답안 #66934 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
66934	2018-08-12T19:48:33 Z	hamzqq9	Snake Escaping (JOI18_snake_escaping)	C++14	75 / 100	2000 ms	53624 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]; 

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() {

	oops[0]=oops[1]=true;
	pos[1]=1;

	for(int i=3;i<1594323;i++) {
 
 		if(i%3==2) pos[i]=0;
 		else {

 			int val=i/3;

 			if(oops[val]) {

 				oops[i]=true;
 				pos[i]=pos[val]*2+i%3;

 			}
 			else {

 				pos[i]=pos[val]+1;

 			}

 		}
 
	}

	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(L,19);
		Left[i]=get_value(0,L-1);
 
	}
 
	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:136: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:140:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",s);
  ~~~~~^~~~~~~~
snake_escaping.cpp:146: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

#	결과	실행 시간	메모리	Grader output
1	Correct	478 ms	13432 KB	Output is correct
2	Correct	469 ms	13540 KB	Output is correct
3	Correct	487 ms	13540 KB	Output is correct
4	Correct	494 ms	13540 KB	Output is correct
5	Correct	480 ms	13700 KB	Output is correct
6	Correct	466 ms	13700 KB	Output is correct
7	Correct	484 ms	13700 KB	Output is correct
8	Correct	464 ms	13700 KB	Output is correct
9	Correct	482 ms	13700 KB	Output is correct
10	Correct	456 ms	13700 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	478 ms	13432 KB	Output is correct
2	Correct	469 ms	13540 KB	Output is correct
3	Correct	487 ms	13540 KB	Output is correct
4	Correct	494 ms	13540 KB	Output is correct
5	Correct	480 ms	13700 KB	Output is correct
6	Correct	466 ms	13700 KB	Output is correct
7	Correct	484 ms	13700 KB	Output is correct
8	Correct	464 ms	13700 KB	Output is correct
9	Correct	482 ms	13700 KB	Output is correct
10	Correct	456 ms	13700 KB	Output is correct
11	Correct	1036 ms	27236 KB	Output is correct
12	Correct	954 ms	27236 KB	Output is correct
13	Correct	889 ms	27236 KB	Output is correct
14	Correct	902 ms	27236 KB	Output is correct
15	Correct	942 ms	27308 KB	Output is correct
16	Correct	898 ms	27308 KB	Output is correct
17	Correct	892 ms	27308 KB	Output is correct
18	Correct	872 ms	28328 KB	Output is correct
19	Correct	886 ms	28328 KB	Output is correct
20	Correct	937 ms	28328 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	478 ms	13432 KB	Output is correct
2	Correct	469 ms	13540 KB	Output is correct
3	Correct	487 ms	13540 KB	Output is correct
4	Correct	494 ms	13540 KB	Output is correct
5	Correct	480 ms	13700 KB	Output is correct
6	Correct	466 ms	13700 KB	Output is correct
7	Correct	484 ms	13700 KB	Output is correct
8	Correct	464 ms	13700 KB	Output is correct
9	Correct	482 ms	13700 KB	Output is correct
10	Correct	456 ms	13700 KB	Output is correct
11	Correct	1036 ms	27236 KB	Output is correct
12	Correct	954 ms	27236 KB	Output is correct
13	Correct	889 ms	27236 KB	Output is correct
14	Correct	902 ms	27236 KB	Output is correct
15	Correct	942 ms	27308 KB	Output is correct
16	Correct	898 ms	27308 KB	Output is correct
17	Correct	892 ms	27308 KB	Output is correct
18	Correct	872 ms	28328 KB	Output is correct
19	Correct	886 ms	28328 KB	Output is correct
20	Correct	937 ms	28328 KB	Output is correct
21	Correct	898 ms	28328 KB	Output is correct
22	Correct	938 ms	28328 KB	Output is correct
23	Correct	998 ms	28328 KB	Output is correct
24	Correct	915 ms	28328 KB	Output is correct
25	Correct	954 ms	28460 KB	Output is correct
26	Correct	940 ms	28460 KB	Output is correct
27	Correct	1039 ms	28460 KB	Output is correct
28	Correct	981 ms	29356 KB	Output is correct
29	Correct	875 ms	29356 KB	Output is correct
30	Correct	1028 ms	29356 KB	Output is correct
31	Correct	960 ms	29356 KB	Output is correct
32	Correct	972 ms	29356 KB	Output is correct
33	Correct	956 ms	29356 KB	Output is correct
34	Correct	941 ms	29356 KB	Output is correct
35	Correct	984 ms	29356 KB	Output is correct
36	Correct	841 ms	29356 KB	Output is correct
37	Correct	1010 ms	29356 KB	Output is correct
38	Correct	878 ms	29356 KB	Output is correct
39	Correct	932 ms	29356 KB	Output is correct
40	Correct	969 ms	29356 KB	Output is correct

