# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42153 | 2018-02-23T05:06:04 Z | fest | Snake Escaping (JOI18_snake_escaping) | C++14 | 2000 ms | 32348 KB |
// fest #include <bits/stdc++.h> #define pb push_back #define F first #define S second #define y1 dasdasfasfas #define x1 wqdadfasfasfas #define All(c) c.begin(), c.end() #define SZ(A) (int((A).size())) #define umap unordered_map #define FILENAME "" #define __ fflush(stdout) typedef long long ll; typedef long double ld; using namespace std; void FREOPEN() { #ifdef COMP freopen(".in", "r", stdin); freopen("1.out", "w", stdout); #else freopen(FILENAME".in", "r", stdin); freopen(FILENAME".out", "w", stdout); #endif } inline double Time() {return (clock() * 1.0) / CLOCKS_PER_SEC; } const int N = 20, inf = 1e9 * 2, MOD = (int)1e9 + 7; char CH[N]; const ll INF = 1e18; const int dx[] = {1, -1, 0, 0, -1, 1, -1, 1}; const int dy[] = {0, 0, 1, -1, -1, 1, 1, -1}; int built[1 << N], ones[21], dp[2][2][1 << N], cost[2][1 << N], qs[21]; int n; int rev(int x) { int ret = 0; for (int i = 0; i < n; i++) { if (x & (1 << i)) continue; ret |= (1 << i); } return ret; } void build(int ty) { for (int mask = 0; mask < (1 << n); mask++) { dp[ty][0][mask] += cost[ty][mask]; if (mask & 1) dp[ty][0][mask] += cost[ty][mask ^ 1]; } for (int bit = 1; bit < n; bit++) { int j = bit % 2; for (int mask = 0; mask < (1 << n); mask++) { dp[ty][j][mask] = dp[ty][j ^ 1][mask]; if (mask & (1 << bit)) dp[ty][j][mask] += dp[ty][j ^ 1][mask ^ (1 << bit)]; } } } int calc(int ty, int cnt) { int ret = 0; int alw = 0; int r = 0; for (int i = 0; i < n; i++) { if (qs[i] == 2) alw |= (1 << i); if (qs[i] == 1) ones[r++] = i; } for (int mask = 0; mask < (1 << cnt); mask++) { int now = alw; for (int i = 0; i < r; i++) { if (mask & (1 << i)) now |= (1 << ones[i]); } if (built[mask] % 2) ret -= dp[ty][(n - 1) % 2][now]; else ret += dp[ty][(n - 1) % 2][now]; } return abs(ret); } int main() { int q; cin >> n >> q; scanf("\n"); for (int i = 0; i < (1 << n); i++) { char x; scanf("%c", &x); cost[0][i] = (int)(x - '0'); cost[1][rev(i)] = (int)(x - '0'); } for (int mask = 0; mask < (1 << n); mask++) built[mask] = __builtin_popcount(mask); build(0); build(1); while (q--) { scanf("\n"); int zer = 0, one = 0, que = 0; for (int i = n - 1; i >= 0; i--) { char x; scanf("%c", &x); if (x == '?') qs[i] = 2, que++; if (x == '1') qs[i] = 1, one++; if (x == '0') qs[i] = 0, zer++; } if (que < 8) { int ans = 0; for (int mask = 0; mask < (1 << que); mask++) { int ret = 0; int j = 0; for (int i = 0; i < n; i++) { if (qs[i] == 2) { if (mask & (1 << j)) ret |= (1 << i); j++; } if (qs[i] == 1) ret |= (1 << i); } ans += cost[0][ret]; } printf("%d\n", ans); continue; } if (!one) { int ret = 0; for (int i = 0; i < n; i++) { if (qs[i] == 2) ret |= (1 << i); } printf("%d\n", dp[0][(n - 1) % 2][ret]); continue; } if (!zer) { int ret = 0; for (int i = 0; i < n; i++) { if (qs[i] == 2) ret |= (1 << i); } printf("%d\n", dp[1][(n - 1) % 2][ret]); continue; } if (one < 8) { printf("%d\n", calc(0, one)); continue; } for (int i = 0; i < n; i++) if (qs[i] < 2) qs[i] ^= 1; printf("%d\n", calc(1, zer)); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 376 KB | Output is correct |
2 | Correct | 5 ms | 484 KB | Output is correct |
3 | Correct | 3 ms | 564 KB | Output is correct |
4 | Correct | 3 ms | 592 KB | Output is correct |
5 | Correct | 7 ms | 788 KB | Output is correct |
6 | Correct | 4 ms | 788 KB | Output is correct |
7 | Correct | 3 ms | 792 KB | Output is correct |
8 | Correct | 2 ms | 792 KB | Output is correct |
9 | Correct | 2 ms | 792 KB | Output is correct |
10 | Correct | 5 ms | 792 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 376 KB | Output is correct |
2 | Correct | 5 ms | 484 KB | Output is correct |
3 | Correct | 3 ms | 564 KB | Output is correct |
4 | Correct | 3 ms | 592 KB | Output is correct |
5 | Correct | 7 ms | 788 KB | Output is correct |
6 | Correct | 4 ms | 788 KB | Output is correct |
7 | Correct | 3 ms | 792 KB | Output is correct |
8 | Correct | 2 ms | 792 KB | Output is correct |
9 | Correct | 2 ms | 792 KB | Output is correct |
10 | Correct | 5 ms | 792 KB | Output is correct |
11 | Execution timed out | 2029 ms | 5948 KB | Time limit exceeded |
12 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 376 KB | Output is correct |
2 | Correct | 5 ms | 484 KB | Output is correct |
3 | Correct | 3 ms | 564 KB | Output is correct |
4 | Correct | 3 ms | 592 KB | Output is correct |
5 | Correct | 7 ms | 788 KB | Output is correct |
6 | Correct | 4 ms | 788 KB | Output is correct |
7 | Correct | 3 ms | 792 KB | Output is correct |
8 | Correct | 2 ms | 792 KB | Output is correct |
9 | Correct | 2 ms | 792 KB | Output is correct |
10 | Correct | 5 ms | 792 KB | Output is correct |
11 | Execution timed out | 2029 ms | 5948 KB | Time limit exceeded |
12 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 376 KB | Output is correct |
2 | Correct | 5 ms | 484 KB | Output is correct |
3 | Correct | 3 ms | 564 KB | Output is correct |
4 | Correct | 3 ms | 592 KB | Output is correct |
5 | Correct | 7 ms | 788 KB | Output is correct |
6 | Correct | 4 ms | 788 KB | Output is correct |
7 | Correct | 3 ms | 792 KB | Output is correct |
8 | Correct | 2 ms | 792 KB | Output is correct |
9 | Correct | 2 ms | 792 KB | Output is correct |
10 | Correct | 5 ms | 792 KB | Output is correct |
11 | Correct | 269 ms | 32208 KB | Output is correct |
12 | Correct | 323 ms | 32208 KB | Output is correct |
13 | Correct | 470 ms | 32208 KB | Output is correct |
14 | Correct | 904 ms | 32232 KB | Output is correct |
15 | Correct | 309 ms | 32232 KB | Output is correct |
16 | Correct | 527 ms | 32232 KB | Output is correct |
17 | Correct | 538 ms | 32232 KB | Output is correct |
18 | Correct | 275 ms | 32348 KB | Output is correct |
19 | Correct | 307 ms | 32348 KB | Output is correct |
20 | Correct | 331 ms | 32348 KB | Output is correct |
21 | Correct | 326 ms | 32348 KB | Output is correct |
22 | Correct | 897 ms | 32348 KB | Output is correct |
23 | Correct | 352 ms | 32348 KB | Output is correct |
24 | Correct | 568 ms | 32348 KB | Output is correct |
25 | Correct | 543 ms | 32348 KB | Output is correct |
26 | Correct | 279 ms | 32348 KB | Output is correct |
27 | Correct | 274 ms | 32348 KB | Output is correct |
28 | Correct | 276 ms | 32348 KB | Output is correct |
29 | Correct | 487 ms | 32348 KB | Output is correct |
30 | Correct | 597 ms | 32348 KB | Output is correct |
31 | Correct | 357 ms | 32348 KB | Output is correct |
32 | Correct | 536 ms | 32348 KB | Output is correct |
33 | Correct | 519 ms | 32348 KB | Output is correct |
34 | Correct | 270 ms | 32348 KB | Output is correct |
35 | Correct | 447 ms | 32348 KB | Output is correct |
36 | Correct | 448 ms | 32348 KB | Output is correct |
37 | Correct | 452 ms | 32348 KB | Output is correct |
38 | Correct | 452 ms | 32348 KB | Output is correct |
39 | Correct | 448 ms | 32348 KB | Output is correct |
40 | Correct | 488 ms | 32348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 376 KB | Output is correct |
2 | Correct | 5 ms | 484 KB | Output is correct |
3 | Correct | 3 ms | 564 KB | Output is correct |
4 | Correct | 3 ms | 592 KB | Output is correct |
5 | Correct | 7 ms | 788 KB | Output is correct |
6 | Correct | 4 ms | 788 KB | Output is correct |
7 | Correct | 3 ms | 792 KB | Output is correct |
8 | Correct | 2 ms | 792 KB | Output is correct |
9 | Correct | 2 ms | 792 KB | Output is correct |
10 | Correct | 5 ms | 792 KB | Output is correct |
11 | Execution timed out | 2029 ms | 5948 KB | Time limit exceeded |
12 | Halted | 0 ms | 0 KB | - |