# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
121508 | IOrtroiii | Palembang Bridges (APIO15_bridge) | C++14 | 480 ms | 15580 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.
/*
2 5
B 0 A 4
B 1 B 3
A 5 B 7
B 2 A 6
B 1 A 7
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll lsum;
ll rsum;
multiset<int> lval;
multiset<int> rval;
void add(int u, int v) {
rsum += u;
rval.insert(u);
rsum += v;
rval.insert(v);
while (rval.size() > lval.size()) {
int x = *rval.begin();
rsum -= x;
rval.erase(rval.find(x));
lsum += x;
lval.insert(x);
# | 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... |