oj.uz

Submission #213504

# Submission time Handle Problem Language Result Execution time Memory
213504 2020-03-26T03:07:08 Z AQT Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 37368 KB 
#include <bits/stdc++.h>

using namespace std;

int N, L, Q;
short arr[1<<20];
int pre[2][1<<20];
short cnt[3];
int msk;
vector<int> lst;
vector<short> v;

void rec(int n){
	if(n == -1){
		lst.emplace_back(msk);
		return;
	}
	msk <<= 1;	
	if(v[n] == 2){
		rec(n-1);
		msk |= 1;
		rec(n-1);
	}
	else{
		msk |= v[n];
		rec(n-1);
	}
	msk >>= 1;
}

int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> L >> Q;
	N = 1<<L;
	for(int m = 0; m<N; m++){
		char c;
		cin >> c;
		arr[m] = c-'0';
		pre[0][m] = arr[m];
	}
	for(int m = 0; m<N; m++){
		pre[1][m] = arr[m^(N-1)];
	}
	for(int d = 0; d<L; d++){
		for(int m = N-1; m>=0; m--){
			if((1<<d)&m){
				pre[0][m] += pre[0][m^(1<<d)];
				pre[1][m] += pre[1][m^(1<<d)];
			}			
		}
	}
	while(Q--){
		cnt[0] = cnt[1] = cnt[2] = 0;
		for(int k = 0; k<L; k++){
			char c;
			cin >> c;
			if(c == '?'){
				v.emplace_back(2);
			}
			else{
				v.emplace_back(c-'0');
			}
			cnt[v.back()]++;
		}
		reverse(v.begin(), v.end());
		int ret = 0;
		if(min({cnt[0], cnt[1], cnt[2]}) == cnt[2]){
			rec(L-1);
			for(int m : lst){
				ret += arr[m];
			}
		}
		else if(min({cnt[0], cnt[1], cnt[2]}) == cnt[1]){
			for(int k = 0; k<L; k++){
				if(v[k] == 2){
					v[k] = 1;
				}
				else if(v[k] == 1){
					v[k] = 2;
				}
				else{
					v[k] = 0;
				}
			}			
			rec(L-1);
			for(int m : lst){
				short c = ((__builtin_popcount(m)&1)<<1)-1;
				ret += pre[0][m]*c;
			}
		}
		else{
			for(int k = 0; k<L; k++){
				if(v[k] == 2){
					v[k] = 1;
				}
				else if(v[k] == 1){
					v[k] = 0;
				}
				else{
					v[k] = 2;
				}
			}
			rec(L-1);			
			for(int m : lst){
				short c = ((__builtin_popcount(m)&1)<<1)-1;
				ret += pre[1][m]*c;
			}
		}
		cout << abs(ret) << "\n";
		lst.clear();
		v.clear();
	}
}

