답안 #41263 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
41263	2018-02-15T09:15:38 Z	Kerim	Snake Escaping (JOI18_snake_escaping)	C++14	22 / 100	773 ms	65536 KB

snake_escaping

#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
#define BLOK 13
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int n,q;
const int N=(1<<20)+5;
int dp[N*2],pw[22],ans[N];
char s[N],t[22];
vector<PII>adj[22],query[130];
void rec(int pos,int mask,int bit,int last){
	if(pos==min(n,BLOK)){
		adj[bit].pb(mp(mask,last));
		return;
	}
	rec(pos+1,mask*3,bit,last);
	rec(pos+1,mask*3+1,bit,last);
	rec(pos+1,mask*3+2,bit+1,min(n,BLOK)-pos-1);
}
int two(int x){
	int bit=0,res=0;
	while(x>=1){
		assert(x%3<2);
		if(x%3)
			res+=(1<<bit);
		x/=3;bit++;
	}
	return res;
}
void f(int l,int r,int mask,int suf,int ind){
	if(l==r){
		query[mask].pb(mp(suf,ind));
		return;
	}
	if(t[l]=='0')
		f(l+1,r,mask*2,suf,ind);
	if(t[l]=='1')
		f(l+1,r,mask*2+1,suf,ind);
	if(t[l]=='?'){
		f(l+1,r,mask*2,suf,ind);
		f(l+1,r,mask*2+1,suf,ind);
	}	
}
int main(){
    //~ freopen("file.in", "r", stdin);
    scanf("%d%d",&n,&q);
    scanf("%s",s);
    pw[0]=1;
    for(int i=1;i<=BLOK;i++)
		pw[i]=pw[i-1]*3;
    if(n<=BLOK){
		rec(0,0,0,-1);
		tr(it,adj[0])
			dp[it->ff]=s[two(it->ff)]-'0';
		for(int j=1;j<=n;j++)
			tr(it,adj[j])
				dp[it->ff]=dp[it->ff-pw[it->ss]]+dp[it->ff-2*pw[it->ss]];
		for(int i=1;i<=q;i++){
			scanf("%s",t);
			int base=0;
			for(int j=0;j<n;j++){
				base=base*3;
				if(t[j]=='1')
					base++;
				if(t[j]=='?')
					base+=2;
			}
			printf("%d\n",dp[base]);
		}
	}
	else{
		rec(0,0,0,-1);
		for(int i=1;i<=q;i++){
			scanf("%s",t);
			int base=0;
			for(int j=n-BLOK;j<n;j++){
				base=base*3;
				if(t[j]=='1')
					base++;
				if(t[j]=='?')
					base+=2;
			}
			f(0,n-BLOK,0,base,i);
		}
		for(int mask=0;mask<(1<<(n-BLOK));mask++){
			tr(it,adj[0])
				dp[it->ff]=s[(1<<BLOK)*mask+two(it->ff)]-'0';
			for(int i=1;i<=BLOK;i++)
				tr(it,adj[i])
					dp[it->ff]=dp[it->ff-pw[it->ss]]+dp[it->ff-2*pw[it->ss]];
			tr(it,query[mask])
				ans[it->ss]+=dp[it->ff];
		}
		for(int i=1;i<=q;i++)
			printf("%d\n",ans[i]);
	}
	return 0;
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:61:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&q);
                        ^
snake_escaping.cpp:62:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s",s);
                  ^
snake_escaping.cpp:74:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%s",t);
                 ^
snake_escaping.cpp:89:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%s",t);
                 ^

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	1272 KB	Output is correct
2	Correct	4 ms	1272 KB	Output is correct
3	Correct	4 ms	1368 KB	Output is correct
4	Correct	4 ms	1468 KB	Output is correct
5	Correct	4 ms	1468 KB	Output is correct
6	Correct	5 ms	1536 KB	Output is correct
7	Correct	4 ms	1548 KB	Output is correct
8	Correct	4 ms	1572 KB	Output is correct
9	Correct	4 ms	1572 KB	Output is correct
10	Correct	4 ms	1672 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	1272 KB	Output is correct
2	Correct	4 ms	1272 KB	Output is correct
3	Correct	4 ms	1368 KB	Output is correct
4	Correct	4 ms	1468 KB	Output is correct
5	Correct	4 ms	1468 KB	Output is correct
6	Correct	5 ms	1536 KB	Output is correct
7	Correct	4 ms	1548 KB	Output is correct
8	Correct	4 ms	1572 KB	Output is correct
9	Correct	4 ms	1572 KB	Output is correct
10	Correct	4 ms	1672 KB	Output is correct
11	Correct	279 ms	16348 KB	Output is correct
12	Correct	228 ms	26756 KB	Output is correct
13	Correct	258 ms	36996 KB	Output is correct
14	Correct	258 ms	47688 KB	Output is correct
15	Correct	248 ms	59408 KB	Output is correct
16	Correct	270 ms	65536 KB	Output is correct
17	Correct	271 ms	65536 KB	Output is correct
18	Correct	230 ms	65536 KB	Output is correct
19	Correct	248 ms	65536 KB	Output is correct
20	Correct	293 ms	65536 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	1272 KB	Output is correct
2	Correct	4 ms	1272 KB	Output is correct
3	Correct	4 ms	1368 KB	Output is correct
4	Correct	4 ms	1468 KB	Output is correct
5	Correct	4 ms	1468 KB	Output is correct
6	Correct	5 ms	1536 KB	Output is correct
7	Correct	4 ms	1548 KB	Output is correct
8	Correct	4 ms	1572 KB	Output is correct
9	Correct	4 ms	1572 KB	Output is correct
10	Correct	4 ms	1672 KB	Output is correct
11	Correct	279 ms	16348 KB	Output is correct
12	Correct	228 ms	26756 KB	Output is correct
13	Correct	258 ms	36996 KB	Output is correct
14	Correct	258 ms	47688 KB	Output is correct
15	Correct	248 ms	59408 KB	Output is correct
16	Correct	270 ms	65536 KB	Output is correct
17	Correct	271 ms	65536 KB	Output is correct
18	Correct	230 ms	65536 KB	Output is correct
19	Correct	248 ms	65536 KB	Output is correct
20	Correct	293 ms	65536 KB	Output is correct
21	Correct	434 ms	65536 KB	Output is correct
22	Correct	329 ms	65536 KB	Output is correct
23	Correct	407 ms	65536 KB	Output is correct
24	Correct	400 ms	65536 KB	Output is correct
25	Correct	390 ms	65536 KB	Output is correct
26	Correct	475 ms	65536 KB	Output is correct
27	Correct	498 ms	65536 KB	Output is correct
28	Correct	310 ms	65536 KB	Output is correct
29	Correct	385 ms	65536 KB	Output is correct
30	Correct	406 ms	65536 KB	Output is correct
31	Correct	458 ms	65536 KB	Output is correct
32	Correct	404 ms	65536 KB	Output is correct
33	Correct	381 ms	65536 KB	Output is correct
34	Correct	460 ms	65536 KB	Output is correct
35	Correct	461 ms	65536 KB	Output is correct
36	Correct	276 ms	65536 KB	Output is correct
37	Correct	300 ms	65536 KB	Output is correct
38	Correct	371 ms	65536 KB	Output is correct
39	Correct	492 ms	65536 KB	Output is correct
40	Correct	430 ms	65536 KB	Output is correct

