Submission #66932

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
66932	2018-08-12T19:40:36 Z	hamzqq9	Snake Escaping (JOI18_snake_escaping)	C++14	75 / 100	2000 ms	66560 KB

snake_escaping

#include<bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define umax(x,y) x=max(x,y)
#define umin(x,y) x=min(x,y)
#define ll long long
#define ii pair<int,int>
#define iii pair<int,ii>
#define sz(x) ((int) x.size())
#define orta ((bas+son)>>1)
#define all(x) x.begin(),x.end()
#define dbgs(x) cerr<<(#x)<<" --> "<<(x)<<" "
#define dbg(x) cerr<<(#x)<<" --> "<<(x)<<endl;getchar()
#define pw(x) (1<<(x))
#define inf 100000000000000
#define MOD 1000000007
#define N 3005
#define MAX 10000006
#define LOG 22
#define L 7
#define R 13
using namespace std;
 
int n,q,l;
int cnt[1594325],ans[pw(20)+5];
int po3[20],po2[25],pos[1594325];
char val[pw(20)+5],s[pw(20)+5];
bool oops[1594325],inc[2188][129];
int Right[pw(20)+5];
short Left[pw(20)+5]; 

int get_2_rep(int val) {
 
	int res=0;
	int curpw=1;
 
	while(val) {
 
		res+=curpw*(val%3);
 
		val/=3;
 
		curpw*=2;
 
	}
 
	return res;
 
}
 
int get_2(int val) {
 
	int cur=0;
 
	while(val) {
 
		if(val%3==2) return cur;
 
		cur++;
 
		val/=3;
 
	}
 
	return -1;
 
}
 
void do_dp(int value) {
 
	for(int i=0;i<1594323;i++) {
 
		if(oops[i]) cnt[i]=val[value*po2[R]+pos[i]];
		else cnt[i]=cnt[i-po3[pos[i]]]+cnt[i-2*po3[pos[i]]];
 
	}
 
}

int lval,rval;

void back_track(int bit) {

	if(bit==L) {

		inc[rval][lval]=true;

		return ;

	}

	// 1 1 1 ? 
	// 0 0 0 ?

	lval+=po2[bit];

	rval+=po3[bit];

	back_track(bit+1);

	rval+=po3[bit];

	back_track(bit+1);

	lval-=po2[bit];

	back_track(bit+1);

	rval-=po3[bit]*2;

	back_track(bit+1);

}

void pre_cal() {
 
	for(int i=0;i<1594323;i++) {
 
		pos[i]=get_2(i);
 
		if(pos[i]==-1) {
		
			oops[i]=true;
 
			pos[i]=get_2_rep(i);
		
		}
 
	}

	back_track(0);
 
}
 
int get_value(int bas,int son) {
 
	int res=0;
 
	for(int i=bas;i<=son;i++) {
 
		res=res*3+(s[i]=='?'?2:(s[i]-'0'));
 
	}
 
	return res;
 
}
 
int main() {
 
	//freopen("input.txt","r",stdin);
 
	po3[0]=po2[0]=1;
 
 	for(int i=1;i<=15;i++) po3[i]=po3[i-1]*3;

 	for(int i=1;i<=20;i++) po2[i]=po2[i-1]*2;
 
	scanf("%d %d",&l,&q);
 
	n=po2[l];
 
	scanf("%s",s);
 
	for(int i=0;i<n;i++) val[i]=s[i]-'0';
 
	for(int i=1;i<=q;i++) {
 
		scanf("%s",s+20-l);
 
		for(int i=0;i<20-l;i++) s[i]='0';
 
		Right[i]=get_value(7,19);
		Left[i]=get_value(0,6);
 
	}
 
	pre_cal();
 
	for(int i=0;i<po2[L];i++) {
 
		do_dp(i);
 
		for(int j=1;j<=q;j++) {

			if(inc[Left[j]][i]) {

				ans[j]+=cnt[Right[j]];

			}

		}
 
	}
 
	for(int i=1;i<=q;i++) printf("%d\n",ans[i]);
 
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:161:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&l,&q);
  ~~~~~^~~~~~~~~~~~~~~
snake_escaping.cpp:165:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",s);
  ~~~~~^~~~~~~~
snake_escaping.cpp:171:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s",s+20-l);
   ~~~~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	453 ms	13304 KB	Output is correct
