답안 #386153

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
386153	2021-04-05T19:58:57 Z	CSQ31	Snake Escaping (JOI18_snake_escaping)	C++14	75 / 100	2000 ms	23264 KB

snake_escaping

#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;
		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

#	결과	실행 시간	메모리	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	2 ms	364 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	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	2 ms	364 KB	Output is correct
11	Correct	608 ms	4460 KB	Output is correct
12	Correct	572 ms	4076 KB	Output is correct
13	Correct	628 ms	3436 KB	Output is correct
14	Correct	656 ms	3564 KB	Output is correct
15	Correct	602 ms	4460 KB	Output is correct
16	Correct	689 ms	3692 KB	Output is correct
17	Correct	712 ms	3564 KB	Output is correct
18	Correct	387 ms	5356 KB	Output is correct
19	Correct	592 ms	2344 KB	Output is correct
20	Correct	581 ms	4076 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	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	2 ms	364 KB	Output is correct
11	Correct	608 ms	4460 KB	Output is correct
12	Correct	572 ms	4076 KB	Output is correct
13	Correct	628 ms	3436 KB	Output is correct
14	Correct	656 ms	3564 KB	Output is correct
15	Correct	602 ms	4460 KB	Output is correct
16	Correct	689 ms	3692 KB	Output is correct
17	Correct	712 ms	3564 KB	Output is correct
18	Correct	387 ms	5356 KB	Output is correct
19	Correct	592 ms	2344 KB	Output is correct
20	Correct	581 ms	4076 KB	Output is correct
21	Correct	651 ms	4508 KB	Output is correct
22	Correct	680 ms	4620 KB	Output is correct
23	Correct	780 ms	3820 KB	Output is correct
24	Correct	845 ms	3520 KB	Output is correct
25	Correct	703 ms	5612 KB	Output is correct
26	Correct	872 ms	4144 KB	Output is correct
27	Correct	852 ms	4076 KB	Output is correct
28	Correct	417 ms	6508 KB	Output is correct
29	Correct	634 ms	2668 KB	Output is correct
30	Correct	688 ms	4844 KB	Output is correct
31	Correct	820 ms	4716 KB	Output is correct
32	Correct	897 ms	4588 KB	Output is correct
33	Correct	691 ms	3564 KB	Output is correct
34	Correct	829 ms	3604 KB	Output is correct
35	Correct	851 ms	3984 KB	Output is correct
36	Correct	394 ms	2540 KB	Output is correct
37	Correct	647 ms	4588 KB	Output is correct
38	Correct	655 ms	2540 KB	Output is correct
39	Correct	783 ms	3692 KB	Output is correct
40	Correct	840 ms	3564 KB	Output is correct

Subtask #4
53.0 / 53.0

#	결과	실행 시간	메모리	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	2 ms	364 KB	Output is correct
11	Correct	109 ms	18852 KB	Output is correct
12	Correct	112 ms	18852 KB	Output is correct
13	Correct	124 ms	18852 KB	Output is correct
14	Correct	164 ms	18852 KB	Output is correct
15	Correct	112 ms	18852 KB	Output is correct
16	Correct	165 ms	18852 KB	Output is correct
17	Correct	149 ms	18852 KB	Output is correct
18	Correct	88 ms	18852 KB	Output is correct
19	Correct	109 ms	18852 KB	Output is correct
20	Correct	130 ms	18852 KB	Output is correct
21	Correct	131 ms	18852 KB	Output is correct
22	Correct	160 ms	18852 KB	Output is correct
23	Correct	115 ms	18852 KB	Output is correct
24	Correct	151 ms	18884 KB	Output is correct
25	Correct	150 ms	18852 KB	Output is correct
26	Correct	86 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	131 ms	18852 KB	Output is correct
30	Correct	148 ms	18852 KB	Output is correct
31	Correct	108 ms	18852 KB	Output is correct
32	Correct	171 ms	18852 KB	Output is correct
33	Correct	156 ms	18852 KB	Output is correct
34	Correct	87 ms	18852 KB	Output is correct
35	Correct	136 ms	18852 KB	Output is correct
36	Correct	139 ms	18852 KB	Output is correct
37	Correct	134 ms	18852 KB	Output is correct
38	Correct	167 ms	18852 KB	Output is correct
39	Correct	136 ms	18852 KB	Output is correct
40	Correct	139 ms	18852 KB	Output is correct

Subtask #5
0 / 25.0

#	결과	실행 시간	메모리	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	2 ms	364 KB	Output is correct
11	Correct	608 ms	4460 KB	Output is correct
12	Correct	572 ms	4076 KB	Output is correct
13	Correct	628 ms	3436 KB	Output is correct
14	Correct	656 ms	3564 KB	Output is correct
15	Correct	602 ms	4460 KB	Output is correct
16	Correct	689 ms	3692 KB	Output is correct
17	Correct	712 ms	3564 KB	Output is correct
18	Correct	387 ms	5356 KB	Output is correct
19	Correct	592 ms	2344 KB	Output is correct
20	Correct	581 ms	4076 KB	Output is correct
21	Correct	651 ms	4508 KB	Output is correct
22	Correct	680 ms	4620 KB	Output is correct
23	Correct	780 ms	3820 KB	Output is correct
24	Correct	845 ms	3520 KB	Output is correct
25	Correct	703 ms	5612 KB	Output is correct
26	Correct	872 ms	4144 KB	Output is correct
27	Correct	852 ms	4076 KB	Output is correct
28	Correct	417 ms	6508 KB	Output is correct
29	Correct	634 ms	2668 KB	Output is correct
30	Correct	688 ms	4844 KB	Output is correct
31	Correct	820 ms	4716 KB	Output is correct
32	Correct	897 ms	4588 KB	Output is correct
33	Correct	691 ms	3564 KB	Output is correct
34	Correct	829 ms	3604 KB	Output is correct
35	Correct	851 ms	3984 KB	Output is correct
36	Correct	394 ms	2540 KB	Output is correct
37	Correct	647 ms	4588 KB	Output is correct
38	Correct	655 ms	2540 KB	Output is correct
39	Correct	783 ms	3692 KB	Output is correct
40	Correct	840 ms	3564 KB	Output is correct
41	Correct	109 ms	18852 KB	Output is correct
42	Correct	112 ms	18852 KB	Output is correct
43	Correct	124 ms	18852 KB	Output is correct
44	Correct	164 ms	18852 KB	Output is correct
45	Correct	112 ms	18852 KB	Output is correct
46	Correct	165 ms	18852 KB	Output is correct
47	Correct	149 ms	18852 KB	Output is correct
48	Correct	88 ms	18852 KB	Output is correct
49	Correct	109 ms	18852 KB	Output is correct
50	Correct	130 ms	18852 KB	Output is correct
51	Correct	131 ms	18852 KB	Output is correct
52	Correct	160 ms	18852 KB	Output is correct
53	Correct	115 ms	18852 KB	Output is correct
54	Correct	151 ms	18884 KB	Output is correct
55	Correct	150 ms	18852 KB	Output is correct
56	Correct	86 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	131 ms	18852 KB	Output is correct
60	Correct	148 ms	18852 KB	Output is correct
61	Correct	108 ms	18852 KB	Output is correct
62	Correct	171 ms	18852 KB	Output is correct
63	Correct	156 ms	18852 KB	Output is correct
64	Correct	87 ms	18852 KB	Output is correct
65	Correct	136 ms	18852 KB	Output is correct
66	Correct	139 ms	18852 KB	Output is correct
67	Correct	134 ms	18852 KB	Output is correct
68	Correct	167 ms	18852 KB	Output is correct
69	Correct	136 ms	18852 KB	Output is correct
70	Correct	139 ms	18852 KB	Output is correct
71	Correct	1039 ms	23008 KB	Output is correct
72	Correct	1056 ms	23264 KB	Output is correct
73	Correct	1312 ms	21984 KB	Output is correct
74	Execution timed out	2060 ms	22080 KB	Time limit exceeded
75	Halted	0 ms	0 KB	-

답안 #386153

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 10.0 / 10.0

Subtask #4 53.0 / 53.0

Subtask #5 0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
10.0 / 10.0

Subtask #4
53.0 / 53.0

Subtask #5
0 / 25.0