# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
995223 | BF001 | Hacker (BOI15_hac) | C++17 | 284 ms | 26364 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;
#define N 500005
#define int long long
int n, a[2 * N], res[N];
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cin >> n;
for (int i = 1; i <= n; i++){
cin >> a[i];
res[i] = 1e18;
a[i + n] = a[i];
a[i] += a[i - 1];
}
for (int i = n + 1; i <= 2 * n; i++){
a[i] += a[i - 1];
}
int sz = (n + 1) / 2;
multiset<int> st;
for (int i = 1; i <= 2 * n; i++){
if (i + sz - 1 <= 2 * n){
# | 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... |