oj.uz

답안 #548479

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
548479 2022-04-13T14:04:03 Z MilosMilutinovic Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 42644 KB 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N=(1<<20)+5;
const int M=1594327;
const int Q=1000050;
int l,n,q,a[N],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();
	for(int i=0;i<n;i++)a[i]=(int)(s[i]-'0');
	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));
	}
	int nsz=(1<<(l-7));
	for(int i=0;i<128;i++){
		memset(dp,0,M*sizeof *dp);
		for(int j=0;j<nsz;j++)dp[msk[(i<<(l-7))+j]]+=a[(i<<(l-7))+j];
		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:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("O3")
      | 
snake_escaping.cpp:3: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      | 
snake_escaping.cpp: In function 'void calc()':
snake_escaping.cpp:20:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |   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:54:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   54 |   while(bits.size()<l)bits.pb(0);
      |         ~~~~~~~~~~~^~
snake_escaping.cpp: In function 'void BruteForce()':
snake_escaping.cpp:35:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |   scanf("%s",qs);
      |   ~~~~~^~~~~~~~~
snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:42:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |  scanf("%i%i",&l,&q);
      |  ~~~~~^~~~~~~~~~~~~~
snake_escaping.cpp:43:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |  scanf("%s",s);
      |  ~~~~~^~~~~~~~
snake_escaping.cpp:60:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |   scanf("%s",qs);
      |   ~~~~~^~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 297 ms 12788 KB Output is correct
2 Correct 278 ms 12692 KB Output is correct
3 Correct 324 ms 12844 KB Output is correct
4 Correct 310 ms 12748 KB Output is correct
5 Correct 283 ms 12692 KB Output is correct
6 Correct 282 ms 12756 KB Output is correct
7 Correct 313 ms 12784 KB Output is correct
8 Correct 285 ms 12688 KB Output is correct
9 Correct 277 ms 12816 KB Output is correct
10 Correct 281 ms 12692 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 297 ms 12788 KB Output is correct
2 Correct 278 ms 12692 KB Output is correct
3 Correct 324 ms 12844 KB Output is correct
4 Correct 310 ms 12748 KB Output is correct
5 Correct 283 ms 12692 KB Output is correct
6 Correct 282 ms 12756 KB Output is correct
7 Correct 313 ms 12784 KB Output is correct
8 Correct 285 ms 12688 KB Output is correct
9 Correct 277 ms 12816 KB Output is correct
10 Correct 281 ms 12692 KB Output is correct
11 Correct 483 ms 17648 KB Output is correct
12 Correct 544 ms 17256 KB Output is correct
13 Correct 533 ms 16532 KB Output is correct
14 Correct 518 ms 16592 KB Output is correct
15 Correct 558 ms 17608 KB Output is correct
16 Correct 514 ms 16808 KB Output is correct
17 Correct 548 ms 15872 KB Output is correct
18 Correct 492 ms 17788 KB Output is correct
19 Correct 546 ms 14680 KB Output is correct
20 Correct 503 ms 16464 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 297 ms 12788 KB Output is correct
2 Correct 278 ms 12692 KB Output is correct
3 Correct 324 ms 12844 KB Output is correct
4 Correct 310 ms 12748 KB Output is correct
5 Correct 283 ms 12692 KB Output is correct
6 Correct 282 ms 12756 KB Output is correct
7 Correct 313 ms 12784 KB Output is correct
8 Correct 285 ms 12688 KB Output is correct
9 Correct 277 ms 12816 KB Output is correct
10 Correct 281 ms 12692 KB Output is correct
11 Correct 483 ms 17648 KB Output is correct
12 Correct 544 ms 17256 KB Output is correct
13 Correct 533 ms 16532 KB Output is correct
14 Correct 518 ms 16592 KB Output is correct
15 Correct 558 ms 17608 KB Output is correct
16 Correct 514 ms 16808 KB Output is correct
17 Correct 548 ms 15872 KB Output is correct
18 Correct 492 ms 17788 KB Output is correct
19 Correct 546 ms 14680 KB Output is correct
20 Correct 503 ms 16464 KB Output is correct
21 Correct 535 ms 16752 KB Output is correct
22 Correct 642 ms 17960 KB Output is correct
23 Correct 659 ms 16920 KB Output is correct
24 Correct 686 ms 16736 KB Output is correct
25 Correct 642 ms 18740 KB Output is correct
26 Correct 563 ms 17216 KB Output is correct
27 Correct 603 ms 17136 KB Output is correct
28 Correct 505 ms 19940 KB Output is correct
29 Correct 566 ms 15720 KB Output is correct
30 Correct 496 ms 17880 KB Output is correct
31 Correct 540 ms 16824 KB Output is correct
32 Correct 550 ms 16824 KB Output is correct
33 Correct 511 ms 15724 KB Output is correct
34 Correct 595 ms 15748 KB Output is correct
35 Correct 598 ms 16248 KB Output is correct
36 Correct 477 ms 14812 KB Output is correct
37 Correct 547 ms 16824 KB Output is correct
38 Correct 541 ms 14796 KB Output is correct
39 Correct 533 ms 16020 KB Output is correct
40 Correct 554 ms 15852 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 297 ms 12788 KB Output is correct
2 Correct 278 ms 12692 KB Output is correct
3 Correct 324 ms 12844 KB Output is correct
4 Correct 310 ms 12748 KB Output is correct
5 Correct 283 ms 12692 KB Output is correct
6 Correct 282 ms 12756 KB Output is correct
7 Correct 313 ms 12784 KB Output is correct
8 Correct 285 ms 12688 KB Output is correct
9 Correct 277 ms 12816 KB Output is correct
10 Correct 281 ms 12692 KB Output is correct
11 Correct 1029 ms 23064 KB Output is correct
12 Correct 1066 ms 22872 KB Output is correct
13 Correct 1022 ms 22940 KB Output is correct
14 Correct 1036 ms 22936 KB Output is correct
15 Correct 1070 ms 23064 KB Output is correct
16 Correct 1018 ms 22940 KB Output is correct
17 Correct 1008 ms 22940 KB Output is correct
18 Correct 1000 ms 22988 KB Output is correct
19 Correct 1020 ms 22812 KB Output is correct
20 Correct 1024 ms 23132 KB Output is correct
21 Correct 1085 ms 23072 KB Output is correct
22 Correct 1051 ms 23076 KB Output is correct
23 Correct 1089 ms 22960 KB Output is correct
24 Correct 1050 ms 22944 KB Output is correct
25 Correct 1087 ms 22940 KB Output is correct
26 Correct 1031 ms 22944 KB Output is correct
27 Correct 1052 ms 22872 KB Output is correct
28 Correct 1036 ms 22812 KB Output is correct
29 Correct 1045 ms 22960 KB Output is correct
30 Correct 1199 ms 23000 KB Output is correct
31 Correct 1203 ms 22936 KB Output is correct
32 Correct 1139 ms 23128 KB Output is correct
33 Correct 1118 ms 23192 KB Output is correct
34 Correct 1213 ms 22948 KB Output is correct
35 Correct 1125 ms 23192 KB Output is correct
36 Correct 1014 ms 23196 KB Output is correct
37 Correct 1054 ms 23064 KB Output is correct
38 Correct 1051 ms 22960 KB Output is correct
39 Correct 1052 ms 22940 KB Output is correct
40 Correct 1024 ms 22968 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 297 ms 12788 KB Output is correct
2 Correct 278 ms 12692 KB Output is correct
3 Correct 324 ms 12844 KB Output is correct
4 Correct 310 ms 12748 KB Output is correct
5 Correct 283 ms 12692 KB Output is correct
6 Correct 282 ms 12756 KB Output is correct
7 Correct 313 ms 12784 KB Output is correct
8 Correct 285 ms 12688 KB Output is correct
9 Correct 277 ms 12816 KB Output is correct
10 Correct 281 ms 12692 KB Output is correct
11 Correct 483 ms 17648 KB Output is correct
12 Correct 544 ms 17256 KB Output is correct
13 Correct 533 ms 16532 KB Output is correct
14 Correct 518 ms 16592 KB Output is correct
15 Correct 558 ms 17608 KB Output is correct
16 Correct 514 ms 16808 KB Output is correct
17 Correct 548 ms 15872 KB Output is correct
18 Correct 492 ms 17788 KB Output is correct
19 Correct 546 ms 14680 KB Output is correct
20 Correct 503 ms 16464 KB Output is correct
21 Correct 535 ms 16752 KB Output is correct
22 Correct 642 ms 17960 KB Output is correct
23 Correct 659 ms 16920 KB Output is correct
24 Correct 686 ms 16736 KB Output is correct
25 Correct 642 ms 18740 KB Output is correct
26 Correct 563 ms 17216 KB Output is correct
27 Correct 603 ms 17136 KB Output is correct
28 Correct 505 ms 19940 KB Output is correct
29 Correct 566 ms 15720 KB Output is correct
30 Correct 496 ms 17880 KB Output is correct
31 Correct 540 ms 16824 KB Output is correct
32 Correct 550 ms 16824 KB Output is correct
33 Correct 511 ms 15724 KB Output is correct
34 Correct 595 ms 15748 KB Output is correct
35 Correct 598 ms 16248 KB Output is correct
36 Correct 477 ms 14812 KB Output is correct
37 Correct 547 ms 16824 KB Output is correct
38 Correct 541 ms 14796 KB Output is correct
39 Correct 533 ms 16020 KB Output is correct
40 Correct 554 ms 15852 KB Output is correct
41 Correct 1029 ms 23064 KB Output is correct
42 Correct 1066 ms 22872 KB Output is correct
43 Correct 1022 ms 22940 KB Output is correct
44 Correct 1036 ms 22936 KB Output is correct
45 Correct 1070 ms 23064 KB Output is correct
46 Correct 1018 ms 22940 KB Output is correct
47 Correct 1008 ms 22940 KB Output is correct
48 Correct 1000 ms 22988 KB Output is correct
49 Correct 1020 ms 22812 KB Output is correct
50 Correct 1024 ms 23132 KB Output is correct
51 Correct 1085 ms 23072 KB Output is correct
52 Correct 1051 ms 23076 KB Output is correct
53 Correct 1089 ms 22960 KB Output is correct
54 Correct 1050 ms 22944 KB Output is correct
55 Correct 1087 ms 22940 KB Output is correct
56 Correct 1031 ms 22944 KB Output is correct
57 Correct 1052 ms 22872 KB Output is correct
58 Correct 1036 ms 22812 KB Output is correct
59 Correct 1045 ms 22960 KB Output is correct
60 Correct 1199 ms 23000 KB Output is correct
61 Correct 1203 ms 22936 KB Output is correct
62 Correct 1139 ms 23128 KB Output is correct
63 Correct 1118 ms 23192 KB Output is correct
64 Correct 1213 ms 22948 KB Output is correct
65 Correct 1125 ms 23192 KB Output is correct
66 Correct 1014 ms 23196 KB Output is correct
67 Correct 1054 ms 23064 KB Output is correct
68 Correct 1051 ms 22960 KB Output is correct
69 Correct 1052 ms 22940 KB Output is correct
70 Correct 1024 ms 22968 KB Output is correct
71 Correct 1578 ms 42644 KB Output is correct
72 Correct 1734 ms 38792 KB Output is correct
73 Correct 1764 ms 41280 KB Output is correct
74 Correct 1971 ms 41620 KB Output is correct
75 Execution timed out 2037 ms 38008 KB Time limit exceeded
76 Halted 0 ms 0 KB -