| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 971662 | Halym2007 | Bali Sculptures (APIO15_sculpture) | C++17 | 1 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 5;
#define ll long long
ll a[N];
int main () {
ll n, A, B, sum = 0;
cin >> n >> A >> B;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
sum += a[i];
}
ll jogap = sum;
ll sum1 = 0;
for (int i = 1; i <= n; ++i) {
sum1 += a[i];
sum -= a[i];
jogap = min (jogap, sum | sum1);
}
cout << jogap;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
