답안 #58946 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
58946	2018-07-19T21:25:01 Z	TadijaSebez	Snake Escaping (JOI18_snake_escaping)	C++11	12 / 100	475 ms	66560 KB

snake_escaping

#include <stdio.h>
const int N=1<<20;
int dp0[N],dp1[N],pc[N];
char s[N],t[20];
int min(int a, int b){ return a>b?b:a;}
int abs(int x){ return x>0?x:-x;}
int main()
{
	int n,q,i,mask;
	for(i=1;i<N;i++) pc[i]=pc[i-(i&-i)]+1;
	scanf("%i %i",&n,&q);
	scanf("%s",s);
	for(i=0;i<(1<<n);i++)
	{
		dp1[i]=dp0[i]=s[i]-'0';
	}
	for(i=0;i<n;i++)
	{
		for(mask=0;mask<(1<<n);mask++)
		{
			if((mask>>i)&1) dp0[mask^(1<<i)]+=dp0[mask];
			else dp1[mask^(1<<i)]+=dp1[mask];
		}
	}
	while(q--)
	{
		scanf("%s",t);
		int a=0,b=0,c=0;
		for(i=0;i<n;i++)
		{
			if(t[n-i-1]=='0') a+=1<<i;
			else if(t[n-i-1]=='1') b+=1<<i;
			else c+=1<<i;
		}
		int ans=0;
		if(pc[a]<=min(pc[b],pc[c]))
		{
			for(mask=a;;mask=(mask-1)&a)
			{
				//printf("a:%i %i\n",a,mask);
				int go=((1<<n)-1)^mask^c;
				if((pc[mask]&1)==(pc[a]&1)) ans+=dp0[go];
				else ans-=dp0[go];
				if(!mask) break;
			}
		}
		else if(pc[b]<=min(pc[a],pc[c]))
		{
			for(mask=b;;mask=(mask-1)&b)
			{
				//printf("b:%i %i\n",b,mask);
				if((pc[mask]&1)==(pc[b]&1)) ans+=dp1[mask|c];
				else ans-=dp1[mask|c];
				if(!mask) break;
			}
		}
		else
		{
			for(mask=c;;mask=(mask-1)&c)
			{
				//printf("c:%i %i\n",c,mask);
				ans+=s[mask|b]-'0';
				if(!mask) break;
			}
		}
		printf("%i\n",abs(ans));
	}
	return 0;
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:11:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i",&n,&q);
  ~~~~~^~~~~~~~~~~~~~~
snake_escaping.cpp:12:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",s);
  ~~~~~^~~~~~~~
snake_escaping.cpp:27:8: 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	6 ms	4472 KB	Output is correct
2	Correct	8 ms	4552 KB	Output is correct
3	Correct	7 ms	4552 KB	Output is correct
4	Correct	9 ms	4552 KB	Output is correct
5	Correct	9 ms	4552 KB	Output is correct
6	Correct	10 ms	4596 KB	Output is correct
7	Correct	10 ms	4736 KB	Output is correct
8	Correct	8 ms	4772 KB	Output is correct
9	Correct	9 ms	4772 KB	Output is correct
10	Correct	9 ms	4772 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	4472 KB	Output is correct
2	Correct	8 ms	4552 KB	Output is correct
3	Correct	7 ms	4552 KB	Output is correct
4	Correct	9 ms	4552 KB	Output is correct
5	Correct	9 ms	4552 KB	Output is correct
6	Correct	10 ms	4596 KB	Output is correct
7	Correct	10 ms	4736 KB	Output is correct
8	Correct	8 ms	4772 KB	Output is correct
9	Correct	9 ms	4772 KB	Output is correct
10	Correct	9 ms	4772 KB	Output is correct
11	Correct	370 ms	13904 KB	Output is correct
12	Correct	287 ms	13904 KB	Output is correct
13	Correct	331 ms	13904 KB	Output is correct
14	Correct	317 ms	13904 KB	Output is correct
15	Correct	315 ms	13904 KB	Output is correct
16	Correct	341 ms	13904 KB	Output is correct
17	Correct	343 ms	13904 KB	Output is correct
18	Correct	225 ms	14844 KB	Output is correct
19	Correct	264 ms	14844 KB	Output is correct
20	Correct	285 ms	14844 KB	Output is correct

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	4472 KB	Output is correct
2	Correct	8 ms	4552 KB	Output is correct
3	Correct	7 ms	4552 KB	Output is correct
4	Correct	9 ms	4552 KB	Output is correct
5	Correct	9 ms	4552 KB	Output is correct
6	Correct	10 ms	4596 KB	Output is correct
7	Correct	10 ms	4736 KB	Output is correct
8	Correct	8 ms	4772 KB	Output is correct
9	Correct	9 ms	4772 KB	Output is correct
10	Correct	9 ms	4772 KB	Output is correct
11	Correct	370 ms	13904 KB	Output is correct
12	Correct	287 ms	13904 KB	Output is correct
13	Correct	331 ms	13904 KB	Output is correct
14	Correct	317 ms	13904 KB	Output is correct
15	Correct	315 ms	13904 KB	Output is correct
16	Correct	341 ms	13904 KB	Output is correct
17	Correct	343 ms	13904 KB	Output is correct
18	Correct	225 ms	14844 KB	Output is correct
19	Correct	264 ms	14844 KB	Output is correct
20	Correct	285 ms	14844 KB	Output is correct
21	Correct	374 ms	27636 KB	Output is correct
22	Correct	391 ms	41708 KB	Output is correct
23	Correct	475 ms	54344 KB	Output is correct
24	Runtime error	419 ms	66560 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
25	Halted	0 ms	0 KB	-

Subtask #4
0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	4472 KB	Output is correct
2	Correct	8 ms	4552 KB	Output is correct
3	Correct	7 ms	4552 KB	Output is correct
4	Correct	9 ms	4552 KB	Output is correct
5	Correct	9 ms	4552 KB	Output is correct
6	Correct	10 ms	4596 KB	Output is correct
7	Correct	10 ms	4736 KB	Output is correct
8	Correct	8 ms	4772 KB	Output is correct
9	Correct	9 ms	4772 KB	Output is correct
10	Correct	9 ms	4772 KB	Output is correct
11	Runtime error	81 ms	66560 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
12	Halted	0 ms	0 KB	-

Subtask #5
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	4472 KB	Output is correct
2	Correct	8 ms	4552 KB	Output is correct
3	Correct	7 ms	4552 KB	Output is correct
4	Correct	9 ms	4552 KB	Output is correct
5	Correct	9 ms	4552 KB	Output is correct
6	Correct	10 ms	4596 KB	Output is correct
7	Correct	10 ms	4736 KB	Output is correct
8	Correct	8 ms	4772 KB	Output is correct
9	Correct	9 ms	4772 KB	Output is correct
10	Correct	9 ms	4772 KB	Output is correct
11	Correct	370 ms	13904 KB	Output is correct
12	Correct	287 ms	13904 KB	Output is correct
13	Correct	331 ms	13904 KB	Output is correct
14	Correct	317 ms	13904 KB	Output is correct
15	Correct	315 ms	13904 KB	Output is correct
16	Correct	341 ms	13904 KB	Output is correct
17	Correct	343 ms	13904 KB	Output is correct
18	Correct	225 ms	14844 KB	Output is correct
19	Correct	264 ms	14844 KB	Output is correct
20	Correct	285 ms	14844 KB	Output is correct
21	Correct	374 ms	27636 KB	Output is correct
22	Correct	391 ms	41708 KB	Output is correct
23	Correct	475 ms	54344 KB	Output is correct
24	Runtime error	419 ms	66560 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
25	Halted	0 ms	0 KB	-

답안 #58946

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 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
0 / 10.0

Subtask #4
0 / 53.0

Subtask #5
0 / 25.0