Submission #334785

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
334785	2020-12-10T01:54:28 Z	YJU	Snake Escaping (JOI18_snake_escaping)	C++14	22 / 100	437 ms	29456 KB

snake_escaping

#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=4e5+5;
const ll K=350;
const ld pi=acos(-1);
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

ll n,q,L,f[N],b[N],bcnt[N],u[N],p0,p1,p2,res;
string s;

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n>>q>>s;
	L=(1<<n);
	REP(i,L){
		f[i]=b[i]=u[i]=s[i]-'0';
		bcnt[i]=bcnt[i>>1]+(i&1);
	}
	for(int i=1;i<L;i<<=1){
		REP(j,L){
			if(i&j)f[j]+=f[i^j],b[i^j]+=b[j];
		}
	}
	while(q--){
		cin>>s;
		p0=p1=p2=res=0;
		REP(i,n){
			if(s[n-i-1]=='0')p0|=(1<<i);
			else if(s[n-i-1]=='1')p1|=(1<<i);
			else p2|=(1<<i);
		}
		if(bcnt[p0]<=6){
			for(int bit=p0;;bit=(bit-1)&p0){
				if(bcnt[bit]&1)res-=b[bit|p1];
				else res+=b[bit|p1];
				if(!bit)break;
			}
		}else if(bcnt[p1]<=6){
			for(int bit=p1;;bit=(bit-1)&p1){
				if(bcnt[bit^p1]&1)res-=f[bit|p2];
				else res+=f[bit|p2];
				if(!bit)break;
			}
		}else{
			for(int bit=p2;;bit=(bit-1)&p2){
				res+=u[p1|bit];
				if(!bit)break;
			}
		}
		cout<<res<<"\n";
	}
	return 0;
}

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	229 ms	6892 KB	Output is correct
12	Correct	288 ms	6596 KB	Output is correct
13	Correct	306 ms	5996 KB	Output is correct
14	Correct	281 ms	5868 KB	Output is correct
15	Correct	261 ms	7148 KB	Output is correct
16	Correct	270 ms	6252 KB	Output is correct
17	Correct	291 ms	6252 KB	Output is correct
18	Correct	199 ms	7916 KB	Output is correct
19	Correct	281 ms	4716 KB	Output is correct
20	Correct	243 ms	6508 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	229 ms	6892 KB	Output is correct
12	Correct	288 ms	6596 KB	Output is correct
13	Correct	306 ms	5996 KB	Output is correct
14	Correct	281 ms	5868 KB	Output is correct
15	Correct	261 ms	7148 KB	Output is correct
16	Correct	270 ms	6252 KB	Output is correct
17	Correct	291 ms	6252 KB	Output is correct
18	Correct	199 ms	7916 KB	Output is correct
19	Correct	281 ms	4716 KB	Output is correct
20	Correct	243 ms	6508 KB	Output is correct
21	Correct	254 ms	6756 KB	Output is correct
22	Correct	326 ms	6892 KB	Output is correct
23	Correct	437 ms	5996 KB	Output is correct
24	Correct	345 ms	5996 KB	Output is correct
25	Correct	276 ms	7896 KB	Output is correct
26	Correct	326 ms	6252 KB	Output is correct
27	Correct	349 ms	6252 KB	Output is correct
28	Correct	219 ms	8812 KB	Output is correct
29	Correct	399 ms	4812 KB	Output is correct
30	Correct	278 ms	6856 KB	Output is correct
31	Correct	310 ms	7276 KB	Output is correct
32	Correct	320 ms	7148 KB	Output is correct
33	Correct	282 ms	5996 KB	Output is correct
34	Correct	339 ms	6176 KB	Output is correct
35	Correct	371 ms	6576 KB	Output is correct
36	Correct	223 ms	5100 KB	Output is correct
37	Correct	259 ms	7148 KB	Output is correct
38	Correct	356 ms	5228 KB	Output is correct
39	Correct	316 ms	6252 KB	Output is correct
40	Correct	316 ms	6284 KB	Output is correct

Subtask #4
0 / 53.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Runtime error	31 ms	29456 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
12	Halted	0 ms	0 KB	-

Subtask #5
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	229 ms	6892 KB	Output is correct
12	Correct	288 ms	6596 KB	Output is correct
13	Correct	306 ms	5996 KB	Output is correct
14	Correct	281 ms	5868 KB	Output is correct
15	Correct	261 ms	7148 KB	Output is correct
16	Correct	270 ms	6252 KB	Output is correct
17	Correct	291 ms	6252 KB	Output is correct
18	Correct	199 ms	7916 KB	Output is correct
19	Correct	281 ms	4716 KB	Output is correct
20	Correct	243 ms	6508 KB	Output is correct
21	Correct	254 ms	6756 KB	Output is correct
22	Correct	326 ms	6892 KB	Output is correct
23	Correct	437 ms	5996 KB	Output is correct
24	Correct	345 ms	5996 KB	Output is correct
25	Correct	276 ms	7896 KB	Output is correct
26	Correct	326 ms	6252 KB	Output is correct
27	Correct	349 ms	6252 KB	Output is correct
28	Correct	219 ms	8812 KB	Output is correct
29	Correct	399 ms	4812 KB	Output is correct
30	Correct	278 ms	6856 KB	Output is correct
31	Correct	310 ms	7276 KB	Output is correct
32	Correct	320 ms	7148 KB	Output is correct
33	Correct	282 ms	5996 KB	Output is correct
34	Correct	339 ms	6176 KB	Output is correct
35	Correct	371 ms	6576 KB	Output is correct
36	Correct	223 ms	5100 KB	Output is correct
37	Correct	259 ms	7148 KB	Output is correct
38	Correct	356 ms	5228 KB	Output is correct
39	Correct	316 ms	6252 KB	Output is correct
40	Correct	316 ms	6284 KB	Output is correct
41	Runtime error	31 ms	29456 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
42	Halted	0 ms	0 KB	-

Submission #334785

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 10.0 / 10.0

Subtask #4 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
0 / 53.0

Subtask #5
0 / 25.0