oj.uz

Submission #160148

# Submission time Handle Problem Language Result Execution time Memory
160148 2019-10-26T07:17:33 Z GioChkhaidze Snake Escaping (JOI18_snake_escaping) C++14
22 / 100
 2000 ms 12792 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 {
		
		while (!('0'<=c && c<='9')) c=getchar();	
			
		for (i=0; i<(1<<n); i++) {
			C[i]=c-'0';
			c=getchar();	
		}

		K=(n-Mid);
		
		for (i=1; i<=q; i++) {
			S="";
			while (c!='0' && c!='1' && c!='?') c=getchar();
			while (c=='0' || c=='1' || c=='?')  {
				S+=c;
				c=getchar();
			}
				
			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 4 ms 632 KB Output is correct
3 Correct 5 ms 532 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 4 ms 632 KB Output is correct
6 Correct 5 ms 632 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 5 ms 632 KB Output is correct
9 Correct 5 ms 632 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 532 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 4 ms 632 KB Output is correct
6 Correct 5 ms 632 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 5 ms 632 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 5 ms 632 KB Output is correct
11 Correct 254 ms 4572 KB Output is correct
12 Correct 273 ms 4284 KB Output is correct
13 Correct 279 ms 3576 KB Output is correct
14 Correct 283 ms 3556 KB Output is correct
15 Correct 276 ms 4600 KB Output is correct
16 Correct 293 ms 3832 KB Output is correct
17 Correct 299 ms 3832 KB Output is correct
18 Correct 215 ms 5624 KB Output is correct
19 Correct 251 ms 2552 KB Output is correct
20 Correct 275 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 4 ms 632 KB Output is correct
3 Correct 5 ms 532 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 4 ms 632 KB Output is correct
6 Correct 5 ms 632 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 5 ms 632 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 5 ms 632 KB Output is correct
11 Correct 254 ms 4572 KB Output is correct
12 Correct 273 ms 4284 KB Output is correct
13 Correct 279 ms 3576 KB Output is correct
14 Correct 283 ms 3556 KB Output is correct
15 Correct 276 ms 4600 KB Output is correct
16 Correct 293 ms 3832 KB Output is correct
17 Correct 299 ms 3832 KB Output is correct
18 Correct 215 ms 5624 KB Output is correct
19 Correct 251 ms 2552 KB Output is correct
20 Correct 275 ms 4344 KB Output is correct
21 Correct 357 ms 10896 KB Output is correct
22 Correct 378 ms 10776 KB Output is correct
23 Correct 446 ms 9788 KB Output is correct
24 Correct 539 ms 9864 KB Output is correct
25 Correct 401 ms 11640 KB Output is correct
26 Correct 475 ms 10076 KB Output is correct
27 Correct 494 ms 10192 KB Output is correct
28 Correct 292 ms 12792 KB Output is correct
29 Correct 362 ms 8696 KB Output is correct
30 Correct 372 ms 10836 KB Output is correct
31 Correct 463 ms 10872 KB Output is correct
32 Correct 453 ms 10696 KB Output is correct
33 Correct 375 ms 9632 KB Output is correct
34 Correct 468 ms 9976 KB Output is correct
35 Correct 516 ms 10104 KB Output is correct
36 Correct 277 ms 8696 KB Output is correct
37 Correct 364 ms 10872 KB Output is correct
38 Correct 365 ms 8696 KB Output is correct
39 Correct 459 ms 9908 KB Output is correct
40 Correct 456 ms 9720 KB Output is correct

Subtask #4
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 532 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 4 ms 632 KB Output is correct
6 Correct 5 ms 632 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 5 ms 632 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 5 ms 632 KB Output is correct
11 Execution timed out 2041 ms 5112 KB Time limit exceeded
12 Halted 0 ms 0 KB -

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 532 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 4 ms 632 KB Output is correct
6 Correct 5 ms 632 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 5 ms 632 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 5 ms 632 KB Output is correct
11 Correct 254 ms 4572 KB Output is correct
12 Correct 273 ms 4284 KB Output is correct
13 Correct 279 ms 3576 KB Output is correct
14 Correct 283 ms 3556 KB Output is correct
15 Correct 276 ms 4600 KB Output is correct
16 Correct 293 ms 3832 KB Output is correct
17 Correct 299 ms 3832 KB Output is correct
18 Correct 215 ms 5624 KB Output is correct
19 Correct 251 ms 2552 KB Output is correct
20 Correct 275 ms 4344 KB Output is correct
21 Correct 357 ms 10896 KB Output is correct
22 Correct 378 ms 10776 KB Output is correct
23 Correct 446 ms 9788 KB Output is correct
24 Correct 539 ms 9864 KB Output is correct
25 Correct 401 ms 11640 KB Output is correct
26 Correct 475 ms 10076 KB Output is correct
27 Correct 494 ms 10192 KB Output is correct
28 Correct 292 ms 12792 KB Output is correct
29 Correct 362 ms 8696 KB Output is correct
30 Correct 372 ms 10836 KB Output is correct
31 Correct 463 ms 10872 KB Output is correct
32 Correct 453 ms 10696 KB Output is correct
33 Correct 375 ms 9632 KB Output is correct
34 Correct 468 ms 9976 KB Output is correct
35 Correct 516 ms 10104 KB Output is correct
36 Correct 277 ms 8696 KB Output is correct
37 Correct 364 ms 10872 KB Output is correct
38 Correct 365 ms 8696 KB Output is correct
39 Correct 459 ms 9908 KB Output is correct
40 Correct 456 ms 9720 KB Output is correct
41 Execution timed out 2041 ms 5112 KB Time limit exceeded
42 Halted 0 ms 0 KB -