# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
731086 | Ivo_12 | Torrent (COI16_torrent) | C++17 | 206 ms | 17452 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;
int n, a, b, x, y;
vector < int > connections[300010];
vector < int > trail;
int main( void ) {
cin >> n >> a >> b;
for(int i = 0; i < n-1; i++) {
cin >> x >> y;
connections[x].push_back(y);
connections[y].push_back(x);
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |