oj.uz

답안 #333113

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
333113 2020-12-04T16:35:57 Z soroush Snake Escaping (JOI18_snake_escaping) C++14
12 / 100
 365 ms 65536 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  = 1e6+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];

string t[maxn];

int res[maxn];

void sub1(){
	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;
	}
}

int32_t main(){
    migmig;
    cin >> l >> q;
    if(l <= 15){
		sub1();
		return(0);
	}
	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 = 1 ; i <= q ; i ++)
		cin >> t[i] , reverse(t[i].begin() , t[i].end());
	for(int k = 0 ; k < 128 ; k ++){
		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 * 128 + k];
			}
		}
		for(int i = 1 ; i <= q ; i ++){
			bool ok = 1;
			for(int j = 0 ; j < 7 ; j ++){
				if(k&(1 << j)){if(t[i][j] == '0'){ok=0 ;break;}}
				else if(t[i][j] == '1'){ok=0 ;break;}
			}
			if(!ok)continue;
			int x = 0;
			for(int j = 7 ; j < l ; j ++)
				if(t[i][j] == '?')x+=p[i]*2;
				else if(t[i][j] == '1')x+=p[i];
			res[i] += ans[x];
		}
	}
	
	for(int i = 1;  i <= q ; i ++)
		cout << res[i] << endl;
    return(0);
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 31980 KB Output is correct
2 Correct 23 ms 31980 KB Output is correct
3 Correct 23 ms 31980 KB Output is correct
4 Correct 23 ms 31980 KB Output is correct
5 Correct 22 ms 31980 KB Output is correct
6 Correct 22 ms 31980 KB Output is correct
7 Correct 23 ms 31980 KB Output is correct
8 Correct 23 ms 31980 KB Output is correct
9 Correct 23 ms 31980 KB Output is correct
10 Correct 22 ms 31980 KB Output is correct
11 Correct 252 ms 36332 KB Output is correct
12 Correct 269 ms 35620 KB Output is correct
13 Correct 273 ms 34924 KB Output is correct
14 Correct 276 ms 35180 KB Output is correct
15 Correct 273 ms 36072 KB Output is correct
16 Correct 284 ms 35180 KB Output is correct
17 Correct 294 ms 35072 KB Output is correct
18 Correct 214 ms 37100 KB Output is correct
19 Correct 265 ms 34028 KB Output is correct
20 Correct 263 ms 35692 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 31980 KB Output is correct
2 Correct 23 ms 31980 KB Output is correct
3 Correct 23 ms 31980 KB Output is correct
4 Correct 23 ms 31980 KB Output is correct
5 Correct 22 ms 31980 KB Output is correct
6 Correct 22 ms 31980 KB Output is correct
7 Correct 23 ms 31980 KB Output is correct
8 Correct 23 ms 31980 KB Output is correct
9 Correct 23 ms 31980 KB Output is correct
10 Correct 22 ms 31980 KB Output is correct
11 Correct 252 ms 36332 KB Output is correct
12 Correct 269 ms 35620 KB Output is correct
13 Correct 273 ms 34924 KB Output is correct
14 Correct 276 ms 35180 KB Output is correct
15 Correct 273 ms 36072 KB Output is correct
16 Correct 284 ms 35180 KB Output is correct
17 Correct 294 ms 35072 KB Output is correct
18 Correct 214 ms 37100 KB Output is correct
19 Correct 265 ms 34028 KB Output is correct
20 Correct 263 ms 35692 KB Output is correct
21 Runtime error 365 ms 65536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 31980 KB Output is correct
2 Correct 23 ms 31980 KB Output is correct
3 Correct 23 ms 31980 KB Output is correct
4 Correct 23 ms 31980 KB Output is correct
5 Correct 22 ms 31980 KB Output is correct
6 Correct 22 ms 31980 KB Output is correct
7 Correct 23 ms 31980 KB Output is correct
8 Correct 23 ms 31980 KB Output is correct
9 Correct 23 ms 31980 KB Output is correct
10 Correct 22 ms 31980 KB Output is correct
11 Runtime error 62 ms 64104 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 23 ms 31980 KB Output is correct
2 Correct 23 ms 31980 KB Output is correct
3 Correct 23 ms 31980 KB Output is correct
4 Correct 23 ms 31980 KB Output is correct
5 Correct 22 ms 31980 KB Output is correct
6 Correct 22 ms 31980 KB Output is correct
7 Correct 23 ms 31980 KB Output is correct
8 Correct 23 ms 31980 KB Output is correct
9 Correct 23 ms 31980 KB Output is correct
10 Correct 22 ms 31980 KB Output is correct
11 Correct 252 ms 36332 KB Output is correct
12 Correct 269 ms 35620 KB Output is correct
13 Correct 273 ms 34924 KB Output is correct
14 Correct 276 ms 35180 KB Output is correct
15 Correct 273 ms 36072 KB Output is correct
16 Correct 284 ms 35180 KB Output is correct
17 Correct 294 ms 35072 KB Output is correct
18 Correct 214 ms 37100 KB Output is correct
19 Correct 265 ms 34028 KB Output is correct
20 Correct 263 ms 35692 KB Output is correct
21 Runtime error 365 ms 65536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -