oj.uz

답안 #548283

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
548283 2022-04-12T21:07:33 Z MilosMilutinovic Snake Escaping (JOI18_snake_escaping) C++14
22 / 100
 552 ms 65536 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N=(1<<20)+5;
const int M=1600050;
int l,n,q,lst[M],pw[20],ans[N],dp[M],msk[N];
char s[N],qs[25];
vector<pair<int,int>> Qs[N];
vector<int> ids[128];
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);
		msk[i]=0;
		for(int j=7;j<l;j++)msk[i]+=bits[j]*pw[j-7];
	}
	for(int i=0;i<n;i++)ids[i&127].pb(i);
	for(int i=1;i<=q;i++){
		scanf("%s",qs);
		int v=0;
		for(int j=7;j<l;j++)v+=(qs[j]=='0'?0:(qs[j]=='1'?1:2))*pw[l-j-1];
		int mask=0;
		for(int b=0;b<7;b++)if(qs[b]!='0')mask+=(1<<b);
		for(int j=0;j<128;j++)if((mask&j)==j)Qs[j].pb({v,i});
	}
	for(int i=0;i<128;i++){
		for(int j=0;j<M;j++)dp[j]=0;
		for(int j:ids[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(auto qs:Qs[i])ans[qs.second]+=dp[qs.first];
	}
	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:18:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |   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:51:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   51 |   while(bits.size()<l)bits.pb(0);
      |         ~~~~~~~~~~~^~
snake_escaping.cpp: In function 'void BruteForce()':
snake_escaping.cpp:33:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |   scanf("%s",qs);
      |   ~~~~~^~~~~~~~~
snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:40:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |  scanf("%i%i",&l,&q);
      |  ~~~~~^~~~~~~~~~~~~~
snake_escaping.cpp:41:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |  scanf("%s",s);
      |  ~~~~~^~~~~~~~
snake_escaping.cpp:57:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |   scanf("%s",qs);
      |   ~~~~~^~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 265 ms 37428 KB Output is correct
2 Correct 269 ms 37548 KB Output is correct
3 Correct 265 ms 37396 KB Output is correct
4 Correct 271 ms 37416 KB Output is correct
5 Correct 273 ms 37388 KB Output is correct
6 Correct 273 ms 37340 KB Output is correct
7 Correct 296 ms 37572 KB Output is correct
8 Correct 270 ms 37380 KB Output is correct
9 Correct 279 ms 37492 KB Output is correct
10 Correct 276 ms 37556 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 265 ms 37428 KB Output is correct
2 Correct 269 ms 37548 KB Output is correct
3 Correct 265 ms 37396 KB Output is correct
4 Correct 271 ms 37416 KB Output is correct
5 Correct 273 ms 37388 KB Output is correct
6 Correct 273 ms 37340 KB Output is correct
7 Correct 296 ms 37572 KB Output is correct
8 Correct 270 ms 37380 KB Output is correct
9 Correct 279 ms 37492 KB Output is correct
10 Correct 276 ms 37556 KB Output is correct
11 Correct 474 ms 50908 KB Output is correct
12 Correct 486 ms 50668 KB Output is correct
13 Correct 507 ms 49872 KB Output is correct
14 Correct 483 ms 49972 KB Output is correct
15 Correct 476 ms 51080 KB Output is correct
16 Correct 473 ms 50224 KB Output is correct
17 Correct 480 ms 50136 KB Output is correct
18 Correct 456 ms 51908 KB Output is correct
19 Correct 502 ms 49136 KB Output is correct
20 Correct 460 ms 50636 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 265 ms 37428 KB Output is correct
2 Correct 269 ms 37548 KB Output is correct
3 Correct 265 ms 37396 KB Output is correct
4 Correct 271 ms 37416 KB Output is correct
5 Correct 273 ms 37388 KB Output is correct
6 Correct 273 ms 37340 KB Output is correct
7 Correct 296 ms 37572 KB Output is correct
8 Correct 270 ms 37380 KB Output is correct
9 Correct 279 ms 37492 KB Output is correct
10 Correct 276 ms 37556 KB Output is correct
11 Correct 474 ms 50908 KB Output is correct
12 Correct 486 ms 50668 KB Output is correct
13 Correct 507 ms 49872 KB Output is correct
14 Correct 483 ms 49972 KB Output is correct
15 Correct 476 ms 51080 KB Output is correct
16 Correct 473 ms 50224 KB Output is correct
17 Correct 480 ms 50136 KB Output is correct
18 Correct 456 ms 51908 KB Output is correct
19 Correct 502 ms 49136 KB Output is correct
20 Correct 460 ms 50636 KB Output is correct
21 Correct 469 ms 50672 KB Output is correct
22 Correct 523 ms 50780 KB Output is correct
23 Correct 525 ms 49840 KB Output is correct
24 Correct 524 ms 49672 KB Output is correct
25 Correct 499 ms 51628 KB Output is correct
26 Correct 528 ms 49988 KB Output is correct
27 Correct 552 ms 49708 KB Output is correct
28 Correct 474 ms 52116 KB Output is correct
29 Correct 504 ms 48204 KB Output is correct
30 Correct 475 ms 50012 KB Output is correct
31 Correct 518 ms 49840 KB Output is correct
32 Correct 544 ms 49992 KB Output is correct
33 Correct 498 ms 48832 KB Output is correct
34 Correct 533 ms 48792 KB Output is correct
35 Correct 529 ms 49116 KB Output is correct
36 Correct 465 ms 47720 KB Output is correct
37 Correct 509 ms 49512 KB Output is correct
38 Correct 524 ms 47492 KB Output is correct
39 Correct 527 ms 48412 KB Output is correct
40 Correct 515 ms 48216 KB Output is correct

Subtask #4
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 265 ms 37428 KB Output is correct
2 Correct 269 ms 37548 KB Output is correct
3 Correct 265 ms 37396 KB Output is correct
4 Correct 271 ms 37416 KB Output is correct
5 Correct 273 ms 37388 KB Output is correct
6 Correct 273 ms 37340 KB Output is correct
7 Correct 296 ms 37572 KB Output is correct
8 Correct 270 ms 37380 KB Output is correct
9 Correct 279 ms 37492 KB Output is correct
10 Correct 276 ms 37556 KB Output is correct
11 Runtime error 507 ms 65536 KB Execution killed with signal 9
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 265 ms 37428 KB Output is correct
2 Correct 269 ms 37548 KB Output is correct
3 Correct 265 ms 37396 KB Output is correct
4 Correct 271 ms 37416 KB Output is correct
5 Correct 273 ms 37388 KB Output is correct
6 Correct 273 ms 37340 KB Output is correct
7 Correct 296 ms 37572 KB Output is correct
8 Correct 270 ms 37380 KB Output is correct
9 Correct 279 ms 37492 KB Output is correct
10 Correct 276 ms 37556 KB Output is correct
11 Correct 474 ms 50908 KB Output is correct
12 Correct 486 ms 50668 KB Output is correct
13 Correct 507 ms 49872 KB Output is correct
14 Correct 483 ms 49972 KB Output is correct
15 Correct 476 ms 51080 KB Output is correct
16 Correct 473 ms 50224 KB Output is correct
17 Correct 480 ms 50136 KB Output is correct
18 Correct 456 ms 51908 KB Output is correct
19 Correct 502 ms 49136 KB Output is correct
20 Correct 460 ms 50636 KB Output is correct
21 Correct 469 ms 50672 KB Output is correct
22 Correct 523 ms 50780 KB Output is correct
23 Correct 525 ms 49840 KB Output is correct
24 Correct 524 ms 49672 KB Output is correct
25 Correct 499 ms 51628 KB Output is correct
26 Correct 528 ms 49988 KB Output is correct
27 Correct 552 ms 49708 KB Output is correct
28 Correct 474 ms 52116 KB Output is correct
29 Correct 504 ms 48204 KB Output is correct
30 Correct 475 ms 50012 KB Output is correct
31 Correct 518 ms 49840 KB Output is correct
32 Correct 544 ms 49992 KB Output is correct
33 Correct 498 ms 48832 KB Output is correct
34 Correct 533 ms 48792 KB Output is correct
35 Correct 529 ms 49116 KB Output is correct
36 Correct 465 ms 47720 KB Output is correct
37 Correct 509 ms 49512 KB Output is correct
38 Correct 524 ms 47492 KB Output is correct
39 Correct 527 ms 48412 KB Output is correct
40 Correct 515 ms 48216 KB Output is correct
41 Runtime error 507 ms 65536 KB Execution killed with signal 9
42 Halted 0 ms 0 KB -