oj.uz

Submission #43300

# Submission time Handle Problem Language Result Execution time Memory
43300 2018-03-13T09:01:13 Z funcsr Snake Escaping (JOI18_snake_escaping) C++14
100 / 100
 1483 ms 65536 KB 
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007

int L, Q;
char IN[(1<<20)+1];
int A[1<<20], B[1<<20], C[1<<20];
char qs[21];
int sub[20];

signed main() {
  scanf("%d %d", &L, &Q);
  scanf("%s", IN);
  rep(i, 1<<L) A[i] = (int)(IN[i]-'0');
  rep(i, 1<<L) B[i] = A[i], C[((1<<L)-1)^i] = A[i];
  rep(add, L) rep(S, 1<<L) if (((S>>add)&1)==0) B[S|(1<<add)] += B[S];
  rep(add, L) rep(S, 1<<L) if (((S>>add)&1)==0) C[S|(1<<add)] += C[S];

  rep(q, Q) {
    scanf("%s", qs);
    rep(i, L/2) swap(qs[i], qs[L-1-i]);
    int zero = 0, one = 0, any = 0;
    rep(i, L) {
      if      (qs[i] == '0') zero++;
      else if (qs[i] == '1') one++;
      else                   any++;
    }
    int s = 0;
    int minsz = min(zero, min(one, any));

    if (any == minsz) {
      int sub = 0, mask = 0;
      rep(i, L) {
        if (qs[i] == '?') sub |= 1<<i;
        else if (qs[i] == '1') mask |= 1<<i;
      }
      s += A[mask];
      for (int id=sub; id>0; id=(id-1)&sub) s += A[id|mask];
    }
    else if (one == minsz) {
      int sz = 0, sub = 0, mask = 0;
      rep(i, L) {
        if (qs[i] == '1') sub |= 1<<i, sz ^= 1;
        else if (qs[i] == '?') mask |= 1<<i;
      }
      if (sz) s -= B[mask];
      else s += B[mask];

      for (int id=sub; id>0; id=(id-1)&sub) {
        if ((sz^__builtin_popcount(id))&1) s -= B[id|mask];
        else s += B[id|mask];
      }
    }
    else {
      int sz = 0, sub = 0, mask = 0;
      rep(i, L) {
        if (qs[i] == '0') sub |= 1<<i, sz ^= 1;
        else if (qs[i] == '?') mask |= 1<<i;
      }
      if (sz) s -= C[mask];
      else s += C[mask];

      for (int id=sub; id>0; id=(id-1)&sub) {
        if ((sz^__builtin_popcount(id))&1) s -= C[id|mask];
        else s += C[id|mask];
      }
    }
    printf("%d\n", s);
  }
  return 0;
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:33:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &L, &Q);
                         ^
snake_escaping.cpp:34:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", IN);
                  ^
snake_escaping.cpp:41:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", qs);
                    ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 352 KB Output is correct
