답안 #58948 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
58948	2018-07-19T21:26:03 Z	TadijaSebez	Snake Escaping (JOI18_snake_escaping)	C++11	12 / 100	552 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	8 ms	4472 KB	Output is correct
2	Correct	8 ms	4584 KB	Output is correct
3	Correct	10 ms	4584 KB	Output is correct
4	Correct	8 ms	4584 KB	Output is correct
5	Correct	9 ms	4584 KB	Output is correct
6	Correct	8 ms	4584 KB	Output is correct
7	Correct	8 ms	4632 KB	Output is correct
8	Correct	8 ms	4692 KB	Output is correct
9	Correct	8 ms	4708 KB	Output is correct
10	Correct	8 ms	4708 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	4472 KB	Output is correct
2	Correct	8 ms	4584 KB	Output is correct
3	Correct	10 ms	4584 KB	Output is correct
4	Correct	8 ms	4584 KB	Output is correct
5	Correct	9 ms	4584 KB	Output is correct
6	Correct	8 ms	4584 KB	Output is correct
7	Correct	8 ms	4632 KB	Output is correct
8	Correct	8 ms	4692 KB	Output is correct
9	Correct	8 ms	4708 KB	Output is correct
10	Correct	8 ms	4708 KB	Output is correct
11	Correct	327 ms	13828 KB	Output is correct
12	Correct	346 ms	13828 KB	Output is correct
13	Correct	461 ms	13828 KB	Output is correct
14	Correct	420 ms	13828 KB	Output is correct
15	Correct	352 ms	13932 KB	Output is correct
16	Correct	387 ms	13932 KB	Output is correct
17	Correct	416 ms	13932 KB	Output is correct
18	Correct	275 ms	14760 KB	Output is correct
19	Correct	314 ms	14760 KB	Output is correct
20	Correct	351 ms	14760 KB	Output is correct

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	4472 KB	Output is correct
2	Correct	8 ms	4584 KB	Output is correct
3	Correct	10 ms	4584 KB	Output is correct
4	Correct	8 ms	4584 KB	Output is correct
5	Correct	9 ms	4584 KB	Output is correct
6	Correct	8 ms	4584 KB	Output is correct
7	Correct	8 ms	4632 KB	Output is correct
8	Correct	8 ms	4692 KB	Output is correct
9	Correct	8 ms	4708 KB	Output is correct
10	Correct	8 ms	4708 KB	Output is correct
11	Correct	327 ms	13828 KB	Output is correct
12	Correct	346 ms	13828 KB	Output is correct
13	Correct	461 ms	13828 KB	Output is correct
14	Correct	420 ms	13828 KB	Output is correct
15	Correct	352 ms	13932 KB	Output is correct
16	Correct	387 ms	13932 KB	Output is correct
17	Correct	416 ms	13932 KB	Output is correct
18	Correct	275 ms	14760 KB	Output is correct
19	Correct	314 ms	14760 KB	Output is correct
20	Correct	351 ms	14760 KB	Output is correct
21	Correct	475 ms	16448 KB	Output is correct
22	Correct	394 ms	16624 KB	Output is correct
23	Correct	450 ms	16624 KB	Output is correct
24	Correct	488 ms	16624 KB	Output is correct
25	Correct	421 ms	20028 KB	Output is correct
26	Correct	470 ms	20028 KB	Output is correct
27	Correct	460 ms	20028 KB	Output is correct
28	Correct	326 ms	20944 KB	Output is correct
29	Correct	390 ms	30896 KB	Output is correct
30	Correct	408 ms	46560 KB	Output is correct
31	Correct	446 ms	60088 KB	Output is correct
32	Runtime error	552 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.
33	Halted	0 ms	0 KB	-

Subtask #4
0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	4472 KB	Output is correct
2	Correct	8 ms	4584 KB	Output is correct
3	Correct	10 ms	4584 KB	Output is correct
4	Correct	8 ms	4584 KB	Output is correct
5	Correct	9 ms	4584 KB	Output is correct
6	Correct	8 ms	4584 KB	Output is correct
7	Correct	8 ms	4632 KB	Output is correct
8	Correct	8 ms	4692 KB	Output is correct
9	Correct	8 ms	4708 KB	Output is correct
10	Correct	8 ms	4708 KB	Output is correct
11	Runtime error	94 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	8 ms	4472 KB	Output is correct
2	Correct	8 ms	4584 KB	Output is correct
3	Correct	10 ms	4584 KB	Output is correct
4	Correct	8 ms	4584 KB	Output is correct
5	Correct	9 ms	4584 KB	Output is correct
6	Correct	8 ms	4584 KB	Output is correct
7	Correct	8 ms	4632 KB	Output is correct
8	Correct	8 ms	4692 KB	Output is correct
9	Correct	8 ms	4708 KB	Output is correct
10	Correct	8 ms	4708 KB	Output is correct
11	Correct	327 ms	13828 KB	Output is correct
12	Correct	346 ms	13828 KB	Output is correct
13	Correct	461 ms	13828 KB	Output is correct
14	Correct	420 ms	13828 KB	Output is correct
15	Correct	352 ms	13932 KB	Output is correct
16	Correct	387 ms	13932 KB	Output is correct
17	Correct	416 ms	13932 KB	Output is correct
18	Correct	275 ms	14760 KB	Output is correct
19	Correct	314 ms	14760 KB	Output is correct
20	Correct	351 ms	14760 KB	Output is correct
21	Correct	475 ms	16448 KB	Output is correct
22	Correct	394 ms	16624 KB	Output is correct
23	Correct	450 ms	16624 KB	Output is correct
24	Correct	488 ms	16624 KB	Output is correct
25	Correct	421 ms	20028 KB	Output is correct
26	Correct	470 ms	20028 KB	Output is correct
27	Correct	460 ms	20028 KB	Output is correct
28	Correct	326 ms	20944 KB	Output is correct
29	Correct	390 ms	30896 KB	Output is correct
30	Correct	408 ms	46560 KB	Output is correct
31	Correct	446 ms	60088 KB	Output is correct
32	Runtime error	552 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.
33	Halted	0 ms	0 KB	-

답안 #58948

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