# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
559395 | Olympia | Tug of War (BOI15_tug) | C++17 | 1691 ms | 16468 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;
vector<multiset<pair<int,int> > > adj;
vector<bool> hasVisited;
int ans = 0;
void dfs (int curNode, int prevNode) {
if (hasVisited[curNode]) {
return;
}
hasVisited[curNode] = true;
for (pair<int,int> p: adj[curNode]) {
if (p.first != prevNode) {
ans += p.second;
dfs (p.first, curNode);
}
}
}
int c = 0;
void apply () {
queue<int> q;
for (int i = 0; i < adj.size(); i++) {
if (adj[i].size() == 1) {
q.push(i);
}
}
while (!q.empty()) {
int x = q.front();
q.pop();
pair<int,int> p = *adj[x].begin();
c += p.second;
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... |