Submission #133564

# Submission time Handle Problem Language Result Execution time Memory
133564 2019-07-21T05:01:59 Z junodeveloper Bali Sculptures (APIO15_sculpture) C++14
37 / 100
95 ms 560 KB
#include <bits/stdc++.h>
#define sz(x) (int)x.size()
#define fi first
#define se second
using namespace std;
typedef long long ll;
int n, A, B;
ll a[2010];
bool chk[2010][2010], chk2[2010];
inline bool f(ll x,ll sum,int p) {
	return (~x&sum)/(1ll<<p)==0;
}
bool Check1 (int x, int p) {
	int i,j,k;ll sum;
	for(i=1;i<=n;i++) {
		chk[i][1]=f(x,a[i],p);
		for(j=2;j<=i;j++) {
			chk[i][j]=false;
			for(k=i-1;k>=j-1;k--) {
				sum=a[i]-a[k];
				if(f(x,sum,p)) {
					chk[i][j]|=chk[k][j-1];
				}
			}
		}
	}
	bool res=false;
	for(i=A;i<=B;i++) res|=chk[n][i];
	return res;
}
bool Check2(int x, int p) {
	int i,j,k;ll sum;
	for(i=1;i<=n;i++) {
		chk2[i]=f(x,a[i],p);
		for(k=i-1;k>=1;k--) {
			sum=a[i]-a[k];
			if(f(x,sum,p)) {
				chk2[i]|=chk2[k];
			}
		}
	}
	return chk2[n];
}
int main() {
	int task;
	scanf("%d%d%d",&n,&A,&B);
	if(n<=100) task=0;
	else task=1;
	int i;
	for(i=1;i<=n;i++) {
		scanf("%lld",a+i);
		a[i]+=a[i-1];
	}
	ll res=0;
	for(i=43;i>=0;i--) {
		if(task) { if(!Check2(res,i)) res|=1ll<<i; }
		else { if(!Check1(res,i)) res|=1ll<<i; }
	}
	printf("%lld",res);
	return 0;
}

Compilation message

sculpture.cpp: In function 'bool Check2(int, int)':
sculpture.cpp:32:8: warning: unused variable 'j' [-Wunused-variable]
  int i,j,k;ll sum;
        ^
sculpture.cpp: In function 'int main()':
sculpture.cpp:46:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d",&n,&A,&B);
  ~~~~~^~~~~~~~~~~~~~~~~~~
sculpture.cpp:51:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",a+i);
   ~~~~~^~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 380 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 380 KB Output is correct
19 Correct 2 ms 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 380 KB Output is correct
30 Incorrect 3 ms 376 KB Output isn't correct
31 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 380 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 380 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 ms 348 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 7 ms 376 KB Output is correct
30 Correct 9 ms 376 KB Output is correct
31 Correct 14 ms 500 KB Output is correct
32 Correct 13 ms 380 KB Output is correct
33 Correct 13 ms 380 KB Output is correct
34 Correct 14 ms 500 KB Output is correct
35 Correct 13 ms 376 KB Output is correct
36 Correct 14 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 7 ms 376 KB Output is correct
17 Correct 9 ms 376 KB Output is correct
18 Correct 13 ms 504 KB Output is correct
19 Correct 13 ms 376 KB Output is correct
20 Correct 13 ms 376 KB Output is correct
21 Correct 15 ms 500 KB Output is correct
22 Correct 14 ms 420 KB Output is correct
23 Correct 14 ms 476 KB Output is correct
24 Correct 14 ms 476 KB Output is correct
25 Correct 27 ms 504 KB Output is correct
26 Correct 45 ms 504 KB Output is correct
27 Correct 71 ms 552 KB Output is correct
28 Correct 95 ms 504 KB Output is correct
29 Correct 92 ms 504 KB Output is correct
30 Correct 92 ms 560 KB Output is correct
31 Correct 94 ms 504 KB Output is correct
32 Correct 93 ms 504 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 400 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 14 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 380 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 3 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 3 ms 380 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 3 ms 380 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 380 KB Output is correct
30 Incorrect 3 ms 376 KB Output isn't correct
31 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Incorrect 3 ms 376 KB Output isn't correct
18 Halted 0 ms 0 KB -