# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
783632 | raysh07 | Hacker (BOI15_hac) | C++17 | 234 ms | 37956 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 int long long
#define INF (int)1e18
#define f first
#define s second
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
void Solve()
{
int n; cin >> n;
vector <int> a(2 * n + 1);
int tot = 0;
for (int i = 1; i <= n; i++){
cin >> a[i];
tot += a[i];
a[i + n] = a[i];
}
vector <int> p(2 * n + 1, 0);
for (int i = 1; i <= 2 * n; i++){
p[i] = p[i - 1] + a[i];
}
vector <int> v(2 * n + 1, 0);
int x = (n / 2);
for (int i = 1; i <= 2 * n; i++){
if (i + x > 2 * n) continue;
Compilation message (stderr)
# | 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... |