oj.uz

Submission #1113344

# Submission time Handle Problem Language Result Execution time Memory
1113344 2024-11-16T12:06:51 Z emad234 Snake Escaping (JOI18_snake_escaping) C++17
22 / 100
 1067 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 << 21) + 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 2 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 1 ms 592 KB Output is correct
5 Correct 2 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 2 ms 592 KB Output is correct
9 Correct 2 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 2 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 1 ms 592 KB Output is correct
5 Correct 2 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 2 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 163 ms 4536 KB Output is correct
12 Correct 182 ms 4120 KB Output is correct
13 Correct 232 ms 9272 KB Output is correct
14 Correct 272 ms 3560 KB Output is correct
15 Correct 204 ms 4424 KB Output is correct
16 Correct 323 ms 3656 KB Output is correct
17 Correct 283 ms 3656 KB Output is correct
18 Correct 116 ms 5448 KB Output is correct
19 Correct 144 ms 2488 KB Output is correct
20 Correct 193 ms 4168 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 1 ms 592 KB Output is correct
5 Correct 2 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 2 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 163 ms 4536 KB Output is correct
12 Correct 182 ms 4120 KB Output is correct
13 Correct 232 ms 9272 KB Output is correct
14 Correct 272 ms 3560 KB Output is correct
15 Correct 204 ms 4424 KB Output is correct
16 Correct 323 ms 3656 KB Output is correct
17 Correct 283 ms 3656 KB Output is correct
18 Correct 116 ms 5448 KB Output is correct
19 Correct 144 ms 2488 KB Output is correct
20 Correct 193 ms 4168 KB Output is correct
21 Correct 194 ms 9372 KB Output is correct
22 Correct 197 ms 5960 KB Output is correct
23 Correct 434 ms 4988 KB Output is correct
24 Correct 960 ms 4856 KB Output is correct
25 Correct 266 ms 6984 KB Output is correct
26 Correct 773 ms 5452 KB Output is correct
27 Correct 587 ms 5468 KB Output is correct
28 Correct 135 ms 7752 KB Output is correct
29 Correct 167 ms 3912 KB Output is correct
30 Correct 189 ms 5960 KB Output is correct
31 Correct 489 ms 5944 KB Output is correct
32 Correct 1067 ms 5848 KB Output is correct
33 Correct 243 ms 4832 KB Output is correct
34 Correct 750 ms 4968 KB Output is correct
35 Correct 590 ms 5196 KB Output is correct
36 Correct 121 ms 3912 KB Output is correct
37 Correct 178 ms 5960 KB Output is correct
38 Correct 172 ms 3912 KB Output is correct
39 Correct 434 ms 4936 KB Output is correct
40 Correct 962 ms 4968 KB Output is correct

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 1 ms 592 KB Output is correct
5 Correct 2 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 2 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Runtime error 50 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 2 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 1 ms 592 KB Output is correct
5 Correct 2 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 2 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 163 ms 4536 KB Output is correct
12 Correct 182 ms 4120 KB Output is correct
13 Correct 232 ms 9272 KB Output is correct
14 Correct 272 ms 3560 KB Output is correct
15 Correct 204 ms 4424 KB Output is correct
16 Correct 323 ms 3656 KB Output is correct
17 Correct 283 ms 3656 KB Output is correct
18 Correct 116 ms 5448 KB Output is correct
19 Correct 144 ms 2488 KB Output is correct
20 Correct 193 ms 4168 KB Output is correct
21 Correct 194 ms 9372 KB Output is correct
22 Correct 197 ms 5960 KB Output is correct
23 Correct 434 ms 4988 KB Output is correct
24 Correct 960 ms 4856 KB Output is correct
25 Correct 266 ms 6984 KB Output is correct
26 Correct 773 ms 5452 KB Output is correct
27 Correct 587 ms 5468 KB Output is correct
28 Correct 135 ms 7752 KB Output is correct
29 Correct 167 ms 3912 KB Output is correct
30 Correct 189 ms 5960 KB Output is correct
31 Correct 489 ms 5944 KB Output is correct
32 Correct 1067 ms 5848 KB Output is correct
33 Correct 243 ms 4832 KB Output is correct
34 Correct 750 ms 4968 KB Output is correct
35 Correct 590 ms 5196 KB Output is correct
36 Correct 121 ms 3912 KB Output is correct
37 Correct 178 ms 5960 KB Output is correct
38 Correct 172 ms 3912 KB Output is correct
39 Correct 434 ms 4936 KB Output is correct
40 Correct 962 ms 4968 KB Output is correct
41 Runtime error 50 ms 65536 KB Execution killed with signal 9
42 Halted 0 ms 0 KB -