# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
572465 | valerikk | Diversity (CEOI21_diversity) | C++17 | 50 ms | 2664 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 = 3e5 + 7;
const int Q = 5e4 + 11;
const int B = 500;
long long solve(vector<pair<int, int>> c) {
reverse(c.begin(), c.end());
int n = 0, k = 0;
deque<pair<int, int>> q;
int t = 0;
for (const auto &[x, y] : c) {
n += x * y;
k += y;
if (t) {
q.push_back({x, (y + 1) / 2});
if (y > 1)
q.push_front({x, y / 2});
} else {
q.push_front({x, (y + 1) / 2});
if (y > 1)
q.push_back({x, y / 2});
}
t = (t + y) & 1;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |