# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
920858 | yhkhoo | Monthly railway pass (LMIO18_menesinis_bilietas) | C++17 | 536 ms | 110560 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;
typedef pair<int, int> pii;
vector<int> p;
int get_parent(int x){
if(p[x] == x) return x;
p[x] = get_parent(p[x]);
return p[x];
}
void union_set(int u, int v){
u = get_parent(u);
v = get_parent(v);
if(u==v) return;
p[u] = v;
}
int main(){
cin.tie(0); ios_base::sync_with_stdio(0);
int n, m;
cin >> n >> m;
p.clear();
p.reserve(n);
for(int i=0; i<n; i++){
p.push_back(i);
}
vector<pii> bus;
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... |