/*
#include <bits/stdc++.h>

using namespace std;

int N, L, Q, T;
int arr[1<<20];
int dp[60000];
vector<char> ternary[60000];
int pows[20];
int pre[1000005];
vector<char> qu[1000005];
int ans[1000005];

int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> L >> Q;
	N = 1<<L;
	for(int m = 0; m<N; m++){
		char c;
		cin >> c;
		arr[m] = c-'0';
	}
	int H = L/2;
	T = 1;
	pows[0] = 1;
	for(int k = 0; k<H; k++){
		T *= 3;
		pows[k+1] = pows[k] * 3;
	}
	for(int m = 0; m<T; m++){
		int temp = m;
		for(int k = 0; k<H; k++){
			ternary[m].emplace_back(temp%3);
			temp /= 3;
		}
	}
	for(int q = 1; q<=Q; q++){
		int t = 0;
		for(int i = 0; i<L; i++){
			char c;
			cin >> c;
			if(c == '?'){
				qu[q].emplace_back(2);
			}
			else{
				qu[q].emplace_back(c-'0');
			}
		}
		for(int k = 0; k<H; k++){
			t *= 3;
			t += qu[q][k];
		}
		reverse(qu[q].begin(), qu[q].end());
		pre[q] = t;
	}
	for(int m = 0; m<1<<(L-H); m++){
		fill(dp, dp+T, 0);
		for(int t = 0; t<T; t++){
			bool has2 = 0;
			int temp = 0;
			for(int h = 0; h<H; h++){
				if(ternary[t][h] == 2){
					has2 = 1;
					dp[t] = dp[t-pows[h]] + dp[t-pows[h]*2];
					break;
				}
				temp += (1<<h)*ternary[t][h];
			}
			if(!has2){
				dp[t] = arr[(temp<<(L-H)) + m];
			}
		}
		for(int q = 1; q<=Q; q++){
			bool good = 1;
			for(int b = 0; b<L-H; b++){
				if(qu[q][b] == 2 || qu[q][b] == ((m>>b)&1)){
					
				}
				else{
					good = 0;
					break;
				}
			}
			if(good){
				ans[q] += dp[pre[q]];
			}
		}
	}
	for(int q = 1; q<=Q; q++){
		cout << ans[q] << "\n";
	}
}
*/

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 484 ms 4856 KB Output is correct
12 Correct 500 ms 4472 KB Output is correct
13 Correct 536 ms 3704 KB Output is correct
14 Correct 630 ms 3960 KB Output is correct
15 Correct 559 ms 5880 KB Output is correct
16 Correct 632 ms 4984 KB Output is correct
17 Correct 590 ms 4984 KB Output is correct
18 Correct 388 ms 6776 KB Output is correct
19 Correct 398 ms 3832 KB Output is correct
20 Correct 496 ms 5496 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 484 ms 4856 KB Output is correct
12 Correct 500 ms 4472 KB Output is correct
13 Correct 536 ms 3704 KB Output is correct
14 Correct 630 ms 3960 KB Output is correct
15 Correct 559 ms 5880 KB Output is correct
16 Correct 632 ms 4984 KB Output is correct
17 Correct 590 ms 4984 KB Output is correct
18 Correct 388 ms 6776 KB Output is correct
19 Correct 398 ms 3832 KB Output is correct
20 Correct 496 ms 5496 KB Output is correct
21 Correct 606 ms 5756 KB Output is correct
22 Correct 623 ms 6008 KB Output is correct
23 Correct 774 ms 5112 KB Output is correct
24 Correct 1006 ms 4856 KB Output is correct
25 Correct 705 ms 6904 KB Output is correct
26 Correct 951 ms 5368 KB Output is correct
27 Correct 846 ms 5240 KB Output is correct
28 Correct 469 ms 7928 KB Output is correct
29 Correct 501 ms 3960 KB Output is correct
30 Correct 618 ms 6008 KB Output is correct
31 Correct 837 ms 5880 KB Output is correct
32 Correct 1139 ms 5880 KB Output is correct
33 Correct 652 ms 4856 KB Output is correct
34 Correct 928 ms 4860 KB Output is correct
35 Correct 856 ms 5368 KB Output is correct
36 Correct 497 ms 3832 KB Output is correct
37 Correct 606 ms 5880 KB Output is correct
38 Correct 506 ms 3832 KB Output is correct
39 Correct 773 ms 5112 KB Output is correct
40 Correct 1004 ms 4856 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 102 ms 10872 KB Output is correct
12 Correct 102 ms 10872 KB Output is correct
13 Correct 138 ms 10744 KB Output is correct
14 Correct 227 ms 10872 KB Output is correct
15 Correct 114 ms 10872 KB Output is correct
16 Correct 223 ms 10872 KB Output is correct
17 Correct 175 ms 10872 KB Output is correct
18 Correct 88 ms 11000 KB Output is correct
19 Correct 92 ms 10744 KB Output is correct
20 Correct 104 ms 10872 KB Output is correct
21 Correct 148 ms 10872 KB Output is correct
22 Correct 224 ms 10872 KB Output is correct
23 Correct 111 ms 10744 KB Output is correct
24 Correct 195 ms 10872 KB Output is correct
25 Correct 177 ms 10876 KB Output is correct
26 Correct 92 ms 10744 KB Output is correct
27 Correct 108 ms 10872 KB Output is correct
28 Correct 95 ms 10744 KB Output is correct
29 Correct 138 ms 10872 KB Output is correct
30 Correct 209 ms 10872 KB Output is correct
31 Correct 111 ms 10744 KB Output is correct
32 Correct 207 ms 10876 KB Output is correct
33 Correct 181 ms 10872 KB Output is correct
34 Correct 92 ms 10744 KB Output is correct
35 Correct 146 ms 10876 KB Output is correct
36 Correct 158 ms 10872 KB Output is correct
37 Correct 150 ms 10872 KB Output is correct
38 Correct 154 ms 10872 KB Output is correct
39 Correct 154 ms 10872 KB Output is correct
40 Correct 148 ms 10876 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 484 ms 4856 KB Output is correct
12 Correct 500 ms 4472 KB Output is correct
13 Correct 536 ms 3704 KB Output is correct
14 Correct 630 ms 3960 KB Output is correct
15 Correct 559 ms 5880 KB Output is correct
16 Correct 632 ms 4984 KB Output is correct
17 Correct 590 ms 4984 KB Output is correct
18 Correct 388 ms 6776 KB Output is correct
19 Correct 398 ms 3832 KB Output is correct
20 Correct 496 ms 5496 KB Output is correct
21 Correct 606 ms 5756 KB Output is correct
22 Correct 623 ms 6008 KB Output is correct
23 Correct 774 ms 5112 KB Output is correct
24 Correct 1006 ms 4856 KB Output is correct
25 Correct 705 ms 6904 KB Output is correct
26 Correct 951 ms 5368 KB Output is correct
27 Correct 846 ms 5240 KB Output is correct
28 Correct 469 ms 7928 KB Output is correct
29 Correct 501 ms 3960 KB Output is correct
30 Correct 618 ms 6008 KB Output is correct
31 Correct 837 ms 5880 KB Output is correct
32 Correct 1139 ms 5880 KB Output is correct
33 Correct 652 ms 4856 KB Output is correct
34 Correct 928 ms 4860 KB Output is correct
35 Correct 856 ms 5368 KB Output is correct
36 Correct 497 ms 3832 KB Output is correct
37 Correct 606 ms 5880 KB Output is correct
38 Correct 506 ms 3832 KB Output is correct
39 Correct 773 ms 5112 KB Output is correct
40 Correct 1004 ms 4856 KB Output is correct
41 Correct 102 ms 10872 KB Output is correct
42 Correct 102 ms 10872 KB Output is correct
43 Correct 138 ms 10744 KB Output is correct
44 Correct 227 ms 10872 KB Output is correct
45 Correct 114 ms 10872 KB Output is correct
46 Correct 223 ms 10872 KB Output is correct
47 Correct 175 ms 10872 KB Output is correct
48 Correct 88 ms 11000 KB Output is correct
49 Correct 92 ms 10744 KB Output is correct
50 Correct 104 ms 10872 KB Output is correct
51 Correct 148 ms 10872 KB Output is correct
52 Correct 224 ms 10872 KB Output is correct
53 Correct 111 ms 10744 KB Output is correct
54 Correct 195 ms 10872 KB Output is correct
55 Correct 177 ms 10876 KB Output is correct
56 Correct 92 ms 10744 KB Output is correct
57 Correct 108 ms 10872 KB Output is correct
58 Correct 95 ms 10744 KB Output is correct
59 Correct 138 ms 10872 KB Output is correct
60 Correct 209 ms 10872 KB Output is correct
61 Correct 111 ms 10744 KB Output is correct
62 Correct 207 ms 10876 KB Output is correct
63 Correct 181 ms 10872 KB Output is correct
64 Correct 92 ms 10744 KB Output is correct
65 Correct 146 ms 10876 KB Output is correct
66 Correct 158 ms 10872 KB Output is correct
67 Correct 150 ms 10872 KB Output is correct
68 Correct 154 ms 10872 KB Output is correct
69 Correct 154 ms 10872 KB Output is correct
70 Correct 148 ms 10876 KB Output is correct
71 Correct 998 ms 37240 KB Output is correct
72 Correct 986 ms 37368 KB Output is correct
73 Correct 1659 ms 35832 KB Output is correct
74 Execution timed out 2099 ms 26744 KB Time limit exceeded
75 Halted 0 ms 0 KB -