# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
523821 | 79brue | Firefighting (NOI20_firefighting) | C++14 | 271 ms | 25156 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;
typedef long long ll;
int n; ll k;
vector<pair<int, ll> > link[300002];
int main(){
scanf("%d %lld", &n, &k);
for(int i=1; i<n; i++){
int x, y; ll v;
scanf("%d %d %lld", &x, &y, &v);
link[x].push_back(make_pair(y, v));
link[y].push_back(make_pair(x, v));
}
printf("%d\n", n);
for(int i=1; i<=n; i++) printf("%d ", i);
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |