oj.uz

답안 #548472

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
548472 2022-04-13T13:51:32 Z MilosMilutinovic Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 60160 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N=(1<<20)+5;
const int M=1600050;
const int Q=1000050;
int l,n,q,lst[M],pw[20],ans[Q],dp[M],msk[N],qmask[Q],omask[Q],qv[Q];
char s[N],qs[25];
void calc(){
	pw[0]=1;
	for(int i=1;i<14;i++)pw[i]=pw[i-1]*3;
	for(int i=0;i<M;i++){
		vector<int> bits;
		int x=i;
		while(x>0)bits.push_back(x%3),x/=3;
		lst[i]=-1;
		for(int j=0;j<bits.size();j++)if(bits[j]==2)lst[i]=j;
	}
}
void BruteForce(){
	memset(dp,0,sizeof *dp);
	for(int i=0;i<n;i++){
		int sum=0,x=i,b=0;
		while(x>0)sum+=(x%2)*pw[b++],x/=2;
		dp[sum]+=(int)(s[i]-'0');
	}
	for(int i=0;i<M;i++)if(lst[i]!=-1){
		dp[i]+=dp[i-2*pw[lst[i]]];
		dp[i]+=dp[i-pw[lst[i]]];
	}
	while(q--){
		scanf("%s",qs);
		int sum=0;
		for(int i=0;i<l;i++)sum+=(qs[i]=='0'?0:(qs[i]=='1'?1:2))*pw[l-i-1];
		printf("%i\n",dp[sum]);
	}
}
int main(){
	scanf("%i%i",&l,&q);
	scanf("%s",s);
	n=(1<<l),calc();
	if(l<=13){
		BruteForce();
		return 0;
	}
	for(int i=0;i<n;i++){
		vector<int> bits;
		int x=i;
		while(x>0)bits.pb(x%2),x/=2;
		while(bits.size()<l)bits.pb(0);
		reverse(bits.begin(),bits.end());
		msk[i]=0;
		for(int j=7;j<l;j++)msk[i]+=bits[j]*pw[j-7];
	}
	for(int i=1;i<=q;i++){
		scanf("%s",qs);
		qv[i]=0;
		for(int j=7;j<l;j++)qv[i]+=(qs[j]=='0'?0:(qs[j]=='1'?1:2))*pw[j-7];
		qmask[i]=0;
		for(int b=0;b<7;b++)if(qs[b]!='0')qmask[i]+=(1<<(6-b));
		for(int b=0;b<7;b++)if(qs[b]=='1')omask[i]+=(1<<(6-b));
	}
	for(int i=0;i<128;i++){
		for(int j=0;j<M;j++)dp[j]=0;
		for(int j=0;j<n;j++)if(((j>>(l-7))&127)==i)dp[msk[j]]+=(int)(s[j]-'0');
		for(int j=0;j<M;j++)if(lst[j]!=-1){
			dp[j]+=dp[j-2*pw[lst[j]]];
			dp[j]+=dp[j-pw[lst[j]]];
		}
		for(int j=1;j<=q;j++)if((qmask[j]&i)==i&&(omask[j]|i)==i)ans[j]+=dp[qv[j]];
	}
	for(int i=1;i<=q;i++)printf("%i\n",ans[i]);
	return 0;
}

Compilation message

snake_escaping.cpp: In function 'void calc()':
snake_escaping.cpp:17:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |   for(int j=0;j<bits.size();j++)if(bits[j]==2)lst[i]=j;
      |               ~^~~~~~~~~~~~
snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:50:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   50 |   while(bits.size()<l)bits.pb(0);
      |         ~~~~~~~~~~~^~
snake_escaping.cpp: In function 'void BruteForce()':
snake_escaping.cpp:32:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |   scanf("%s",qs);
      |   ~~~~~^~~~~~~~~
snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:39:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |  scanf("%i%i",&l,&q);
      |  ~~~~~^~~~~~~~~~~~~~
snake_escaping.cpp:40:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |  scanf("%s",s);
      |  ~~~~~^~~~~~~~
snake_escaping.cpp:56:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |   scanf("%s",qs);
      |   ~~~~~^~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 264 ms 12748 KB Output is correct
2 Correct 262 ms 12848 KB Output is correct
3 Correct 287 ms 12784 KB Output is correct
4 Correct 259 ms 12792 KB Output is correct
5 Correct 338 ms 12700 KB Output is correct
6 Correct 267 ms 12732 KB Output is correct
7 Correct 275 ms 12748 KB Output is correct
8 Correct 266 ms 12876 KB Output is correct
9 Correct 259 ms 12812 KB Output is correct
10 Correct 271 ms 12804 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 264 ms 12748 KB Output is correct
2 Correct 262 ms 12848 KB Output is correct
3 Correct 287 ms 12784 KB Output is correct
4 Correct 259 ms 12792 KB Output is correct
5 Correct 338 ms 12700 KB Output is correct
6 Correct 267 ms 12732 KB Output is correct
7 Correct 275 ms 12748 KB Output is correct
8 Correct 266 ms 12876 KB Output is correct
9 Correct 259 ms 12812 KB Output is correct
10 Correct 271 ms 12804 KB Output is correct
11 Correct 465 ms 16916 KB Output is correct
12 Correct 563 ms 16448 KB Output is correct
13 Correct 492 ms 15676 KB Output is correct
14 Correct 476 ms 15832 KB Output is correct
15 Correct 462 ms 16824 KB Output is correct
16 Correct 507 ms 16060 KB Output is correct
17 Correct 491 ms 16000 KB Output is correct
18 Correct 464 ms 18064 KB Output is correct
19 Correct 480 ms 14800 KB Output is correct
20 Correct 443 ms 16660 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 264 ms 12748 KB Output is correct
2 Correct 262 ms 12848 KB Output is correct
3 Correct 287 ms 12784 KB Output is correct
4 Correct 259 ms 12792 KB Output is correct
5 Correct 338 ms 12700 KB Output is correct
6 Correct 267 ms 12732 KB Output is correct
7 Correct 275 ms 12748 KB Output is correct
8 Correct 266 ms 12876 KB Output is correct
9 Correct 259 ms 12812 KB Output is correct
10 Correct 271 ms 12804 KB Output is correct
11 Correct 465 ms 16916 KB Output is correct
12 Correct 563 ms 16448 KB Output is correct
13 Correct 492 ms 15676 KB Output is correct
14 Correct 476 ms 15832 KB Output is correct
15 Correct 462 ms 16824 KB Output is correct
16 Correct 507 ms 16060 KB Output is correct
17 Correct 491 ms 16000 KB Output is correct
18 Correct 464 ms 18064 KB Output is correct
19 Correct 480 ms 14800 KB Output is correct
20 Correct 443 ms 16660 KB Output is correct
21 Correct 460 ms 16736 KB Output is correct
22 Correct 512 ms 16972 KB Output is correct
23 Correct 502 ms 15944 KB Output is correct
24 Correct 487 ms 15880 KB Output is correct
25 Correct 495 ms 17744 KB Output is correct
26 Correct 521 ms 16252 KB Output is correct
27 Correct 524 ms 16200 KB Output is correct
28 Correct 453 ms 18932 KB Output is correct
29 Correct 508 ms 14784 KB Output is correct
30 Correct 454 ms 17108 KB Output is correct
31 Correct 481 ms 16780 KB Output is correct
32 Correct 489 ms 16800 KB Output is correct
33 Correct 476 ms 15704 KB Output is correct
34 Correct 519 ms 15828 KB Output is correct
35 Correct 539 ms 16204 KB Output is correct
36 Correct 449 ms 14796 KB Output is correct
37 Correct 513 ms 16756 KB Output is correct
38 Correct 513 ms 14920 KB Output is correct
39 Correct 493 ms 15960 KB Output is correct
40 Correct 496 ms 15756 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 264 ms 12748 KB Output is correct
2 Correct 262 ms 12848 KB Output is correct
3 Correct 287 ms 12784 KB Output is correct
4 Correct 259 ms 12792 KB Output is correct
5 Correct 338 ms 12700 KB Output is correct
6 Correct 267 ms 12732 KB Output is correct
7 Correct 275 ms 12748 KB Output is correct
8 Correct 266 ms 12876 KB Output is correct
9 Correct 259 ms 12812 KB Output is correct
10 Correct 271 ms 12804 KB Output is correct
11 Correct 1014 ms 18996 KB Output is correct
12 Correct 1050 ms 20868 KB Output is correct
13 Correct 1163 ms 20908 KB Output is correct
14 Correct 1150 ms 20932 KB Output is correct
15 Correct 1104 ms 21160 KB Output is correct
16 Correct 1126 ms 20980 KB Output is correct
17 Correct 1221 ms 20932 KB Output is correct
18 Correct 1098 ms 20988 KB Output is correct
19 Correct 1147 ms 20800 KB Output is correct
20 Correct 1091 ms 21064 KB Output is correct
21 Correct 1148 ms 20976 KB Output is correct
22 Correct 1185 ms 20932 KB Output is correct
23 Correct 1200 ms 20928 KB Output is correct
24 Correct 1133 ms 20932 KB Output is correct
25 Correct 1103 ms 20932 KB Output is correct
26 Correct 1100 ms 20864 KB Output is correct
27 Correct 1125 ms 20736 KB Output is correct
28 Correct 1143 ms 20896 KB Output is correct
29 Correct 1132 ms 20932 KB Output is correct
30 Correct 1101 ms 20932 KB Output is correct
31 Correct 1114 ms 20936 KB Output is correct
32 Correct 1212 ms 20936 KB Output is correct
33 Correct 1127 ms 20944 KB Output is correct
34 Correct 1114 ms 20604 KB Output is correct
35 Correct 1119 ms 20932 KB Output is correct
36 Correct 1156 ms 20936 KB Output is correct
37 Correct 1141 ms 20936 KB Output is correct
38 Correct 1111 ms 20960 KB Output is correct
39 Correct 1131 ms 20932 KB Output is correct
40 Correct 1132 ms 20900 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 264 ms 12748 KB Output is correct
2 Correct 262 ms 12848 KB Output is correct
3 Correct 287 ms 12784 KB Output is correct
4 Correct 259 ms 12792 KB Output is correct
5 Correct 338 ms 12700 KB Output is correct
6 Correct 267 ms 12732 KB Output is correct
7 Correct 275 ms 12748 KB Output is correct
8 Correct 266 ms 12876 KB Output is correct
9 Correct 259 ms 12812 KB Output is correct
10 Correct 271 ms 12804 KB Output is correct
11 Correct 465 ms 16916 KB Output is correct
12 Correct 563 ms 16448 KB Output is correct
13 Correct 492 ms 15676 KB Output is correct
14 Correct 476 ms 15832 KB Output is correct
15 Correct 462 ms 16824 KB Output is correct
16 Correct 507 ms 16060 KB Output is correct
17 Correct 491 ms 16000 KB Output is correct
18 Correct 464 ms 18064 KB Output is correct
19 Correct 480 ms 14800 KB Output is correct
20 Correct 443 ms 16660 KB Output is correct
21 Correct 460 ms 16736 KB Output is correct
22 Correct 512 ms 16972 KB Output is correct
23 Correct 502 ms 15944 KB Output is correct
24 Correct 487 ms 15880 KB Output is correct
25 Correct 495 ms 17744 KB Output is correct
26 Correct 521 ms 16252 KB Output is correct
27 Correct 524 ms 16200 KB Output is correct
28 Correct 453 ms 18932 KB Output is correct
29 Correct 508 ms 14784 KB Output is correct
30 Correct 454 ms 17108 KB Output is correct
31 Correct 481 ms 16780 KB Output is correct
32 Correct 489 ms 16800 KB Output is correct
33 Correct 476 ms 15704 KB Output is correct
34 Correct 519 ms 15828 KB Output is correct
35 Correct 539 ms 16204 KB Output is correct
36 Correct 449 ms 14796 KB Output is correct
37 Correct 513 ms 16756 KB Output is correct
38 Correct 513 ms 14920 KB Output is correct
39 Correct 493 ms 15960 KB Output is correct
40 Correct 496 ms 15756 KB Output is correct
41 Correct 1014 ms 18996 KB Output is correct
42 Correct 1050 ms 20868 KB Output is correct
43 Correct 1163 ms 20908 KB Output is correct
44 Correct 1150 ms 20932 KB Output is correct
45 Correct 1104 ms 21160 KB Output is correct
46 Correct 1126 ms 20980 KB Output is correct
47 Correct 1221 ms 20932 KB Output is correct
48 Correct 1098 ms 20988 KB Output is correct
49 Correct 1147 ms 20800 KB Output is correct
50 Correct 1091 ms 21064 KB Output is correct
51 Correct 1148 ms 20976 KB Output is correct
52 Correct 1185 ms 20932 KB Output is correct
53 Correct 1200 ms 20928 KB Output is correct
54 Correct 1133 ms 20932 KB Output is correct
55 Correct 1103 ms 20932 KB Output is correct
56 Correct 1100 ms 20864 KB Output is correct
57 Correct 1125 ms 20736 KB Output is correct
58 Correct 1143 ms 20896 KB Output is correct
59 Correct 1132 ms 20932 KB Output is correct
60 Correct 1101 ms 20932 KB Output is correct
61 Correct 1114 ms 20936 KB Output is correct
62 Correct 1212 ms 20936 KB Output is correct
63 Correct 1127 ms 20944 KB Output is correct
64 Correct 1114 ms 20604 KB Output is correct
65 Correct 1119 ms 20932 KB Output is correct
66 Correct 1156 ms 20936 KB Output is correct
67 Correct 1141 ms 20936 KB Output is correct
68 Correct 1111 ms 20960 KB Output is correct
69 Correct 1131 ms 20932 KB Output is correct
70 Correct 1132 ms 20900 KB Output is correct
71 Correct 1686 ms 60160 KB Output is correct
72 Correct 1738 ms 56428 KB Output is correct
73 Correct 1888 ms 58756 KB Output is correct
74 Execution timed out 2023 ms 55240 KB Time limit exceeded
75 Halted 0 ms 0 KB -