oj.uz

Submission #386154

# Submission time Handle Problem Language Result Execution time Memory
386154 2021-04-05T20:00:14 Z CSQ31 Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 24544 KB 
#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
typedef pair<int,pii> P;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
const int pw[22] = {1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768,65536,131072,262144,524288,1048576,2097152};
int main()
{

	owo
	int l,q;
	cin>>l>>q;
	vector<int>sub(pw[(l+1)]),sup(pw[(l+1)]);
	string snek;
	for(int i=0;i<pw[l];i++){
		char c;cin>>c;
		sub[i]+=c-'0';
		sup[i]+=c-'0';
		snek+=c;
	}
	for(int i=0;i<l;i++){
		for(int j=0;j<pw[l];j++){
			if(j&pw[i])sub[j]+=sub[j^pw[i]];
			else sup[j]+=sup[j^pw[i]];
		}
	}
	while(q--){
		vector<int>a,b,c;
		string s;cin>>s;
		int ans = 0;
		for(int i=0;i<l;i++){
			if(s[i] == '?')c.pb(l-i-1);
			else if(s[i] == '0')a.pb(l-i-1);
			else b.pb(l-i-1);
		}
		int mn = min({sz(a),sz(b),sz(c)});
		if(sz(c) == mn){
			int cur = 0;
			for(int i=0;i<l;i++)if(s[i]=='1')cur+=pw[(l-i-1)];
			for(int i=0;i<pw[sz(c)];i++){
				int ncur = cur;
				for(int j=0;j<sz(c);j++){
					if(i&pw[j])ncur+=pw[c[j]];
				}
				ans+=snek[ncur]-'0';
			}
		}
		else if(sz(a) == mn){
			int cur = 0;
			for(int i=0;i<l;i++)if(s[i] == '1')cur+=pw[(l-i-1)];
			for(int i=0;i<pw[sz(a)];i++){
				int ncur = cur;
				int cnt = 0;
				for(int j=0;j<sz(a);j++){
					if(i&pw[j]){ncur+=pw[a[j]];cnt++;}
				}
				if(cnt&1)ans-=sup[ncur];
				else ans+=sup[ncur];
			}
		}else{
			int cur = 0;
			for(int i=0;i<l;i++)if(s[i] == '?')cur+=pw[(l-i-1)];
			for(int mask=0;mask<pw[sz(b)];mask++){
				int ncur = cur;
				int cnt = 0;
				for(int j=0;j<sz(b);j++){
					if(mask&pw[j]){ncur+=pw[b[j]];}
					else cnt++;
				}
				if(cnt&1)ans-=sub[ncur];
				else ans+=sub[ncur];
			}
		}
		cout<<ans<<'\n';
	}
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 614 ms 4644 KB Output is correct
12 Correct 581 ms 4204 KB Output is correct
13 Correct 637 ms 3436 KB Output is correct
14 Correct 656 ms 3468 KB Output is correct
15 Correct 599 ms 4536 KB Output is correct
16 Correct 697 ms 3564 KB Output is correct
17 Correct 682 ms 3564 KB Output is correct
18 Correct 394 ms 5432 KB Output is correct
19 Correct 593 ms 2424 KB Output is correct
20 Correct 583 ms 4076 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 614 ms 4644 KB Output is correct
12 Correct 581 ms 4204 KB Output is correct
13 Correct 637 ms 3436 KB Output is correct
14 Correct 656 ms 3468 KB Output is correct
15 Correct 599 ms 4536 KB Output is correct
16 Correct 697 ms 3564 KB Output is correct
17 Correct 682 ms 3564 KB Output is correct
18 Correct 394 ms 5432 KB Output is correct
19 Correct 593 ms 2424 KB Output is correct
20 Correct 583 ms 4076 KB Output is correct
21 Correct 651 ms 4588 KB Output is correct
22 Correct 681 ms 4844 KB Output is correct
23 Correct 776 ms 3820 KB Output is correct
24 Correct 833 ms 3564 KB Output is correct
25 Correct 702 ms 5612 KB Output is correct
26 Correct 850 ms 4168 KB Output is correct
27 Correct 889 ms 4588 KB Output is correct
28 Correct 419 ms 7020 KB Output is correct
29 Correct 638 ms 3052 KB Output is correct
30 Correct 687 ms 5228 KB Output is correct
31 Correct 812 ms 4972 KB Output is correct
32 Correct 864 ms 5228 KB Output is correct
33 Correct 677 ms 3820 KB Output is correct
34 Correct 825 ms 3944 KB Output is correct
35 Correct 850 ms 4460 KB Output is correct
36 Correct 403 ms 2924 KB Output is correct
37 Correct 643 ms 5012 KB Output is correct
38 Correct 663 ms 2924 KB Output is correct
39 Correct 783 ms 4204 KB Output is correct
40 Correct 835 ms 3948 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 112 ms 19108 KB Output is correct
12 Correct 122 ms 19108 KB Output is correct
13 Correct 123 ms 19236 KB Output is correct
14 Correct 156 ms 19108 KB Output is correct
15 Correct 113 ms 19108 KB Output is correct
16 Correct 171 ms 19108 KB Output is correct
17 Correct 153 ms 19108 KB Output is correct
18 Correct 90 ms 19108 KB Output is correct
19 Correct 110 ms 19108 KB Output is correct
20 Correct 110 ms 19108 KB Output is correct
21 Correct 133 ms 19108 KB Output is correct
22 Correct 163 ms 19108 KB Output is correct
23 Correct 117 ms 19108 KB Output is correct
24 Correct 147 ms 19108 KB Output is correct
25 Correct 154 ms 19128 KB Output is correct
26 Correct 87 ms 19108 KB Output is correct
27 Correct 113 ms 19108 KB Output is correct
28 Correct 112 ms 19108 KB Output is correct
29 Correct 122 ms 19108 KB Output is correct
30 Correct 145 ms 19108 KB Output is correct
31 Correct 108 ms 19108 KB Output is correct
32 Correct 169 ms 19108 KB Output is correct
33 Correct 147 ms 19108 KB Output is correct
34 Correct 87 ms 19108 KB Output is correct
35 Correct 135 ms 19108 KB Output is correct
36 Correct 136 ms 19108 KB Output is correct
37 Correct 141 ms 19108 KB Output is correct
38 Correct 162 ms 19108 KB Output is correct
39 Correct 136 ms 19108 KB Output is correct
40 Correct 137 ms 19108 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 614 ms 4644 KB Output is correct
12 Correct 581 ms 4204 KB Output is correct
13 Correct 637 ms 3436 KB Output is correct
14 Correct 656 ms 3468 KB Output is correct
15 Correct 599 ms 4536 KB Output is correct
16 Correct 697 ms 3564 KB Output is correct
17 Correct 682 ms 3564 KB Output is correct
18 Correct 394 ms 5432 KB Output is correct
19 Correct 593 ms 2424 KB Output is correct
20 Correct 583 ms 4076 KB Output is correct
21 Correct 651 ms 4588 KB Output is correct
22 Correct 681 ms 4844 KB Output is correct
23 Correct 776 ms 3820 KB Output is correct
24 Correct 833 ms 3564 KB Output is correct
25 Correct 702 ms 5612 KB Output is correct
26 Correct 850 ms 4168 KB Output is correct
27 Correct 889 ms 4588 KB Output is correct
28 Correct 419 ms 7020 KB Output is correct
29 Correct 638 ms 3052 KB Output is correct
30 Correct 687 ms 5228 KB Output is correct
31 Correct 812 ms 4972 KB Output is correct
32 Correct 864 ms 5228 KB Output is correct
33 Correct 677 ms 3820 KB Output is correct
34 Correct 825 ms 3944 KB Output is correct
35 Correct 850 ms 4460 KB Output is correct
36 Correct 403 ms 2924 KB Output is correct
37 Correct 643 ms 5012 KB Output is correct
38 Correct 663 ms 2924 KB Output is correct
39 Correct 783 ms 4204 KB Output is correct
40 Correct 835 ms 3948 KB Output is correct
41 Correct 112 ms 19108 KB Output is correct
42 Correct 122 ms 19108 KB Output is correct
43 Correct 123 ms 19236 KB Output is correct
44 Correct 156 ms 19108 KB Output is correct
45 Correct 113 ms 19108 KB Output is correct
46 Correct 171 ms 19108 KB Output is correct
47 Correct 153 ms 19108 KB Output is correct
48 Correct 90 ms 19108 KB Output is correct
49 Correct 110 ms 19108 KB Output is correct
50 Correct 110 ms 19108 KB Output is correct
51 Correct 133 ms 19108 KB Output is correct
52 Correct 163 ms 19108 KB Output is correct
53 Correct 117 ms 19108 KB Output is correct
54 Correct 147 ms 19108 KB Output is correct
55 Correct 154 ms 19128 KB Output is correct
56 Correct 87 ms 19108 KB Output is correct
57 Correct 113 ms 19108 KB Output is correct
58 Correct 112 ms 19108 KB Output is correct
59 Correct 122 ms 19108 KB Output is correct
60 Correct 145 ms 19108 KB Output is correct
61 Correct 108 ms 19108 KB Output is correct
62 Correct 169 ms 19108 KB Output is correct
63 Correct 147 ms 19108 KB Output is correct
64 Correct 87 ms 19108 KB Output is correct
65 Correct 135 ms 19108 KB Output is correct
66 Correct 136 ms 19108 KB Output is correct
67 Correct 141 ms 19108 KB Output is correct
68 Correct 162 ms 19108 KB Output is correct
69 Correct 136 ms 19108 KB Output is correct
70 Correct 137 ms 19108 KB Output is correct
71 Correct 1020 ms 23372 KB Output is correct
72 Correct 1024 ms 23392 KB Output is correct
73 Correct 1285 ms 21984 KB Output is correct
74 Correct 1920 ms 22368 KB Output is correct
75 Correct 1102 ms 24544 KB Output is correct
76 Execution timed out 2021 ms 22664 KB Time limit exceeded
77 Halted 0 ms 0 KB -