# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
549873 | sheldon | Race (IOI11_race) | C++14 | 0 ms | 0 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;
const int nax = 1e6 + 20;
vector<int> edges[nax];
map<pair<int, int>, int> mp;
void solve() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n - 1; ++i) {
int u, v, x;
cin >> u >> v >> x;
}
int ans;
cin >> ans;
cout << ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
}