oj.uz

Submission #968416

# Submission time Handle Problem Language Result Execution time Memory
968416 2024-04-23T11:58:10 Z Acanikolic Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>

#define int long long

#define pb push_back

#define F first

#define S second

using namespace std;

const long long N = 2e5 + 10;

const long long mod = 998244353;

const long long inf = 1e9;

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

	int n,l,r;
	cin >> n >> l >> r;
	vector<int>a(n + 1),pref(n + 1);
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
		pref[i] = pref[i - 1] + a[i];
	}
	int res = (1ll << 31) - 1;
	for(int j = 30; j >= 0; j--) {
		int try_res = res ^ (1ll << j);
		vector<int>mx(n + 1);
		vector<int>mn(n + 1,inf);
		mn[0] = 0;
		for(int i = 1; i <= n; i++) {
			for(int k = 1; k <= i; k++) {
				int sum = pref[i] - pref[k - 1];
				if((sum & try_res) == sum) {
					mx[i] = max(mx[i],mx[k - 1] + 1);
					mn[i] = min(mn[i],mn[k - 1] + 1);
				}
			}
		}
		/*if(try_res == 11) {
			for(int i = 1; i <= n; i++) cout << mx[i] << " ";
			cout << endl;
			for(int i = 1; i <= n; i++) cout << mn[i] << " ";
			cout << endl;
		}*/
		int mnn = *min_element(mx.begin() + 1,mx.end());
		int mxx = *max_element(mn.begin() + 1,mn.end());
		if(mx[n] >= l && mnn > 0 && mxx < inf && mn[n] <= r) res = try_res;
	}
	cout << res;
    return 0; 
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -