oj.uz

Submission #160142

# Submission time Handle Problem Language Result Execution time Memory
160142 2019-10-26T07:10:44 Z GioChkhaidze Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 32612 KB 
#pragma GCC optimize ("O3")
#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
using namespace std;
const int Q=1e6+5;
const int M20=1048576;
const int M13=1594323;
int n,q,C[M20+5],M[15],dp[M13+5],ANS[Q],Y[Q],Last2[M13+5],Boz[Q],Boz2[Q],x,ko,K,i,j,k,Mid;	
string S,s;
char c;
main () { 
	ios::sync_with_stdio(false);
	cin>>n>>q;
	
	M[0]=1;
	for (int i=1; i<=13; i++) 
		M[i]=M[i-1]*3;
	
	Mid=13;
	
	if (n<=Mid) {	
		for (i=0; i<(1<<n); i++) {
			cin>>c;
			C[i]=c-'0';
			
			x=0;
			for (j=0; j<n; j++) 
				if (i&(1<<j)) x+=M[j];
			dp[x]+=C[i];
		}
		
		for (i=0; i<M[n]; i++) {
			x=i;
			for (j=n-1; j>=0; j--) 
				if (x>=2*M[j]) x-=2*M[j],dp[i]=(dp[i-2*M[j]]+dp[i-M[j]]);	
					else
				if (x>=M[j]) x-=M[j];
		}
		
		for (i=1; i<=q; i++) {
			x=0;
			cin>>s;			
			for (j=0; j<s.size(); j++) 
				if (s[s.size()-j-1]=='?') x+=2*M[j];	
					else
				if (s[s.size()-j-1]=='1') x+=M[j];
			printf("%d\n",dp[x]);
		}
	}
		else {
		for (i=0; i<(1<<n); i++) {
			cin>>c;
			C[i]=c-'0';
		}

		K=(n-Mid);
		
		for (i=1; i<=q; i++) {
			cin>>S;	
			
			for (k=S.size()-1; k>=K; k--) {
				if (S[k]=='?') Y[i]+=2*M[S.size()-1-k];	
					else
				if (S[k]=='1') Y[i]+=M[S.size()-1-k];
			}
			
			for (k=0; k<K; k++)
				if (S[K-k-1]=='?') Boz2[i]+=(1<<(k));
					else
				if (S[K-k-1]=='1') Boz[i]+=(1<<(k));
		}
		
		for (i=0; i<M[Mid]; i++) {
			x=i;
			Last2[i]=-1;
			for (j=Mid-1; j>=0; j--) 
				if (x>=2*M[j]) { Last2[i]=j; break; }
						else
				if (x>=M[j]) x-=M[j];
		}
		
		for (i=0; i<(1<<K); i++) {
			for (int j=0; j<M[Mid]; j++)
				dp[j]=0;

			for (j=0; j<(1<<Mid); j++) {
				x=0;
				for (k=0; k<Mid; k++) 
					if (j&(1<<k)) x+=M[k];
				dp[x]=C[i*(1<<Mid)+j];
			}
			
			for (j=0; j<M[Mid]; j++) 
				if (Last2[j]!=-1) dp[j]=(dp[j-2*M[Last2[j]]]+dp[j-M[Last2[j]]]);	
			
			for (j=1; j<=q; j++) {
				ko=0;
				for (k=0; k<K; k++) {
					if (Boz2[j]&(1<<k)) continue;
					if (!((Boz[j]^i)&(1<<k))) continue;
					ko=1; 
					break;
				}
				
				if (!ko) ANS[j]+=dp[Y[j]];
			}
		}
		
		for (i=1; i<=q; i++) 
			printf("%d\n",ANS[i]);		
	}
}

Compilation message

snake_escaping.cpp:11:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () { 
       ^
snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:43:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (j=0; j<s.size(); j++) 
              ~^~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 5 ms 604 KB Output is correct
3 Correct 4 ms 632 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 5 ms 632 KB Output is correct
6 Correct 4 ms 632 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 4 ms 636 KB Output is correct
9 Correct 4 ms 632 KB Output is correct
10 Correct 4 ms 632 KB Output is correct
11 Correct 253 ms 4600 KB Output is correct
12 Correct 277 ms 4220 KB Output is correct
13 Correct 281 ms 3684 KB Output is correct
14 Correct 290 ms 3704 KB Output is correct
15 Correct 279 ms 4728 KB Output is correct
16 Correct 302 ms 3832 KB Output is correct
17 Correct 299 ms 3832 KB Output is correct
18 Correct 206 ms 5788 KB Output is correct
19 Correct 259 ms 2572 KB Output is correct
20 Correct 272 ms 4344 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 5 ms 604 KB Output is correct
3 Correct 4 ms 632 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 5 ms 632 KB Output is correct
6 Correct 4 ms 632 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 4 ms 636 KB Output is correct
9 Correct 4 ms 632 KB Output is correct
10 Correct 4 ms 632 KB Output is correct
11 Correct 253 ms 4600 KB Output is correct
12 Correct 277 ms 4220 KB Output is correct
13 Correct 281 ms 3684 KB Output is correct
14 Correct 290 ms 3704 KB Output is correct
15 Correct 279 ms 4728 KB Output is correct
16 Correct 302 ms 3832 KB Output is correct
17 Correct 299 ms 3832 KB Output is correct
18 Correct 206 ms 5788 KB Output is correct
19 Correct 259 ms 2572 KB Output is correct
20 Correct 272 ms 4344 KB Output is correct
21 Correct 359 ms 10772 KB Output is correct
22 Correct 379 ms 10872 KB Output is correct
23 Correct 451 ms 9832 KB Output is correct
24 Correct 447 ms 9720 KB Output is correct
25 Correct 384 ms 11768 KB Output is correct
26 Correct 481 ms 10160 KB Output is correct
27 Correct 496 ms 10244 KB Output is correct
28 Correct 289 ms 12728 KB Output is correct
29 Correct 356 ms 8724 KB Output is correct
30 Correct 385 ms 11000 KB Output is correct
31 Correct 466 ms 10744 KB Output is correct
32 Correct 460 ms 10616 KB Output is correct
33 Correct 374 ms 9600 KB Output is correct
34 Correct 465 ms 9700 KB Output is correct
35 Correct 495 ms 10208 KB Output is correct
36 Correct 273 ms 8568 KB Output is correct
37 Correct 355 ms 10792 KB Output is correct
38 Correct 356 ms 8672 KB Output is correct
39 Correct 430 ms 9848 KB Output is correct
40 Correct 443 ms 9648 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 5 ms 604 KB Output is correct
3 Correct 4 ms 632 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 5 ms 632 KB Output is correct
6 Correct 4 ms 632 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 4 ms 636 KB Output is correct
9 Correct 4 ms 632 KB Output is correct
10 Correct 4 ms 632 KB Output is correct
11 Correct 869 ms 18028 KB Output is correct
12 Correct 692 ms 17912 KB Output is correct
13 Correct 677 ms 17912 KB Output is correct
14 Correct 714 ms 17996 KB Output is correct
15 Correct 804 ms 18040 KB Output is correct
16 Correct 725 ms 17912 KB Output is correct
17 Correct 747 ms 18040 KB Output is correct
18 Correct 601 ms 17912 KB Output is correct
19 Correct 647 ms 17660 KB Output is correct
20 Correct 691 ms 18032 KB Output is correct
21 Correct 745 ms 18036 KB Output is correct
22 Correct 710 ms 17904 KB Output is correct
23 Correct 644 ms 17900 KB Output is correct
24 Correct 701 ms 17904 KB Output is correct
25 Correct 711 ms 17904 KB Output is correct
26 Correct 575 ms 17628 KB Output is correct
27 Correct 707 ms 17836 KB Output is correct
28 Correct 678 ms 17580 KB Output is correct
29 Correct 682 ms 17916 KB Output is correct
30 Correct 702 ms 17900 KB Output is correct
31 Correct 649 ms 17912 KB Output is correct
32 Correct 713 ms 17904 KB Output is correct
33 Correct 708 ms 17912 KB Output is correct
34 Correct 571 ms 17184 KB Output is correct
35 Correct 724 ms 17904 KB Output is correct
36 Correct 713 ms 17904 KB Output is correct
37 Correct 714 ms 17916 KB Output is correct
38 Correct 709 ms 17908 KB Output is correct
39 Correct 714 ms 17912 KB Output is correct
40 Correct 719 ms 17912 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 5 ms 604 KB Output is correct
3 Correct 4 ms 632 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 5 ms 632 KB Output is correct
6 Correct 4 ms 632 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 4 ms 636 KB Output is correct
9 Correct 4 ms 632 KB Output is correct
10 Correct 4 ms 632 KB Output is correct
11 Correct 253 ms 4600 KB Output is correct
12 Correct 277 ms 4220 KB Output is correct
13 Correct 281 ms 3684 KB Output is correct
14 Correct 290 ms 3704 KB Output is correct
15 Correct 279 ms 4728 KB Output is correct
16 Correct 302 ms 3832 KB Output is correct
17 Correct 299 ms 3832 KB Output is correct
18 Correct 206 ms 5788 KB Output is correct
19 Correct 259 ms 2572 KB Output is correct
20 Correct 272 ms 4344 KB Output is correct
21 Correct 359 ms 10772 KB Output is correct
22 Correct 379 ms 10872 KB Output is correct
23 Correct 451 ms 9832 KB Output is correct
24 Correct 447 ms 9720 KB Output is correct
25 Correct 384 ms 11768 KB Output is correct
26 Correct 481 ms 10160 KB Output is correct
27 Correct 496 ms 10244 KB Output is correct
28 Correct 289 ms 12728 KB Output is correct
29 Correct 356 ms 8724 KB Output is correct
30 Correct 385 ms 11000 KB Output is correct
31 Correct 466 ms 10744 KB Output is correct
32 Correct 460 ms 10616 KB Output is correct
33 Correct 374 ms 9600 KB Output is correct
34 Correct 465 ms 9700 KB Output is correct
35 Correct 495 ms 10208 KB Output is correct
36 Correct 273 ms 8568 KB Output is correct
37 Correct 355 ms 10792 KB Output is correct
38 Correct 356 ms 8672 KB Output is correct
39 Correct 430 ms 9848 KB Output is correct
40 Correct 443 ms 9648 KB Output is correct
41 Correct 869 ms 18028 KB Output is correct
42 Correct 692 ms 17912 KB Output is correct
43 Correct 677 ms 17912 KB Output is correct
44 Correct 714 ms 17996 KB Output is correct
45 Correct 804 ms 18040 KB Output is correct
46 Correct 725 ms 17912 KB Output is correct
47 Correct 747 ms 18040 KB Output is correct
48 Correct 601 ms 17912 KB Output is correct
49 Correct 647 ms 17660 KB Output is correct
50 Correct 691 ms 18032 KB Output is correct
51 Correct 745 ms 18036 KB Output is correct
52 Correct 710 ms 17904 KB Output is correct
53 Correct 644 ms 17900 KB Output is correct
54 Correct 701 ms 17904 KB Output is correct
55 Correct 711 ms 17904 KB Output is correct
56 Correct 575 ms 17628 KB Output is correct
57 Correct 707 ms 17836 KB Output is correct
58 Correct 678 ms 17580 KB Output is correct
59 Correct 682 ms 17916 KB Output is correct
60 Correct 702 ms 17900 KB Output is correct
61 Correct 649 ms 17912 KB Output is correct
62 Correct 713 ms 17904 KB Output is correct
63 Correct 708 ms 17912 KB Output is correct
64 Correct 571 ms 17184 KB Output is correct
65 Correct 724 ms 17904 KB Output is correct
66 Correct 713 ms 17904 KB Output is correct
67 Correct 714 ms 17916 KB Output is correct
68 Correct 709 ms 17908 KB Output is correct
69 Correct 714 ms 17912 KB Output is correct
70 Correct 719 ms 17912 KB Output is correct
71 Execution timed out 2049 ms 32612 KB Time limit exceeded
72 Halted 0 ms 0 KB -