oj.uz

Submission #43294

# Submission time Handle Problem Language Result Execution time Memory
43294 2018-03-13T08:20:39 Z funcsr Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 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];
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) {
    char qs[21];
    scanf("%s", qs);
    reverse(qs, qs+L);
    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));
    assert(minsz <= 6);

    if (any == minsz) {
      int sz = 0, mask = 0;
      rep(i, L) {
        if (qs[i] == '?') sub[sz++] = 1<<i;
        else if (qs[i] == '1') mask |= 1<<i;
      }
      rep(w, 1<<sz) {
        int id = mask;
        rep(i, sz) if ((w>>i)&1) id |= sub[i];
        s += A[id];
      }
    }
    else if (one == minsz) {
      int sz = 0, mask = 0;
      rep(i, L) {
        if (qs[i] == '1') sub[sz++] = 1<<i;
        else if (qs[i] == '?') mask |= 1<<i;
      }
      rep(w, 1<<sz) {
        int id = mask, sgn = (sz-__builtin_popcount(w))&1?-1:1;
        rep(i, sz) if ((w>>i)&1) id |= sub[i];
        s += sgn*B[id];
      }
    }
    else {
      int sz = 0, mask = 0;
      rep(i, L) {
        if (qs[i] == '0') sub[sz++] = 1<<i;
        else if (qs[i] == '?') mask |= 1<<i;
      }
      rep(w, 1<<sz) {
        int id = mask, sgn = (sz-__builtin_popcount(w))&1?-1:1;
        rep(i, sz) if ((w>>i)&1) id |= sub[i];
        s += sgn*C[id];
      }
    }
    printf("%d\n", s);
  }
  return 0;
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:32: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:33: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 3 ms 576 KB Output is correct
4 Correct 2 ms 660 KB Output is correct
5 Correct 2 ms 660 KB Output is correct
6 Correct 2 ms 660 KB Output is correct
7 Correct 2 ms 780 KB Output is correct
8 Correct 2 ms 780 KB Output is correct
9 Correct 2 ms 780 KB Output is correct
10 Correct 2 ms 780 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 3 ms 576 KB Output is correct
4 Correct 2 ms 660 KB Output is correct
5 Correct 2 ms 660 KB Output is correct
6 Correct 2 ms 660 KB Output is correct
7 Correct 2 ms 780 KB Output is correct
8 Correct 2 ms 780 KB Output is correct
9 Correct 2 ms 780 KB Output is correct
10 Correct 2 ms 780 KB Output is correct
11 Correct 350 ms 15444 KB Output is correct
12 Correct 379 ms 26040 KB Output is correct
13 Correct 456 ms 35976 KB Output is correct
14 Correct 444 ms 46620 KB Output is correct
15 Correct 403 ms 58480 KB Output is correct
16 Correct 461 ms 65536 KB Output is correct
17 Correct 474 ms 65536 KB Output is correct
18 Correct 280 ms 65536 KB Output is correct
19 Correct 335 ms 65536 KB Output is correct
20 Correct 423 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 3 ms 576 KB Output is correct
4 Correct 2 ms 660 KB Output is correct
5 Correct 2 ms 660 KB Output is correct
6 Correct 2 ms 660 KB Output is correct
7 Correct 2 ms 780 KB Output is correct
8 Correct 2 ms 780 KB Output is correct
9 Correct 2 ms 780 KB Output is correct
10 Correct 2 ms 780 KB Output is correct
11 Correct 350 ms 15444 KB Output is correct
12 Correct 379 ms 26040 KB Output is correct
13 Correct 456 ms 35976 KB Output is correct
14 Correct 444 ms 46620 KB Output is correct
15 Correct 403 ms 58480 KB Output is correct
16 Correct 461 ms 65536 KB Output is correct
17 Correct 474 ms 65536 KB Output is correct
18 Correct 280 ms 65536 KB Output is correct
19 Correct 335 ms 65536 KB Output is correct
20 Correct 423 ms 65536 KB Output is correct
21 Correct 454 ms 65536 KB Output is correct
22 Correct 503 ms 65536 KB Output is correct
23 Correct 538 ms 65536 KB Output is correct
24 Correct 613 ms 65536 KB Output is correct
25 Correct 462 ms 65536 KB Output is correct
26 Correct 642 ms 65536 KB Output is correct
27 Correct 578 ms 65536 KB Output is correct
28 Correct 300 ms 65536 KB Output is correct
29 Correct 454 ms 65536 KB Output is correct
30 Correct 473 ms 65536 KB Output is correct
31 Correct 550 ms 65536 KB Output is correct
32 Correct 675 ms 65536 KB Output is correct
33 Correct 509 ms 65536 KB Output is correct
34 Correct 591 ms 65536 KB Output is correct
35 Correct 604 ms 65536 KB Output is correct
36 Correct 306 ms 65536 KB Output is correct
37 Correct 420 ms 65536 KB Output is correct
38 Correct 504 ms 65536 KB Output is correct
39 Correct 600 ms 65536 KB Output is correct
40 Correct 583 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 3 ms 576 KB Output is correct
4 Correct 2 ms 660 KB Output is correct
5 Correct 2 ms 660 KB Output is correct
6 Correct 2 ms 660 KB Output is correct
7 Correct 2 ms 780 KB Output is correct
8 Correct 2 ms 780 KB Output is correct
9 Correct 2 ms 780 KB Output is correct
10 Correct 2 ms 780 KB Output is correct
11 Correct 105 ms 65536 KB Output is correct
12 Correct 104 ms 65536 KB Output is correct
13 Correct 118 ms 65536 KB Output is correct
14 Correct 184 ms 65536 KB Output is correct
15 Correct 103 ms 65536 KB Output is correct
16 Correct 182 ms 65536 KB Output is correct
17 Correct 158 ms 65536 KB Output is correct
18 Correct 90 ms 65536 KB Output is correct
19 Correct 97 ms 65536 KB Output is correct
20 Correct 100 ms 65536 KB Output is correct
21 Correct 130 ms 65536 KB Output is correct
22 Correct 197 ms 65536 KB Output is correct
23 Correct 98 ms 65536 KB Output is correct
24 Correct 163 ms 65536 KB Output is correct
25 Correct 175 ms 65536 KB Output is correct
26 Correct 91 ms 65536 KB Output is correct
27 Correct 129 ms 65536 KB Output is correct
28 Correct 105 ms 65536 KB Output is correct
29 Correct 135 ms 65536 KB Output is correct
30 Correct 144 ms 65536 KB Output is correct
31 Correct 104 ms 65536 KB Output is correct
32 Correct 173 ms 65536 KB Output is correct
33 Correct 151 ms 65536 KB Output is correct
34 Correct 77 ms 65536 KB Output is correct
35 Correct 133 ms 65536 KB Output is correct
36 Correct 138 ms 65536 KB Output is correct
37 Correct 132 ms 65536 KB Output is correct
38 Correct 137 ms 65536 KB Output is correct
39 Correct 135 ms 65536 KB Output is correct
40 Correct 160 ms 65536 KB Output is correct