3 Correct 2 ms 424 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 2 ms 496 KB Output is correct
6 Correct 2 ms 520 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 652 KB Output is correct
9 Correct 2 ms 684 KB Output is correct
10 Correct 2 ms 692 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 352 KB Output is correct
3 Correct 2 ms 424 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 2 ms 496 KB Output is correct
6 Correct 2 ms 520 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 652 KB Output is correct
9 Correct 2 ms 684 KB Output is correct
10 Correct 2 ms 692 KB Output is correct
11 Correct 356 ms 15448 KB Output is correct
12 Correct 404 ms 25796 KB Output is correct
13 Correct 436 ms 35860 KB Output is correct
14 Correct 420 ms 46700 KB Output is correct
15 Correct 426 ms 58336 KB Output is correct
16 Correct 472 ms 65536 KB Output is correct
17 Correct 451 ms 65536 KB Output is correct
18 Correct 283 ms 65536 KB Output is correct
19 Correct 385 ms 65536 KB Output is correct
20 Correct 393 ms 65536 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 352 KB Output is correct
3 Correct 2 ms 424 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 2 ms 496 KB Output is correct
6 Correct 2 ms 520 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 652 KB Output is correct
9 Correct 2 ms 684 KB Output is correct
10 Correct 2 ms 692 KB Output is correct
11 Correct 356 ms 15448 KB Output is correct
12 Correct 404 ms 25796 KB Output is correct
13 Correct 436 ms 35860 KB Output is correct
14 Correct 420 ms 46700 KB Output is correct
15 Correct 426 ms 58336 KB Output is correct
16 Correct 472 ms 65536 KB Output is correct
17 Correct 451 ms 65536 KB Output is correct
18 Correct 283 ms 65536 KB Output is correct
19 Correct 385 ms 65536 KB Output is correct
20 Correct 393 ms 65536 KB Output is correct
21 Correct 449 ms 65536 KB Output is correct
22 Correct 477 ms 65536 KB Output is correct
23 Correct 500 ms 65536 KB Output is correct
24 Correct 512 ms 65536 KB Output is correct
25 Correct 499 ms 65536 KB Output is correct
26 Correct 635 ms 65536 KB Output is correct
27 Correct 590 ms 65536 KB Output is correct
28 Correct 313 ms 65536 KB Output is correct
29 Correct 445 ms 65536 KB Output is correct
30 Correct 470 ms 65536 KB Output is correct
31 Correct 534 ms 65536 KB Output is correct
32 Correct 586 ms 65536 KB Output is correct
33 Correct 542 ms 65536 KB Output is correct
34 Correct 540 ms 65536 KB Output is correct
35 Correct 549 ms 65536 KB Output is correct
36 Correct 306 ms 65536 KB Output is correct
37 Correct 446 ms 65536 KB Output is correct
38 Correct 463 ms 65536 KB Output is correct
39 Correct 545 ms 65536 KB Output is correct
40 Correct 483 ms 65536 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 352 KB Output is correct
3 Correct 2 ms 424 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 2 ms 496 KB Output is correct
6 Correct 2 ms 520 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 652 KB Output is correct
9 Correct 2 ms 684 KB Output is correct
10 Correct 2 ms 692 KB Output is correct
11 Correct 96 ms 65536 KB Output is correct
12 Correct 107 ms 65536 KB Output is correct
13 Correct 103 ms 65536 KB Output is correct
14 Correct 120 ms 65536 KB Output is correct
15 Correct 94 ms 65536 KB Output is correct
16 Correct 128 ms 65536 KB Output is correct
17 Correct 143 ms 65536 KB Output is correct
18 Correct 82 ms 65536 KB Output is correct
19 Correct 93 ms 65536 KB Output is correct
20 Correct 96 ms 65536 KB Output is correct
21 Correct 116 ms 65536 KB Output is correct
22 Correct 136 ms 65536 KB Output is correct
23 Correct 91 ms 65536 KB Output is correct
24 Correct 148 ms 65536 KB Output is correct
25 Correct 129 ms 65536 KB Output is correct
26 Correct 81 ms 65536 KB Output is correct
27 Correct 119 ms 65536 KB Output is correct
28 Correct 105 ms 65536 KB Output is correct
29 Correct 106 ms 65536 KB Output is correct
30 Correct 103 ms 65536 KB Output is correct
31 Correct 102 ms 65536 KB Output is correct
32 Correct 139 ms 65536 KB Output is correct
33 Correct 142 ms 65536 KB Output is correct
34 Correct 80 ms 65536 KB Output is correct
35 Correct 124 ms 65536 KB Output is correct
36 Correct 127 ms 65536 KB Output is correct
37 Correct 115 ms 65536 KB Output is correct
38 Correct 117 ms 65536 KB Output is correct
39 Correct 122 ms 65536 KB Output is correct
40 Correct 116 ms 65536 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 352 KB Output is correct
3 Correct 2 ms 424 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 2 ms 496 KB Output is correct
6 Correct 2 ms 520 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 652 KB Output is correct
9 Correct 2 ms 684 KB Output is correct
10 Correct 2 ms 692 KB Output is correct
11 Correct 356 ms 15448 KB Output is correct
12 Correct 404 ms 25796 KB Output is correct
13 Correct 436 ms 35860 KB Output is correct
14 Correct 420 ms 46700 KB Output is correct
15 Correct 426 ms 58336 KB Output is correct
16 Correct 472 ms 65536 KB Output is correct
17 Correct 451 ms 65536 KB Output is correct
18 Correct 283 ms 65536 KB Output is correct
19 Correct 385 ms 65536 KB Output is correct
20 Correct 393 ms 65536 KB Output is correct
21 Correct 449 ms 65536 KB Output is correct
22 Correct 477 ms 65536 KB Output is correct
23 Correct 500 ms 65536 KB Output is correct
24 Correct 512 ms 65536 KB Output is correct
25 Correct 499 ms 65536 KB Output is correct
26 Correct 635 ms 65536 KB Output is correct
27 Correct 590 ms 65536 KB Output is correct
28 Correct 313 ms 65536 KB Output is correct
29 Correct 445 ms 65536 KB Output is correct
30 Correct 470 ms 65536 KB Output is correct
31 Correct 534 ms 65536 KB Output is correct
32 Correct 586 ms 65536 KB Output is correct
33 Correct 542 ms 65536 KB Output is correct
34 Correct 540 ms 65536 KB Output is correct
35 Correct 549 ms 65536 KB Output is correct
36 Correct 306 ms 65536 KB Output is correct
37 Correct 446 ms 65536 KB Output is correct
38 Correct 463 ms 65536 KB Output is correct
39 Correct 545 ms 65536 KB Output is correct
40 Correct 483 ms 65536 KB Output is correct
41 Correct 96 ms 65536 KB Output is correct
42 Correct 107 ms 65536 KB Output is correct
43 Correct 103 ms 65536 KB Output is correct
44 Correct 120 ms 65536 KB Output is correct
45 Correct 94 ms 65536 KB Output is correct
46 Correct 128 ms 65536 KB Output is correct
47 Correct 143 ms 65536 KB Output is correct
48 Correct 82 ms 65536 KB Output is correct
49 Correct 93 ms 65536 KB Output is correct
50 Correct 96 ms 65536 KB Output is correct
51 Correct 116 ms 65536 KB Output is correct
52 Correct 136 ms 65536 KB Output is correct
53 Correct 91 ms 65536 KB Output is correct
54 Correct 148 ms 65536 KB Output is correct
55 Correct 129 ms 65536 KB Output is correct
56 Correct 81 ms 65536 KB Output is correct
57 Correct 119 ms 65536 KB Output is correct
58 Correct 105 ms 65536 KB Output is correct
59 Correct 106 ms 65536 KB Output is correct
60 Correct 103 ms 65536 KB Output is correct
61 Correct 102 ms 65536 KB Output is correct
62 Correct 139 ms 65536 KB Output is correct
63 Correct 142 ms 65536 KB Output is correct
64 Correct 80 ms 65536 KB Output is correct
65 Correct 124 ms 65536 KB Output is correct
66 Correct 127 ms 65536 KB Output is correct
67 Correct 115 ms 65536 KB Output is correct
68 Correct 117 ms 65536 KB Output is correct
69 Correct 122 ms 65536 KB Output is correct
70 Correct 116 ms 65536 KB Output is correct
71 Correct 727 ms 65536 KB Output is correct
72 Correct 754 ms 65536 KB Output is correct
73 Correct 924 ms 65536 KB Output is correct
74 Correct 1332 ms 65536 KB Output is correct
75 Correct 704 ms 65536 KB Output is correct
76 Correct 1417 ms 65536 KB Output is correct
77 Correct 1288 ms 65536 KB Output is correct
78 Correct 431 ms 65536 KB Output is correct
79 Correct 720 ms 65536 KB Output is correct
80 Correct 831 ms 65536 KB Output is correct
81 Correct 1065 ms 65536 KB Output is correct
82 Correct 1176 ms 65536 KB Output is correct
83 Correct 709 ms 65536 KB Output is correct
84 Correct 1095 ms 65536 KB Output is correct
85 Correct 1336 ms 65536 KB Output is correct
86 Correct 406 ms 65536 KB Output is correct
87 Correct 733 ms 65536 KB Output is correct
88 Correct 746 ms 65536 KB Output is correct
89 Correct 993 ms 65536 KB Output is correct
90 Correct 939 ms 65536 KB Output is correct
91 Correct 771 ms 65536 KB Output is correct
92 Correct 1483 ms 65536 KB Output is correct
93 Correct 1294 ms 65536 KB Output is correct
94 Correct 393 ms 65536 KB Output is correct
95 Correct 1152 ms 65536 KB Output is correct
96 Correct 1053 ms 65536 KB Output is correct
97 Correct 1180 ms 65536 KB Output is correct
98 Correct 1154 ms 65536 KB Output is correct
99 Correct 1120 ms 65536 KB Output is correct
100 Correct 1141 ms 65536 KB Output is correct