oj.uz

Submission #43292

# Submission time Handle Problem Language Result Execution time Memory
43292 2018-03-13T08:11:22 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);
        else if (qs[i] == '1') mask |= 1<<i;
      }
      int sz = sub.size();
      rep(w, 1<<sz) {
        int id = mask;
        rep(i, sz) 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);
        else if (qs[i] == '?') mask |= 1<<i;
      }
      int sz = sub.size();
      rep(w, 1<<sz) {
        int id = mask, sgn = 1;
        rep(i, sz) {
          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);
        else if (qs[i] == '?') mask |= 1<<i;
      }
      int sz = sub.size();
      rep(w, 1<<sz) {
        int id = mask, sgn = 1;
        rep(i, sz) {
          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: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 3 ms 376 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 2 ms 652 KB Output is correct
8 Correct 2 ms 680 KB Output is correct
9 Correct 2 ms 692 KB Output is correct
10 Correct 3 ms 832 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 3 ms 376 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 2 ms 652 KB Output is correct
8 Correct 2 ms 680 KB Output is correct
9 Correct 2 ms 692 KB Output is correct
10 Correct 3 ms 832 KB Output is correct
11 Correct 755 ms 15516 KB Output is correct
12 Correct 727 ms 25884 KB Output is correct
13 Correct 603 ms 35912 KB Output is correct
14 Correct 599 ms 46796 KB Output is correct
15 Correct 1174 ms 58668 KB Output is correct
16 Correct 686 ms 65536 KB Output is correct
17 Correct 700 ms 65536 KB Output is correct
18 Correct 279 ms 65536 KB Output is correct
19 Correct 379 ms 65536 KB Output is correct
20 Correct 793 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 3 ms 376 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 2 ms 652 KB Output is correct
8 Correct 2 ms 680 KB Output is correct
9 Correct 2 ms 692 KB Output is correct
10 Correct 3 ms 832 KB Output is correct
11 Correct 755 ms 15516 KB Output is correct
12 Correct 727 ms 25884 KB Output is correct
13 Correct 603 ms 35912 KB Output is correct
14 Correct 599 ms 46796 KB Output is correct
15 Correct 1174 ms 58668 KB Output is correct
16 Correct 686 ms 65536 KB Output is correct
17 Correct 700 ms 65536 KB Output is correct
18 Correct 279 ms 65536 KB Output is correct
19 Correct 379 ms 65536 KB Output is correct
20 Correct 793 ms 65536 KB Output is correct
21 Correct 1425 ms 65536 KB Output is correct
22 Correct 719 ms 65536 KB Output is correct
23 Correct 783 ms 65536 KB Output is correct
24 Correct 786 ms 65536 KB Output is correct
25 Correct 709 ms 65536 KB Output is correct
26 Correct 880 ms 65536 KB Output is correct
27 Correct 889 ms 65536 KB Output is correct
28 Correct 306 ms 65536 KB Output is correct
29 Correct 405 ms 65536 KB Output is correct
30 Correct 1037 ms 65536 KB Output is correct
31 Correct 1277 ms 65536 KB Output is correct
32 Correct 959 ms 65536 KB Output is correct
33 Correct 650 ms 65536 KB Output is correct
34 Correct 765 ms 65536 KB Output is correct
35 Correct 899 ms 65536 KB Output is correct
36 Correct 275 ms 65536 KB Output is correct
37 Correct 1298 ms 65536 KB Output is correct
38 Correct 495 ms 65536 KB Output is correct
39 Correct 825 ms 65536 KB Output is correct
40 Correct 841 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 3 ms 376 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 2 ms 652 KB Output is correct
8 Correct 2 ms 680 KB Output is correct
9 Correct 2 ms 692 KB Output is correct
10 Correct 3 ms 832 KB Output is correct
11 Correct 104 ms 65536 KB Output is correct
12 Correct 109 ms 65536 KB Output is correct
13 Correct 134 ms 65536 KB Output is correct
14 Correct 189 ms 65536 KB Output is correct
15 Correct 118 ms 65536 KB Output is correct
16 Correct 188 ms 65536 KB Output is correct
17 Correct 169 ms 65536 KB Output is correct
18 Correct 85 ms 65536 KB Output is correct
19 Correct 97 ms 65536 KB Output is correct
20 Correct 125 ms 65536 KB Output is correct
21 Correct 138 ms 65536 KB Output is correct
22 Correct 158 ms 65536 KB Output is correct
23 Correct 116 ms 65536 KB Output is correct
24 Correct 169 ms 65536 KB Output is correct
25 Correct 172 ms 65536 KB Output is correct
26 Correct 84 ms 65536 KB Output is correct
27 Correct 101 ms 65536 KB Output is correct
28 Correct 99 ms 65536 KB Output is correct
29 Correct 129 ms 65536 KB Output is correct
30 Correct 194 ms 65536 KB Output is correct
31 Correct 114 ms 65536 KB Output is correct
32 Correct 196 ms 65536 KB Output is correct
33 Correct 171 ms 65536 KB Output is correct
34 Correct 84 ms 65536 KB Output is correct
35 Correct 149 ms 65536 KB Output is correct
36 Correct 146 ms 65536 KB Output is correct
37 Correct 165 ms 65536 KB Output is correct
38 Correct 156 ms 65536 KB Output is correct
39 Correct 164 ms 65536 KB Output is correct
40 Correct 164 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 3 ms 376 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 2 ms 652 KB Output is correct
8 Correct 2 ms 680 KB Output is correct
9 Correct 2 ms 692 KB Output is correct
10 Correct 3 ms 832 KB Output is correct
11 Correct 755 ms 15516 KB Output is correct
12 Correct 727 ms 25884 KB Output is correct
13 Correct 603 ms 35912 KB Output is correct
14 Correct 599 ms 46796 KB Output is correct
15 Correct 1174 ms 58668 KB Output is correct
16 Correct 686 ms 65536 KB Output is correct
17 Correct 700 ms 65536 KB Output is correct
18 Correct 279 ms 65536 KB Output is correct
19 Correct 379 ms 65536 KB Output is correct
20 Correct 793 ms 65536 KB Output is correct
21 Correct 1425 ms 65536 KB Output is correct
22 Correct 719 ms 65536 KB Output is correct
23 Correct 783 ms 65536 KB Output is correct
24 Correct 786 ms 65536 KB Output is correct
25 Correct 709 ms 65536 KB Output is correct
26 Correct 880 ms 65536 KB Output is correct
27 Correct 889 ms 65536 KB Output is correct
28 Correct 306 ms 65536 KB Output is correct
29 Correct 405 ms 65536 KB Output is correct
30 Correct 1037 ms 65536 KB Output is correct
31 Correct 1277 ms 65536 KB Output is correct
32 Correct 959 ms 65536 KB Output is correct
33 Correct 650 ms 65536 KB Output is correct
34 Correct 765 ms 65536 KB Output is correct
35 Correct 899 ms 65536 KB Output is correct
36 Correct 275 ms 65536 KB Output is correct
37 Correct 1298 ms 65536 KB Output is correct
38 Correct 495 ms 65536 KB Output is correct
39 Correct 825 ms 65536 KB Output is correct
40 Correct 841 ms 65536 KB Output is correct
41 Correct 104 ms 65536 KB Output is correct
42 Correct 109 ms 65536 KB Output is correct
43 Correct 134 ms 65536 KB Output is correct
44 Correct 189 ms 65536 KB Output is correct
45 Correct 118 ms 65536 KB Output is correct
46 Correct 188 ms 65536 KB Output is correct
47 Correct 169 ms 65536 KB Output is correct
48 Correct 85 ms 65536 KB Output is correct
49 Correct 97 ms 65536 KB Output is correct
50 Correct 125 ms 65536 KB Output is correct
51 Correct 138 ms 65536 KB Output is correct
52 Correct 158 ms 65536 KB Output is correct
53 Correct 116 ms 65536 KB Output is correct
54 Correct 169 ms 65536 KB Output is correct
55 Correct 172 ms 65536 KB Output is correct
56 Correct 84 ms 65536 KB Output is correct
57 Correct 101 ms 65536 KB Output is correct
58 Correct 99 ms 65536 KB Output is correct
59 Correct 129 ms 65536 KB Output is correct
60 Correct 194 ms 65536 KB Output is correct
61 Correct 114 ms 65536 KB Output is correct
62 Correct 196 ms 65536 KB Output is correct
63 Correct 171 ms 65536 KB Output is correct
64 Correct 84 ms 65536 KB Output is correct
65 Correct 149 ms 65536 KB Output is correct
66 Correct 146 ms 65536 KB Output is correct
67 Correct 165 ms 65536 KB Output is correct
68 Correct 156 ms 65536 KB Output is correct
69 Correct 164 ms 65536 KB Output is correct
70 Correct 164 ms 65536 KB Output is correct
71 Correct 786 ms 65536 KB Output is correct
72 Correct 859 ms 65536 KB Output is correct
73 Correct 1418 ms 65536 KB Output is correct
74 Execution timed out 2017 ms 65536 KB Time limit exceeded
75 Halted 0 ms 0 KB -