oj.uz

답안 #160154

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
160154 2019-10-26T07:38:54 Z GioChkhaidze Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 32660 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.tie(0);
	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: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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 5 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 5 ms 632 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 4 ms 632 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 4 ms 632 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 5 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 5 ms 632 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 4 ms 632 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 4 ms 632 KB Output is correct
11 Correct 256 ms 4648 KB Output is correct
12 Correct 267 ms 4316 KB Output is correct
13 Correct 274 ms 3704 KB Output is correct
14 Correct 280 ms 3640 KB Output is correct
15 Correct 270 ms 4604 KB Output is correct
16 Correct 293 ms 3832 KB Output is correct
17 Correct 293 ms 3812 KB Output is correct
18 Correct 200 ms 5628 KB Output is correct
19 Correct 250 ms 2784 KB Output is correct
20 Correct 260 ms 4216 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 5 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 5 ms 632 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 4 ms 632 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 4 ms 632 KB Output is correct
11 Correct 256 ms 4648 KB Output is correct
12 Correct 267 ms 4316 KB Output is correct
13 Correct 274 ms 3704 KB Output is correct
14 Correct 280 ms 3640 KB Output is correct
15 Correct 270 ms 4604 KB Output is correct
16 Correct 293 ms 3832 KB Output is correct
17 Correct 293 ms 3812 KB Output is correct
18 Correct 200 ms 5628 KB Output is correct
19 Correct 250 ms 2784 KB Output is correct
20 Correct 260 ms 4216 KB Output is correct
21 Correct 361 ms 10800 KB Output is correct
22 Correct 363 ms 10744 KB Output is correct
23 Correct 440 ms 9852 KB Output is correct
24 Correct 522 ms 9736 KB Output is correct
25 Correct 395 ms 11640 KB Output is correct
26 Correct 470 ms 10232 KB Output is correct
27 Correct 470 ms 10076 KB Output is correct
28 Correct 285 ms 12668 KB Output is correct
29 Correct 352 ms 8824 KB Output is correct
30 Correct 377 ms 10924 KB Output is correct
31 Correct 459 ms 10744 KB Output is correct
32 Correct 456 ms 10692 KB Output is correct
33 Correct 381 ms 9568 KB Output is correct
34 Correct 461 ms 9848 KB Output is correct
35 Correct 484 ms 10176 KB Output is correct
36 Correct 282 ms 8576 KB Output is correct
37 Correct 356 ms 10616 KB Output is correct
38 Correct 376 ms 8568 KB Output is correct
39 Correct 528 ms 9832 KB Output is correct
40 Correct 456 ms 9744 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 5 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 5 ms 632 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 4 ms 632 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 4 ms 632 KB Output is correct
11 Correct 678 ms 18032 KB Output is correct
12 Correct 694 ms 17844 KB Output is correct
13 Correct 690 ms 17872 KB Output is correct
14 Correct 738 ms 17904 KB Output is correct
15 Correct 764 ms 18032 KB Output is correct
16 Correct 726 ms 17900 KB Output is correct
17 Correct 725 ms 17912 KB Output is correct
18 Correct 605 ms 17912 KB Output is correct
19 Correct 666 ms 17580 KB Output is correct
20 Correct 710 ms 18040 KB Output is correct
21 Correct 740 ms 18028 KB Output is correct
22 Correct 712 ms 17908 KB Output is correct
23 Correct 671 ms 17900 KB Output is correct
24 Correct 712 ms 17904 KB Output is correct
25 Correct 731 ms 17904 KB Output is correct
26 Correct 581 ms 17632 KB Output is correct
27 Correct 697 ms 17828 KB Output is correct
28 Correct 649 ms 17580 KB Output is correct
29 Correct 691 ms 17912 KB Output is correct
30 Correct 706 ms 17908 KB Output is correct
31 Correct 643 ms 17912 KB Output is correct
32 Correct 712 ms 17908 KB Output is correct
33 Correct 711 ms 17912 KB Output is correct
34 Correct 577 ms 17184 KB Output is correct
35 Correct 709 ms 17904 KB Output is correct
36 Correct 716 ms 17908 KB Output is correct
37 Correct 706 ms 17912 KB Output is correct
38 Correct 713 ms 17912 KB Output is correct
39 Correct 698 ms 17912 KB Output is correct
40 Correct 709 ms 17912 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 5 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 5 ms 632 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 4 ms 632 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 4 ms 632 KB Output is correct
11 Correct 256 ms 4648 KB Output is correct
12 Correct 267 ms 4316 KB Output is correct
13 Correct 274 ms 3704 KB Output is correct
14 Correct 280 ms 3640 KB Output is correct
15 Correct 270 ms 4604 KB Output is correct
16 Correct 293 ms 3832 KB Output is correct
17 Correct 293 ms 3812 KB Output is correct
18 Correct 200 ms 5628 KB Output is correct
19 Correct 250 ms 2784 KB Output is correct
20 Correct 260 ms 4216 KB Output is correct
21 Correct 361 ms 10800 KB Output is correct
22 Correct 363 ms 10744 KB Output is correct
23 Correct 440 ms 9852 KB Output is correct
24 Correct 522 ms 9736 KB Output is correct
25 Correct 395 ms 11640 KB Output is correct
26 Correct 470 ms 10232 KB Output is correct
27 Correct 470 ms 10076 KB Output is correct
28 Correct 285 ms 12668 KB Output is correct
29 Correct 352 ms 8824 KB Output is correct
30 Correct 377 ms 10924 KB Output is correct
31 Correct 459 ms 10744 KB Output is correct
32 Correct 456 ms 10692 KB Output is correct
33 Correct 381 ms 9568 KB Output is correct
34 Correct 461 ms 9848 KB Output is correct
35 Correct 484 ms 10176 KB Output is correct
36 Correct 282 ms 8576 KB Output is correct
37 Correct 356 ms 10616 KB Output is correct
38 Correct 376 ms 8568 KB Output is correct
39 Correct 528 ms 9832 KB Output is correct
40 Correct 456 ms 9744 KB Output is correct
41 Correct 678 ms 18032 KB Output is correct
42 Correct 694 ms 17844 KB Output is correct
43 Correct 690 ms 17872 KB Output is correct
44 Correct 738 ms 17904 KB Output is correct
45 Correct 764 ms 18032 KB Output is correct
46 Correct 726 ms 17900 KB Output is correct
47 Correct 725 ms 17912 KB Output is correct
48 Correct 605 ms 17912 KB Output is correct
49 Correct 666 ms 17580 KB Output is correct
50 Correct 710 ms 18040 KB Output is correct
51 Correct 740 ms 18028 KB Output is correct
52 Correct 712 ms 17908 KB Output is correct
53 Correct 671 ms 17900 KB Output is correct
54 Correct 712 ms 17904 KB Output is correct
55 Correct 731 ms 17904 KB Output is correct
56 Correct 581 ms 17632 KB Output is correct
57 Correct 697 ms 17828 KB Output is correct
58 Correct 649 ms 17580 KB Output is correct
59 Correct 691 ms 17912 KB Output is correct
60 Correct 706 ms 17908 KB Output is correct
61 Correct 643 ms 17912 KB Output is correct
62 Correct 712 ms 17908 KB Output is correct
63 Correct 711 ms 17912 KB Output is correct
64 Correct 577 ms 17184 KB Output is correct
65 Correct 709 ms 17904 KB Output is correct
66 Correct 716 ms 17908 KB Output is correct
67 Correct 706 ms 17912 KB Output is correct
68 Correct 713 ms 17912 KB Output is correct
69 Correct 698 ms 17912 KB Output is correct
70 Correct 709 ms 17912 KB Output is correct
71 Execution timed out 2037 ms 32660 KB Time limit exceeded
72 Halted 0 ms 0 KB -