# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105313 | win11905 | Palembang Bridges (APIO15_bridge) | C++11 | 111 ms | 6408 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>
#define all(x) (x).begin(), (x).end()
#define pii pair<int, int>
#define x first
#define y second
#define long long long
using namespace std;
const int N = 1e5+5;
int k, n, sz;
vector<pii> vec;
long ans;
long dp[2][N];
void solve_median(int z) {
priority_queue<int> Q1;
priority_queue<int, vector<int>, greater<int> > Q2;
long sum1 = 0, sum2 = 0;
for(int i = 0; i < sz; ++i) {
Q1.emplace(vec[i].x), sum1 += vec[i].x;
Q2.emplace(vec[i].y), sum2 += vec[i].y;
if(Q1.top() > Q2.top()) {
int u = Q1.top(), v = Q2.top();
Q1.pop(), Q2.pop(); sum1 += v - u, sum2 += u - v;
Q1.emplace(v), Q2.emplace(u);
}
dp[z][i] = ((i+1ll) * (Q1.top()) - sum1) + (sum2 - (i+1ll) * Q1.top());
}
}
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... |