# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
947308 | AlphaMale06 | Evacuation plan (IZhO18_plan) | C++17 | 152 ms | 32764 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;
#define pb push_back
#define F first
#define S second
const int N = 1e5+3;
vector<pair<int, pair<int, int>>> edges;
vector<pair<int, int>> adj[N], g[N];
int dist[N], mark[N], p[N], sz[N], tin[N], tout[N];
int up[N][17], cost[N][17];
int timer=-1;
int find(int v){
if(p[v]==v)return v;
return p[v]=find(p[v]);
}
void merge(int u, int v){
u=find(u);
v=find(v);
if(u==v)return;
if(sz[u]<sz[v])swap(u, v);
sz[u]+=sz[v];
p[v]=u;
}
# | 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... |