2	Correct	534 ms	13540 KB	Output is correct
3	Correct	566 ms	13540 KB	Output is correct
4	Correct	525 ms	13540 KB	Output is correct
5	Correct	508 ms	13652 KB	Output is correct
6	Correct	468 ms	13652 KB	Output is correct
7	Correct	594 ms	13652 KB	Output is correct
8	Correct	469 ms	13652 KB	Output is correct
9	Correct	510 ms	13652 KB	Output is correct
10	Correct	465 ms	13652 KB	Output is correct

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	453 ms	13304 KB	Output is correct
2	Correct	534 ms	13540 KB	Output is correct
3	Correct	566 ms	13540 KB	Output is correct
4	Correct	525 ms	13540 KB	Output is correct
5	Correct	508 ms	13652 KB	Output is correct
6	Correct	468 ms	13652 KB	Output is correct
7	Correct	594 ms	13652 KB	Output is correct
8	Correct	469 ms	13652 KB	Output is correct
9	Correct	510 ms	13652 KB	Output is correct
10	Correct	465 ms	13652 KB	Output is correct
11	Correct	974 ms	27344 KB	Output is correct
12	Correct	1156 ms	27344 KB	Output is correct
13	Correct	943 ms	27344 KB	Output is correct
14	Correct	854 ms	27344 KB	Output is correct
15	Correct	913 ms	27344 KB	Output is correct
16	Correct	918 ms	27344 KB	Output is correct
17	Correct	994 ms	27344 KB	Output is correct
18	Correct	862 ms	28548 KB	Output is correct
19	Correct	875 ms	28548 KB	Output is correct
20	Correct	926 ms	28548 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	453 ms	13304 KB	Output is correct
2	Correct	534 ms	13540 KB	Output is correct
3	Correct	566 ms	13540 KB	Output is correct
4	Correct	525 ms	13540 KB	Output is correct
5	Correct	508 ms	13652 KB	Output is correct
6	Correct	468 ms	13652 KB	Output is correct
7	Correct	594 ms	13652 KB	Output is correct
8	Correct	469 ms	13652 KB	Output is correct
9	Correct	510 ms	13652 KB	Output is correct
10	Correct	465 ms	13652 KB	Output is correct
11	Correct	974 ms	27344 KB	Output is correct
12	Correct	1156 ms	27344 KB	Output is correct
13	Correct	943 ms	27344 KB	Output is correct
14	Correct	854 ms	27344 KB	Output is correct
15	Correct	913 ms	27344 KB	Output is correct
16	Correct	918 ms	27344 KB	Output is correct
17	Correct	994 ms	27344 KB	Output is correct
18	Correct	862 ms	28548 KB	Output is correct
19	Correct	875 ms	28548 KB	Output is correct
20	Correct	926 ms	28548 KB	Output is correct
21	Correct	944 ms	28548 KB	Output is correct
22	Correct	941 ms	28548 KB	Output is correct
23	Correct	919 ms	28548 KB	Output is correct
24	Correct	949 ms	28548 KB	Output is correct
25	Correct	993 ms	28548 KB	Output is correct
26	Correct	967 ms	28548 KB	Output is correct
27	Correct	981 ms	28548 KB	Output is correct
28	Correct	914 ms	29236 KB	Output is correct
29	Correct	917 ms	29236 KB	Output is correct
30	Correct	976 ms	29236 KB	Output is correct
31	Correct	968 ms	29236 KB	Output is correct
32	Correct	965 ms	29236 KB	Output is correct
33	Correct	987 ms	29236 KB	Output is correct
34	Correct	976 ms	29236 KB	Output is correct
35	Correct	1006 ms	29236 KB	Output is correct
36	Correct	895 ms	29236 KB	Output is correct
37	Correct	1022 ms	29236 KB	Output is correct
38	Correct	921 ms	29236 KB	Output is correct
39	Correct	925 ms	29236 KB	Output is correct
40	Correct	951 ms	29236 KB	Output is correct

Subtask #4
53.0 / 53.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	453 ms	13304 KB	Output is correct
2	Correct	534 ms	13540 KB	Output is correct
3	Correct	566 ms	13540 KB	Output is correct
4	Correct	525 ms	13540 KB	Output is correct
5	Correct	508 ms	13652 KB	Output is correct
6	Correct	468 ms	13652 KB	Output is correct
7	Correct	594 ms	13652 KB	Output is correct
8	Correct	469 ms	13652 KB	Output is correct
9	Correct	510 ms	13652 KB	Output is correct
10	Correct	465 ms	13652 KB	Output is correct
11	Correct	537 ms	29236 KB	Output is correct
12	Correct	593 ms	29236 KB	Output is correct
13	Correct	553 ms	29236 KB	Output is correct
14	Correct	594 ms	29236 KB	Output is correct
15	Correct	640 ms	29236 KB	Output is correct
16	Correct	620 ms	29236 KB	Output is correct
17	Correct	559 ms	29236 KB	Output is correct
18	Correct	535 ms	29236 KB	Output is correct
19	Correct	540 ms	29236 KB	Output is correct
20	Correct	546 ms	29236 KB	Output is correct
21	Correct	598 ms	29236 KB	Output is correct
22	Correct	529 ms	29236 KB	Output is correct
23	Correct	512 ms	29236 KB	Output is correct
24	Correct	532 ms	29236 KB	Output is correct
25	Correct	617 ms	29236 KB	Output is correct
26	Correct	520 ms	29236 KB	Output is correct
27	Correct	529 ms	29236 KB	Output is correct
28	Correct	566 ms	29236 KB	Output is correct
29	Correct	555 ms	29236 KB	Output is correct
30	Correct	548 ms	29236 KB	Output is correct
31	Correct	622 ms	29236 KB	Output is correct
32	Correct	603 ms	29236 KB	Output is correct
33	Correct	713 ms	29236 KB	Output is correct
34	Correct	547 ms	29236 KB	Output is correct
35	Correct	552 ms	29236 KB	Output is correct
36	Correct	594 ms	29236 KB	Output is correct
37	Correct	546 ms	29236 KB	Output is correct
38	Correct	672 ms	29236 KB	Output is correct
39	Correct	540 ms	29236 KB	Output is correct
40	Correct	563 ms	29236 KB	Output is correct

