oj.uz

Submission #43291

# Submission time Handle Problem Language Result Execution time Memory
43291 2018-03-13T08:09:06 Z funcsr Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 65536 KB 
#include <cstdio>
#include <iostream>
#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];

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;
    if (any <= 6) {
      int mask = 0;
      vector<int> sub;
      rep(i, L) {
        if (qs[i] == '?') sub.pb(1<<i);
        if (qs[i] == '1') mask |= 1<<i;
      }
      rep(w, 1<<sub.size()) {
        int id = mask;
        rep(i, sub.size()) if ((w>>i)&1) id += sub[i];
        s += A[id];
      }
    }
    else if (one <= 6) {
      int mask = 0;
      vector<int> sub;
      rep(i, L) {
        if (qs[i] == '1') sub.pb(1<<i);
        if (qs[i] == '?') mask |= 1<<i;
      }
      rep(w, 1<<sub.size()) {
        int id = mask, sgn = 1;
        rep(i, sub.size()) {
          if ((w>>i)&1) id += sub[i];
          else sgn *= -1;
        }
        s += sgn*B[id];
      }
    }
    else {
      assert(zero <= 6);
      int mask = 0;
      vector<int> sub;
      rep(i, L) {
        if (qs[i] == '0') sub.pb(1<<i);
        if (qs[i] == '?') mask |= 1<<i;
      }
      rep(w, 1<<sub.size()) {
        int id = mask, sgn = 1;
        rep(i, sub.size()) {
          if ((w>>i)&1) id += sub[i];
          else sgn *= -1;
        }
        s += sgn*C[id];
      }
    }
    printf("%d\n", s);
  }
  return 0;
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:17:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i, n) for (int i=0; i<(n); i++)
                                  ^
snake_escaping.cpp:59:9: note: in expansion of macro 'rep'
         rep(i, sub.size()) if ((w>>i)&1) id += sub[i];
         ^
snake_escaping.cpp:17:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i, n) for (int i=0; i<(n); i++)
                                  ^
snake_escaping.cpp:72:9: note: in expansion of macro 'rep'
         rep(i, sub.size()) {
         ^
snake_escaping.cpp:17:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i, n) for (int i=0; i<(n); i++)
                                  ^
snake_escaping.cpp:89:9: note: in expansion of macro 'rep'
         rep(i, sub.size()) {
         ^
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 492 KB Output is correct
3 Correct 2 ms 496 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 2 ms 672 KB Output is correct
7 Correct 2 ms 672 KB Output is correct
8 Correct 2 ms 828 KB Output is correct
9 Correct 2 ms 828 KB Output is correct
10 Correct 3 ms 884 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 492 KB Output is correct
3 Correct 2 ms 496 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 2 ms 672 KB Output is correct
7 Correct 2 ms 672 KB Output is correct
8 Correct 2 ms 828 KB Output is correct
9 Correct 2 ms 828 KB Output is correct
10 Correct 3 ms 884 KB Output is correct
11 Correct 818 ms 15652 KB Output is correct
12 Correct 778 ms 26240 KB Output is correct
13 Correct 600 ms 36068 KB Output is correct
14 Correct 630 ms 47004 KB Output is correct
15 Correct 1178 ms 58776 KB Output is correct
16 Correct 726 ms 65536 KB Output is correct
17 Correct 697 ms 65536 KB Output is correct
18 Correct 256 ms 65536 KB Output is correct
19 Correct 318 ms 65536 KB Output is correct
20 Correct 845 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 492 KB Output is correct
3 Correct 2 ms 496 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 2 ms 672 KB Output is correct
7 Correct 2 ms 672 KB Output is correct
8 Correct 2 ms 828 KB Output is correct
9 Correct 2 ms 828 KB Output is correct
10 Correct 3 ms 884 KB Output is correct
11 Correct 818 ms 15652 KB Output is correct
12 Correct 778 ms 26240 KB Output is correct
13 Correct 600 ms 36068 KB Output is correct
14 Correct 630 ms 47004 KB Output is correct
15 Correct 1178 ms 58776 KB Output is correct
16 Correct 726 ms 65536 KB Output is correct
17 Correct 697 ms 65536 KB Output is correct
18 Correct 256 ms 65536 KB Output is correct
19 Correct 318 ms 65536 KB Output is correct
20 Correct 845 ms 65536 KB Output is correct
21 Correct 1178 ms 65536 KB Output is correct
22 Correct 756 ms 65536 KB Output is correct
23 Correct 776 ms 65536 KB Output is correct
24 Correct 765 ms 65536 KB Output is correct
25 Correct 650 ms 65536 KB Output is correct
26 Correct 927 ms 65536 KB Output is correct
27 Correct 900 ms 65536 KB Output is correct
28 Correct 287 ms 65536 KB Output is correct
29 Correct 418 ms 65536 KB Output is correct
30 Correct 1016 ms 65536 KB Output is correct
31 Correct 1313 ms 65536 KB Output is correct
32 Correct 998 ms 65536 KB Output is correct
33 Correct 634 ms 65536 KB Output is correct
34 Correct 793 ms 65536 KB Output is correct
35 Correct 895 ms 65536 KB Output is correct
36 Correct 277 ms 65536 KB Output is correct
37 Correct 1218 ms 65536 KB Output is correct
38 Correct 428 ms 65536 KB Output is correct
39 Correct 769 ms 65536 KB Output is correct
40 Correct 745 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 492 KB Output is correct
3 Correct 2 ms 496 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 2 ms 672 KB Output is correct
7 Correct 2 ms 672 KB Output is correct
8 Correct 2 ms 828 KB Output is correct
9 Correct 2 ms 828 KB Output is correct
10 Correct 3 ms 884 KB Output is correct
11 Correct 95 ms 65536 KB Output is correct
12 Correct 99 ms 65536 KB Output is correct
13 Correct 123 ms 65536 KB Output is correct
14 Correct 147 ms 65536 KB Output is correct
15 Correct 107 ms 65536 KB Output is correct
16 Correct 178 ms 65536 KB Output is correct
17 Correct 153 ms 65536 KB Output is correct
18 Correct 80 ms 65536 KB Output is correct
19 Correct 92 ms 65536 KB Output is correct
20 Correct 105 ms 65536 KB Output is correct
21 Correct 131 ms 65536 KB Output is correct
22 Correct 154 ms 65536 KB Output is correct
23 Correct 112 ms 65536 KB Output is correct
24 Correct 155 ms 65536 KB Output is correct
25 Correct 160 ms 65536 KB Output is correct
26 Correct 85 ms 65536 KB Output is correct
27 Correct 94 ms 65536 KB Output is correct
28 Correct 93 ms 65536 KB Output is correct
29 Correct 126 ms 65536 KB Output is correct
30 Correct 141 ms 65536 KB Output is correct
31 Correct 112 ms 65536 KB Output is correct
32 Correct 176 ms 65536 KB Output is correct
33 Correct 188 ms 65536 KB Output is correct
34 Correct 78 ms 65536 KB Output is correct
35 Correct 155 ms 65536 KB Output is correct
36 Correct 138 ms 65536 KB Output is correct
37 Correct 148 ms 65536 KB Output is correct
38 Correct 158 ms 65536 KB Output is correct
39 Correct 145 ms 65536 KB Output is correct
40 Correct 144 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 492 KB Output is correct
3 Correct 2 ms 496 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 2 ms 672 KB Output is correct
7 Correct 2 ms 672 KB Output is correct
8 Correct 2 ms 828 KB Output is correct
9 Correct 2 ms 828 KB Output is correct
10 Correct 3 ms 884 KB Output is correct
11 Correct 818 ms 15652 KB Output is correct
12 Correct 778 ms 26240 KB Output is correct
13 Correct 600 ms 36068 KB Output is correct
14 Correct 630 ms 47004 KB Output is correct
15 Correct 1178 ms 58776 KB Output is correct
16 Correct 726 ms 65536 KB Output is correct
17 Correct 697 ms 65536 KB Output is correct
18 Correct 256 ms 65536 KB Output is correct
19 Correct 318 ms 65536 KB Output is correct
20 Correct 845 ms 65536 KB Output is correct
21 Correct 1178 ms 65536 KB Output is correct
22 Correct 756 ms 65536 KB Output is correct
23 Correct 776 ms 65536 KB Output is correct
24 Correct 765 ms 65536 KB Output is correct
25 Correct 650 ms 65536 KB Output is correct
26 Correct 927 ms 65536 KB Output is correct
27 Correct 900 ms 65536 KB Output is correct
28 Correct 287 ms 65536 KB Output is correct
29 Correct 418 ms 65536 KB Output is correct
30 Correct 1016 ms 65536 KB Output is correct
31 Correct 1313 ms 65536 KB Output is correct
32 Correct 998 ms 65536 KB Output is correct
33 Correct 634 ms 65536 KB Output is correct
34 Correct 793 ms 65536 KB Output is correct
35 Correct 895 ms 65536 KB Output is correct
36 Correct 277 ms 65536 KB Output is correct
37 Correct 1218 ms 65536 KB Output is correct
38 Correct 428 ms 65536 KB Output is correct
39 Correct 769 ms 65536 KB Output is correct
40 Correct 745 ms 65536 KB Output is correct
41 Correct 95 ms 65536 KB Output is correct
42 Correct 99 ms 65536 KB Output is correct
43 Correct 123 ms 65536 KB Output is correct
44 Correct 147 ms 65536 KB Output is correct
45 Correct 107 ms 65536 KB Output is correct
46 Correct 178 ms 65536 KB Output is correct
47 Correct 153 ms 65536 KB Output is correct
48 Correct 80 ms 65536 KB Output is correct
49 Correct 92 ms 65536 KB Output is correct
50 Correct 105 ms 65536 KB Output is correct
51 Correct 131 ms 65536 KB Output is correct
52 Correct 154 ms 65536 KB Output is correct
53 Correct 112 ms 65536 KB Output is correct
54 Correct 155 ms 65536 KB Output is correct
55 Correct 160 ms 65536 KB Output is correct
56 Correct 85 ms 65536 KB Output is correct
57 Correct 94 ms 65536 KB Output is correct
58 Correct 93 ms 65536 KB Output is correct
59 Correct 126 ms 65536 KB Output is correct
60 Correct 141 ms 65536 KB Output is correct
61 Correct 112 ms 65536 KB Output is correct
62 Correct 176 ms 65536 KB Output is correct
63 Correct 188 ms 65536 KB Output is correct
64 Correct 78 ms 65536 KB Output is correct
65 Correct 155 ms 65536 KB Output is correct
66 Correct 138 ms 65536 KB Output is correct
67 Correct 148 ms 65536 KB Output is correct
68 Correct 158 ms 65536 KB Output is correct
69 Correct 145 ms 65536 KB Output is correct
70 Correct 144 ms 65536 KB Output is correct
71 Correct 708 ms 65536 KB Output is correct
72 Correct 823 ms 65536 KB Output is correct
73 Correct 1368 ms 65536 KB Output is correct
74 Correct 1971 ms 65536 KB Output is correct
75 Correct 1000 ms 65536 KB Output is correct
76 Execution timed out 2032 ms 65536 KB Time limit exceeded
77 Halted 0 ms 0 KB -