# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
642791 | sanstzu | Monthly railway pass (LMIO18_menesinis_bilietas) | C++14 | 666 ms | 103956 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;
vector<int> train[500069], bus[500069];
set<int> adj[500069];
int par[500069], sz[500069];
bool visited[500069];
int pars;
void init(){
for(int i=0; i<500069; i++){
par[i] = i;
sz[i] = 1;
visited[i] = 0;
}
}
int fp(int x){
if(par[x]==x) return x;
else return par[x]=fp(par[x]);
}
void merge(int x, int y){
int px, py;
px = fp(x), py = fp(y);
if(sz[px] > sz[py]){
par[py] = px;
sz[px] += sz[py];
} else {
par[px] = py;
sz[py] += sz[px];
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... |