oj.uz

Submission #418058

# Submission time Handle Problem Language Result Execution time Memory
418058 2021-06-05T01:36:15 Z cgiosy Bali Sculptures (APIO15_sculpture) C++17
0 / 100
 1 ms 204 KB 
#include <bits/stdc++.h>
using namespace std;
using ll=long long;

int main() {
	ios::sync_with_stdio(0);cin.tie(0);
	int N, S, E;
	cin>>N>>S>>E;
	ll A[N+1];
	A[0]=0;
	for(int i=1; i<=N; i++) cin>>A[i], A[i]+=A[i-1];
	ll l=0, r=1LL<<41;
	int L[N+1], R[N+1];
	L[0]=R[0]=0;
	while(l+1<r) {
		ll m=l+r>>1;
		for(int i=1; i<=N; i++) {
			L[i]=N, R[i]=1;
			for(int j=0; j<=i; j++) if(!(A[i]-A[j]&m)) {
				L[i]=min(L[i], L[j]+1);
				R[i]=max(R[i], R[j]+1);
			}
		}
		(S<=R[N] && L[N]<=E ? l : r)=m;
	}
	cout<<(1LL<<41)-1-l<<'\n';
}

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:16:9: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   16 |   ll m=l+r>>1;
      |        ~^~
sculpture.cpp:19:37: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   19 |    for(int j=0; j<=i; j++) if(!(A[i]-A[j]&m)) {
      |                                 ~~~~^~~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Incorrect 0 ms 204 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Incorrect 1 ms 204 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Incorrect 1 ms 204 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Incorrect 1 ms 204 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Incorrect 1 ms 204 KB Output isn't correct
7 Halted 0 ms 0 KB -