Submission #1365616
Source Code Expand
#include <cstdio> #include <cstdlib> #include <cstring> #include <iostream> #include <vector> #include <string> #include <algorithm> #include <stack> #include <queue> #include <set> #include <map> using namespace std; #define MOD 1000000007 #define ADD(X,Y) ((X) = ((X) + (Y)%MOD) % MOD) typedef long long i64; typedef vector<int> ivec; typedef vector<string> svec; int N, M; int X[200], Y[200]; int out[200]; i64 dp[1 << 15]; int main() { scanf("%d%d", &N, &M); for (int i = 0; i < M; ++i) { scanf("%d%d", X + i, Y + i); --X[i]; --Y[i]; out[X[i]] |= 1 << Y[i]; } dp[0] = 1; for (int m = 1; m < (1 << N); ++m) { dp[m] = 0; for (int t = m; t > 0; t = (t - 1) & m) { // choose <t> for nodes with largest grundy number among <m> if ((t & 3) == 3) continue; int rem = m ^ t; i64 pat = dp[rem]; for (int i = 0; i < N; ++i) { if (!(m & (1 << i))) { pat = pat * ((1 << __builtin_popcount(out[i] & t)) - 1) % MOD; } if (t & (1 << i)) { pat = pat * (1 << __builtin_popcount(out[i] & ~m)) % MOD; } } ADD(dp[m], pat); } } printf("%lld\n", dp[(1 << N) - 1]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Games on DAG |
User | semiexp |
Language | C++14 (GCC 5.4.1) |
Score | 1600 |
Code Size | 1181 Byte |
Status | AC |
Exec Time | 1470 ms |
Memory | 512 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:24:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d", &N, &M); ^ ./Main.cpp:26:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d", X + i, Y + i); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1600 / 1600 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
0_03.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1357 ms | 512 KB |
1_02.txt | AC | 1462 ms | 512 KB |
1_03.txt | AC | 1353 ms | 512 KB |
1_04.txt | AC | 1358 ms | 512 KB |
1_05.txt | AC | 1359 ms | 512 KB |
1_06.txt | AC | 1470 ms | 512 KB |
1_07.txt | AC | 1357 ms | 512 KB |
1_08.txt | AC | 1359 ms | 512 KB |
1_09.txt | AC | 1360 ms | 512 KB |
1_10.txt | AC | 1354 ms | 512 KB |
1_11.txt | AC | 1361 ms | 512 KB |
1_12.txt | AC | 1465 ms | 512 KB |
1_13.txt | AC | 1354 ms | 512 KB |
1_14.txt | AC | 1352 ms | 512 KB |
1_15.txt | AC | 1362 ms | 512 KB |
1_16.txt | AC | 1465 ms | 512 KB |
1_17.txt | AC | 1354 ms | 512 KB |
1_18.txt | AC | 1356 ms | 512 KB |
1_19.txt | AC | 1358 ms | 512 KB |
1_20.txt | AC | 1363 ms | 512 KB |
1_21.txt | AC | 5 ms | 256 KB |
1_22.txt | AC | 1355 ms | 512 KB |
1_23.txt | AC | 1356 ms | 512 KB |
1_24.txt | AC | 465 ms | 384 KB |
1_25.txt | AC | 3 ms | 256 KB |
1_26.txt | AC | 1356 ms | 512 KB |
1_27.txt | AC | 45 ms | 256 KB |
1_28.txt | AC | 1461 ms | 512 KB |
1_29.txt | AC | 149 ms | 256 KB |
1_30.txt | AC | 45 ms | 256 KB |
1_31.txt | AC | 1462 ms | 512 KB |
1_32.txt | AC | 138 ms | 256 KB |
1_33.txt | AC | 45 ms | 256 KB |
1_34.txt | AC | 434 ms | 384 KB |
1_35.txt | AC | 149 ms | 256 KB |