# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
73930 | ainta | Toll (APIO13_toll) | C++17 | 2330 ms | 19180 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<stdio.h>
#include<algorithm>
#include<list>
#define N_ 101000
#define LIT list<Edge3>::iterator
using namespace std;
int N, M, K, Renum[N_], C, P[N_];
long long SZ[30], Res;
struct Edge{
int a, b, c;
bool operator <(const Edge &p)const{
return c < p.c;
}
}Ed[301000];
struct Edge2{
int a, b;
}w[30];
struct Edge3{
int a, b, gap;
bool ck;
}tp, par2[N_], def_E[30];
list <Edge3> E[N_];
int par[N_];
int find(int a){
if (a == par[a])return a;
return par[a] = find(par[a]);
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... |