oj.uz

Submission #160134

# Submission time Handle Problem Language Result Execution time Memory
160134 2019-10-26T06:38:21 Z GioChkhaidze Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 770 ms 65536 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],x,ko,K,i,j,k,Mid;	
bool Bo[Q][(1<<7)+5];
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 (j=0; j<(1<<K); j++) {
				ko=0;
				for (k=0; k<K; k++)
					if ((S[K-k-1]=='1' && (!((1<<k)&j))) ||
					    (S[K-k-1]=='0' && (((1<<k)&j)))) { ko=1; break; }
					    
				Bo[i][j]=(!ko);	    
			}
		}
		
		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 (int 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++) {
				x=j;
				if (Last2[j]==-1) continue;
				dp[j]=(dp[j-2*M[Last2[j]]]+dp[j-M[Last2[j]]]);	
			}
			
			for (j=1; j<=q; j++) {
				if (!Bo[j][i]) continue;
				ANS[j]+=dp[Y[j]];
			}
		}
		
		for (i=1; i<=q; i++) 
			printf("%d\n",ANS[i]);		
	}
}

Compilation message

snake_escaping.cpp:12:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () { 
       ^
snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:44: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 4 ms 632 KB Output is correct
3 Correct 5 ms 632 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 4 ms 632 KB Output is correct
6 Correct 4 ms 632 KB Output is correct
7 Correct 4 ms 632 KB Output is correct
8 Correct 4 ms 632 KB Output is correct
9 Correct 5 ms 636 KB Output is correct
10 Correct 5 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 4 ms 632 KB Output is correct
3 Correct 5 ms 632 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 4 ms 632 KB Output is correct
6 Correct 4 ms 632 KB Output is correct
7 Correct 4 ms 632 KB Output is correct
8 Correct 4 ms 632 KB Output is correct
9 Correct 5 ms 636 KB Output is correct
10 Correct 5 ms 632 KB Output is correct
11 Correct 254 ms 4652 KB Output is correct
12 Correct 274 ms 4392 KB Output is correct
13 Correct 278 ms 3576 KB Output is correct
14 Correct 285 ms 3672 KB Output is correct
15 Correct 276 ms 4600 KB Output is correct
16 Correct 292 ms 3932 KB Output is correct
17 Correct 294 ms 3832 KB Output is correct
18 Correct 206 ms 5668 KB Output is correct
19 Correct 249 ms 2552 KB Output is correct
20 Correct 280 ms 4472 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 4 ms 632 KB Output is correct
3 Correct 5 ms 632 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 4 ms 632 KB Output is correct
6 Correct 4 ms 632 KB Output is correct
7 Correct 4 ms 632 KB Output is correct
8 Correct 4 ms 632 KB Output is correct
9 Correct 5 ms 636 KB Output is correct
10 Correct 5 ms 632 KB Output is correct
11 Correct 254 ms 4652 KB Output is correct
12 Correct 274 ms 4392 KB Output is correct
13 Correct 278 ms 3576 KB Output is correct
14 Correct 285 ms 3672 KB Output is correct
15 Correct 276 ms 4600 KB Output is correct
16 Correct 292 ms 3932 KB Output is correct
17 Correct 294 ms 3832 KB Output is correct
18 Correct 206 ms 5668 KB Output is correct
19 Correct 249 ms 2552 KB Output is correct
20 Correct 280 ms 4472 KB Output is correct
21 Correct 358 ms 10720 KB Output is correct
22 Correct 378 ms 10804 KB Output is correct
23 Correct 462 ms 10032 KB Output is correct
24 Correct 460 ms 9684 KB Output is correct
25 Correct 404 ms 11644 KB Output is correct
26 Correct 469 ms 10292 KB Output is correct
27 Correct 504 ms 10144 KB Output is correct
28 Correct 285 ms 12668 KB Output is correct
29 Correct 396 ms 8656 KB Output is correct
30 Correct 385 ms 10868 KB Output is correct
31 Correct 471 ms 10624 KB Output is correct
32 Correct 485 ms 10792 KB Output is correct
33 Correct 387 ms 9804 KB Output is correct
34 Correct 450 ms 9720 KB Output is correct
35 Correct 487 ms 10104 KB Output is correct
36 Correct 283 ms 8776 KB Output is correct
37 Correct 364 ms 10616 KB Output is correct
38 Correct 360 ms 8684 KB Output is correct
39 Correct 451 ms 9924 KB Output is correct
40 Correct 440 ms 9720 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 4 ms 632 KB Output is correct
3 Correct 5 ms 632 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 4 ms 632 KB Output is correct
6 Correct 4 ms 632 KB Output is correct
7 Correct 4 ms 632 KB Output is correct
8 Correct 4 ms 632 KB Output is correct
9 Correct 5 ms 636 KB Output is correct
10 Correct 5 ms 632 KB Output is correct
11 Correct 666 ms 24052 KB Output is correct
12 Correct 664 ms 24156 KB Output is correct
13 Correct 679 ms 24056 KB Output is correct
14 Correct 660 ms 24028 KB Output is correct
15 Correct 770 ms 24188 KB Output is correct
16 Correct 716 ms 24028 KB Output is correct
17 Correct 711 ms 24184 KB Output is correct
18 Correct 705 ms 24184 KB Output is correct
19 Correct 675 ms 24056 KB Output is correct
20 Correct 672 ms 24188 KB Output is correct
21 Correct 696 ms 24272 KB Output is correct
22 Correct 695 ms 24096 KB Output is correct
23 Correct 677 ms 24056 KB Output is correct
24 Correct 678 ms 24056 KB Output is correct
25 Correct 701 ms 24108 KB Output is correct
26 Correct 641 ms 23928 KB Output is correct
27 Correct 663 ms 24184 KB Output is correct
28 Correct 656 ms 23928 KB Output is correct
29 Correct 690 ms 24008 KB Output is correct
30 Correct 717 ms 24056 KB Output is correct
31 Correct 664 ms 24116 KB Output is correct
32 Correct 707 ms 24056 KB Output is correct
33 Correct 718 ms 24056 KB Output is correct
34 Correct 633 ms 23800 KB Output is correct
35 Correct 701 ms 24152 KB Output is correct
36 Correct 693 ms 24056 KB Output is correct
37 Correct 672 ms 24056 KB Output is correct
38 Correct 660 ms 24172 KB Output is correct
39 Correct 669 ms 24056 KB Output is correct
40 Correct 677 ms 24060 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 4 ms 632 KB Output is correct
3 Correct 5 ms 632 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 4 ms 632 KB Output is correct
6 Correct 4 ms 632 KB Output is correct
7 Correct 4 ms 632 KB Output is correct
8 Correct 4 ms 632 KB Output is correct
9 Correct 5 ms 636 KB Output is correct
10 Correct 5 ms 632 KB Output is correct
11 Correct 254 ms 4652 KB Output is correct
12 Correct 274 ms 4392 KB Output is correct
13 Correct 278 ms 3576 KB Output is correct
14 Correct 285 ms 3672 KB Output is correct
15 Correct 276 ms 4600 KB Output is correct
16 Correct 292 ms 3932 KB Output is correct
17 Correct 294 ms 3832 KB Output is correct
18 Correct 206 ms 5668 KB Output is correct
19 Correct 249 ms 2552 KB Output is correct
20 Correct 280 ms 4472 KB Output is correct
21 Correct 358 ms 10720 KB Output is correct
22 Correct 378 ms 10804 KB Output is correct
23 Correct 462 ms 10032 KB Output is correct
24 Correct 460 ms 9684 KB Output is correct
25 Correct 404 ms 11644 KB Output is correct
26 Correct 469 ms 10292 KB Output is correct
27 Correct 504 ms 10144 KB Output is correct
28 Correct 285 ms 12668 KB Output is correct
29 Correct 396 ms 8656 KB Output is correct
30 Correct 385 ms 10868 KB Output is correct
31 Correct 471 ms 10624 KB Output is correct
32 Correct 485 ms 10792 KB Output is correct
33 Correct 387 ms 9804 KB Output is correct
34 Correct 450 ms 9720 KB Output is correct
35 Correct 487 ms 10104 KB Output is correct
36 Correct 283 ms 8776 KB Output is correct
37 Correct 364 ms 10616 KB Output is correct
38 Correct 360 ms 8684 KB Output is correct
39 Correct 451 ms 9924 KB Output is correct
40 Correct 440 ms 9720 KB Output is correct
41 Correct 666 ms 24052 KB Output is correct
42 Correct 664 ms 24156 KB Output is correct
43 Correct 679 ms 24056 KB Output is correct
44 Correct 660 ms 24028 KB Output is correct
45 Correct 770 ms 24188 KB Output is correct
46 Correct 716 ms 24028 KB Output is correct
47 Correct 711 ms 24184 KB Output is correct
48 Correct 705 ms 24184 KB Output is correct
49 Correct 675 ms 24056 KB Output is correct
50 Correct 672 ms 24188 KB Output is correct
51 Correct 696 ms 24272 KB Output is correct
52 Correct 695 ms 24096 KB Output is correct
53 Correct 677 ms 24056 KB Output is correct
54 Correct 678 ms 24056 KB Output is correct
55 Correct 701 ms 24108 KB Output is correct
56 Correct 641 ms 23928 KB Output is correct
57 Correct 663 ms 24184 KB Output is correct
58 Correct 656 ms 23928 KB Output is correct
59 Correct 690 ms 24008 KB Output is correct
60 Correct 717 ms 24056 KB Output is correct
61 Correct 664 ms 24116 KB Output is correct
62 Correct 707 ms 24056 KB Output is correct
63 Correct 718 ms 24056 KB Output is correct
64 Correct 633 ms 23800 KB Output is correct
65 Correct 701 ms 24152 KB Output is correct
66 Correct 693 ms 24056 KB Output is correct
67 Correct 672 ms 24056 KB Output is correct
68 Correct 660 ms 24172 KB Output is correct
69 Correct 669 ms 24056 KB Output is correct
70 Correct 677 ms 24060 KB Output is correct
71 Runtime error 682 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
72 Halted 0 ms 0 KB -