oj.uz

답안 #1113358

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1113358 2024-11-16T12:22:18 Z emad234 Snake Escaping (JOI18_snake_escaping) C++17
22 / 100
 1040 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 << 22) + 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 644 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 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 2 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 592 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 644 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 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 2 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 176 ms 4424 KB Output is correct
12 Correct 176 ms 4168 KB Output is correct
13 Correct 222 ms 8016 KB Output is correct
14 Correct 278 ms 3656 KB Output is correct
15 Correct 211 ms 4424 KB Output is correct
16 Correct 370 ms 3656 KB Output is correct
17 Correct 291 ms 3572 KB Output is correct
18 Correct 141 ms 7692 KB Output is correct
19 Correct 154 ms 2608 KB Output is correct
20 Correct 178 ms 4168 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 644 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 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 2 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 176 ms 4424 KB Output is correct
12 Correct 176 ms 4168 KB Output is correct
13 Correct 222 ms 8016 KB Output is correct
14 Correct 278 ms 3656 KB Output is correct
15 Correct 211 ms 4424 KB Output is correct
16 Correct 370 ms 3656 KB Output is correct
17 Correct 291 ms 3572 KB Output is correct
18 Correct 141 ms 7692 KB Output is correct
19 Correct 154 ms 2608 KB Output is correct
20 Correct 178 ms 4168 KB Output is correct
21 Correct 199 ms 12872 KB Output is correct
22 Correct 222 ms 6064 KB Output is correct
23 Correct 452 ms 5704 KB Output is correct
24 Correct 939 ms 4948 KB Output is correct
25 Correct 272 ms 13984 KB Output is correct
26 Correct 782 ms 5352 KB Output is correct
27 Correct 601 ms 12360 KB Output is correct
28 Correct 142 ms 17024 KB Output is correct
29 Correct 180 ms 10988 KB Output is correct
30 Correct 203 ms 9552 KB Output is correct
31 Correct 483 ms 13896 KB Output is correct
32 Correct 1040 ms 5924 KB Output is correct
33 Correct 256 ms 11848 KB Output is correct
34 Correct 771 ms 11988 KB Output is correct
35 Correct 570 ms 12360 KB Output is correct
36 Correct 126 ms 10956 KB Output is correct
37 Correct 191 ms 15320 KB Output is correct
38 Correct 199 ms 11180 KB Output is correct
39 Correct 471 ms 12360 KB Output is correct
40 Correct 973 ms 12064 KB Output is correct

Subtask #4
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 644 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 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 2 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Runtime error 44 ms 65536 KB Execution killed with signal 9
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 1 ms 644 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 1 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 2 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 176 ms 4424 KB Output is correct
12 Correct 176 ms 4168 KB Output is correct
13 Correct 222 ms 8016 KB Output is correct
14 Correct 278 ms 3656 KB Output is correct
15 Correct 211 ms 4424 KB Output is correct
16 Correct 370 ms 3656 KB Output is correct
17 Correct 291 ms 3572 KB Output is correct
18 Correct 141 ms 7692 KB Output is correct
19 Correct 154 ms 2608 KB Output is correct
20 Correct 178 ms 4168 KB Output is correct
21 Correct 199 ms 12872 KB Output is correct
22 Correct 222 ms 6064 KB Output is correct
23 Correct 452 ms 5704 KB Output is correct
24 Correct 939 ms 4948 KB Output is correct
25 Correct 272 ms 13984 KB Output is correct
26 Correct 782 ms 5352 KB Output is correct
27 Correct 601 ms 12360 KB Output is correct
28 Correct 142 ms 17024 KB Output is correct
29 Correct 180 ms 10988 KB Output is correct
30 Correct 203 ms 9552 KB Output is correct
31 Correct 483 ms 13896 KB Output is correct
32 Correct 1040 ms 5924 KB Output is correct
33 Correct 256 ms 11848 KB Output is correct
34 Correct 771 ms 11988 KB Output is correct
35 Correct 570 ms 12360 KB Output is correct
36 Correct 126 ms 10956 KB Output is correct
37 Correct 191 ms 15320 KB Output is correct
38 Correct 199 ms 11180 KB Output is correct
39 Correct 471 ms 12360 KB Output is correct
40 Correct 973 ms 12064 KB Output is correct
41 Runtime error 44 ms 65536 KB Execution killed with signal 9
42 Halted 0 ms 0 KB -