Subtask #4
0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	1272 KB	Output is correct
2	Correct	4 ms	1272 KB	Output is correct
3	Correct	4 ms	1368 KB	Output is correct
4	Correct	4 ms	1468 KB	Output is correct
5	Correct	4 ms	1468 KB	Output is correct
6	Correct	5 ms	1536 KB	Output is correct
7	Correct	4 ms	1548 KB	Output is correct
8	Correct	4 ms	1572 KB	Output is correct
9	Correct	4 ms	1572 KB	Output is correct
10	Correct	4 ms	1672 KB	Output is correct
11	Correct	726 ms	65536 KB	Output is correct
12	Correct	698 ms	65536 KB	Output is correct
13	Correct	773 ms	65536 KB	Output is correct
14	Correct	702 ms	65536 KB	Output is correct
15	Correct	742 ms	65536 KB	Output is correct
16	Correct	725 ms	65536 KB	Output is correct
17	Correct	759 ms	65536 KB	Output is correct
18	Runtime error	394 ms	65536 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
19	Halted	0 ms	0 KB	-

Subtask #5
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	1272 KB	Output is correct
2	Correct	4 ms	1272 KB	Output is correct
3	Correct	4 ms	1368 KB	Output is correct
4	Correct	4 ms	1468 KB	Output is correct
5	Correct	4 ms	1468 KB	Output is correct
6	Correct	5 ms	1536 KB	Output is correct
7	Correct	4 ms	1548 KB	Output is correct
8	Correct	4 ms	1572 KB	Output is correct
9	Correct	4 ms	1572 KB	Output is correct
10	Correct	4 ms	1672 KB	Output is correct
11	Correct	279 ms	16348 KB	Output is correct
12	Correct	228 ms	26756 KB	Output is correct
13	Correct	258 ms	36996 KB	Output is correct
14	Correct	258 ms	47688 KB	Output is correct
15	Correct	248 ms	59408 KB	Output is correct
16	Correct	270 ms	65536 KB	Output is correct
17	Correct	271 ms	65536 KB	Output is correct
18	Correct	230 ms	65536 KB	Output is correct
19	Correct	248 ms	65536 KB	Output is correct
20	Correct	293 ms	65536 KB	Output is correct
21	Correct	434 ms	65536 KB	Output is correct
22	Correct	329 ms	65536 KB	Output is correct
23	Correct	407 ms	65536 KB	Output is correct
24	Correct	400 ms	65536 KB	Output is correct
25	Correct	390 ms	65536 KB	Output is correct
26	Correct	475 ms	65536 KB	Output is correct
27	Correct	498 ms	65536 KB	Output is correct
28	Correct	310 ms	65536 KB	Output is correct
29	Correct	385 ms	65536 KB	Output is correct
30	Correct	406 ms	65536 KB	Output is correct
31	Correct	458 ms	65536 KB	Output is correct
32	Correct	404 ms	65536 KB	Output is correct
33	Correct	381 ms	65536 KB	Output is correct
34	Correct	460 ms	65536 KB	Output is correct
35	Correct	461 ms	65536 KB	Output is correct
36	Correct	276 ms	65536 KB	Output is correct
37	Correct	300 ms	65536 KB	Output is correct
38	Correct	371 ms	65536 KB	Output is correct
39	Correct	492 ms	65536 KB	Output is correct
40	Correct	430 ms	65536 KB	Output is correct
41	Correct	726 ms	65536 KB	Output is correct
42	Correct	698 ms	65536 KB	Output is correct
43	Correct	773 ms	65536 KB	Output is correct
44	Correct	702 ms	65536 KB	Output is correct
45	Correct	742 ms	65536 KB	Output is correct
46	Correct	725 ms	65536 KB	Output is correct
47	Correct	759 ms	65536 KB	Output is correct
48	Runtime error	394 ms	65536 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
49	Halted	0 ms	0 KB	-

답안 #41263

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 10.0 / 10.0

Subtask #4 0 / 53.0

Subtask #5 0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
10.0 / 10.0

Subtask #4
0 / 53.0

Subtask #5
0 / 25.0