답안 #43293 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
43293	2018-03-13T08:12:50 Z	funcsr	Snake Escaping (JOI18_snake_escaping)	C++14	75 / 100	2000 ms	65536 KB

snake_escaping

#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];
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;
    if (any <= 6) {
      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 <= 6) {
      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 = 1;
        rep(i, sz) {
          if ((w>>i)&1) id += sub[i];
          else sgn *= -1;
        }
        s += sgn*B[id];
      }
    }
    else {
      assert(zero <= 6);
      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 = 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: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

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	448 KB	Output is correct
4	Correct	2 ms	536 KB	Output is correct
5	Correct	2 ms	692 KB	Output is correct
6	Correct	2 ms	692 KB	Output is correct
7	Correct	2 ms	692 KB	Output is correct
8	Correct	2 ms	692 KB	Output is correct
9	Correct	2 ms	692 KB	Output is correct
10	Correct	2 ms	692 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	448 KB	Output is correct
4	Correct	2 ms	536 KB	Output is correct
5	Correct	2 ms	692 KB	Output is correct
6	Correct	2 ms	692 KB	Output is correct
7	Correct	2 ms	692 KB	Output is correct
8	Correct	2 ms	692 KB	Output is correct
9	Correct	2 ms	692 KB	Output is correct
10	Correct	2 ms	692 KB	Output is correct
11	Correct	561 ms	15384 KB	Output is correct
12	Correct	634 ms	25996 KB	Output is correct
13	Correct	450 ms	35972 KB	Output is correct
14	Correct	440 ms	46804 KB	Output is correct
15	Correct	909 ms	58460 KB	Output is correct
16	Correct	537 ms	65536 KB	Output is correct
17	Correct	529 ms	65536 KB	Output is correct
18	Correct	263 ms	65536 KB	Output is correct
19	Correct	330 ms	65536 KB	Output is correct
20	Correct	598 ms	65536 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	448 KB	Output is correct
4	Correct	2 ms	536 KB	Output is correct
5	Correct	2 ms	692 KB	Output is correct
6	Correct	2 ms	692 KB	Output is correct
7	Correct	2 ms	692 KB	Output is correct
8	Correct	2 ms	692 KB	Output is correct
9	Correct	2 ms	692 KB	Output is correct
10	Correct	2 ms	692 KB	Output is correct
11	Correct	561 ms	15384 KB	Output is correct
12	Correct	634 ms	25996 KB	Output is correct
13	Correct	450 ms	35972 KB	Output is correct
14	Correct	440 ms	46804 KB	Output is correct
15	Correct	909 ms	58460 KB	Output is correct
16	Correct	537 ms	65536 KB	Output is correct
17	Correct	529 ms	65536 KB	Output is correct
18	Correct	263 ms	65536 KB	Output is correct
19	Correct	330 ms	65536 KB	Output is correct
20	Correct	598 ms	65536 KB	Output is correct
21	Correct	1018 ms	65536 KB	Output is correct
22	Correct	656 ms	65536 KB	Output is correct
23	Correct	620 ms	65536 KB	Output is correct
24	Correct	585 ms	65536 KB	Output is correct
25	Correct	505 ms	65536 KB	Output is correct
26	Correct	716 ms	65536 KB	Output is correct
27	Correct	674 ms	65536 KB	Output is correct
28	Correct	305 ms	65536 KB	Output is correct
29	Correct	427 ms	65536 KB	Output is correct
30	Correct	814 ms	65536 KB	Output is correct
31	Correct	1002 ms	65536 KB	Output is correct
32	Correct	710 ms	65536 KB	Output is correct
33	Correct	493 ms	65536 KB	Output is correct
34	Correct	594 ms	65536 KB	Output is correct
35	Correct	709 ms	65536 KB	Output is correct
36	Correct	307 ms	65536 KB	Output is correct
37	Correct	989 ms	65536 KB	Output is correct
38	Correct	463 ms	65536 KB	Output is correct
39	Correct	609 ms	65536 KB	Output is correct
40	Correct	581 ms	65536 KB	Output is correct

Subtask #4
53.0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	448 KB	Output is correct
4	Correct	2 ms	536 KB	Output is correct
5	Correct	2 ms	692 KB	Output is correct
6	Correct	2 ms	692 KB	Output is correct
7	Correct	2 ms	692 KB	Output is correct
8	Correct	2 ms	692 KB	Output is correct
9	Correct	2 ms	692 KB	Output is correct
10	Correct	2 ms	692 KB	Output is correct
11	Correct	121 ms	65536 KB	Output is correct
12	Correct	107 ms	65536 KB	Output is correct
13	Correct	133 ms	65536 KB	Output is correct
14	Correct	145 ms	65536 KB	Output is correct
15	Correct	102 ms	65536 KB	Output is correct
16	Correct	233 ms	65536 KB	Output is correct
17	Correct	153 ms	65536 KB	Output is correct
18	Correct	85 ms	65536 KB	Output is correct
19	Correct	105 ms	65536 KB	Output is correct
20	Correct	103 ms	65536 KB	Output is correct
21	Correct	132 ms	65536 KB	Output is correct
22	Correct	148 ms	65536 KB	Output is correct
23	Correct	108 ms	65536 KB	Output is correct
24	Correct	158 ms	65536 KB	Output is correct
25	Correct	153 ms	65536 KB	Output is correct
26	Correct	85 ms	65536 KB	Output is correct
27	Correct	99 ms	65536 KB	Output is correct
28	Correct	99 ms	65536 KB	Output is correct
29	Correct	115 ms	65536 KB	Output is correct
30	Correct	139 ms	65536 KB	Output is correct
31	Correct	103 ms	65536 KB	Output is correct
32	Correct	164 ms	65536 KB	Output is correct
33	Correct	158 ms	65536 KB	Output is correct
34	Correct	96 ms	65536 KB	Output is correct
35	Correct	153 ms	65536 KB	Output is correct
36	Correct	140 ms	65536 KB	Output is correct
37	Correct	131 ms	65536 KB	Output is correct
38	Correct	135 ms	65536 KB	Output is correct
39	Correct	143 ms	65536 KB	Output is correct
40	Correct	164 ms	65536 KB	Output is correct

Subtask #5
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	448 KB	Output is correct
4	Correct	2 ms	536 KB	Output is correct
5	Correct	2 ms	692 KB	Output is correct
6	Correct	2 ms	692 KB	Output is correct
7	Correct	2 ms	692 KB	Output is correct
8	Correct	2 ms	692 KB	Output is correct
9	Correct	2 ms	692 KB	Output is correct
10	Correct	2 ms	692 KB	Output is correct
11	Correct	561 ms	15384 KB	Output is correct
12	Correct	634 ms	25996 KB	Output is correct
13	Correct	450 ms	35972 KB	Output is correct
14	Correct	440 ms	46804 KB	Output is correct
15	Correct	909 ms	58460 KB	Output is correct
16	Correct	537 ms	65536 KB	Output is correct
17	Correct	529 ms	65536 KB	Output is correct
18	Correct	263 ms	65536 KB	Output is correct
19	Correct	330 ms	65536 KB	Output is correct
20	Correct	598 ms	65536 KB	Output is correct
21	Correct	1018 ms	65536 KB	Output is correct
22	Correct	656 ms	65536 KB	Output is correct
23	Correct	620 ms	65536 KB	Output is correct
24	Correct	585 ms	65536 KB	Output is correct
25	Correct	505 ms	65536 KB	Output is correct
26	Correct	716 ms	65536 KB	Output is correct
27	Correct	674 ms	65536 KB	Output is correct
28	Correct	305 ms	65536 KB	Output is correct
29	Correct	427 ms	65536 KB	Output is correct
30	Correct	814 ms	65536 KB	Output is correct
31	Correct	1002 ms	65536 KB	Output is correct
32	Correct	710 ms	65536 KB	Output is correct
33	Correct	493 ms	65536 KB	Output is correct
34	Correct	594 ms	65536 KB	Output is correct
35	Correct	709 ms	65536 KB	Output is correct
36	Correct	307 ms	65536 KB	Output is correct
37	Correct	989 ms	65536 KB	Output is correct
38	Correct	463 ms	65536 KB	Output is correct
39	Correct	609 ms	65536 KB	Output is correct
40	Correct	581 ms	65536 KB	Output is correct
41	Correct	121 ms	65536 KB	Output is correct
42	Correct	107 ms	65536 KB	Output is correct
43	Correct	133 ms	65536 KB	Output is correct
44	Correct	145 ms	65536 KB	Output is correct
45	Correct	102 ms	65536 KB	Output is correct
46	Correct	233 ms	65536 KB	Output is correct
47	Correct	153 ms	65536 KB	Output is correct
48	Correct	85 ms	65536 KB	Output is correct
49	Correct	105 ms	65536 KB	Output is correct
50	Correct	103 ms	65536 KB	Output is correct
51	Correct	132 ms	65536 KB	Output is correct
52	Correct	148 ms	65536 KB	Output is correct
53	Correct	108 ms	65536 KB	Output is correct
54	Correct	158 ms	65536 KB	Output is correct
55	Correct	153 ms	65536 KB	Output is correct
56	Correct	85 ms	65536 KB	Output is correct
57	Correct	99 ms	65536 KB	Output is correct
58	Correct	99 ms	65536 KB	Output is correct
59	Correct	115 ms	65536 KB	Output is correct
60	Correct	139 ms	65536 KB	Output is correct
61	Correct	103 ms	65536 KB	Output is correct
62	Correct	164 ms	65536 KB	Output is correct
63	Correct	158 ms	65536 KB	Output is correct
64	Correct	96 ms	65536 KB	Output is correct
65	Correct	153 ms	65536 KB	Output is correct
66	Correct	140 ms	65536 KB	Output is correct
67	Correct	131 ms	65536 KB	Output is correct
68	Correct	135 ms	65536 KB	Output is correct
69	Correct	143 ms	65536 KB	Output is correct
70	Correct	164 ms	65536 KB	Output is correct
71	Correct	770 ms	65536 KB	Output is correct
72	Correct	761 ms	65536 KB	Output is correct
73	Correct	1040 ms	65536 KB	Output is correct
74	Correct	1468 ms	65536 KB	Output is correct
75	Correct	770 ms	65536 KB	Output is correct
76	Execution timed out	2041 ms	65536 KB	Time limit exceeded
77	Halted	0 ms	0 KB	-

답안 #43293

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 10.0 / 10.0

Subtask #4 53.0 / 53.0

Subtask #5 0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
10.0 / 10.0

Subtask #4
53.0 / 53.0

Subtask #5
0 / 25.0