# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
395346 | KoD | Graph (BOI20_graph) | C++17 | 324 ms | 20080 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>
template <class T>
using Vec = std::vector<T>;
int main() {
int N, M;
std::cin >> N >> M;
Vec<int> A(M), B(M), C(M);
Vec<Vec<std::pair<int, int>>> graph(N);
for (int i = 0; i < M; ++i) {
std::cin >> A[i] >> B[i] >> C[i];
A[i] -= 1;
B[i] -= 1;
C[i] *= 2;
graph[A[i]].emplace_back(B[i], C[i]);
graph[B[i]].emplace_back(A[i], C[i]);
}
Vec<bool> done(N);
Vec<std::pair<int, int>> coeff(N);
Vec<int> val(N);
Vec<int> visited;
auto dfs = [&](auto&& dfs, const int u) -> void {
done[u] = true;
visited.push_back(u);
for (const auto [v, c]: graph[u]) {
if (!done[v]) {
coeff[v].first = -coeff[u].first;
coeff[v].second = c - coeff[u].second;
dfs(dfs, v);
# | 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... |