oj.uz

Submission #817540

# Submission time Handle Problem Language Result Execution time Memory
817540 2023-08-09T13:25:18 Z kwongweng Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 15252 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ll, int> li;
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define ROF(i, a, b) for(int i = a; i >= b; i--)
#define ms memset
#define pb push_back
#define fi first
#define se second
 
int main(){
  ios::sync_with_stdio(false);
  if (fopen("input.txt", "r")){
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  }
  int L, Q; cin>>L>>Q;
  string s; cin >> s;
  int dp[1<<L]; FOR(i,0,(1<<L)) dp[i]=s[i]-'0';
  int dp2[1<<L]; FOR(i,0,(1<<L)) dp2[i]=s[(1<<L)-1-i]-'0';
  FOR(i,0,L){
    FOR(mask,0,(1<<L)){
      if (mask & (1<<i)) {dp[mask] += dp[mask-(1<<i)]; dp2[mask] += dp2[mask-(1<<i)];}
    }
  }
  FOR(i,0,Q){
    string t; cin >> t; reverse(t.begin(), t.end());
    int cnt1=0, cnt2=0; FOR(j,0,L) {cnt1 += (t[j]=='?'); cnt2 += (t[j]=='1');}
    if (cnt1 <= 6){
      int ans = 0;
      vi a; int cur = 0;
      FOR(j,0,L){
        if (t[j]=='?') a.pb(j);
        else cur += (1<<j)*(t[j]-'0');
      }
      FOR(j,0,(1<<cnt1)){
        int val=0; FOR(k,0,cnt1){
          if (j & (1<<k)) val ^= (1<<a[k]);
        }
        //cout<<cur+val<<" ";
        ans+=s[cur^val]-'0';
      }
      cout<<ans<<'\n'; continue;
    }
    if (cnt2 <= 6){
      vi a; int cur=0;
      FOR(j,0,L){
        if (t[j]=='1') {a.pb(j); cur ^= (1<<j);}
        if (t[j]=='?') cur ^= (1<<j);
      }
      int ans = 0;
      FOR(j,0,(1<<cnt2)){
        int val=0; int num=0; FOR(k,0,cnt2){
          if (j & (1<<k)) {val ^= (1<<a[k]); num^=1;}
        }
        if (num) ans -= dp[cur^val];
        else ans += dp[cur^val];
      }
      cout<<ans<<'\n'; continue;
    }
    int cnt3=L-cnt1-cnt2; vi a; int cur=0;
    FOR(j,0,L){
      if (t[j] != '1') cur ^= (1<<j);
      if (t[j] == '0') a.pb(j);
    }
    int ans=0;
    FOR(j,0,(1<<cnt3)){
      int val=0,num=0; FOR(k,0,cnt3){
        if (j & (1<<k)) {val ^= (1<<a[k]); num^=1;}
      }
      if (num) ans-=dp2[cur^val];
      else ans+=dp2[cur^val];
    }
    cout<<ans<<'\n';
  }
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:20:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
snake_escaping.cpp:21:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 2 ms 212 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 3 ms 212 KB Output is correct
6 Correct 2 ms 328 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 212 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 2 ms 212 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 3 ms 212 KB Output is correct
6 Correct 2 ms 328 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 1487 ms 5064 KB Output is correct
12 Correct 1482 ms 4660 KB Output is correct
13 Correct 1292 ms 4052 KB Output is correct
14 Correct 1289 ms 4060 KB Output is correct
15 Correct 1813 ms 5004 KB Output is correct
16 Correct 1394 ms 4168 KB Output is correct
17 Correct 1402 ms 4256 KB Output is correct
18 Correct 1162 ms 6100 KB Output is correct
19 Correct 1122 ms 2960 KB Output is correct
20 Correct 1508 ms 4700 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 2 ms 212 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 3 ms 212 KB Output is correct
6 Correct 2 ms 328 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 1487 ms 5064 KB Output is correct
12 Correct 1482 ms 4660 KB Output is correct
13 Correct 1292 ms 4052 KB Output is correct
14 Correct 1289 ms 4060 KB Output is correct
15 Correct 1813 ms 5004 KB Output is correct
16 Correct 1394 ms 4168 KB Output is correct
17 Correct 1402 ms 4256 KB Output is correct
18 Correct 1162 ms 6100 KB Output is correct
19 Correct 1122 ms 2960 KB Output is correct
20 Correct 1508 ms 4700 KB Output is correct
21 Correct 1883 ms 5076 KB Output is correct
22 Correct 1486 ms 5312 KB Output is correct
23 Correct 1421 ms 4332 KB Output is correct
24 Correct 1350 ms 4164 KB Output is correct
25 Correct 1367 ms 6144 KB Output is correct
26 Correct 1537 ms 4628 KB Output is correct
27 Correct 1499 ms 4536 KB Output is correct
28 Correct 1170 ms 7140 KB Output is correct
29 Correct 1143 ms 3148 KB Output is correct
30 Correct 1666 ms 5284 KB Output is correct
31 Correct 1802 ms 5076 KB Output is correct
32 Correct 1501 ms 5236 KB Output is correct
33 Correct 1299 ms 3940 KB Output is correct
34 Correct 1361 ms 4148 KB Output is correct
35 Correct 1469 ms 4500 KB Output is correct
36 Correct 1170 ms 3056 KB Output is correct
37 Correct 1881 ms 5188 KB Output is correct
38 Correct 1142 ms 3120 KB Output is correct
39 Correct 1402 ms 4316 KB Output is correct
40 Correct 1341 ms 4096 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 2 ms 212 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 3 ms 212 KB Output is correct
6 Correct 2 ms 328 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 96 ms 10588 KB Output is correct
12 Correct 114 ms 10588 KB Output is correct
13 Correct 109 ms 10604 KB Output is correct
14 Correct 144 ms 10620 KB Output is correct
15 Correct 108 ms 10712 KB Output is correct
16 Correct 133 ms 10652 KB Output is correct
17 Correct 118 ms 10604 KB Output is correct
18 Correct 107 ms 10832 KB Output is correct
19 Correct 92 ms 10436 KB Output is correct
20 Correct 99 ms 10692 KB Output is correct
21 Correct 115 ms 10604 KB Output is correct
22 Correct 140 ms 10608 KB Output is correct
23 Correct 104 ms 10476 KB Output is correct
24 Correct 127 ms 10604 KB Output is correct
25 Correct 125 ms 10672 KB Output is correct
26 Correct 91 ms 10496 KB Output is correct
27 Correct 98 ms 10688 KB Output is correct
28 Correct 91 ms 10464 KB Output is correct
29 Correct 109 ms 10528 KB Output is correct
30 Correct 126 ms 10624 KB Output is correct
31 Correct 102 ms 10488 KB Output is correct
32 Correct 127 ms 10552 KB Output is correct
33 Correct 120 ms 10568 KB Output is correct
34 Correct 101 ms 10612 KB Output is correct
35 Correct 111 ms 10604 KB Output is correct
36 Correct 110 ms 10524 KB Output is correct
37 Correct 113 ms 10628 KB Output is correct
38 Correct 112 ms 10620 KB Output is correct
39 Correct 113 ms 10544 KB Output is correct
40 Correct 116 ms 10608 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 2 ms 212 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 3 ms 212 KB Output is correct
6 Correct 2 ms 328 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 1487 ms 5064 KB Output is correct
12 Correct 1482 ms 4660 KB Output is correct
13 Correct 1292 ms 4052 KB Output is correct
14 Correct 1289 ms 4060 KB Output is correct
15 Correct 1813 ms 5004 KB Output is correct
16 Correct 1394 ms 4168 KB Output is correct
17 Correct 1402 ms 4256 KB Output is correct
18 Correct 1162 ms 6100 KB Output is correct
19 Correct 1122 ms 2960 KB Output is correct
20 Correct 1508 ms 4700 KB Output is correct
21 Correct 1883 ms 5076 KB Output is correct
22 Correct 1486 ms 5312 KB Output is correct
23 Correct 1421 ms 4332 KB Output is correct
24 Correct 1350 ms 4164 KB Output is correct
25 Correct 1367 ms 6144 KB Output is correct
26 Correct 1537 ms 4628 KB Output is correct
27 Correct 1499 ms 4536 KB Output is correct
28 Correct 1170 ms 7140 KB Output is correct
29 Correct 1143 ms 3148 KB Output is correct
30 Correct 1666 ms 5284 KB Output is correct
31 Correct 1802 ms 5076 KB Output is correct
32 Correct 1501 ms 5236 KB Output is correct
33 Correct 1299 ms 3940 KB Output is correct
34 Correct 1361 ms 4148 KB Output is correct
35 Correct 1469 ms 4500 KB Output is correct
36 Correct 1170 ms 3056 KB Output is correct
37 Correct 1881 ms 5188 KB Output is correct
38 Correct 1142 ms 3120 KB Output is correct
39 Correct 1402 ms 4316 KB Output is correct
40 Correct 1341 ms 4096 KB Output is correct
41 Correct 96 ms 10588 KB Output is correct
42 Correct 114 ms 10588 KB Output is correct
43 Correct 109 ms 10604 KB Output is correct
44 Correct 144 ms 10620 KB Output is correct
45 Correct 108 ms 10712 KB Output is correct
46 Correct 133 ms 10652 KB Output is correct
47 Correct 118 ms 10604 KB Output is correct
48 Correct 107 ms 10832 KB Output is correct
49 Correct 92 ms 10436 KB Output is correct
50 Correct 99 ms 10692 KB Output is correct
51 Correct 115 ms 10604 KB Output is correct
52 Correct 140 ms 10608 KB Output is correct
53 Correct 104 ms 10476 KB Output is correct
54 Correct 127 ms 10604 KB Output is correct
55 Correct 125 ms 10672 KB Output is correct
56 Correct 91 ms 10496 KB Output is correct
57 Correct 98 ms 10688 KB Output is correct
58 Correct 91 ms 10464 KB Output is correct
59 Correct 109 ms 10528 KB Output is correct
60 Correct 126 ms 10624 KB Output is correct
61 Correct 102 ms 10488 KB Output is correct
62 Correct 127 ms 10552 KB Output is correct
63 Correct 120 ms 10568 KB Output is correct
64 Correct 101 ms 10612 KB Output is correct
65 Correct 111 ms 10604 KB Output is correct
66 Correct 110 ms 10524 KB Output is correct
67 Correct 113 ms 10628 KB Output is correct
68 Correct 112 ms 10620 KB Output is correct
69 Correct 113 ms 10544 KB Output is correct
70 Correct 116 ms 10608 KB Output is correct
71 Correct 1377 ms 15132 KB Output is correct
72 Correct 1572 ms 15252 KB Output is correct
73 Correct 1700 ms 13788 KB Output is correct
74 Execution timed out 2064 ms 14088 KB Time limit exceeded
75 Halted 0 ms 0 KB -