oj.uz

Submission #160141

# Submission time Handle Problem Language Result Execution time Memory
160141 2019-10-26T07:10:16 Z GioChkhaidze Snake Escaping (JOI18_snake_escaping) C++14
5 / 100
 2000 ms 16072 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=2;
	
	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 10 ms 376 KB Output is correct
2 Correct 8 ms 376 KB Output is correct
3 Correct 7 ms 376 KB Output is correct
4 Correct 9 ms 376 KB Output is correct
5 Correct 10 ms 376 KB Output is correct
6 Correct 8 ms 376 KB Output is correct
7 Correct 8 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 8 ms 376 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 376 KB Output is correct
2 Correct 8 ms 376 KB Output is correct
3 Correct 7 ms 376 KB Output is correct
4 Correct 9 ms 376 KB Output is correct
5 Correct 10 ms 376 KB Output is correct
6 Correct 8 ms 376 KB Output is correct
7 Correct 8 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 8 ms 376 KB Output is correct
11 Execution timed out 2037 ms 16072 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 376 KB Output is correct
2 Correct 8 ms 376 KB Output is correct
3 Correct 7 ms 376 KB Output is correct
4 Correct 9 ms 376 KB Output is correct
5 Correct 10 ms 376 KB Output is correct
6 Correct 8 ms 376 KB Output is correct
7 Correct 8 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 8 ms 376 KB Output is correct
11 Execution timed out 2037 ms 16072 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 376 KB Output is correct
2 Correct 8 ms 376 KB Output is correct
3 Correct 7 ms 376 KB Output is correct
4 Correct 9 ms 376 KB Output is correct
5 Correct 10 ms 376 KB Output is correct
6 Correct 8 ms 376 KB Output is correct
7 Correct 8 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 8 ms 376 KB Output is correct
11 Execution timed out 2071 ms 5260 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 376 KB Output is correct
2 Correct 8 ms 376 KB Output is correct
3 Correct 7 ms 376 KB Output is correct
4 Correct 9 ms 376 KB Output is correct
5 Correct 10 ms 376 KB Output is correct
6 Correct 8 ms 376 KB Output is correct
7 Correct 8 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 8 ms 376 KB Output is correct
11 Execution timed out 2037 ms 16072 KB Time limit exceeded
12 Halted 0 ms 0 KB -