# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
372408 | gozonite | Palembang Bridges (APIO15_bridge) | C++14 | 472 ms | 15236 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;
typedef long long ll;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
typedef pair<int, int> pi;
#define MOD 1000000007LL
struct Data {
ll fi, si;
};
bool cmp(const Data& a, const Data& b) { return a.fi+a.si < b.fi+b.si; }
int K, N;
vector<Data> info;
int n;
multiset<ll> fl, fh, sl, sh;
ll fls = 0, fhs = 0, sls = 0, shs = 0;
void trans(ll x) {
if (sl.find(x) != sl.end()) {
sl.erase(sl.find(x)); sls -= x;
if (sl.size()+1 < sh.size()) { auto it = sh.begin(); sls += *it; shs -= *it; sl.insert(*it); sh.erase(it); }
} else if (sh.find(x) != sh.end()) {
sh.erase(sh.find(x)); shs -= x;
if (sh.size() < sl.size()) { auto it = sl.end(); it--; shs += *it; sls -= *it; sh.insert(*it); sl.erase(it); }
}
if (x >= *fh.begin()) {
fh.insert(x); fhs += x;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |