oj.uz

Submission #332106

# Submission time Handle Problem Language Result Execution time Memory
332106 2020-12-01T13:21:11 Z soroush Snake Escaping (JOI18_snake_escaping) C++14
22 / 100
 435 ms 18740 KB 
/*
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma")
//*/
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int  ,int > pii;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll maxn  = 2e6+100;
const ll mod =1e9+7;
const ld PI = acos((ld)-1);

#define pb push_back
#define endl '\n'
#define dokme(x) cout << x , exit(0)
#define migmig ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define ms(x , y) memset(x , y , sizeof x)
ll pw(ll a, ll b, ll md = mod){ll res = 1;while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}

int l , q;
int a[maxn];
string s;

int ans[maxn];

int p[30];

int32_t main(){
    migmig;
    cin >> l >> q;
    assert( l <= 15 );
    cin >> s;
    for(int i = 0 ; i < (1 << l) ; i ++)
		a[i] = s[i] - '0';
	p[0] = 1;
	for(int i = 1 ; i < 16; i ++)
		p[i] = p[i - 1] * 3;
	for(int i = 0 ; i < p[l] ; i ++){
		int res = 0;
		int x = i;
		for(int j = l ; j >= 0 ; j --){
			if(x >= 2*p[j]){
				x = i;
				x-=2*p[j];
				ans[i] = ans[x] + ans[x + p[j]];
				break;
			}
			if(x >= p[j])
				res += (1 << j);
			x%=p[j];
			if(j == 0)ans[i] = a[res];
		}
	}
	while(q -- ){
		string t;
		cin >> t;
		reverse(t.begin() , t.end());
		int x = 0;
		for(int i = 0 ; i < l ; i ++)
			if(t[i] == '?')x+=p[i]*2;
			else if(t[i] == '1')x+=p[i];
		cout << ans[x] << endl;
	}
    return(0);
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 620 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 2 ms 620 KB Output is correct
4 Correct 2 ms 620 KB Output is correct
5 Correct 2 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 620 KB Output is correct
11 Correct 237 ms 9580 KB Output is correct
12 Correct 253 ms 9196 KB Output is correct
13 Correct 245 ms 8428 KB Output is correct
14 Correct 249 ms 8428 KB Output is correct
15 Correct 254 ms 9580 KB Output is correct
16 Correct 276 ms 8812 KB Output is correct
17 Correct 287 ms 8684 KB Output is correct
18 Correct 187 ms 10476 KB Output is correct
19 Correct 231 ms 7660 KB Output is correct
20 Correct 246 ms 9196 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 620 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 2 ms 620 KB Output is correct
4 Correct 2 ms 620 KB Output is correct
5 Correct 2 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 620 KB Output is correct
11 Correct 237 ms 9580 KB Output is correct
12 Correct 253 ms 9196 KB Output is correct
13 Correct 245 ms 8428 KB Output is correct
14 Correct 249 ms 8428 KB Output is correct
15 Correct 254 ms 9580 KB Output is correct
16 Correct 276 ms 8812 KB Output is correct
17 Correct 287 ms 8684 KB Output is correct
18 Correct 187 ms 10476 KB Output is correct
19 Correct 231 ms 7660 KB Output is correct
20 Correct 246 ms 9196 KB Output is correct
21 Correct 299 ms 16364 KB Output is correct
22 Correct 305 ms 16520 KB Output is correct
23 Correct 428 ms 15492 KB Output is correct
24 Correct 366 ms 15852 KB Output is correct
25 Correct 347 ms 17260 KB Output is correct
26 Correct 403 ms 15816 KB Output is correct
27 Correct 420 ms 16108 KB Output is correct
28 Correct 226 ms 18740 KB Output is correct
29 Correct 280 ms 14444 KB Output is correct
30 Correct 302 ms 16876 KB Output is correct
31 Correct 405 ms 16748 KB Output is correct
32 Correct 384 ms 16876 KB Output is correct
33 Correct 318 ms 15596 KB Output is correct
34 Correct 413 ms 15724 KB Output is correct
35 Correct 435 ms 16364 KB Output is correct
36 Correct 233 ms 14720 KB Output is correct
37 Correct 292 ms 17004 KB Output is correct
38 Correct 300 ms 15084 KB Output is correct
39 Correct 383 ms 16364 KB Output is correct
40 Correct 366 ms 16236 KB Output is correct

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 620 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 2 ms 620 KB Output is correct
4 Correct 2 ms 620 KB Output is correct
5 Correct 2 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 620 KB Output is correct
11 Runtime error 2 ms 620 KB Execution killed with signal 6 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 620 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 2 ms 620 KB Output is correct
4 Correct 2 ms 620 KB Output is correct
5 Correct 2 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 620 KB Output is correct
11 Correct 237 ms 9580 KB Output is correct
12 Correct 253 ms 9196 KB Output is correct
13 Correct 245 ms 8428 KB Output is correct
14 Correct 249 ms 8428 KB Output is correct
15 Correct 254 ms 9580 KB Output is correct
16 Correct 276 ms 8812 KB Output is correct
17 Correct 287 ms 8684 KB Output is correct
18 Correct 187 ms 10476 KB Output is correct
19 Correct 231 ms 7660 KB Output is correct
20 Correct 246 ms 9196 KB Output is correct
21 Correct 299 ms 16364 KB Output is correct
22 Correct 305 ms 16520 KB Output is correct
23 Correct 428 ms 15492 KB Output is correct
24 Correct 366 ms 15852 KB Output is correct
25 Correct 347 ms 17260 KB Output is correct
26 Correct 403 ms 15816 KB Output is correct
27 Correct 420 ms 16108 KB Output is correct
28 Correct 226 ms 18740 KB Output is correct
29 Correct 280 ms 14444 KB Output is correct
30 Correct 302 ms 16876 KB Output is correct
31 Correct 405 ms 16748 KB Output is correct
32 Correct 384 ms 16876 KB Output is correct
33 Correct 318 ms 15596 KB Output is correct
34 Correct 413 ms 15724 KB Output is correct
35 Correct 435 ms 16364 KB Output is correct
36 Correct 233 ms 14720 KB Output is correct
37 Correct 292 ms 17004 KB Output is correct
38 Correct 300 ms 15084 KB Output is correct
39 Correct 383 ms 16364 KB Output is correct
40 Correct 366 ms 16236 KB Output is correct
41 Runtime error 2 ms 620 KB Execution killed with signal 6 (could be triggered by violating memory limits)
42 Halted 0 ms 0 KB -