oj.uz

Submission #386151

# Submission time Handle Problem Language Result Execution time Memory
386151 2021-04-05T19:55:06 Z CSQ31 Snake Escaping (JOI18_snake_escaping) C++14
22 / 100
 860 ms 18852 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(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;
		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+=pw[(l-i-1)];
			for(int i=0;i<pw[sz(c)];i++){
				ll 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){
			ll 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++){
				ll 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{
			ll 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++){
				ll 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 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 598 ms 4384 KB Output is correct
12 Correct 578 ms 4204 KB Output is correct
13 Correct 631 ms 3308 KB Output is correct
14 Correct 652 ms 3384 KB Output is correct
15 Correct 601 ms 4496 KB Output is correct
16 Correct 681 ms 3820 KB Output is correct
17 Correct 683 ms 3588 KB Output is correct
18 Correct 393 ms 5624 KB Output is correct
19 Correct 594 ms 2512 KB Output is correct
20 Correct 576 ms 4204 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 598 ms 4384 KB Output is correct
12 Correct 578 ms 4204 KB Output is correct
13 Correct 631 ms 3308 KB Output is correct
14 Correct 652 ms 3384 KB Output is correct
15 Correct 601 ms 4496 KB Output is correct
16 Correct 681 ms 3820 KB Output is correct
17 Correct 683 ms 3588 KB Output is correct
18 Correct 393 ms 5624 KB Output is correct
19 Correct 594 ms 2512 KB Output is correct
20 Correct 576 ms 4204 KB Output is correct
21 Correct 653 ms 4480 KB Output is correct
22 Correct 694 ms 4716 KB Output is correct
23 Correct 781 ms 3948 KB Output is correct
24 Correct 828 ms 3564 KB Output is correct
25 Correct 702 ms 5484 KB Output is correct
26 Correct 840 ms 4076 KB Output is correct
27 Correct 840 ms 4076 KB Output is correct
28 Correct 406 ms 6628 KB Output is correct
29 Correct 629 ms 2668 KB Output is correct
30 Correct 675 ms 4844 KB Output is correct
31 Correct 811 ms 4716 KB Output is correct
32 Correct 860 ms 4844 KB Output is correct
33 Correct 670 ms 3424 KB Output is correct
34 Correct 826 ms 3820 KB Output is correct
35 Correct 849 ms 3948 KB Output is correct
36 Correct 391 ms 2540 KB Output is correct
37 Correct 649 ms 4460 KB Output is correct
38 Correct 659 ms 2540 KB Output is correct
39 Correct 785 ms 3820 KB Output is correct
40 Correct 831 ms 3692 KB Output is correct

Subtask #4
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 Incorrect 115 ms 18852 KB Output isn't correct
12 Halted 0 ms 0 KB -

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 598 ms 4384 KB Output is correct
12 Correct 578 ms 4204 KB Output is correct
13 Correct 631 ms 3308 KB Output is correct
14 Correct 652 ms 3384 KB Output is correct
15 Correct 601 ms 4496 KB Output is correct
16 Correct 681 ms 3820 KB Output is correct
17 Correct 683 ms 3588 KB Output is correct
18 Correct 393 ms 5624 KB Output is correct
19 Correct 594 ms 2512 KB Output is correct
20 Correct 576 ms 4204 KB Output is correct
21 Correct 653 ms 4480 KB Output is correct
22 Correct 694 ms 4716 KB Output is correct
23 Correct 781 ms 3948 KB Output is correct
24 Correct 828 ms 3564 KB Output is correct
25 Correct 702 ms 5484 KB Output is correct
26 Correct 840 ms 4076 KB Output is correct
27 Correct 840 ms 4076 KB Output is correct
28 Correct 406 ms 6628 KB Output is correct
29 Correct 629 ms 2668 KB Output is correct
30 Correct 675 ms 4844 KB Output is correct
31 Correct 811 ms 4716 KB Output is correct
32 Correct 860 ms 4844 KB Output is correct
33 Correct 670 ms 3424 KB Output is correct
34 Correct 826 ms 3820 KB Output is correct
35 Correct 849 ms 3948 KB Output is correct
36 Correct 391 ms 2540 KB Output is correct
37 Correct 649 ms 4460 KB Output is correct
38 Correct 659 ms 2540 KB Output is correct
39 Correct 785 ms 3820 KB Output is correct
40 Correct 831 ms 3692 KB Output is correct
41 Incorrect 115 ms 18852 KB Output isn't correct
42 Halted 0 ms 0 KB -