# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1155562 | NeilP | Toll (APIO13_toll) | C++20 | 0 ms | 324 KiB |
#include <iostream>
#include <vector>
#include <algorithm>
using std::pair;
using std::vector;
using std::cout;
using std::cin;
using std::endl;
using std::endl;
using std::swap;
struct Edge{
long long a;
long long b;
long long cost;
};
long long n, m, k;
vector<vector<pair<long long, long long>>> tree;
bool comp(Edge a, Edge b){
return a.cost < b.cost;
}
vector<long long> parent;
vector<long long> size;
vector<long long> tots;
vector<long long> parent2;
vector<long long> size2;
# | 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... |