oj.uz

Submission #386144

# Submission time Handle Problem Language Result Execution time Memory
386144 2021-04-05T19:27:28 Z CSQ31 Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 23412 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);}
int main()
{
	//O(l * 2^l + q)
	owo
	int l,q;
	cin>>l>>q;
	vector<int>sub(1<<(l+1)),sup(1<<(l+1));
	string snek;
	for(int i=0;i<(1<<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<(1<<l);j++){
			if(j&(1<<i))sub[j]+=sub[j^(1<<i)];
			else sup[j]+=sup[j^(1<<i)];
		}
	}
	while(q--){
		vector<int>a,b,c;
		string s;cin>>s;
		ll ans = 0;
		for(int i=0;i<l;i++){
			if(s[i] == '?')c.pb(l-i-1);
			if(s[i] == '0')a.pb(l-i-1);
			if(s[i] == '1')b.pb(l-i-1);
		}
		int mn = min({sz(a),sz(b),sz(c)});
		if(sz(c) == mn){
			ll cur = 0;
			for(int i=0;i<l;i++)if(s[i]=='1')cur+=(1<<(l-i-1));
			for(int i=0;i<(1<<sz(c));i++){
				ll ncur = cur;
				for(int j=0;j<sz(c);j++){
					if(i&(1<<j))ncur+=(1<<c[j]);
				}
				ans+=snek[ncur]-'0';
			}
		}
		else if(sz(a) == mn){
			ll cur = 0;
			for(int i=0;i<l;i++)if(s[i] == '1')cur+=(1<<(l-i-1));
			for(int i=0;i<(1<<sz(a));i++){
				ll ncur = cur;
				int cnt = 0;
				for(int j=0;j<sz(a);j++){
					if(i&(1<<j)){ncur+=(1<<a[j]);cnt++;}
				}
				if(cnt&1)ans-=sup[ncur];
				else ans+=sup[ncur];
			}
		}else{
			ll cur = 0;
			for(int i=0;i<l;i++)if(s[i] == '?')cur+=(1<<(l-i-1));
			for(int mask=0;mask<(1<<sz(b));mask++){
				ll ncur = cur;
				int cnt = 0;
				for(int j=0;j<sz(b);j++){
					if(mask&(1<<j)){ncur+=(1<<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 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 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 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 649 ms 4460 KB Output is correct
12 Correct 599 ms 4204 KB Output is correct
13 Correct 653 ms 3468 KB Output is correct
14 Correct 671 ms 3436 KB Output is correct
15 Correct 616 ms 4460 KB Output is correct
16 Correct 736 ms 3728 KB Output is correct
17 Correct 740 ms 3692 KB Output is correct
18 Correct 402 ms 5484 KB Output is correct
19 Correct 611 ms 2524 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 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 649 ms 4460 KB Output is correct
12 Correct 599 ms 4204 KB Output is correct
13 Correct 653 ms 3468 KB Output is correct
14 Correct 671 ms 3436 KB Output is correct
15 Correct 616 ms 4460 KB Output is correct
16 Correct 736 ms 3728 KB Output is correct
17 Correct 740 ms 3692 KB Output is correct
18 Correct 402 ms 5484 KB Output is correct
19 Correct 611 ms 2524 KB Output is correct
20 Correct 583 ms 4076 KB Output is correct
21 Correct 663 ms 4588 KB Output is correct
22 Correct 714 ms 4716 KB Output is correct
23 Correct 811 ms 3948 KB Output is correct
24 Correct 847 ms 3632 KB Output is correct
25 Correct 726 ms 5564 KB Output is correct
26 Correct 875 ms 4076 KB Output is correct
27 Correct 902 ms 4076 KB Output is correct
28 Correct 424 ms 6508 KB Output is correct
29 Correct 685 ms 2628 KB Output is correct
30 Correct 706 ms 4716 KB Output is correct
31 Correct 868 ms 4616 KB Output is correct
32 Correct 885 ms 4784 KB Output is correct
33 Correct 721 ms 3416 KB Output is correct
34 Correct 841 ms 3692 KB Output is correct
35 Correct 924 ms 4076 KB Output is correct
36 Correct 407 ms 2688 KB Output is correct
37 Correct 663 ms 4588 KB Output is correct
38 Correct 687 ms 2740 KB Output is correct
39 Correct 838 ms 4076 KB Output is correct
40 Correct 883 ms 3564 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 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 113 ms 18852 KB Output is correct
12 Correct 108 ms 18928 KB Output is correct
13 Correct 126 ms 18852 KB Output is correct
14 Correct 150 ms 18852 KB Output is correct
15 Correct 111 ms 18852 KB Output is correct
16 Correct 168 ms 18852 KB Output is correct
17 Correct 154 ms 18852 KB Output is correct
18 Correct 85 ms 18852 KB Output is correct
19 Correct 112 ms 18852 KB Output is correct
20 Correct 110 ms 18852 KB Output is correct
21 Correct 133 ms 18980 KB Output is correct
22 Correct 158 ms 18852 KB Output is correct
23 Correct 111 ms 18888 KB Output is correct
24 Correct 163 ms 18852 KB Output is correct
25 Correct 147 ms 18852 KB Output is correct
26 Correct 84 ms 18852 KB Output is correct
27 Correct 107 ms 18852 KB Output is correct
28 Correct 110 ms 18852 KB Output is correct
29 Correct 129 ms 18852 KB Output is correct
30 Correct 143 ms 18852 KB Output is correct
31 Correct 106 ms 18852 KB Output is correct
32 Correct 176 ms 18852 KB Output is correct
33 Correct 155 ms 18852 KB Output is correct
34 Correct 84 ms 18852 KB Output is correct
35 Correct 138 ms 18852 KB Output is correct
36 Correct 158 ms 18980 KB Output is correct
37 Correct 137 ms 19000 KB Output is correct
38 Correct 138 ms 18852 KB Output is correct
39 Correct 162 ms 18852 KB Output is correct
40 Correct 146 ms 18852 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 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 649 ms 4460 KB Output is correct
12 Correct 599 ms 4204 KB Output is correct
13 Correct 653 ms 3468 KB Output is correct
14 Correct 671 ms 3436 KB Output is correct
15 Correct 616 ms 4460 KB Output is correct
16 Correct 736 ms 3728 KB Output is correct
17 Correct 740 ms 3692 KB Output is correct
18 Correct 402 ms 5484 KB Output is correct
19 Correct 611 ms 2524 KB Output is correct
20 Correct 583 ms 4076 KB Output is correct
21 Correct 663 ms 4588 KB Output is correct
22 Correct 714 ms 4716 KB Output is correct
23 Correct 811 ms 3948 KB Output is correct
24 Correct 847 ms 3632 KB Output is correct
25 Correct 726 ms 5564 KB Output is correct
26 Correct 875 ms 4076 KB Output is correct
27 Correct 902 ms 4076 KB Output is correct
28 Correct 424 ms 6508 KB Output is correct
29 Correct 685 ms 2628 KB Output is correct
30 Correct 706 ms 4716 KB Output is correct
31 Correct 868 ms 4616 KB Output is correct
32 Correct 885 ms 4784 KB Output is correct
33 Correct 721 ms 3416 KB Output is correct
34 Correct 841 ms 3692 KB Output is correct
35 Correct 924 ms 4076 KB Output is correct
36 Correct 407 ms 2688 KB Output is correct
37 Correct 663 ms 4588 KB Output is correct
38 Correct 687 ms 2740 KB Output is correct
39 Correct 838 ms 4076 KB Output is correct
40 Correct 883 ms 3564 KB Output is correct
41 Correct 113 ms 18852 KB Output is correct
42 Correct 108 ms 18928 KB Output is correct
43 Correct 126 ms 18852 KB Output is correct
44 Correct 150 ms 18852 KB Output is correct
45 Correct 111 ms 18852 KB Output is correct
46 Correct 168 ms 18852 KB Output is correct
47 Correct 154 ms 18852 KB Output is correct
48 Correct 85 ms 18852 KB Output is correct
49 Correct 112 ms 18852 KB Output is correct
50 Correct 110 ms 18852 KB Output is correct
51 Correct 133 ms 18980 KB Output is correct
52 Correct 158 ms 18852 KB Output is correct
53 Correct 111 ms 18888 KB Output is correct
54 Correct 163 ms 18852 KB Output is correct
55 Correct 147 ms 18852 KB Output is correct
56 Correct 84 ms 18852 KB Output is correct
57 Correct 107 ms 18852 KB Output is correct
58 Correct 110 ms 18852 KB Output is correct
59 Correct 129 ms 18852 KB Output is correct
60 Correct 143 ms 18852 KB Output is correct
61 Correct 106 ms 18852 KB Output is correct
62 Correct 176 ms 18852 KB Output is correct
63 Correct 155 ms 18852 KB Output is correct
64 Correct 84 ms 18852 KB Output is correct
65 Correct 138 ms 18852 KB Output is correct
66 Correct 158 ms 18980 KB Output is correct
67 Correct 137 ms 19000 KB Output is correct
68 Correct 138 ms 18852 KB Output is correct
69 Correct 162 ms 18852 KB Output is correct
70 Correct 146 ms 18852 KB Output is correct
71 Correct 1042 ms 23280 KB Output is correct
72 Correct 1087 ms 23412 KB Output is correct
73 Correct 1349 ms 21856 KB Output is correct
74 Execution timed out 2031 ms 22352 KB Time limit exceeded
75 Halted 0 ms 0 KB -