oj.uz

Submission #66945

# Submission time Handle Problem Language Result Execution time Memory
66945 2018-08-12T20:11:26 Z hamzqq9 Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 31836 KB 
#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]]];
 
	}
 
}

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;

 			}

 		}
 
	}

	inc[0][0]=true;

	for(int i=0;i<2187;i++) {

		for(int j=0;j<128;j++) {

			if(i%3==2 || i%3==j%2) inc[i][j]=inc[i/3][j/2]; 

		}

	}
 
}
 
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:111: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:115:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",s);
  ~~~~~^~~~~~~~
snake_escaping.cpp:121: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 487 ms 13304 KB Output is correct
2 Correct 494 ms 13544 KB Output is correct
3 Correct 511 ms 13544 KB Output is correct
4 Correct 533 ms 13544 KB Output is correct
5 Correct 525 ms 13596 KB Output is correct
6 Correct 533 ms 13636 KB Output is correct
7 Correct 531 ms 13636 KB Output is correct
8 Correct 528 ms 13636 KB Output is correct
9 Correct 494 ms 13636 KB Output is correct
10 Correct 501 ms 13704 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 487 ms 13304 KB Output is correct
2 Correct 494 ms 13544 KB Output is correct
3 Correct 511 ms 13544 KB Output is correct
4 Correct 533 ms 13544 KB Output is correct
5 Correct 525 ms 13596 KB Output is correct
6 Correct 533 ms 13636 KB Output is correct
7 Correct 531 ms 13636 KB Output is correct
8 Correct 528 ms 13636 KB Output is correct
9 Correct 494 ms 13636 KB Output is correct
10 Correct 501 ms 13704 KB Output is correct
11 Correct 954 ms 27252 KB Output is correct
12 Correct 949 ms 27252 KB Output is correct
13 Correct 891 ms 27252 KB Output is correct
14 Correct 920 ms 27252 KB Output is correct
15 Correct 972 ms 27252 KB Output is correct
16 Correct 999 ms 27252 KB Output is correct
17 Correct 977 ms 27252 KB Output is correct
18 Correct 893 ms 28228 KB Output is correct
19 Correct 899 ms 28228 KB Output is correct
20 Correct 1093 ms 28228 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 487 ms 13304 KB Output is correct
2 Correct 494 ms 13544 KB Output is correct
3 Correct 511 ms 13544 KB Output is correct
4 Correct 533 ms 13544 KB Output is correct
5 Correct 525 ms 13596 KB Output is correct
6 Correct 533 ms 13636 KB Output is correct
7 Correct 531 ms 13636 KB Output is correct
8 Correct 528 ms 13636 KB Output is correct
9 Correct 494 ms 13636 KB Output is correct
10 Correct 501 ms 13704 KB Output is correct
11 Correct 954 ms 27252 KB Output is correct
12 Correct 949 ms 27252 KB Output is correct
13 Correct 891 ms 27252 KB Output is correct
14 Correct 920 ms 27252 KB Output is correct
15 Correct 972 ms 27252 KB Output is correct
16 Correct 999 ms 27252 KB Output is correct
17 Correct 977 ms 27252 KB Output is correct
18 Correct 893 ms 28228 KB Output is correct
19 Correct 899 ms 28228 KB Output is correct
20 Correct 1093 ms 28228 KB Output is correct
21 Correct 1080 ms 28228 KB Output is correct
22 Correct 1032 ms 28228 KB Output is correct
23 Correct 1028 ms 28228 KB Output is correct
24 Correct 1012 ms 28228 KB Output is correct
25 Correct 946 ms 28488 KB Output is correct
26 Correct 1048 ms 28488 KB Output is correct
27 Correct 1058 ms 28488 KB Output is correct
28 Correct 942 ms 29384 KB Output is correct
29 Correct 982 ms 29384 KB Output is correct
30 Correct 1053 ms 29384 KB Output is correct
31 Correct 977 ms 29384 KB Output is correct
32 Correct 1027 ms 29384 KB Output is correct
33 Correct 1039 ms 29384 KB Output is correct
34 Correct 1018 ms 29384 KB Output is correct
35 Correct 971 ms 29384 KB Output is correct
36 Correct 935 ms 29384 KB Output is correct
37 Correct 984 ms 29384 KB Output is correct
38 Correct 951 ms 29384 KB Output is correct
39 Correct 1062 ms 29384 KB Output is correct
40 Correct 958 ms 29384 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 487 ms 13304 KB Output is correct
2 Correct 494 ms 13544 KB Output is correct
3 Correct 511 ms 13544 KB Output is correct
4 Correct 533 ms 13544 KB Output is correct
5 Correct 525 ms 13596 KB Output is correct
6 Correct 533 ms 13636 KB Output is correct
7 Correct 531 ms 13636 KB Output is correct
8 Correct 528 ms 13636 KB Output is correct
9 Correct 494 ms 13636 KB Output is correct
10 Correct 501 ms 13704 KB Output is correct
11 Correct 596 ms 29384 KB Output is correct
12 Correct 598 ms 29384 KB Output is correct
13 Correct 566 ms 29384 KB Output is correct
14 Correct 555 ms 29384 KB Output is correct
15 Correct 650 ms 29384 KB Output is correct
16 Correct 588 ms 29384 KB Output is correct
17 Correct 576 ms 29384 KB Output is correct
18 Correct 512 ms 29384 KB Output is correct
19 Correct 515 ms 29384 KB Output is correct
20 Correct 585 ms 29384 KB Output is correct
21 Correct 594 ms 29384 KB Output is correct
22 Correct 561 ms 29384 KB Output is correct
23 Correct 645 ms 29384 KB Output is correct
24 Correct 575 ms 29384 KB Output is correct
25 Correct 571 ms 29384 KB Output is correct
26 Correct 487 ms 29384 KB Output is correct
27 Correct 571 ms 29384 KB Output is correct
28 Correct 529 ms 29384 KB Output is correct
29 Correct 552 ms 29384 KB Output is correct
30 Correct 554 ms 29384 KB Output is correct
31 Correct 564 ms 29384 KB Output is correct
32 Correct 573 ms 29384 KB Output is correct
33 Correct 586 ms 29384 KB Output is correct
34 Correct 490 ms 29384 KB Output is correct
35 Correct 608 ms 29384 KB Output is correct
36 Correct 568 ms 29384 KB Output is correct
37 Correct 561 ms 29384 KB Output is correct
38 Correct 591 ms 29384 KB Output is correct
39 Correct 563 ms 29384 KB Output is correct
40 Correct 573 ms 29384 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 487 ms 13304 KB Output is correct
2 Correct 494 ms 13544 KB Output is correct
3 Correct 511 ms 13544 KB Output is correct
4 Correct 533 ms 13544 KB Output is correct
5 Correct 525 ms 13596 KB Output is correct
6 Correct 533 ms 13636 KB Output is correct
7 Correct 531 ms 13636 KB Output is correct
8 Correct 528 ms 13636 KB Output is correct
9 Correct 494 ms 13636 KB Output is correct
10 Correct 501 ms 13704 KB Output is correct
11 Correct 954 ms 27252 KB Output is correct
12 Correct 949 ms 27252 KB Output is correct
13 Correct 891 ms 27252 KB Output is correct
14 Correct 920 ms 27252 KB Output is correct
15 Correct 972 ms 27252 KB Output is correct
16 Correct 999 ms 27252 KB Output is correct
17 Correct 977 ms 27252 KB Output is correct
18 Correct 893 ms 28228 KB Output is correct
19 Correct 899 ms 28228 KB Output is correct
20 Correct 1093 ms 28228 KB Output is correct
21 Correct 1080 ms 28228 KB Output is correct
22 Correct 1032 ms 28228 KB Output is correct
23 Correct 1028 ms 28228 KB Output is correct
24 Correct 1012 ms 28228 KB Output is correct
25 Correct 946 ms 28488 KB Output is correct
26 Correct 1048 ms 28488 KB Output is correct
27 Correct 1058 ms 28488 KB Output is correct
28 Correct 942 ms 29384 KB Output is correct
29 Correct 982 ms 29384 KB Output is correct
30 Correct 1053 ms 29384 KB Output is correct
31 Correct 977 ms 29384 KB Output is correct
32 Correct 1027 ms 29384 KB Output is correct
33 Correct 1039 ms 29384 KB Output is correct
34 Correct 1018 ms 29384 KB Output is correct
35 Correct 971 ms 29384 KB Output is correct
36 Correct 935 ms 29384 KB Output is correct
37 Correct 984 ms 29384 KB Output is correct
38 Correct 951 ms 29384 KB Output is correct
39 Correct 1062 ms 29384 KB Output is correct
40 Correct 958 ms 29384 KB Output is correct
41 Correct 596 ms 29384 KB Output is correct
42 Correct 598 ms 29384 KB Output is correct
43 Correct 566 ms 29384 KB Output is correct
44 Correct 555 ms 29384 KB Output is correct
45 Correct 650 ms 29384 KB Output is correct
46 Correct 588 ms 29384 KB Output is correct
47 Correct 576 ms 29384 KB Output is correct
48 Correct 512 ms 29384 KB Output is correct
49 Correct 515 ms 29384 KB Output is correct
50 Correct 585 ms 29384 KB Output is correct
51 Correct 594 ms 29384 KB Output is correct
52 Correct 561 ms 29384 KB Output is correct
53 Correct 645 ms 29384 KB Output is correct
54 Correct 575 ms 29384 KB Output is correct
55 Correct 571 ms 29384 KB Output is correct
56 Correct 487 ms 29384 KB Output is correct
57 Correct 571 ms 29384 KB Output is correct
58 Correct 529 ms 29384 KB Output is correct
59 Correct 552 ms 29384 KB Output is correct
60 Correct 554 ms 29384 KB Output is correct
61 Correct 564 ms 29384 KB Output is correct
62 Correct 573 ms 29384 KB Output is correct
63 Correct 586 ms 29384 KB Output is correct
64 Correct 490 ms 29384 KB Output is correct
65 Correct 608 ms 29384 KB Output is correct
66 Correct 568 ms 29384 KB Output is correct
67 Correct 561 ms 29384 KB Output is correct
68 Correct 591 ms 29384 KB Output is correct
69 Correct 563 ms 29384 KB Output is correct
70 Correct 573 ms 29384 KB Output is correct
71 Correct 1504 ms 30672 KB Output is correct
72 Correct 1671 ms 30940 KB Output is correct
73 Correct 1652 ms 30940 KB Output is correct
74 Correct 1903 ms 30940 KB Output is correct
75 Execution timed out 2011 ms 31836 KB Time limit exceeded
76 Halted 0 ms 0 KB -