oj.uz

Submission #386150

# Submission time Handle Problem Language Result Execution time Memory
386150 2021-04-05T19:52:47 Z CSQ31 Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 23392 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 pw[22] = {1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768,65536,131072,262144,524288,1048572,2097152};
int main()
{

	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);
			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){
			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 596 ms 4588 KB Output is correct
12 Correct 572 ms 4204 KB Output is correct
13 Correct 637 ms 3300 KB Output is correct
14 Correct 652 ms 3432 KB Output is correct
15 Correct 629 ms 4460 KB Output is correct
16 Correct 717 ms 3692 KB Output is correct
17 Correct 717 ms 3576 KB Output is correct
18 Correct 386 ms 5356 KB Output is correct
19 Correct 577 ms 2604 KB Output is correct
20 Correct 577 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 596 ms 4588 KB Output is correct
12 Correct 572 ms 4204 KB Output is correct
13 Correct 637 ms 3300 KB Output is correct
14 Correct 652 ms 3432 KB Output is correct
15 Correct 629 ms 4460 KB Output is correct
16 Correct 717 ms 3692 KB Output is correct
17 Correct 717 ms 3576 KB Output is correct
18 Correct 386 ms 5356 KB Output is correct
19 Correct 577 ms 2604 KB Output is correct
20 Correct 577 ms 4076 KB Output is correct
21 Correct 656 ms 4588 KB Output is correct
22 Correct 675 ms 4716 KB Output is correct
23 Correct 787 ms 3892 KB Output is correct
24 Correct 855 ms 3564 KB Output is correct
25 Correct 719 ms 5660 KB Output is correct
26 Correct 843 ms 4168 KB Output is correct
27 Correct 842 ms 4076 KB Output is correct
28 Correct 459 ms 6508 KB Output is correct
29 Correct 652 ms 2540 KB Output is correct
30 Correct 679 ms 4716 KB Output is correct
31 Correct 813 ms 4716 KB Output is correct
32 Correct 879 ms 4668 KB Output is correct
33 Correct 679 ms 3692 KB Output is correct
34 Correct 836 ms 3692 KB Output is correct
35 Correct 848 ms 4204 KB Output is correct
36 Correct 386 ms 2540 KB Output is correct
37 Correct 641 ms 4680 KB Output is correct
38 Correct 658 ms 2540 KB Output is correct
39 Correct 856 ms 3692 KB Output is correct
40 Correct 841 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 106 ms 18852 KB Output is correct
12 Correct 113 ms 18852 KB Output is correct
13 Correct 124 ms 18852 KB Output is correct
14 Correct 159 ms 18852 KB Output is correct
15 Correct 115 ms 18852 KB Output is correct
16 Correct 163 ms 18852 KB Output is correct
17 Correct 147 ms 18852 KB Output is correct
18 Correct 86 ms 18852 KB Output is correct
19 Correct 104 ms 18852 KB Output is correct
20 Correct 106 ms 18852 KB Output is correct
21 Correct 125 ms 18852 KB Output is correct
22 Correct 207 ms 18852 KB Output is correct
23 Correct 107 ms 18852 KB Output is correct
24 Correct 160 ms 18852 KB Output is correct
25 Correct 156 ms 18852 KB Output is correct
26 Correct 101 ms 18852 KB Output is correct
27 Correct 107 ms 18852 KB Output is correct
28 Correct 106 ms 18852 KB Output is correct
29 Correct 123 ms 18852 KB Output is correct
30 Correct 145 ms 18852 KB Output is correct
31 Correct 106 ms 18852 KB Output is correct
32 Correct 206 ms 18808 KB Output is correct
33 Correct 145 ms 18852 KB Output is correct
34 Correct 94 ms 18852 KB Output is correct
35 Correct 139 ms 18852 KB Output is correct
36 Correct 133 ms 18852 KB Output is correct
37 Correct 140 ms 18852 KB Output is correct
38 Correct 132 ms 18852 KB Output is correct
39 Correct 145 ms 18852 KB Output is correct
40 Correct 132 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 596 ms 4588 KB Output is correct
12 Correct 572 ms 4204 KB Output is correct
13 Correct 637 ms 3300 KB Output is correct
14 Correct 652 ms 3432 KB Output is correct
15 Correct 629 ms 4460 KB Output is correct
16 Correct 717 ms 3692 KB Output is correct
17 Correct 717 ms 3576 KB Output is correct
18 Correct 386 ms 5356 KB Output is correct
19 Correct 577 ms 2604 KB Output is correct
20 Correct 577 ms 4076 KB Output is correct
21 Correct 656 ms 4588 KB Output is correct
22 Correct 675 ms 4716 KB Output is correct
23 Correct 787 ms 3892 KB Output is correct
24 Correct 855 ms 3564 KB Output is correct
25 Correct 719 ms 5660 KB Output is correct
26 Correct 843 ms 4168 KB Output is correct
27 Correct 842 ms 4076 KB Output is correct
28 Correct 459 ms 6508 KB Output is correct
29 Correct 652 ms 2540 KB Output is correct
30 Correct 679 ms 4716 KB Output is correct
31 Correct 813 ms 4716 KB Output is correct
32 Correct 879 ms 4668 KB Output is correct
33 Correct 679 ms 3692 KB Output is correct
34 Correct 836 ms 3692 KB Output is correct
35 Correct 848 ms 4204 KB Output is correct
36 Correct 386 ms 2540 KB Output is correct
37 Correct 641 ms 4680 KB Output is correct
38 Correct 658 ms 2540 KB Output is correct
39 Correct 856 ms 3692 KB Output is correct
40 Correct 841 ms 3564 KB Output is correct
41 Correct 106 ms 18852 KB Output is correct
42 Correct 113 ms 18852 KB Output is correct
43 Correct 124 ms 18852 KB Output is correct
44 Correct 159 ms 18852 KB Output is correct
45 Correct 115 ms 18852 KB Output is correct
46 Correct 163 ms 18852 KB Output is correct
47 Correct 147 ms 18852 KB Output is correct
48 Correct 86 ms 18852 KB Output is correct
49 Correct 104 ms 18852 KB Output is correct
50 Correct 106 ms 18852 KB Output is correct
51 Correct 125 ms 18852 KB Output is correct
52 Correct 207 ms 18852 KB Output is correct
53 Correct 107 ms 18852 KB Output is correct
54 Correct 160 ms 18852 KB Output is correct
55 Correct 156 ms 18852 KB Output is correct
56 Correct 101 ms 18852 KB Output is correct
57 Correct 107 ms 18852 KB Output is correct
58 Correct 106 ms 18852 KB Output is correct
59 Correct 123 ms 18852 KB Output is correct
60 Correct 145 ms 18852 KB Output is correct
61 Correct 106 ms 18852 KB Output is correct
62 Correct 206 ms 18808 KB Output is correct
63 Correct 145 ms 18852 KB Output is correct
64 Correct 94 ms 18852 KB Output is correct
65 Correct 139 ms 18852 KB Output is correct
66 Correct 133 ms 18852 KB Output is correct
67 Correct 140 ms 18852 KB Output is correct
68 Correct 132 ms 18852 KB Output is correct
69 Correct 145 ms 18852 KB Output is correct
70 Correct 132 ms 18852 KB Output is correct
71 Correct 1022 ms 23392 KB Output is correct
72 Correct 1040 ms 23392 KB Output is correct
73 Correct 1318 ms 21784 KB Output is correct
74 Execution timed out 2076 ms 21996 KB Time limit exceeded
75 Halted 0 ms 0 KB -