# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
528507 | cologne | Road Closures (APIO21_roads) | C++17 | 155 ms | 44632 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 "roads.h"
#include <algorithm>
#include <functional>
#include <map>
#include <utility>
#include <vector>
using namespace std;
struct Choicer
{
map<long long, int> M;
map<long long, int>::iterator ptr;
long long left_sum;
int left_count;
long long total_sum;
Choicer() : M(), ptr(M.end()), left_sum(0), left_count(0), total_sum(0)
{
}
void add(long long pick, long long skip, int delta)
{
pick = min(pick, skip);
total_sum += skip * delta;
long long save_cost = pick - skip;
if (ptr == M.end() || save_cost < ptr->first)
{
left_sum += save_cost * delta;
left_count += delta;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |