# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
563136 | four_specks | Hacker (BOI15_hac) | C++17 | 413 ms | 26372 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;
inline namespace
{
} // namespace
void solve(const int _test_ = -1)
{
int n;
cin >> n;
int m = (n + 1) / 2;
vector<long> v(n);
for (long &x : v)
cin >> x;
vector w = v;
for (int i = 0; i < m; i++)
w.push_back(v[i]);
long res = 0;
multiset<long> ms;
queue<long> q;
long sum = 0;
for (int i = n - m; i < n; i++)
sum += w[i];
# | 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... |