oj.uz

Submission #1113341

# Submission time Handle Problem Language Result Execution time Memory
1113341 2024-11-16T12:04:25 Z vjudge1 Snake Escaping (JOI18_snake_escaping) C++17
12 / 100
 2000 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 3 ms 592 KB Output is correct
2 Correct 3 ms 760 KB Output is correct
3 Correct 3 ms 592 KB Output is correct
4 Correct 3 ms 760 KB Output is correct
5 Correct 3 ms 592 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 3 ms 592 KB Output is correct
9 Correct 3 ms 592 KB Output is correct
10 Correct 3 ms 592 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 592 KB Output is correct
2 Correct 3 ms 760 KB Output is correct
3 Correct 3 ms 592 KB Output is correct
4 Correct 3 ms 760 KB Output is correct
5 Correct 3 ms 592 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 3 ms 592 KB Output is correct
9 Correct 3 ms 592 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Correct 1753 ms 4648 KB Output is correct
12 Correct 1779 ms 4264 KB Output is correct
13 Correct 1824 ms 3336 KB Output is correct
14 Correct 1888 ms 3516 KB Output is correct
15 Correct 1804 ms 4516 KB Output is correct
16 Correct 1923 ms 3656 KB Output is correct
17 Correct 1925 ms 3672 KB Output is correct
18 Correct 1681 ms 5600 KB Output is correct
19 Correct 1684 ms 2500 KB Output is correct
20 Correct 1696 ms 4208 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 592 KB Output is correct
2 Correct 3 ms 760 KB Output is correct
3 Correct 3 ms 592 KB Output is correct
4 Correct 3 ms 760 KB Output is correct
5 Correct 3 ms 592 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 3 ms 592 KB Output is correct
9 Correct 3 ms 592 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Correct 1753 ms 4648 KB Output is correct
12 Correct 1779 ms 4264 KB Output is correct
13 Correct 1824 ms 3336 KB Output is correct
14 Correct 1888 ms 3516 KB Output is correct
15 Correct 1804 ms 4516 KB Output is correct
16 Correct 1923 ms 3656 KB Output is correct
17 Correct 1925 ms 3672 KB Output is correct
18 Correct 1681 ms 5600 KB Output is correct
19 Correct 1684 ms 2500 KB Output is correct
20 Correct 1696 ms 4208 KB Output is correct
21 Correct 1784 ms 5928 KB Output is correct
22 Correct 1888 ms 5924 KB Output is correct
23 Execution timed out 2069 ms 5744 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 592 KB Output is correct
2 Correct 3 ms 760 KB Output is correct
3 Correct 3 ms 592 KB Output is correct
4 Correct 3 ms 760 KB Output is correct
5 Correct 3 ms 592 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 3 ms 592 KB Output is correct
9 Correct 3 ms 592 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Runtime error 62 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 3 ms 592 KB Output is correct
2 Correct 3 ms 760 KB Output is correct
3 Correct 3 ms 592 KB Output is correct
4 Correct 3 ms 760 KB Output is correct
5 Correct 3 ms 592 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 3 ms 592 KB Output is correct
9 Correct 3 ms 592 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Correct 1753 ms 4648 KB Output is correct
12 Correct 1779 ms 4264 KB Output is correct
13 Correct 1824 ms 3336 KB Output is correct
14 Correct 1888 ms 3516 KB Output is correct
15 Correct 1804 ms 4516 KB Output is correct
16 Correct 1923 ms 3656 KB Output is correct
17 Correct 1925 ms 3672 KB Output is correct
18 Correct 1681 ms 5600 KB Output is correct
19 Correct 1684 ms 2500 KB Output is correct
20 Correct 1696 ms 4208 KB Output is correct
21 Correct 1784 ms 5928 KB Output is correct
22 Correct 1888 ms 5924 KB Output is correct
23 Execution timed out 2069 ms 5744 KB Time limit exceeded
24 Halted 0 ms 0 KB -