oj.uz

Submission #58952

# Submission time Handle Problem Language Result Execution time Memory
58952 2018-07-19T21:28:16 Z TadijaSebez Snake Escaping (JOI18_snake_escaping) C++11
75 / 100
 676 ms 65572 KB 
#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

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4472 KB Output is correct
2 Correct 8 ms 4552 KB Output is correct
3 Correct 8 ms 4552 KB Output is correct
4 Correct 8 ms 4592 KB Output is correct
5 Correct 7 ms 4592 KB Output is correct
6 Correct 8 ms 4656 KB Output is correct
7 Correct 8 ms 4668 KB Output is correct
8 Correct 8 ms 4736 KB Output is correct
9 Correct 8 ms 4756 KB Output is correct
10 Correct 9 ms 4764 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4472 KB Output is correct
2 Correct 8 ms 4552 KB Output is correct
3 Correct 8 ms 4552 KB Output is correct
4 Correct 8 ms 4592 KB Output is correct
5 Correct 7 ms 4592 KB Output is correct
6 Correct 8 ms 4656 KB Output is correct
7 Correct 8 ms 4668 KB Output is correct
8 Correct 8 ms 4736 KB Output is correct
9 Correct 8 ms 4756 KB Output is correct
10 Correct 9 ms 4764 KB Output is correct
11 Correct 353 ms 8872 KB Output is correct
12 Correct 387 ms 8872 KB Output is correct
13 Correct 388 ms 8872 KB Output is correct
14 Correct 418 ms 8872 KB Output is correct
15 Correct 362 ms 8972 KB Output is correct
16 Correct 408 ms 8972 KB Output is correct
17 Correct 394 ms 8972 KB Output is correct
18 Correct 294 ms 10140 KB Output is correct
19 Correct 358 ms 10140 KB Output is correct
20 Correct 337 ms 10140 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4472 KB Output is correct
2 Correct 8 ms 4552 KB Output is correct
3 Correct 8 ms 4552 KB Output is correct
4 Correct 8 ms 4592 KB Output is correct
5 Correct 7 ms 4592 KB Output is correct
6 Correct 8 ms 4656 KB Output is correct
7 Correct 8 ms 4668 KB Output is correct
8 Correct 8 ms 4736 KB Output is correct
9 Correct 8 ms 4756 KB Output is correct
10 Correct 9 ms 4764 KB Output is correct
11 Correct 353 ms 8872 KB Output is correct
12 Correct 387 ms 8872 KB Output is correct
13 Correct 388 ms 8872 KB Output is correct
14 Correct 418 ms 8872 KB Output is correct
15 Correct 362 ms 8972 KB Output is correct
16 Correct 408 ms 8972 KB Output is correct
17 Correct 394 ms 8972 KB Output is correct
18 Correct 294 ms 10140 KB Output is correct
19 Correct 358 ms 10140 KB Output is correct
20 Correct 337 ms 10140 KB Output is correct
21 Correct 403 ms 10140 KB Output is correct
22 Correct 392 ms 10140 KB Output is correct
23 Correct 450 ms 10140 KB Output is correct
24 Correct 453 ms 10140 KB Output is correct
25 Correct 485 ms 10180 KB Output is correct
26 Correct 486 ms 10180 KB Output is correct
27 Correct 525 ms 10180 KB Output is correct
28 Correct 321 ms 10992 KB Output is correct
29 Correct 380 ms 10992 KB Output is correct
30 Correct 393 ms 10992 KB Output is correct
31 Correct 430 ms 10992 KB Output is correct
32 Correct 470 ms 10992 KB Output is correct
33 Correct 392 ms 10992 KB Output is correct
34 Correct 463 ms 10992 KB Output is correct
35 Correct 451 ms 10992 KB Output is correct
36 Correct 290 ms 10992 KB Output is correct
37 Correct 369 ms 10992 KB Output is correct
38 Correct 502 ms 10992 KB Output is correct
39 Correct 424 ms 10992 KB Output is correct
40 Correct 459 ms 10992 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4472 KB Output is correct
2 Correct 8 ms 4552 KB Output is correct
3 Correct 8 ms 4552 KB Output is correct
4 Correct 8 ms 4592 KB Output is correct
5 Correct 7 ms 4592 KB Output is correct
6 Correct 8 ms 4656 KB Output is correct
7 Correct 8 ms 4668 KB Output is correct
8 Correct 8 ms 4736 KB Output is correct
9 Correct 8 ms 4756 KB Output is correct
10 Correct 9 ms 4764 KB Output is correct
11 Correct 87 ms 14492 KB Output is correct
12 Correct 89 ms 14492 KB Output is correct
13 Correct 102 ms 14520 KB Output is correct
14 Correct 122 ms 14520 KB Output is correct
15 Correct 88 ms 14676 KB Output is correct
16 Correct 123 ms 14676 KB Output is correct
17 Correct 106 ms 14676 KB Output is correct
18 Correct 75 ms 14676 KB Output is correct
19 Correct 90 ms 14676 KB Output is correct
20 Correct 92 ms 14676 KB Output is correct
21 Correct 98 ms 14676 KB Output is correct
22 Correct 124 ms 14676 KB Output is correct
23 Correct 85 ms 14676 KB Output is correct
24 Correct 120 ms 14676 KB Output is correct
25 Correct 113 ms 14676 KB Output is correct
26 Correct 73 ms 14676 KB Output is correct
27 Correct 99 ms 14676 KB Output is correct
28 Correct 86 ms 14676 KB Output is correct
29 Correct 113 ms 16572 KB Output is correct
30 Correct 98 ms 18704 KB Output is correct
31 Correct 90 ms 20804 KB Output is correct
32 Correct 181 ms 22860 KB Output is correct
33 Correct 111 ms 24764 KB Output is correct
34 Correct 70 ms 26736 KB Output is correct
35 Correct 100 ms 28880 KB Output is correct
36 Correct 109 ms 30968 KB Output is correct
37 Correct 105 ms 32996 KB Output is correct
38 Correct 102 ms 35088 KB Output is correct
39 Correct 104 ms 37156 KB Output is correct
40 Correct 101 ms 39208 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4472 KB Output is correct
2 Correct 8 ms 4552 KB Output is correct
3 Correct 8 ms 4552 KB Output is correct
4 Correct 8 ms 4592 KB Output is correct
5 Correct 7 ms 4592 KB Output is correct
6 Correct 8 ms 4656 KB Output is correct
7 Correct 8 ms 4668 KB Output is correct
8 Correct 8 ms 4736 KB Output is correct
9 Correct 8 ms 4756 KB Output is correct
10 Correct 9 ms 4764 KB Output is correct
11 Correct 353 ms 8872 KB Output is correct
12 Correct 387 ms 8872 KB Output is correct
13 Correct 388 ms 8872 KB Output is correct
14 Correct 418 ms 8872 KB Output is correct
15 Correct 362 ms 8972 KB Output is correct
16 Correct 408 ms 8972 KB Output is correct
17 Correct 394 ms 8972 KB Output is correct
18 Correct 294 ms 10140 KB Output is correct
19 Correct 358 ms 10140 KB Output is correct
20 Correct 337 ms 10140 KB Output is correct
21 Correct 403 ms 10140 KB Output is correct
22 Correct 392 ms 10140 KB Output is correct
23 Correct 450 ms 10140 KB Output is correct
24 Correct 453 ms 10140 KB Output is correct
25 Correct 485 ms 10180 KB Output is correct
26 Correct 486 ms 10180 KB Output is correct
27 Correct 525 ms 10180 KB Output is correct
28 Correct 321 ms 10992 KB Output is correct
29 Correct 380 ms 10992 KB Output is correct
30 Correct 393 ms 10992 KB Output is correct
31 Correct 430 ms 10992 KB Output is correct
32 Correct 470 ms 10992 KB Output is correct
33 Correct 392 ms 10992 KB Output is correct
34 Correct 463 ms 10992 KB Output is correct
35 Correct 451 ms 10992 KB Output is correct
36 Correct 290 ms 10992 KB Output is correct
37 Correct 369 ms 10992 KB Output is correct
38 Correct 502 ms 10992 KB Output is correct
39 Correct 424 ms 10992 KB Output is correct
40 Correct 459 ms 10992 KB Output is correct
41 Correct 87 ms 14492 KB Output is correct
42 Correct 89 ms 14492 KB Output is correct
43 Correct 102 ms 14520 KB Output is correct
44 Correct 122 ms 14520 KB Output is correct
45 Correct 88 ms 14676 KB Output is correct
46 Correct 123 ms 14676 KB Output is correct
47 Correct 106 ms 14676 KB Output is correct
48 Correct 75 ms 14676 KB Output is correct
49 Correct 90 ms 14676 KB Output is correct
50 Correct 92 ms 14676 KB Output is correct
51 Correct 98 ms 14676 KB Output is correct
52 Correct 124 ms 14676 KB Output is correct
53 Correct 85 ms 14676 KB Output is correct
54 Correct 120 ms 14676 KB Output is correct
55 Correct 113 ms 14676 KB Output is correct
56 Correct 73 ms 14676 KB Output is correct
57 Correct 99 ms 14676 KB Output is correct
58 Correct 86 ms 14676 KB Output is correct
59 Correct 113 ms 16572 KB Output is correct
60 Correct 98 ms 18704 KB Output is correct
61 Correct 90 ms 20804 KB Output is correct
62 Correct 181 ms 22860 KB Output is correct
63 Correct 111 ms 24764 KB Output is correct
64 Correct 70 ms 26736 KB Output is correct
65 Correct 100 ms 28880 KB Output is correct
66 Correct 109 ms 30968 KB Output is correct
67 Correct 105 ms 32996 KB Output is correct
68 Correct 102 ms 35088 KB Output is correct
69 Correct 104 ms 37156 KB Output is correct
70 Correct 101 ms 39208 KB Output is correct
71 Runtime error 676 ms 65572 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.
72 Halted 0 ms 0 KB -