Subtask #4
53.0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	478 ms	13432 KB	Output is correct
2	Correct	469 ms	13540 KB	Output is correct
3	Correct	487 ms	13540 KB	Output is correct
4	Correct	494 ms	13540 KB	Output is correct
5	Correct	480 ms	13700 KB	Output is correct
6	Correct	466 ms	13700 KB	Output is correct
7	Correct	484 ms	13700 KB	Output is correct
8	Correct	464 ms	13700 KB	Output is correct
9	Correct	482 ms	13700 KB	Output is correct
10	Correct	456 ms	13700 KB	Output is correct
11	Correct	526 ms	29356 KB	Output is correct
12	Correct	560 ms	29356 KB	Output is correct
13	Correct	547 ms	29356 KB	Output is correct
14	Correct	536 ms	29356 KB	Output is correct
15	Correct	642 ms	29356 KB	Output is correct
16	Correct	571 ms	29356 KB	Output is correct
17	Correct	552 ms	29356 KB	Output is correct
18	Correct	545 ms	29356 KB	Output is correct
19	Correct	526 ms	29356 KB	Output is correct
20	Correct	562 ms	29356 KB	Output is correct
21	Correct	571 ms	29356 KB	Output is correct
22	Correct	556 ms	29356 KB	Output is correct
23	Correct	527 ms	29356 KB	Output is correct
24	Correct	563 ms	29356 KB	Output is correct
25	Correct	628 ms	29356 KB	Output is correct
26	Correct	502 ms	29356 KB	Output is correct
27	Correct	577 ms	29356 KB	Output is correct
28	Correct	551 ms	29356 KB	Output is correct
29	Correct	601 ms	29356 KB	Output is correct
30	Correct	609 ms	29356 KB	Output is correct
31	Correct	573 ms	29356 KB	Output is correct
32	Correct	599 ms	29356 KB	Output is correct
33	Correct	596 ms	29356 KB	Output is correct
34	Correct	525 ms	29356 KB	Output is correct
35	Correct	586 ms	29356 KB	Output is correct
36	Correct	606 ms	29356 KB	Output is correct
37	Correct	739 ms	29356 KB	Output is correct
38	Correct	588 ms	29356 KB	Output is correct
39	Correct	616 ms	29356 KB	Output is correct
40	Correct	604 ms	29356 KB	Output is correct

