oj.uz

Submission #43295

# Submission time Handle Problem Language Result Execution time Memory
43295 2018-03-13T08:23:55 Z funcsr Snake Escaping (JOI18_snake_escaping) C++14
65 / 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];
map<string, int> cache;

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);
    string st(qs);
    if (cache.find(st) != cache.end()) {
      printf("%d\n", cache[qs]);
      continue;
    }
    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);
    cache[st] = 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:42: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 664 KB Output is correct
4 Correct 2 ms 664 KB Output is correct
5 Correct 2 ms 664 KB Output is correct
6 Correct 2 ms 664 KB Output is correct
7 Correct 3 ms 732 KB Output is correct
8 Correct 2 ms 732 KB Output is correct
9 Correct 2 ms 732 KB Output is correct
10 Correct 2 ms 732 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 664 KB Output is correct
4 Correct 2 ms 664 KB Output is correct
5 Correct 2 ms 664 KB Output is correct
6 Correct 2 ms 664 KB Output is correct
7 Correct 3 ms 732 KB Output is correct
8 Correct 2 ms 732 KB Output is correct
9 Correct 2 ms 732 KB Output is correct
10 Correct 2 ms 732 KB Output is correct
11 Correct 574 ms 15604 KB Output is correct
12 Correct 716 ms 26124 KB Output is correct
13 Correct 889 ms 36612 KB Output is correct
14 Correct 832 ms 47228 KB Output is correct
15 Correct 808 ms 58648 KB Output is correct
16 Correct 1030 ms 65536 KB Output is correct
17 Correct 1352 ms 65536 KB Output is correct
18 Correct 307 ms 65536 KB Output is correct
19 Correct 591 ms 65536 KB Output is correct
20 Correct 707 ms 65536 KB Output is correct

Subtask #3
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 664 KB Output is correct
4 Correct 2 ms 664 KB Output is correct
5 Correct 2 ms 664 KB Output is correct
6 Correct 2 ms 664 KB Output is correct
7 Correct 3 ms 732 KB Output is correct
8 Correct 2 ms 732 KB Output is correct
9 Correct 2 ms 732 KB Output is correct
10 Correct 2 ms 732 KB Output is correct
11 Correct 574 ms 15604 KB Output is correct
12 Correct 716 ms 26124 KB Output is correct
13 Correct 889 ms 36612 KB Output is correct
14 Correct 832 ms 47228 KB Output is correct
15 Correct 808 ms 58648 KB Output is correct
16 Correct 1030 ms 65536 KB Output is correct
17 Correct 1352 ms 65536 KB Output is correct
18 Correct 307 ms 65536 KB Output is correct
19 Correct 591 ms 65536 KB Output is correct
20 Correct 707 ms 65536 KB Output is correct
21 Correct 808 ms 65536 KB Output is correct
22 Correct 1002 ms 65536 KB Output is correct
23 Execution timed out 2055 ms 65536 KB Time limit exceeded
24 Halted 0 ms 0 KB -

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 664 KB Output is correct
4 Correct 2 ms 664 KB Output is correct
5 Correct 2 ms 664 KB Output is correct
6 Correct 2 ms 664 KB Output is correct
7 Correct 3 ms 732 KB Output is correct
8 Correct 2 ms 732 KB Output is correct
9 Correct 2 ms 732 KB Output is correct
10 Correct 2 ms 732 KB Output is correct
11 Correct 179 ms 65536 KB Output is correct
12 Correct 185 ms 65536 KB Output is correct
13 Correct 204 ms 65536 KB Output is correct
14 Correct 279 ms 65536 KB Output is correct
15 Correct 192 ms 65536 KB Output is correct
16 Correct 292 ms 65536 KB Output is correct
17 Correct 253 ms 65536 KB Output is correct
18 Correct 89 ms 65536 KB Output is correct
19 Correct 176 ms 65536 KB Output is correct
20 Correct 177 ms 65536 KB Output is correct
21 Correct 212 ms 65536 KB Output is correct
22 Correct 269 ms 65536 KB Output is correct
23 Correct 184 ms 65536 KB Output is correct
24 Correct 269 ms 65536 KB Output is correct
25 Correct 247 ms 65536 KB Output is correct
26 Correct 85 ms 65536 KB Output is correct
27 Correct 165 ms 65536 KB Output is correct
28 Correct 194 ms 65536 KB Output is correct
29 Correct 211 ms 65536 KB Output is correct
30 Correct 252 ms 65536 KB Output is correct
31 Correct 191 ms 65536 KB Output is correct
32 Correct 290 ms 65536 KB Output is correct
33 Correct 249 ms 65536 KB Output is correct
34 Correct 83 ms 65536 KB Output is correct
35 Correct 206 ms 65536 KB Output is correct
36 Correct 217 ms 65536 KB Output is correct
37 Correct 217 ms 65536 KB Output is correct
38 Correct 208 ms 65536 KB Output is correct
39 Correct 246 ms 65536 KB Output is correct
40 Correct 238 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 664 KB Output is correct
4 Correct 2 ms 664 KB Output is correct
5 Correct 2 ms 664 KB Output is correct
6 Correct 2 ms 664 KB Output is correct
7 Correct 3 ms 732 KB Output is correct
8 Correct 2 ms 732 KB Output is correct
9 Correct 2 ms 732 KB Output is correct
10 Correct 2 ms 732 KB Output is correct
11 Correct 574 ms 15604 KB Output is correct
12 Correct 716 ms 26124 KB Output is correct
13 Correct 889 ms 36612 KB Output is correct
14 Correct 832 ms 47228 KB Output is correct
15 Correct 808 ms 58648 KB Output is correct
16 Correct 1030 ms 65536 KB Output is correct
17 Correct 1352 ms 65536 KB Output is correct
18 Correct 307 ms 65536 KB Output is correct
19 Correct 591 ms 65536 KB Output is correct
20 Correct 707 ms 65536 KB Output is correct
21 Correct 808 ms 65536 KB Output is correct
22 Correct 1002 ms 65536 KB Output is correct
23 Execution timed out 2055 ms 65536 KB Time limit exceeded
24 Halted 0 ms 0 KB -