[组合数] SRM 555 Div1 Medium XorBoard
2018-01-06 13:16
316 查看
Solution
枚举行列进行奇数次操作的个数,组合数算一下就好了。// BEGIN CUT HERE // END CUT HERE #line 5 "XorBoard.cpp" #include <bits/stdc++.h> using namespace std; const int N = 3333; const int MOD = 555555555; typedef long long ll; int n, m, nc, mc, s, ans; int C ; inline void Add(int &x, int a) { x = (x + a) % MOD; } inline void Pre(int n) { for(int i = 0; i <= n; i++) { C[i][0] = 1; for(int j = 1; j <= i; j++) C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % MOD; } } class XorBoard { public: int count(int H, int W, int Rcount, int Ccount, int S) { n = H; m = W; nc = Rcount; mc = Ccount; s = S; ans = 0; Pre(max((nc >> 1) + n, (mc >> 1) + m)); for(int i = nc & 1; i <= n && i <= nc; i += 2) for(int j = mc & 1; j <= m && j <= mc; j += 2) if(i * (m - j) + j * (n - i) == S) Add(ans, (ll)C [i] * C[(nc - i >> 1) + n - 1][n - 1] % MOD * C[m][j] % MOD * C[(mc - j >> 1) + m - 1][m - 1] % MOD); return ans; } // BEGIN CUT HERE public: void run_test(int Case) { if ((Case == -1) || (Case == 0)) test_case_0(); if ((Case == -1) || (Case == 1)) test_case_1(); if ((Case == -1) || (Case == 2)) test_case_2(); if ((Case == -1) || (Case == 3)) test_case_3(); if ((Case == -1) || (Case == 4)) test_case_4(); } private: template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); } void verify_case(int Case, const int &Expected, const int &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } } void test_case_0() { int Arg0 = 2; int Arg1 = 2; int Arg2 = 2; int Arg3 = 2; int Arg4 = 4; int Arg5 = 4; verify_case(0, Arg5, count(Arg0, Arg1, Arg2, Arg3, Arg4)); } void test_case_1() { int Arg0 = 2; int Arg1 = 2; int Arg2 = 0; int Arg3 = 0; int Arg4 = 1; int Arg5 = 0; verify_case(1, Arg5, count(Arg0, Arg1, Arg2, Arg3, Arg4)); } void test_case_2() { int Arg0 = 10; int Arg1 = 20; int Arg2 = 50; int Arg3 = 40; int Arg4 = 200; int Arg5 = 333759825; verify_case(2, Arg5, count(Arg0, Arg1, Arg2, Arg3, Arg4)); } void test_case_3() { int Arg0 = 1200; int Arg1 = 1000; int Arg2 = 800; int Arg3 = 600; int Arg4 = 4000; int Arg5 = 96859710; verify_case(3, Arg5, count(Arg0, Arg1, Arg2, Arg3, Arg4)); } void test_case_4() { int Arg0 = 555; int Arg1 = 555; int Arg2 = 555; int Arg3 = 555; int Arg4 = 5550; int Arg5 = 549361755; verify_case(4, Arg5, count(Arg0, Arg1, Arg2, Arg3, Arg4)); } // END CUT HERE }; // BEGIN CUT HERE int main(void) { XorBoard ___test; ___test.run_test(-1); system("pause"); } // END CUT HERE
相关文章推荐
- [博弈论][凸包][复杂度分析] SRM 597 Div1 Medium ConvexPolygonGame
- SRM 555 DIV 2
- srm555 div1
- SRM 555 DIV2 555
- 拓扑排序 SRM 660 Div2 Medium: PrivateD2party
- SRM 719 div1 Medium (树形dp)
- SRM 555 DIV2
- [SRM554-500]TheBrickTowerMediumDivOne
- srm555 div2
- TopCoder SRM 360 DIV2 500 分题目, 需要排列组合么?需要强力法么?
- SRM 554 - 500 TheBrickTowerMediumDivOne
- 有向图判环+拆解图求参会期望 SRM 660 Div1 Medium: Privateparty
- SRM556 Div1 555
- N排列盒子涂色方法总和 DP SRM 666 div1 medium SumOverPermutations
- Floyd-Warshall+二进制枚举SRM 661 Div2 Medium: BridgeBuilding
- [容斥原理][复杂度分析] SRM 555 Div1 Hard MapGuessing
- SRM 555 DIV2
- SRM 458 Div 2
- [LP对偶 & 最大费用可行流] TopCoder SRM 676 div1 Farmville
- topcoder SRM 593 DIV2 WolfDelaymaster