Subtask #5
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 3 ms 576 KB Output is correct
4 Correct 2 ms 660 KB Output is correct
5 Correct 2 ms 660 KB Output is correct
6 Correct 2 ms 660 KB Output is correct
7 Correct 2 ms 780 KB Output is correct
8 Correct 2 ms 780 KB Output is correct
9 Correct 2 ms 780 KB Output is correct
10 Correct 2 ms 780 KB Output is correct
11 Correct 350 ms 15444 KB Output is correct
12 Correct 379 ms 26040 KB Output is correct
13 Correct 456 ms 35976 KB Output is correct
14 Correct 444 ms 46620 KB Output is correct
15 Correct 403 ms 58480 KB Output is correct
16 Correct 461 ms 65536 KB Output is correct
17 Correct 474 ms 65536 KB Output is correct
18 Correct 280 ms 65536 KB Output is correct
19 Correct 335 ms 65536 KB Output is correct
20 Correct 423 ms 65536 KB Output is correct
21 Correct 454 ms 65536 KB Output is correct
22 Correct 503 ms 65536 KB Output is correct
23 Correct 538 ms 65536 KB Output is correct
24 Correct 613 ms 65536 KB Output is correct
25 Correct 462 ms 65536 KB Output is correct
26 Correct 642 ms 65536 KB Output is correct
27 Correct 578 ms 65536 KB Output is correct
28 Correct 300 ms 65536 KB Output is correct
29 Correct 454 ms 65536 KB Output is correct
30 Correct 473 ms 65536 KB Output is correct
31 Correct 550 ms 65536 KB Output is correct
32 Correct 675 ms 65536 KB Output is correct
33 Correct 509 ms 65536 KB Output is correct
34 Correct 591 ms 65536 KB Output is correct
35 Correct 604 ms 65536 KB Output is correct
36 Correct 306 ms 65536 KB Output is correct
37 Correct 420 ms 65536 KB Output is correct
38 Correct 504 ms 65536 KB Output is correct
39 Correct 600 ms 65536 KB Output is correct
40 Correct 583 ms 65536 KB Output is correct
41 Correct 105 ms 65536 KB Output is correct
42 Correct 104 ms 65536 KB Output is correct
43 Correct 118 ms 65536 KB Output is correct
44 Correct 184 ms 65536 KB Output is correct
45 Correct 103 ms 65536 KB Output is correct
46 Correct 182 ms 65536 KB Output is correct
47 Correct 158 ms 65536 KB Output is correct
48 Correct 90 ms 65536 KB Output is correct
49 Correct 97 ms 65536 KB Output is correct
50 Correct 100 ms 65536 KB Output is correct
51 Correct 130 ms 65536 KB Output is correct
52 Correct 197 ms 65536 KB Output is correct
53 Correct 98 ms 65536 KB Output is correct
54 Correct 163 ms 65536 KB Output is correct
55 Correct 175 ms 65536 KB Output is correct
56 Correct 91 ms 65536 KB Output is correct
57 Correct 129 ms 65536 KB Output is correct
58 Correct 105 ms 65536 KB Output is correct
59 Correct 135 ms 65536 KB Output is correct
60 Correct 144 ms 65536 KB Output is correct
61 Correct 104 ms 65536 KB Output is correct
62 Correct 173 ms 65536 KB Output is correct
63 Correct 151 ms 65536 KB Output is correct
64 Correct 77 ms 65536 KB Output is correct
65 Correct 133 ms 65536 KB Output is correct
66 Correct 138 ms 65536 KB Output is correct
67 Correct 132 ms 65536 KB Output is correct
68 Correct 137 ms 65536 KB Output is correct
69 Correct 135 ms 65536 KB Output is correct
70 Correct 160 ms 65536 KB Output is correct
71 Correct 775 ms 65536 KB Output is correct
72 Correct 738 ms 65536 KB Output is correct
73 Correct 1158 ms 65536 KB Output is correct
74 Correct 1839 ms 65536 KB Output is correct
75 Correct 782 ms 65536 KB Output is correct
76 Execution timed out 2104 ms 65536 KB Time limit exceeded
77 Halted 0 ms 0 KB -