# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23155 | ainta | Logistical Metropolis (KRIII5_LM) | C++14 | 1193 ms | 48572 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<cstdio>
#include<algorithm>
#include<vector>
#define pii pair<int,int>
using namespace std;
vector<int>E[101000], T[101000], L[101000];
int n, m, pL[101000][20], par[101000][18], Dep[101000], Num[101000], Ed[101000], cnt;
struct Edge{
int a, b, c;
bool operator <(const Edge &p)const{
return c<p.c;
}
}w[301000];
int UF[101000];
long long S;
int Find(int a){
if(a==UF[a])return a;
return UF[a] = Find(UF[a]);
}
bool Merge(int a, int b){
a=Find(a),b=Find(b);
if(a==b)return false;
UF[a] = b;
return true;
}
void DFS(int a, int pp){
int i, x;
Num[a] = ++cnt;
for(i=0;i<17;i++){
par[a][i+1]=par[par[a][i]][i];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |