oj.uz

Submission #1113343

# Submission time Handle Problem Language Result Execution time Memory
1113343 2024-11-16T12:05:52 Z vjudge1 Snake Escaping (JOI18_snake_escaping) C++17
22 / 100
 1014 ms 65536 KB 
#include "bits/stdc++.h"
#define F first
#define S second
#define ll long long
#define pii pair<ll,int>
const int mxN = (1 << 20) + 5;
const int mod = 1e9 + 7;
using namespace std;
int sos[mxN][23][2];
signed main(){
 ios_base::sync_with_stdio(0);
 cin.tie(0);
 cout.tie(0);
  int n,q;
  cin >>n>>q;
  string s;
  cin>>s;
  for(int i = 0;i < n;i++){
    for(int mask = 0;mask < (1 << n);mask++){
      sos[mask][0][0] = s[mask] - '0';
  if(mask % 2) sos[mask][0][0] += s[mask - 1] - '0';
      sos[mask][0][1] = s[mask] - '0';
  if(mask % 2 == 0) sos[mask][0][1] += s[mask + 1] - '0';
      if(!i) continue;
      sos[mask][i][0] = sos[mask][i - 1][0];
      sos[mask][i][1] = sos[mask][i - 1][1];
      if(mask >> i & 1) sos[mask][i][0] += sos[mask - (1 << i)][i - 1][0];
      else sos[mask][i][1] += sos[mask + (1 << i)][i - 1][1];
    }
  }
  while(q--){
    string a;
    cin >>a;
    reverse(a.begin(),a.end());
    int Qcnt = 0, Ocnt = 0, Icnt = 0;
    for(auto x : a){
      if(x == '?') Qcnt++;
      else if(x == '1') Icnt++;
      else Ocnt++;
    }
    int ans = 0;
    if(min({Qcnt,Ocnt,Icnt}) == Qcnt){
      // printf("? small\n");
      for(int mask = 0;mask < (1 << Qcnt);mask++){
        int cnt = 0;
        int num = 0;
        int i = 0;
        for(auto x : a){
          if(x == '?') {
            if(mask >> cnt & 1) num += (1 << i);
              cnt++;
          }
          if(x == '1') num += (1 << i);
          i++;
        }
        ans += s[num] - '0';
      }
    }else if(min({Qcnt,Ocnt,Icnt}) == Icnt){
      // printf("1 small\n");
      for(int mask = 0; mask < (1 << Icnt);mask++){
        int cnt = 0;
        int num = 0;
        int i = 0;
        for(auto x : a){
          if(x == '1') {
            if(mask >> cnt & 1) num += (1 << i);
              cnt++;
          }
          if(x == '?') num += (1 << i);
          i++;
        }
        if(Icnt % 2 == __builtin_popcount(mask) % 2) ans += sos[num][n - 1][0];
        else ans -= sos[num][n - 1][0];
      }
    }else{
      for(int mask = 0; mask < (1 << Ocnt);mask++){
        // printf("0 small\n");
        int cnt = 0;
        int num = 0;
        int i = 0;
        for(auto x : a){
          if(x == '0') {
            if(mask >> cnt & 1) num += (1 << i);
              cnt++;
          }
          if(x == '1') num += (1 << i);
          // if(x == '?') num += (1 << i);
          i++;
        }
        if(0 == __builtin_popcount(mask) % 2) ans += sos[num][n - 1][1];
        else ans -= sos[num][n - 1][1];
      }
    }
    cout<<ans<<'\n';
  }
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 2 ms 592 KB Output is correct
4 Correct 2 ms 592 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 764 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 151 ms 4556 KB Output is correct
12 Correct 214 ms 4168 KB Output is correct
13 Correct 219 ms 9132 KB Output is correct
14 Correct 288 ms 3556 KB Output is correct
15 Correct 216 ms 4424 KB Output is correct
16 Correct 324 ms 3648 KB Output is correct
17 Correct 294 ms 3656 KB Output is correct
18 Correct 164 ms 11232 KB Output is correct
19 Correct 155 ms 2440 KB Output is correct
20 Correct 178 ms 4168 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 2 ms 592 KB Output is correct
4 Correct 2 ms 592 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 764 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 151 ms 4556 KB Output is correct
12 Correct 214 ms 4168 KB Output is correct
13 Correct 219 ms 9132 KB Output is correct
14 Correct 288 ms 3556 KB Output is correct
15 Correct 216 ms 4424 KB Output is correct
16 Correct 324 ms 3648 KB Output is correct
17 Correct 294 ms 3656 KB Output is correct
18 Correct 164 ms 11232 KB Output is correct
19 Correct 155 ms 2440 KB Output is correct
20 Correct 178 ms 4168 KB Output is correct
21 Correct 243 ms 13144 KB Output is correct
22 Correct 233 ms 5960 KB Output is correct
23 Correct 460 ms 4936 KB Output is correct
24 Correct 987 ms 4924 KB Output is correct
25 Correct 284 ms 13880 KB Output is correct
26 Correct 809 ms 5428 KB Output is correct
27 Correct 581 ms 5192 KB Output is correct
28 Correct 158 ms 14920 KB Output is correct
29 Correct 169 ms 3912 KB Output is correct
30 Correct 205 ms 13128 KB Output is correct
31 Correct 469 ms 5964 KB Output is correct
32 Correct 1014 ms 5928 KB Output is correct
33 Correct 250 ms 4680 KB Output is correct
34 Correct 764 ms 4792 KB Output is correct
35 Correct 618 ms 5256 KB Output is correct
36 Correct 122 ms 3912 KB Output is correct
37 Correct 186 ms 13128 KB Output is correct
38 Correct 180 ms 3912 KB Output is correct
39 Correct 474 ms 12104 KB Output is correct
40 Correct 955 ms 4936 KB Output is correct

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 2 ms 592 KB Output is correct
4 Correct 2 ms 592 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 764 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Runtime error 54 ms 65536 KB Execution killed with signal 9
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 2 ms 592 KB Output is correct
4 Correct 2 ms 592 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 764 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 151 ms 4556 KB Output is correct
12 Correct 214 ms 4168 KB Output is correct
13 Correct 219 ms 9132 KB Output is correct
14 Correct 288 ms 3556 KB Output is correct
15 Correct 216 ms 4424 KB Output is correct
16 Correct 324 ms 3648 KB Output is correct
17 Correct 294 ms 3656 KB Output is correct
18 Correct 164 ms 11232 KB Output is correct
19 Correct 155 ms 2440 KB Output is correct
20 Correct 178 ms 4168 KB Output is correct
21 Correct 243 ms 13144 KB Output is correct
22 Correct 233 ms 5960 KB Output is correct
23 Correct 460 ms 4936 KB Output is correct
24 Correct 987 ms 4924 KB Output is correct
25 Correct 284 ms 13880 KB Output is correct
26 Correct 809 ms 5428 KB Output is correct
27 Correct 581 ms 5192 KB Output is correct
28 Correct 158 ms 14920 KB Output is correct
29 Correct 169 ms 3912 KB Output is correct
30 Correct 205 ms 13128 KB Output is correct
31 Correct 469 ms 5964 KB Output is correct
32 Correct 1014 ms 5928 KB Output is correct
33 Correct 250 ms 4680 KB Output is correct
34 Correct 764 ms 4792 KB Output is correct
35 Correct 618 ms 5256 KB Output is correct
36 Correct 122 ms 3912 KB Output is correct
37 Correct 186 ms 13128 KB Output is correct
38 Correct 180 ms 3912 KB Output is correct
39 Correct 474 ms 12104 KB Output is correct
40 Correct 955 ms 4936 KB Output is correct
41 Runtime error 54 ms 65536 KB Execution killed with signal 9
42 Halted 0 ms 0 KB -