oj.uz

Submission #43301

# Submission time Handle Problem Language Result Execution time Memory
43301 2018-03-13T09:02:38 Z funcsr Snake Escaping (JOI18_snake_escaping) C++14
100 / 100
 1591 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;
      }
      s += B[mask];
      for (int id=sub; id>0; id=(id-1)&sub) {
        if ((__builtin_popcount(id))&1) s -= B[id|mask];
        else s += B[id|mask];
      }
      if (sz) s = -s;
    }
    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;
      }
      s += C[mask];

      for (int id=sub; id>0; id=(id-1)&sub) {
        if ((__builtin_popcount(id))&1) s -= C[id|mask];
        else s += C[id|mask];
      }
      if (sz) s = -s;
    }
    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 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 416 KB Output is correct
4 Correct 2 ms 532 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 2 ms 532 KB Output is correct
7 Correct 2 ms 560 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 760 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 416 KB Output is correct
4 Correct 2 ms 532 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 2 ms 532 KB Output is correct
7 Correct 2 ms 560 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 760 KB Output is correct
11 Correct 351 ms 15448 KB Output is correct
12 Correct 384 ms 25848 KB Output is correct
13 Correct 412 ms 35844 KB Output is correct
14 Correct 438 ms 46760 KB Output is correct
15 Correct 449 ms 58532 KB Output is correct
16 Correct 461 ms 65536 KB Output is correct
17 Correct 484 ms 65536 KB Output is correct
18 Correct 299 ms 65536 KB Output is correct
19 Correct 342 ms 65536 KB Output is correct
20 Correct 407 ms 65536 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 416 KB Output is correct
4 Correct 2 ms 532 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 2 ms 532 KB Output is correct
7 Correct 2 ms 560 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 760 KB Output is correct
11 Correct 351 ms 15448 KB Output is correct
12 Correct 384 ms 25848 KB Output is correct
13 Correct 412 ms 35844 KB Output is correct
14 Correct 438 ms 46760 KB Output is correct
15 Correct 449 ms 58532 KB Output is correct
16 Correct 461 ms 65536 KB Output is correct
17 Correct 484 ms 65536 KB Output is correct
18 Correct 299 ms 65536 KB Output is correct
19 Correct 342 ms 65536 KB Output is correct
20 Correct 407 ms 65536 KB Output is correct
21 Correct 456 ms 65536 KB Output is correct
22 Correct 465 ms 65536 KB Output is correct
23 Correct 515 ms 65536 KB Output is correct
24 Correct 498 ms 65536 KB Output is correct
25 Correct 482 ms 65536 KB Output is correct
26 Correct 573 ms 65536 KB Output is correct
27 Correct 552 ms 65536 KB Output is correct
28 Correct 324 ms 65536 KB Output is correct
29 Correct 441 ms 65536 KB Output is correct
30 Correct 467 ms 65536 KB Output is correct
31 Correct 521 ms 65536 KB Output is correct
32 Correct 553 ms 65536 KB Output is correct
33 Correct 510 ms 65536 KB Output is correct
34 Correct 537 ms 65536 KB Output is correct
35 Correct 541 ms 65536 KB Output is correct
36 Correct 282 ms 65536 KB Output is correct
37 Correct 427 ms 65536 KB Output is correct
38 Correct 458 ms 65536 KB Output is correct
39 Correct 533 ms 65536 KB Output is correct
40 Correct 524 ms 65536 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 416 KB Output is correct
4 Correct 2 ms 532 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 2 ms 532 KB Output is correct
7 Correct 2 ms 560 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 760 KB Output is correct
11 Correct 95 ms 65536 KB Output is correct
12 Correct 112 ms 65536 KB Output is correct
13 Correct 112 ms 65536 KB Output is correct
14 Correct 144 ms 65536 KB Output is correct
15 Correct 97 ms 65536 KB Output is correct
16 Correct 165 ms 65536 KB Output is correct
17 Correct 141 ms 65536 KB Output is correct
18 Correct 86 ms 65536 KB Output is correct
19 Correct 93 ms 65536 KB Output is correct
20 Correct 93 ms 65536 KB Output is correct
21 Correct 115 ms 65536 KB Output is correct
22 Correct 129 ms 65536 KB Output is correct
23 Correct 92 ms 65536 KB Output is correct
24 Correct 117 ms 65536 KB Output is correct
25 Correct 125 ms 65536 KB Output is correct
26 Correct 84 ms 65536 KB Output is correct
27 Correct 95 ms 65536 KB Output is correct
28 Correct 94 ms 65536 KB Output is correct
29 Correct 103 ms 65536 KB Output is correct
30 Correct 107 ms 65536 KB Output is correct
31 Correct 99 ms 65536 KB Output is correct
32 Correct 141 ms 65536 KB Output is correct
33 Correct 123 ms 65536 KB Output is correct
34 Correct 93 ms 65536 KB Output is correct
35 Correct 113 ms 65536 KB Output is correct
36 Correct 110 ms 65536 KB Output is correct
37 Correct 120 ms 65536 KB Output is correct
38 Correct 114 ms 65536 KB Output is correct
39 Correct 121 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 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 416 KB Output is correct
4 Correct 2 ms 532 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 2 ms 532 KB Output is correct
7 Correct 2 ms 560 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 760 KB Output is correct
11 Correct 351 ms 15448 KB Output is correct
12 Correct 384 ms 25848 KB Output is correct
13 Correct 412 ms 35844 KB Output is correct
14 Correct 438 ms 46760 KB Output is correct
15 Correct 449 ms 58532 KB Output is correct
16 Correct 461 ms 65536 KB Output is correct
17 Correct 484 ms 65536 KB Output is correct
18 Correct 299 ms 65536 KB Output is correct
19 Correct 342 ms 65536 KB Output is correct
20 Correct 407 ms 65536 KB Output is correct
21 Correct 456 ms 65536 KB Output is correct
22 Correct 465 ms 65536 KB Output is correct
23 Correct 515 ms 65536 KB Output is correct
24 Correct 498 ms 65536 KB Output is correct
25 Correct 482 ms 65536 KB Output is correct
26 Correct 573 ms 65536 KB Output is correct
27 Correct 552 ms 65536 KB Output is correct
28 Correct 324 ms 65536 KB Output is correct
29 Correct 441 ms 65536 KB Output is correct
30 Correct 467 ms 65536 KB Output is correct
31 Correct 521 ms 65536 KB Output is correct
32 Correct 553 ms 65536 KB Output is correct
33 Correct 510 ms 65536 KB Output is correct
34 Correct 537 ms 65536 KB Output is correct
35 Correct 541 ms 65536 KB Output is correct
36 Correct 282 ms 65536 KB Output is correct
37 Correct 427 ms 65536 KB Output is correct
38 Correct 458 ms 65536 KB Output is correct
39 Correct 533 ms 65536 KB Output is correct
40 Correct 524 ms 65536 KB Output is correct
41 Correct 95 ms 65536 KB Output is correct
42 Correct 112 ms 65536 KB Output is correct
43 Correct 112 ms 65536 KB Output is correct
44 Correct 144 ms 65536 KB Output is correct
45 Correct 97 ms 65536 KB Output is correct
46 Correct 165 ms 65536 KB Output is correct
47 Correct 141 ms 65536 KB Output is correct
48 Correct 86 ms 65536 KB Output is correct
49 Correct 93 ms 65536 KB Output is correct
50 Correct 93 ms 65536 KB Output is correct
51 Correct 115 ms 65536 KB Output is correct
52 Correct 129 ms 65536 KB Output is correct
53 Correct 92 ms 65536 KB Output is correct
54 Correct 117 ms 65536 KB Output is correct
55 Correct 125 ms 65536 KB Output is correct
56 Correct 84 ms 65536 KB Output is correct
57 Correct 95 ms 65536 KB Output is correct
58 Correct 94 ms 65536 KB Output is correct
59 Correct 103 ms 65536 KB Output is correct
60 Correct 107 ms 65536 KB Output is correct
61 Correct 99 ms 65536 KB Output is correct
62 Correct 141 ms 65536 KB Output is correct
63 Correct 123 ms 65536 KB Output is correct
64 Correct 93 ms 65536 KB Output is correct
65 Correct 113 ms 65536 KB Output is correct
66 Correct 110 ms 65536 KB Output is correct
67 Correct 120 ms 65536 KB Output is correct
68 Correct 114 ms 65536 KB Output is correct
69 Correct 121 ms 65536 KB Output is correct
70 Correct 116 ms 65536 KB Output is correct
71 Correct 861 ms 65536 KB Output is correct
72 Correct 787 ms 65536 KB Output is correct
73 Correct 940 ms 65536 KB Output is correct
74 Correct 1181 ms 65536 KB Output is correct
75 Correct 730 ms 65536 KB Output is correct
76 Correct 1591 ms 65536 KB Output is correct
77 Correct 1384 ms 65536 KB Output is correct
78 Correct 458 ms 65536 KB Output is correct
79 Correct 723 ms 65536 KB Output is correct
80 Correct 760 ms 65536 KB Output is correct
81 Correct 1029 ms 65536 KB Output is correct
82 Correct 1360 ms 65536 KB Output is correct
83 Correct 721 ms 65536 KB Output is correct
84 Correct 1259 ms 65536 KB Output is correct
85 Correct 1359 ms 65536 KB Output is correct
86 Correct 421 ms 65536 KB Output is correct
87 Correct 752 ms 65536 KB Output is correct
88 Correct 753 ms 65536 KB Output is correct
89 Correct 937 ms 65536 KB Output is correct
90 Correct 1020 ms 65536 KB Output is correct
91 Correct 781 ms 65536 KB Output is correct
92 Correct 1511 ms 65536 KB Output is correct
93 Correct 1275 ms 65536 KB Output is correct
94 Correct 410 ms 65536 KB Output is correct
95 Correct 1132 ms 65536 KB Output is correct
96 Correct 1107 ms 65536 KB Output is correct
97 Correct 1153 ms 65536 KB Output is correct
98 Correct 1129 ms 65536 KB Output is correct
99 Correct 1178 ms 65536 KB Output is correct
100 Correct 1087 ms 65536 KB Output is correct