Subtask #5
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	453 ms	13304 KB	Output is correct
2	Correct	534 ms	13540 KB	Output is correct
3	Correct	566 ms	13540 KB	Output is correct
4	Correct	525 ms	13540 KB	Output is correct
5	Correct	508 ms	13652 KB	Output is correct
6	Correct	468 ms	13652 KB	Output is correct
7	Correct	594 ms	13652 KB	Output is correct
8	Correct	469 ms	13652 KB	Output is correct
9	Correct	510 ms	13652 KB	Output is correct
10	Correct	465 ms	13652 KB	Output is correct
11	Correct	974 ms	27344 KB	Output is correct
12	Correct	1156 ms	27344 KB	Output is correct
13	Correct	943 ms	27344 KB	Output is correct
14	Correct	854 ms	27344 KB	Output is correct
15	Correct	913 ms	27344 KB	Output is correct
16	Correct	918 ms	27344 KB	Output is correct
17	Correct	994 ms	27344 KB	Output is correct
18	Correct	862 ms	28548 KB	Output is correct
19	Correct	875 ms	28548 KB	Output is correct
20	Correct	926 ms	28548 KB	Output is correct
21	Correct	944 ms	28548 KB	Output is correct
22	Correct	941 ms	28548 KB	Output is correct
23	Correct	919 ms	28548 KB	Output is correct
24	Correct	949 ms	28548 KB	Output is correct
25	Correct	993 ms	28548 KB	Output is correct
26	Correct	967 ms	28548 KB	Output is correct
27	Correct	981 ms	28548 KB	Output is correct
28	Correct	914 ms	29236 KB	Output is correct
29	Correct	917 ms	29236 KB	Output is correct
30	Correct	976 ms	29236 KB	Output is correct
31	Correct	968 ms	29236 KB	Output is correct
32	Correct	965 ms	29236 KB	Output is correct
33	Correct	987 ms	29236 KB	Output is correct
34	Correct	976 ms	29236 KB	Output is correct
35	Correct	1006 ms	29236 KB	Output is correct
36	Correct	895 ms	29236 KB	Output is correct
37	Correct	1022 ms	29236 KB	Output is correct
38	Correct	921 ms	29236 KB	Output is correct
39	Correct	925 ms	29236 KB	Output is correct
40	Correct	951 ms	29236 KB	Output is correct
41	Correct	537 ms	29236 KB	Output is correct
42	Correct	593 ms	29236 KB	Output is correct
43	Correct	553 ms	29236 KB	Output is correct
44	Correct	594 ms	29236 KB	Output is correct
45	Correct	640 ms	29236 KB	Output is correct
46	Correct	620 ms	29236 KB	Output is correct
47	Correct	559 ms	29236 KB	Output is correct
48	Correct	535 ms	29236 KB	Output is correct
49	Correct	540 ms	29236 KB	Output is correct
50	Correct	546 ms	29236 KB	Output is correct
51	Correct	598 ms	29236 KB	Output is correct
52	Correct	529 ms	29236 KB	Output is correct
53	Correct	512 ms	29236 KB	Output is correct
54	Correct	532 ms	29236 KB	Output is correct
55	Correct	617 ms	29236 KB	Output is correct
56	Correct	520 ms	29236 KB	Output is correct
57	Correct	529 ms	29236 KB	Output is correct
58	Correct	566 ms	29236 KB	Output is correct
59	Correct	555 ms	29236 KB	Output is correct
60	Correct	548 ms	29236 KB	Output is correct
61	Correct	622 ms	29236 KB	Output is correct
62	Correct	603 ms	29236 KB	Output is correct
63	Correct	713 ms	29236 KB	Output is correct
64	Correct	547 ms	29236 KB	Output is correct
65	Correct	552 ms	29236 KB	Output is correct
66	Correct	594 ms	29236 KB	Output is correct
67	Correct	546 ms	29236 KB	Output is correct
68	Correct	672 ms	29236 KB	Output is correct
69	Correct	540 ms	29236 KB	Output is correct
70	Correct	563 ms	29236 KB	Output is correct
71	Correct	1504 ms	30600 KB	Output is correct
72	Correct	1651 ms	30884 KB	Output is correct
73	Correct	1898 ms	50984 KB	Output is correct
74	Correct	1834 ms	51276 KB	Output is correct
75	Execution timed out	2070 ms	66560 KB	Time limit exceeded
76	Halted	0 ms	0 KB	-

Submission #66932

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