oj.uz

답안 #792454

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
792454 2023-07-25T05:08:30 Z Cookie Snake Escaping (JOI18_snake_escaping) C++14
22 / 100
 2000 ms 9720 KB 
#include<bits/stdc++.h>
#include<fstream>
#pragma GCC optimize("Ofast,O3,unroll-loops")
#pragma GCC target("avx2")
using namespace std;
//ifstream fin("FEEDING.INP");
//ofstream fout("FEEDING.OUT");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const ll mxn = 3e5 + 5, base = 972663749;
const ll mod = 911382323, mxv = 1e9 + 1, inf = 2e9;
int l, q;
int big[(1 << 20)], small[(1 << 20)];
string s;
signed main()
{
     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); 
    cin >> l >> q;
    cin >> s;
    for(int i = 0; i < (1 << l); i++){
        
        big[i] = (s[i] - '0'); small[i] = (s[i] - '0');
    }
    for(int i = 0; i < l; i++){
        for(int j = 0; j < (1 << l); j++){
            if(j & (1 << i))small[j] += small[j ^ (1 << i)];
            else big[j] += big[j ^ (1 << i)];
        }
    }
    
    char c;
    while(q--){
       
       
        int zero = 0, one = 0, que = 0;
        for(int i = 0; i < l; i++){
            cin >> c;
            if(c == '0')zero += (1 << (l - i - 1));
            else if(c == '1')one += (1 << (l - i - 1));
            else que += (1 << (l - i - 1));
        }
        int ans = 0;
        if(__builtin_popcount(que) <= 6){
            int mask = one;
            for(int j = que;; j = (j - 1) & que){
                //cout << (mask | j) << " ";
                ans += (s[mask | j] - '0');
                if(j == 0)break;
            }
        }else if(__builtin_popcount(one) <= 6){
            int mask = que;
            for(int j = one;; j = (j - 1) & one){
                if((__builtin_popcount(one) - __builtin_popcount(j)) & 1)ans -= small[mask | j];
                else ans += small[mask | j];
                if(j == 0)break;
            }
        }else{
            int mask = one;
            for(int j = zero;; j = (j - 1) & zero){
                if(__builtin_popcount(j) & 1)ans -= big[mask | j];
                else ans += big[mask | j];
            }
        }
        cout << ans << "\n";
    }
    return(0);
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 226 ms 4272 KB Output is correct
12 Correct 276 ms 3884 KB Output is correct
13 Correct 249 ms 3220 KB Output is correct
14 Correct 256 ms 3252 KB Output is correct
15 Correct 270 ms 4320 KB Output is correct
16 Correct 292 ms 3416 KB Output is correct
17 Correct 264 ms 3396 KB Output is correct
18 Correct 169 ms 5324 KB Output is correct
19 Correct 236 ms 2312 KB Output is correct
20 Correct 252 ms 3964 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 226 ms 4272 KB Output is correct
12 Correct 276 ms 3884 KB Output is correct
13 Correct 249 ms 3220 KB Output is correct
14 Correct 256 ms 3252 KB Output is correct
15 Correct 270 ms 4320 KB Output is correct
16 Correct 292 ms 3416 KB Output is correct
17 Correct 264 ms 3396 KB Output is correct
18 Correct 169 ms 5324 KB Output is correct
19 Correct 236 ms 2312 KB Output is correct
20 Correct 252 ms 3964 KB Output is correct
21 Correct 343 ms 4392 KB Output is correct
22 Correct 298 ms 4556 KB Output is correct
23 Correct 333 ms 3552 KB Output is correct
24 Correct 310 ms 3368 KB Output is correct
25 Correct 266 ms 5428 KB Output is correct
26 Correct 391 ms 3864 KB Output is correct
27 Correct 393 ms 3856 KB Output is correct
28 Correct 180 ms 6524 KB Output is correct
29 Correct 267 ms 2508 KB Output is correct
30 Correct 324 ms 4656 KB Output is correct
31 Correct 350 ms 4504 KB Output is correct
32 Correct 328 ms 4468 KB Output is correct
33 Correct 292 ms 3328 KB Output is correct
34 Correct 344 ms 3436 KB Output is correct
35 Correct 361 ms 3952 KB Output is correct
36 Correct 198 ms 2416 KB Output is correct
37 Correct 314 ms 4456 KB Output is correct
38 Correct 284 ms 2440 KB Output is correct
39 Correct 302 ms 3672 KB Output is correct
40 Correct 301 ms 3488 KB Output is correct

Subtask #4
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Execution timed out 2050 ms 9720 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 226 ms 4272 KB Output is correct
12 Correct 276 ms 3884 KB Output is correct
13 Correct 249 ms 3220 KB Output is correct
14 Correct 256 ms 3252 KB Output is correct
15 Correct 270 ms 4320 KB Output is correct
16 Correct 292 ms 3416 KB Output is correct
17 Correct 264 ms 3396 KB Output is correct
18 Correct 169 ms 5324 KB Output is correct
19 Correct 236 ms 2312 KB Output is correct
20 Correct 252 ms 3964 KB Output is correct
21 Correct 343 ms 4392 KB Output is correct
22 Correct 298 ms 4556 KB Output is correct
23 Correct 333 ms 3552 KB Output is correct
24 Correct 310 ms 3368 KB Output is correct
25 Correct 266 ms 5428 KB Output is correct
26 Correct 391 ms 3864 KB Output is correct
27 Correct 393 ms 3856 KB Output is correct
28 Correct 180 ms 6524 KB Output is correct
29 Correct 267 ms 2508 KB Output is correct
30 Correct 324 ms 4656 KB Output is correct
31 Correct 350 ms 4504 KB Output is correct
32 Correct 328 ms 4468 KB Output is correct
33 Correct 292 ms 3328 KB Output is correct
34 Correct 344 ms 3436 KB Output is correct
35 Correct 361 ms 3952 KB Output is correct
36 Correct 198 ms 2416 KB Output is correct
37 Correct 314 ms 4456 KB Output is correct
38 Correct 284 ms 2440 KB Output is correct
39 Correct 302 ms 3672 KB Output is correct
40 Correct 301 ms 3488 KB Output is correct
41 Execution timed out 2050 ms 9720 KB Time limit exceeded
42 Halted 0 ms 0 KB -