oj.uz

Submission #817578

# Submission time Handle Problem Language Result Execution time Memory
817578 2023-08-09T13:43:30 Z kwongweng Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 14728 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');}
    int cnt3=L-cnt1-cnt2;
    if (cnt1 <= min(cnt2, cnt3)){
      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 <= cnt3){
      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; FOR(k,0,cnt2){
          if (j & (1<<k)) {val ^= (1<<a[k]);}
        }
        if (__builtin_popcount(val)%2==1) ans -= dp[cur^val];
        else ans += dp[cur^val];
      }
      cout<<ans<<'\n'; continue;
    }
    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; FOR(k,0,cnt3){
        if (j & (1<<k)) {val ^= (1<<a[k]);}
      }
      if (__builtin_popcount(val)%2==1) 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 2 ms 212 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 2 ms 212 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 2 ms 212 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 1187 ms 4392 KB Output is correct
12 Correct 1269 ms 3944 KB Output is correct
13 Correct 1328 ms 3212 KB Output is correct
14 Correct 1287 ms 3324 KB Output is correct
15 Correct 1270 ms 4300 KB Output is correct
16 Correct 1348 ms 3376 KB Output is correct
17 Correct 1314 ms 3356 KB Output is correct
18 Correct 1152 ms 5324 KB Output is correct
19 Correct 1189 ms 2268 KB Output is correct
20 Correct 1225 ms 3980 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 2 ms 212 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 1187 ms 4392 KB Output is correct
12 Correct 1269 ms 3944 KB Output is correct
13 Correct 1328 ms 3212 KB Output is correct
14 Correct 1287 ms 3324 KB Output is correct
15 Correct 1270 ms 4300 KB Output is correct
16 Correct 1348 ms 3376 KB Output is correct
17 Correct 1314 ms 3356 KB Output is correct
18 Correct 1152 ms 5324 KB Output is correct
19 Correct 1189 ms 2268 KB Output is correct
20 Correct 1225 ms 3980 KB Output is correct
21 Correct 1286 ms 4324 KB Output is correct
22 Correct 1369 ms 4552 KB Output is correct
23 Correct 1407 ms 3468 KB Output is correct
24 Correct 1382 ms 3400 KB Output is correct
25 Correct 1463 ms 5324 KB Output is correct
26 Correct 1452 ms 3784 KB Output is correct
27 Correct 1489 ms 3776 KB Output is correct
28 Correct 1189 ms 6324 KB Output is correct
29 Correct 1153 ms 2380 KB Output is correct
30 Correct 1229 ms 4508 KB Output is correct
31 Correct 1381 ms 4488 KB Output is correct
32 Correct 1483 ms 4468 KB Output is correct
33 Correct 1408 ms 3208 KB Output is correct
34 Correct 1399 ms 3400 KB Output is correct
35 Correct 1409 ms 3808 KB Output is correct
36 Correct 1179 ms 2364 KB Output is correct
37 Correct 1212 ms 4280 KB Output is correct
38 Correct 1155 ms 2536 KB Output is correct
39 Correct 1370 ms 3644 KB Output is correct
40 Correct 1371 ms 3328 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 2 ms 212 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 103 ms 9808 KB Output is correct
12 Correct 101 ms 9860 KB Output is correct
13 Correct 106 ms 9796 KB Output is correct
14 Correct 140 ms 9836 KB Output is correct
15 Correct 102 ms 9932 KB Output is correct
16 Correct 144 ms 9976 KB Output is correct
17 Correct 128 ms 9808 KB Output is correct
18 Correct 90 ms 9964 KB Output is correct
19 Correct 91 ms 9676 KB Output is correct
20 Correct 97 ms 9848 KB Output is correct
21 Correct 123 ms 9948 KB Output is correct
22 Correct 135 ms 9832 KB Output is correct
23 Correct 99 ms 9812 KB Output is correct
24 Correct 123 ms 9848 KB Output is correct
25 Correct 125 ms 9840 KB Output is correct
26 Correct 91 ms 9752 KB Output is correct
27 Correct 95 ms 9904 KB Output is correct
28 Correct 90 ms 9676 KB Output is correct
29 Correct 109 ms 9848 KB Output is correct
30 Correct 136 ms 9924 KB Output is correct
31 Correct 100 ms 9804 KB Output is correct
32 Correct 130 ms 9856 KB Output is correct
33 Correct 119 ms 9812 KB Output is correct
34 Correct 89 ms 9704 KB Output is correct
35 Correct 122 ms 9964 KB Output is correct
36 Correct 114 ms 9868 KB Output is correct
37 Correct 122 ms 9864 KB Output is correct
38 Correct 118 ms 9868 KB Output is correct
39 Correct 113 ms 9804 KB Output is correct
40 Correct 109 ms 9844 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 2 ms 212 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 1187 ms 4392 KB Output is correct
12 Correct 1269 ms 3944 KB Output is correct
13 Correct 1328 ms 3212 KB Output is correct
14 Correct 1287 ms 3324 KB Output is correct
15 Correct 1270 ms 4300 KB Output is correct
16 Correct 1348 ms 3376 KB Output is correct
17 Correct 1314 ms 3356 KB Output is correct
18 Correct 1152 ms 5324 KB Output is correct
19 Correct 1189 ms 2268 KB Output is correct
20 Correct 1225 ms 3980 KB Output is correct
21 Correct 1286 ms 4324 KB Output is correct
22 Correct 1369 ms 4552 KB Output is correct
23 Correct 1407 ms 3468 KB Output is correct
24 Correct 1382 ms 3400 KB Output is correct
25 Correct 1463 ms 5324 KB Output is correct
26 Correct 1452 ms 3784 KB Output is correct
27 Correct 1489 ms 3776 KB Output is correct
28 Correct 1189 ms 6324 KB Output is correct
29 Correct 1153 ms 2380 KB Output is correct
30 Correct 1229 ms 4508 KB Output is correct
31 Correct 1381 ms 4488 KB Output is correct
32 Correct 1483 ms 4468 KB Output is correct
33 Correct 1408 ms 3208 KB Output is correct
34 Correct 1399 ms 3400 KB Output is correct
35 Correct 1409 ms 3808 KB Output is correct
36 Correct 1179 ms 2364 KB Output is correct
37 Correct 1212 ms 4280 KB Output is correct
38 Correct 1155 ms 2536 KB Output is correct
39 Correct 1370 ms 3644 KB Output is correct
40 Correct 1371 ms 3328 KB Output is correct
41 Correct 103 ms 9808 KB Output is correct
42 Correct 101 ms 9860 KB Output is correct
43 Correct 106 ms 9796 KB Output is correct
44 Correct 140 ms 9836 KB Output is correct
45 Correct 102 ms 9932 KB Output is correct
46 Correct 144 ms 9976 KB Output is correct
47 Correct 128 ms 9808 KB Output is correct
48 Correct 90 ms 9964 KB Output is correct
49 Correct 91 ms 9676 KB Output is correct
50 Correct 97 ms 9848 KB Output is correct
51 Correct 123 ms 9948 KB Output is correct
52 Correct 135 ms 9832 KB Output is correct
53 Correct 99 ms 9812 KB Output is correct
54 Correct 123 ms 9848 KB Output is correct
55 Correct 125 ms 9840 KB Output is correct
56 Correct 91 ms 9752 KB Output is correct
57 Correct 95 ms 9904 KB Output is correct
58 Correct 90 ms 9676 KB Output is correct
59 Correct 109 ms 9848 KB Output is correct
60 Correct 136 ms 9924 KB Output is correct
61 Correct 100 ms 9804 KB Output is correct
62 Correct 130 ms 9856 KB Output is correct
63 Correct 119 ms 9812 KB Output is correct
64 Correct 89 ms 9704 KB Output is correct
65 Correct 122 ms 9964 KB Output is correct
66 Correct 114 ms 9868 KB Output is correct
67 Correct 122 ms 9864 KB Output is correct
68 Correct 118 ms 9868 KB Output is correct
69 Correct 113 ms 9804 KB Output is correct
70 Correct 109 ms 9844 KB Output is correct
71 Correct 1407 ms 14676 KB Output is correct
72 Correct 1416 ms 14728 KB Output is correct
73 Correct 1608 ms 13252 KB Output is correct
74 Execution timed out 2065 ms 13312 KB Time limit exceeded
75 Halted 0 ms 0 KB -