oj.uz

답안 #548475

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
548475 2022-04-13T13:58:05 Z MilosMilutinovic Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 38736 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=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++){
		memset(dp,0,M*sizeof *dp);
		for(int j=0;j<(1<<(l-7));j++)dp[msk[(i<<(l-7))+j]]+=(int)(s[(i<<(l-7))+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: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:53:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   53 |   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:59:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |   scanf("%s",qs);
      |   ~~~~~^~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 263 ms 12828 KB Output is correct
2 Correct 275 ms 12880 KB Output is correct
3 Correct 262 ms 12732 KB Output is correct
4 Correct 276 ms 12736 KB Output is correct
5 Correct 266 ms 12708 KB Output is correct
6 Correct 274 ms 12752 KB Output is correct
7 Correct 269 ms 12812 KB Output is correct
8 Correct 272 ms 12756 KB Output is correct
9 Correct 269 ms 12748 KB Output is correct
10 Correct 285 ms 12820 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 263 ms 12828 KB Output is correct
2 Correct 275 ms 12880 KB Output is correct
3 Correct 262 ms 12732 KB Output is correct
4 Correct 276 ms 12736 KB Output is correct
5 Correct 266 ms 12708 KB Output is correct
6 Correct 274 ms 12752 KB Output is correct
7 Correct 269 ms 12812 KB Output is correct
8 Correct 272 ms 12756 KB Output is correct
9 Correct 269 ms 12748 KB Output is correct
10 Correct 285 ms 12820 KB Output is correct
11 Correct 463 ms 16804 KB Output is correct
12 Correct 508 ms 16516 KB Output is correct
13 Correct 487 ms 15744 KB Output is correct
14 Correct 478 ms 15772 KB Output is correct
15 Correct 456 ms 16728 KB Output is correct
16 Correct 466 ms 16036 KB Output is correct
17 Correct 490 ms 16052 KB Output is correct
18 Correct 468 ms 17740 KB Output is correct
19 Correct 474 ms 14712 KB Output is correct
20 Correct 450 ms 16596 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 263 ms 12828 KB Output is correct
2 Correct 275 ms 12880 KB Output is correct
3 Correct 262 ms 12732 KB Output is correct
4 Correct 276 ms 12736 KB Output is correct
5 Correct 266 ms 12708 KB Output is correct
6 Correct 274 ms 12752 KB Output is correct
7 Correct 269 ms 12812 KB Output is correct
8 Correct 272 ms 12756 KB Output is correct
9 Correct 269 ms 12748 KB Output is correct
10 Correct 285 ms 12820 KB Output is correct
11 Correct 463 ms 16804 KB Output is correct
12 Correct 508 ms 16516 KB Output is correct
13 Correct 487 ms 15744 KB Output is correct
14 Correct 478 ms 15772 KB Output is correct
15 Correct 456 ms 16728 KB Output is correct
16 Correct 466 ms 16036 KB Output is correct
17 Correct 490 ms 16052 KB Output is correct
18 Correct 468 ms 17740 KB Output is correct
19 Correct 474 ms 14712 KB Output is correct
20 Correct 450 ms 16596 KB Output is correct
21 Correct 472 ms 16740 KB Output is correct
22 Correct 523 ms 16928 KB Output is correct
23 Correct 543 ms 16108 KB Output is correct
24 Correct 522 ms 15796 KB Output is correct
25 Correct 556 ms 17768 KB Output is correct
26 Correct 536 ms 16356 KB Output is correct
27 Correct 569 ms 16304 KB Output is correct
28 Correct 463 ms 18844 KB Output is correct
29 Correct 519 ms 14716 KB Output is correct
30 Correct 470 ms 16928 KB Output is correct
31 Correct 554 ms 16736 KB Output is correct
32 Correct 505 ms 16844 KB Output is correct
33 Correct 508 ms 15616 KB Output is correct
34 Correct 517 ms 15820 KB Output is correct
35 Correct 531 ms 16204 KB Output is correct
36 Correct 478 ms 14756 KB Output is correct
37 Correct 532 ms 16820 KB Output is correct
38 Correct 532 ms 14812 KB Output is correct
39 Correct 543 ms 16020 KB Output is correct
40 Correct 533 ms 15872 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 263 ms 12828 KB Output is correct
2 Correct 275 ms 12880 KB Output is correct
3 Correct 262 ms 12732 KB Output is correct
4 Correct 276 ms 12736 KB Output is correct
5 Correct 266 ms 12708 KB Output is correct
6 Correct 274 ms 12752 KB Output is correct
7 Correct 269 ms 12812 KB Output is correct
8 Correct 272 ms 12756 KB Output is correct
9 Correct 269 ms 12748 KB Output is correct
10 Correct 285 ms 12820 KB Output is correct
11 Correct 956 ms 19000 KB Output is correct
12 Correct 941 ms 18864 KB Output is correct
13 Correct 1004 ms 18892 KB Output is correct
14 Correct 956 ms 18936 KB Output is correct
15 Correct 963 ms 18996 KB Output is correct
16 Correct 950 ms 19072 KB Output is correct
17 Correct 965 ms 18876 KB Output is correct
18 Correct 985 ms 19020 KB Output is correct
19 Correct 954 ms 18744 KB Output is correct
20 Correct 962 ms 19004 KB Output is correct
21 Correct 1012 ms 19004 KB Output is correct
22 Correct 952 ms 18896 KB Output is correct
23 Correct 1037 ms 18976 KB Output is correct
24 Correct 946 ms 19016 KB Output is correct
25 Correct 937 ms 18880 KB Output is correct
26 Correct 903 ms 18872 KB Output is correct
27 Correct 962 ms 18916 KB Output is correct
28 Correct 939 ms 18844 KB Output is correct
29 Correct 975 ms 18872 KB Output is correct
30 Correct 967 ms 18872 KB Output is correct
31 Correct 954 ms 18876 KB Output is correct
32 Correct 950 ms 18900 KB Output is correct
33 Correct 994 ms 18956 KB Output is correct
34 Correct 922 ms 18552 KB Output is correct
35 Correct 965 ms 18892 KB Output is correct
36 Correct 955 ms 18880 KB Output is correct
37 Correct 963 ms 18876 KB Output is correct
38 Correct 947 ms 18904 KB Output is correct
39 Correct 965 ms 18876 KB Output is correct
40 Correct 964 ms 18896 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 263 ms 12828 KB Output is correct
2 Correct 275 ms 12880 KB Output is correct
3 Correct 262 ms 12732 KB Output is correct
4 Correct 276 ms 12736 KB Output is correct
5 Correct 266 ms 12708 KB Output is correct
6 Correct 274 ms 12752 KB Output is correct
7 Correct 269 ms 12812 KB Output is correct
8 Correct 272 ms 12756 KB Output is correct
9 Correct 269 ms 12748 KB Output is correct
10 Correct 285 ms 12820 KB Output is correct
11 Correct 463 ms 16804 KB Output is correct
12 Correct 508 ms 16516 KB Output is correct
13 Correct 487 ms 15744 KB Output is correct
14 Correct 478 ms 15772 KB Output is correct
15 Correct 456 ms 16728 KB Output is correct
16 Correct 466 ms 16036 KB Output is correct
17 Correct 490 ms 16052 KB Output is correct
18 Correct 468 ms 17740 KB Output is correct
19 Correct 474 ms 14712 KB Output is correct
20 Correct 450 ms 16596 KB Output is correct
21 Correct 472 ms 16740 KB Output is correct
22 Correct 523 ms 16928 KB Output is correct
23 Correct 543 ms 16108 KB Output is correct
24 Correct 522 ms 15796 KB Output is correct
25 Correct 556 ms 17768 KB Output is correct
26 Correct 536 ms 16356 KB Output is correct
27 Correct 569 ms 16304 KB Output is correct
28 Correct 463 ms 18844 KB Output is correct
29 Correct 519 ms 14716 KB Output is correct
30 Correct 470 ms 16928 KB Output is correct
31 Correct 554 ms 16736 KB Output is correct
32 Correct 505 ms 16844 KB Output is correct
33 Correct 508 ms 15616 KB Output is correct
34 Correct 517 ms 15820 KB Output is correct
35 Correct 531 ms 16204 KB Output is correct
36 Correct 478 ms 14756 KB Output is correct
37 Correct 532 ms 16820 KB Output is correct
38 Correct 532 ms 14812 KB Output is correct
39 Correct 543 ms 16020 KB Output is correct
40 Correct 533 ms 15872 KB Output is correct
41 Correct 956 ms 19000 KB Output is correct
42 Correct 941 ms 18864 KB Output is correct
43 Correct 1004 ms 18892 KB Output is correct
44 Correct 956 ms 18936 KB Output is correct
45 Correct 963 ms 18996 KB Output is correct
46 Correct 950 ms 19072 KB Output is correct
47 Correct 965 ms 18876 KB Output is correct
48 Correct 985 ms 19020 KB Output is correct
49 Correct 954 ms 18744 KB Output is correct
50 Correct 962 ms 19004 KB Output is correct
51 Correct 1012 ms 19004 KB Output is correct
52 Correct 952 ms 18896 KB Output is correct
53 Correct 1037 ms 18976 KB Output is correct
54 Correct 946 ms 19016 KB Output is correct
55 Correct 937 ms 18880 KB Output is correct
56 Correct 903 ms 18872 KB Output is correct
57 Correct 962 ms 18916 KB Output is correct
58 Correct 939 ms 18844 KB Output is correct
59 Correct 975 ms 18872 KB Output is correct
60 Correct 967 ms 18872 KB Output is correct
61 Correct 954 ms 18876 KB Output is correct
62 Correct 950 ms 18900 KB Output is correct
63 Correct 994 ms 18956 KB Output is correct
64 Correct 922 ms 18552 KB Output is correct
65 Correct 965 ms 18892 KB Output is correct
66 Correct 955 ms 18880 KB Output is correct
67 Correct 963 ms 18876 KB Output is correct
68 Correct 947 ms 18904 KB Output is correct
69 Correct 965 ms 18876 KB Output is correct
70 Correct 964 ms 18896 KB Output is correct
71 Correct 1491 ms 38736 KB Output is correct
72 Correct 1570 ms 34936 KB Output is correct
73 Correct 1680 ms 37300 KB Output is correct
74 Correct 1804 ms 37684 KB Output is correct
75 Execution timed out 2091 ms 37000 KB Time limit exceeded
76 Halted 0 ms 0 KB -