# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
413031 | phathnv | Road Closures (APIO21_roads) | C++11 | 457 ms | 52348 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>
#include "roads.h"
using namespace std;
const int N = 1e5;
int k, deg[N];
long long dp[N][2], sum[N], f[N];
multiset<long long> s[N][2];
vector<pair<int, int>> preAdj[N], adj[N];
bool mark[N];
set<int> cur, needVisit;
void Add(int u, long long val0, long long val1) {
val1 = min(val1, val0);
sum[u] += val0;
f[u] += val1 - val0;
s[u][0].insert(val1 - val0);
}
void Del(int u, long long val0, long long val1) {
val1 = min(val1, val0);
sum[u] -= val0;
if (s[u][0].find(val1 - val0) != s[u][0].end()) {
f[u] -= val1 - val0;
s[u][0].erase(s[u][0].find(val1 - val0));
} else {
s[u][1].erase(s[u][1].find(val1 - val0));
}
}
# | 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... |