답안 #386145

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

snake_escaping

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#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()
{
	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';
	}
}

Compilation message

snake_escaping.cpp:2: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("O3")
      | 
snake_escaping.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      |

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	605 ms	4460 KB	Output is correct
12	Correct	582 ms	4204 KB	Output is correct
13	Correct	631 ms	3436 KB	Output is correct
14	Correct	652 ms	3436 KB	Output is correct
15	Correct	600 ms	4460 KB	Output is correct
16	Correct	680 ms	3676 KB	Output is correct
17	Correct	677 ms	3656 KB	Output is correct
18	Correct	390 ms	5356 KB	Output is correct
19	Correct	581 ms	2412 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	605 ms	4460 KB	Output is correct
12	Correct	582 ms	4204 KB	Output is correct
13	Correct	631 ms	3436 KB	Output is correct
14	Correct	652 ms	3436 KB	Output is correct
15	Correct	600 ms	4460 KB	Output is correct
16	Correct	680 ms	3676 KB	Output is correct
17	Correct	677 ms	3656 KB	Output is correct
18	Correct	390 ms	5356 KB	Output is correct
19	Correct	581 ms	2412 KB	Output is correct
20	Correct	581 ms	4076 KB	Output is correct
21	Correct	657 ms	4864 KB	Output is correct
22	Correct	681 ms	4844 KB	Output is correct
23	Correct	776 ms	3880 KB	Output is correct
24	Correct	813 ms	3564 KB	Output is correct
25	Correct	697 ms	5484 KB	Output is correct
26	Correct	858 ms	4076 KB	Output is correct
27	Correct	851 ms	3948 KB	Output is correct
28	Correct	411 ms	6764 KB	Output is correct
29	Correct	635 ms	2540 KB	Output is correct
30	Correct	693 ms	4716 KB	Output is correct
31	Correct	809 ms	4844 KB	Output is correct
32	Correct	866 ms	4872 KB	Output is correct
33	Correct	674 ms	3436 KB	Output is correct
34	Correct	830 ms	3756 KB	Output is correct
35	Correct	846 ms	3948 KB	Output is correct
36	Correct	393 ms	2668 KB	Output is correct
37	Correct	649 ms	4460 KB	Output is correct
38	Correct	666 ms	2540 KB	Output is correct
39	Correct	800 ms	3692 KB	Output is correct
40	Correct	832 ms	3692 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	114 ms	18852 KB	Output is correct
13	Correct	124 ms	18852 KB	Output is correct
14	Correct	177 ms	18852 KB	Output is correct
15	Correct	118 ms	18852 KB	Output is correct
16	Correct	172 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	109 ms	18852 KB	Output is correct
20	Correct	110 ms	18788 KB	Output is correct
21	Correct	127 ms	18852 KB	Output is correct
22	Correct	166 ms	18852 KB	Output is correct
23	Correct	107 ms	18852 KB	Output is correct
24	Correct	148 ms	18852 KB	Output is correct
25	Correct	150 ms	18852 KB	Output is correct
26	Correct	84 ms	18852 KB	Output is correct
27	Correct	106 ms	18852 KB	Output is correct
28	Correct	104 ms	18852 KB	Output is correct
29	Correct	122 ms	18852 KB	Output is correct
30	Correct	144 ms	18852 KB	Output is correct
31	Correct	109 ms	18852 KB	Output is correct
32	Correct	168 ms	18852 KB	Output is correct
33	Correct	150 ms	18852 KB	Output is correct
34	Correct	83 ms	18852 KB	Output is correct
35	Correct	137 ms	18852 KB	Output is correct
36	Correct	134 ms	18852 KB	Output is correct
37	Correct	135 ms	18852 KB	Output is correct
38	Correct	138 ms	18852 KB	Output is correct
39	Correct	136 ms	18852 KB	Output is correct
40	Correct	137 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	605 ms	4460 KB	Output is correct
12	Correct	582 ms	4204 KB	Output is correct
13	Correct	631 ms	3436 KB	Output is correct
14	Correct	652 ms	3436 KB	Output is correct
15	Correct	600 ms	4460 KB	Output is correct
16	Correct	680 ms	3676 KB	Output is correct
17	Correct	677 ms	3656 KB	Output is correct
18	Correct	390 ms	5356 KB	Output is correct
19	Correct	581 ms	2412 KB	Output is correct
20	Correct	581 ms	4076 KB	Output is correct
21	Correct	657 ms	4864 KB	Output is correct
22	Correct	681 ms	4844 KB	Output is correct
23	Correct	776 ms	3880 KB	Output is correct
24	Correct	813 ms	3564 KB	Output is correct
25	Correct	697 ms	5484 KB	Output is correct
26	Correct	858 ms	4076 KB	Output is correct
27	Correct	851 ms	3948 KB	Output is correct
28	Correct	411 ms	6764 KB	Output is correct
29	Correct	635 ms	2540 KB	Output is correct
30	Correct	693 ms	4716 KB	Output is correct
31	Correct	809 ms	4844 KB	Output is correct
32	Correct	866 ms	4872 KB	Output is correct
33	Correct	674 ms	3436 KB	Output is correct
34	Correct	830 ms	3756 KB	Output is correct
35	Correct	846 ms	3948 KB	Output is correct
36	Correct	393 ms	2668 KB	Output is correct
37	Correct	649 ms	4460 KB	Output is correct
38	Correct	666 ms	2540 KB	Output is correct
39	Correct	800 ms	3692 KB	Output is correct
40	Correct	832 ms	3692 KB	Output is correct
41	Correct	109 ms	18852 KB	Output is correct
42	Correct	114 ms	18852 KB	Output is correct
43	Correct	124 ms	18852 KB	Output is correct
44	Correct	177 ms	18852 KB	Output is correct
45	Correct	118 ms	18852 KB	Output is correct
46	Correct	172 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	109 ms	18852 KB	Output is correct
50	Correct	110 ms	18788 KB	Output is correct
51	Correct	127 ms	18852 KB	Output is correct
52	Correct	166 ms	18852 KB	Output is correct
53	Correct	107 ms	18852 KB	Output is correct
54	Correct	148 ms	18852 KB	Output is correct
55	Correct	150 ms	18852 KB	Output is correct
56	Correct	84 ms	18852 KB	Output is correct
57	Correct	106 ms	18852 KB	Output is correct
58	Correct	104 ms	18852 KB	Output is correct
59	Correct	122 ms	18852 KB	Output is correct
60	Correct	144 ms	18852 KB	Output is correct
61	Correct	109 ms	18852 KB	Output is correct
62	Correct	168 ms	18852 KB	Output is correct
63	Correct	150 ms	18852 KB	Output is correct
64	Correct	83 ms	18852 KB	Output is correct
65	Correct	137 ms	18852 KB	Output is correct
66	Correct	134 ms	18852 KB	Output is correct
67	Correct	135 ms	18852 KB	Output is correct
68	Correct	138 ms	18852 KB	Output is correct
69	Correct	136 ms	18852 KB	Output is correct
70	Correct	137 ms	18852 KB	Output is correct
71	Correct	1031 ms	23008 KB	Output is correct
72	Correct	1028 ms	23264 KB	Output is correct
73	Correct	1316 ms	21600 KB	Output is correct
74	Execution timed out	2090 ms	21968 KB	Time limit exceeded
75	Halted	0 ms	0 KB	-

답안 #386145

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