Submission #260271

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
260271	2020-08-10T00:17:13 Z	Goolakh	Snake Escaping (JOI18_snake_escaping)	C++17	22 / 100	2000 ms	20216 KB

snake_escaping

// FUCKED UP FUCKED UP FUCKED UP FUCKED UP FUCKED UP
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O2,no-stack-protector,unroll-loops,fast-math")

#define F first
#define S second
#define pb push_back
#define SZ(x) (ll)(x.size())
#define all(x) x.begin(),x.end()
#define MP make_pair

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll maxn=2e3+10, maxm=1e6+10, lg=21, mod=1e9+7, inf=1e18;

#define bone(x) (__builtin_popcount(x))

ll L,Q;
string s;
ll s0[1<<lg],s1[1<<lg];

int main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	
	cin>>L>>Q>>s;
	for(int m=0;m<SZ(s);m++){
		ll xx=((1<<L)-1)^m;
		for(int b=xx;;b=(b-1)&xx){
			s1[m]+=s[m^b]-'0', s0[m]+=s[((1<<L)-1)^(m^b)]-'0';
			if(!b) break;
		}
	}
	while(Q--){
		string t; cin>>t; reverse(all(t));
		ll t0=0,t1=0,tq=0;
		for(int i=0;i<L;i++){
			if(t[i]=='0') t0^=(1<<i);
			if(t[i]=='1') t1^=(1<<i);
			if(t[i]=='?') tq+=(1<<i);
		}
		ll mn=min({bone(t0),bone(t1),bone(tq)}),ans=0;
		if(mn==bone(tq)){
			for(ll sub=tq;;sub=(sub-1)&tq){
				ans+=s[sub^t1]-'0';
				if(!sub) break;
			};
		}
		else if(mn==bone(t1)){
			for(ll sub=t1;;sub=(sub-1)&t1){
				ans+=(bone(sub)%2 ? +1:-1)*s0[sub^t0];
				if(!sub) break;
			}
		}
		else if(mn==bone(t0)){
			for(ll sub=t0;;sub=(sub-1)&t0){
				ans+=(bone(sub)%2 ? +1:-1)*s1[sub^t1];
				if(!sub) break;
			}
		}
		cout<<abs(ans)<<'\n';
	}
	
	return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	262 ms	15124 KB	Output is correct
12	Correct	274 ms	14948 KB	Output is correct
13	Correct	288 ms	14072 KB	Output is correct
14	Correct	282 ms	14228 KB	Output is correct
15	Correct	268 ms	15096 KB	Output is correct
16	Correct	309 ms	14432 KB	Output is correct
17	Correct	306 ms	14328 KB	Output is correct
18	Correct	217 ms	16252 KB	Output is correct
19	Correct	275 ms	13308 KB	Output is correct
20	Correct	270 ms	14840 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	262 ms	15124 KB	Output is correct
12	Correct	274 ms	14948 KB	Output is correct
13	Correct	288 ms	14072 KB	Output is correct
14	Correct	282 ms	14228 KB	Output is correct
15	Correct	268 ms	15096 KB	Output is correct
16	Correct	309 ms	14432 KB	Output is correct
17	Correct	306 ms	14328 KB	Output is correct
18	Correct	217 ms	16252 KB	Output is correct
19	Correct	275 ms	13308 KB	Output is correct
20	Correct	270 ms	14840 KB	Output is correct
21	Correct	293 ms	18424 KB	Output is correct
22	Correct	305 ms	18556 KB	Output is correct
23	Correct	352 ms	17396 KB	Output is correct
24	Correct	341 ms	17272 KB	Output is correct
25	Correct	329 ms	19316 KB	Output is correct
26	Correct	365 ms	17784 KB	Output is correct
27	Correct	379 ms	17656 KB	Output is correct
28	Correct	232 ms	20216 KB	Output is correct
29	Correct	278 ms	16248 KB	Output is correct
30	Correct	305 ms	18344 KB	Output is correct
31	Correct	339 ms	18296 KB	Output is correct
32	Correct	396 ms	18296 KB	Output is correct
33	Correct	333 ms	17144 KB	Output is correct
34	Correct	353 ms	17272 KB	Output is correct
35	Correct	362 ms	17784 KB	Output is correct
36	Correct	220 ms	16248 KB	Output is correct
37	Correct	284 ms	18168 KB	Output is correct
38	Correct	292 ms	16248 KB	Output is correct
39	Correct	329 ms	17656 KB	Output is correct
40	Correct	335 ms	17272 KB	Output is correct

Subtask #4
0 / 53.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Execution timed out	2075 ms	4056 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #5
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	262 ms	15124 KB	Output is correct
12	Correct	274 ms	14948 KB	Output is correct
13	Correct	288 ms	14072 KB	Output is correct
14	Correct	282 ms	14228 KB	Output is correct
15	Correct	268 ms	15096 KB	Output is correct
16	Correct	309 ms	14432 KB	Output is correct
17	Correct	306 ms	14328 KB	Output is correct
18	Correct	217 ms	16252 KB	Output is correct
19	Correct	275 ms	13308 KB	Output is correct
20	Correct	270 ms	14840 KB	Output is correct
21	Correct	293 ms	18424 KB	Output is correct
22	Correct	305 ms	18556 KB	Output is correct
23	Correct	352 ms	17396 KB	Output is correct
24	Correct	341 ms	17272 KB	Output is correct
25	Correct	329 ms	19316 KB	Output is correct
26	Correct	365 ms	17784 KB	Output is correct
27	Correct	379 ms	17656 KB	Output is correct
28	Correct	232 ms	20216 KB	Output is correct
29	Correct	278 ms	16248 KB	Output is correct
30	Correct	305 ms	18344 KB	Output is correct
31	Correct	339 ms	18296 KB	Output is correct
32	Correct	396 ms	18296 KB	Output is correct
33	Correct	333 ms	17144 KB	Output is correct
34	Correct	353 ms	17272 KB	Output is correct
35	Correct	362 ms	17784 KB	Output is correct
36	Correct	220 ms	16248 KB	Output is correct
37	Correct	284 ms	18168 KB	Output is correct
38	Correct	292 ms	16248 KB	Output is correct
39	Correct	329 ms	17656 KB	Output is correct
40	Correct	335 ms	17272 KB	Output is correct
41	Execution timed out	2075 ms	4056 KB	Time limit exceeded
42	Halted	0 ms	0 KB	-

Submission #260271

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