# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
208606 | dolphingarlic | Tug of War (BOI15_tug) | C++14 | 808 ms | 9468 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;
multiset<pair<int, int>> graph[60001];
bool visited[60001];
bitset<600001> dp;
int tot = 0, sm = 0;
void dfs(int node) {
visited[node] = true;
if (!graph[node].size()) return;
int nxt, cost;
tie(nxt, cost) = *graph[node].begin();
tot += cost;
if (!visited[nxt]) {
graph[nxt].erase(graph[nxt].find({node, -cost}));
graph[node].clear();
dfs(nxt);
}
}
int main() {
int n, k;
scanf("%d %d", &n, &k);
for (int i = 1; i <= 2 * n; i++) {
int l, r, s;
scanf("%d %d %d", &l, &r, &s);
graph[l].insert({n + r, s});
graph[n + r].insert({l, -s});
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... |