# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
890893 | nahco314 | Tug of War (BOI15_tug) | C++14 | 3075 ms | 4272 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;
#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
void ng() {
cout << "NO" << endl;
exit(0);
}
int remove(int v, vector<set<tuple<int, int, int>>>& g) {
if (g[v].size() == 1) {
tuple<int, int, int> elt = *g[v].begin();
int l = get<0>(elt);
int r = get<1>(elt);
int s = get<2>(elt);
g[l].erase({l, r, s});
g[r].erase({r, l, s});
return s + -remove(r, g);
}
return 0;
}
int dfs(int v, int used_e, int sign, vector<set<tuple<int, int, int>>>& g, vector<int>& seen) {
seen[v] = sign;
int res = 0;
sign *= -1;
for (auto [nxt, s, e] : g[v]) {
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... |