oj.uz

답안 #333114

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
333114 2020-12-04T16:36:54 Z soroush Snake Escaping (JOI18_snake_escaping) C++14
22 / 100
 421 ms 26348 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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 232 ms 5100 KB Output is correct
12 Correct 245 ms 4872 KB Output is correct
13 Correct 242 ms 3840 KB Output is correct
14 Correct 246 ms 3948 KB Output is correct
15 Correct 256 ms 4872 KB Output is correct
16 Correct 261 ms 4204 KB Output is correct
17 Correct 277 ms 4076 KB Output is correct
18 Correct 188 ms 5868 KB Output is correct
19 Correct 227 ms 2924 KB Output is correct
20 Correct 252 ms 4616 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 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 232 ms 5100 KB Output is correct
12 Correct 245 ms 4872 KB Output is correct
13 Correct 242 ms 3840 KB Output is correct
14 Correct 246 ms 3948 KB Output is correct
15 Correct 256 ms 4872 KB Output is correct
16 Correct 261 ms 4204 KB Output is correct
17 Correct 277 ms 4076 KB Output is correct
18 Correct 188 ms 5868 KB Output is correct
19 Correct 227 ms 2924 KB Output is correct
20 Correct 252 ms 4616 KB Output is correct
21 Correct 297 ms 24576 KB Output is correct
22 Correct 310 ms 24556 KB Output is correct
23 Correct 375 ms 23528 KB Output is correct
24 Correct 366 ms 23376 KB Output is correct
25 Correct 338 ms 25372 KB Output is correct
26 Correct 406 ms 23916 KB Output is correct
27 Correct 413 ms 23916 KB Output is correct
28 Correct 234 ms 26348 KB Output is correct
29 Correct 283 ms 22396 KB Output is correct
30 Correct 310 ms 24684 KB Output is correct
31 Correct 383 ms 24428 KB Output is correct
32 Correct 371 ms 24428 KB Output is correct
33 Correct 300 ms 23404 KB Output is correct
34 Correct 379 ms 23404 KB Output is correct
35 Correct 421 ms 23908 KB Output is correct
36 Correct 218 ms 22380 KB Output is correct
37 Correct 293 ms 24388 KB Output is correct
38 Correct 296 ms 22380 KB Output is correct
39 Correct 376 ms 23532 KB Output is correct
40 Correct 361 ms 23404 KB Output is correct

Subtask #4
0 / 53.0

# 결과 실행 시간 메모리 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 492 KB Execution killed with signal 6 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 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 232 ms 5100 KB Output is correct
12 Correct 245 ms 4872 KB Output is correct
13 Correct 242 ms 3840 KB Output is correct
14 Correct 246 ms 3948 KB Output is correct
15 Correct 256 ms 4872 KB Output is correct
16 Correct 261 ms 4204 KB Output is correct
17 Correct 277 ms 4076 KB Output is correct
18 Correct 188 ms 5868 KB Output is correct
19 Correct 227 ms 2924 KB Output is correct
20 Correct 252 ms 4616 KB Output is correct
21 Correct 297 ms 24576 KB Output is correct
22 Correct 310 ms 24556 KB Output is correct
23 Correct 375 ms 23528 KB Output is correct
24 Correct 366 ms 23376 KB Output is correct
25 Correct 338 ms 25372 KB Output is correct
26 Correct 406 ms 23916 KB Output is correct
27 Correct 413 ms 23916 KB Output is correct
28 Correct 234 ms 26348 KB Output is correct
29 Correct 283 ms 22396 KB Output is correct
30 Correct 310 ms 24684 KB Output is correct
31 Correct 383 ms 24428 KB Output is correct
32 Correct 371 ms 24428 KB Output is correct
33 Correct 300 ms 23404 KB Output is correct
34 Correct 379 ms 23404 KB Output is correct
35 Correct 421 ms 23908 KB Output is correct
36 Correct 218 ms 22380 KB Output is correct
37 Correct 293 ms 24388 KB Output is correct
38 Correct 296 ms 22380 KB Output is correct
39 Correct 376 ms 23532 KB Output is correct
40 Correct 361 ms 23404 KB Output is correct
41 Runtime error 2 ms 492 KB Execution killed with signal 6 (could be triggered by violating memory limits)
42 Halted 0 ms 0 KB -