# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
623706 | Joshc | Tug of War (BOI15_tug) | C++11 | 2153 ms | 10344 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;
#define pii pair<int, int>
#define mp make_pair
#define f first
#define s second
multiset<pii> edges[60005];
bitset<1200001> pos;
int bal;
void dfs(int x, int c) {
if (!edges[x].empty()) {
pii cur = *edges[x].begin();
edges[x].clear();
edges[cur.f].erase(edges[cur.f].find(mp(x, cur.s)));
bal += c*cur.s;
dfs(cur.f, -c);
}
}
int main() {
int n, k, x, y, z, balance = 600000;
scanf("%d%d", &n, &k);
for (int i=1; i<=2*n; i++) {
scanf("%d%d%d", &x, &y, &z);
y += n;
edges[x].insert(mp(y, z));
edges[y].insert(mp(x, z));
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... |