Subtask #5
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	478 ms	13432 KB	Output is correct
2	Correct	469 ms	13540 KB	Output is correct
3	Correct	487 ms	13540 KB	Output is correct
4	Correct	494 ms	13540 KB	Output is correct
5	Correct	480 ms	13700 KB	Output is correct
6	Correct	466 ms	13700 KB	Output is correct
7	Correct	484 ms	13700 KB	Output is correct
8	Correct	464 ms	13700 KB	Output is correct
9	Correct	482 ms	13700 KB	Output is correct
10	Correct	456 ms	13700 KB	Output is correct
11	Correct	1036 ms	27236 KB	Output is correct
12	Correct	954 ms	27236 KB	Output is correct
13	Correct	889 ms	27236 KB	Output is correct
14	Correct	902 ms	27236 KB	Output is correct
15	Correct	942 ms	27308 KB	Output is correct
16	Correct	898 ms	27308 KB	Output is correct
17	Correct	892 ms	27308 KB	Output is correct
18	Correct	872 ms	28328 KB	Output is correct
19	Correct	886 ms	28328 KB	Output is correct
20	Correct	937 ms	28328 KB	Output is correct
21	Correct	898 ms	28328 KB	Output is correct
22	Correct	938 ms	28328 KB	Output is correct
23	Correct	998 ms	28328 KB	Output is correct
24	Correct	915 ms	28328 KB	Output is correct
25	Correct	954 ms	28460 KB	Output is correct
26	Correct	940 ms	28460 KB	Output is correct
27	Correct	1039 ms	28460 KB	Output is correct
28	Correct	981 ms	29356 KB	Output is correct
29	Correct	875 ms	29356 KB	Output is correct
30	Correct	1028 ms	29356 KB	Output is correct
31	Correct	960 ms	29356 KB	Output is correct
32	Correct	972 ms	29356 KB	Output is correct
33	Correct	956 ms	29356 KB	Output is correct
34	Correct	941 ms	29356 KB	Output is correct
35	Correct	984 ms	29356 KB	Output is correct
36	Correct	841 ms	29356 KB	Output is correct
37	Correct	1010 ms	29356 KB	Output is correct
38	Correct	878 ms	29356 KB	Output is correct
39	Correct	932 ms	29356 KB	Output is correct
40	Correct	969 ms	29356 KB	Output is correct
41	Correct	526 ms	29356 KB	Output is correct
42	Correct	560 ms	29356 KB	Output is correct
43	Correct	547 ms	29356 KB	Output is correct
44	Correct	536 ms	29356 KB	Output is correct
45	Correct	642 ms	29356 KB	Output is correct
46	Correct	571 ms	29356 KB	Output is correct
47	Correct	552 ms	29356 KB	Output is correct
48	Correct	545 ms	29356 KB	Output is correct
49	Correct	526 ms	29356 KB	Output is correct
50	Correct	562 ms	29356 KB	Output is correct
51	Correct	571 ms	29356 KB	Output is correct
52	Correct	556 ms	29356 KB	Output is correct
53	Correct	527 ms	29356 KB	Output is correct
54	Correct	563 ms	29356 KB	Output is correct
55	Correct	628 ms	29356 KB	Output is correct
56	Correct	502 ms	29356 KB	Output is correct
57	Correct	577 ms	29356 KB	Output is correct
58	Correct	551 ms	29356 KB	Output is correct
59	Correct	601 ms	29356 KB	Output is correct
60	Correct	609 ms	29356 KB	Output is correct
61	Correct	573 ms	29356 KB	Output is correct
62	Correct	599 ms	29356 KB	Output is correct
63	Correct	596 ms	29356 KB	Output is correct
64	Correct	525 ms	29356 KB	Output is correct
65	Correct	586 ms	29356 KB	Output is correct
66	Correct	606 ms	29356 KB	Output is correct
67	Correct	739 ms	29356 KB	Output is correct
68	Correct	588 ms	29356 KB	Output is correct
69	Correct	616 ms	29356 KB	Output is correct
70	Correct	604 ms	29356 KB	Output is correct
71	Correct	1519 ms	31204 KB	Output is correct
72	Correct	1674 ms	31240 KB	Output is correct
73	Correct	1698 ms	51612 KB	Output is correct
74	Correct	1893 ms	51760 KB	Output is correct
75	Execution timed out	2040 ms	53624 KB	Time limit exceeded
76	Halted	0 ms	0 KB	-

답안 #66934

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