# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
920869 | Sandarach151 | Monthly railway pass (LMIO18_menesinis_bilietas) | C++17 | 580 ms | 90656 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> link;
vector<int> sizes;
int find(int x){
while(x!=link[x]) x = link[x];
return x;
}
bool same(int a, int b){
return find(a)==find(b);
}
void unite(int a, int b){
a = find(a);
b = find(b);
if(a!=b){
if(sizes[a]<sizes[b]) swap(a, b);
link[b] = a;
sizes[a] += sizes[b];
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
# | 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... |