# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1130395 | heey | Monthly railway pass (LMIO18_menesinis_bilietas) | C++20 | 869 ms | 76644 KiB |
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> sz, p, mark;
vector<vector<int>> adj;
void make(int v){
sz[v] = 1;
p[v] = v;
}
int dsu(int v){
if(v == p[v]) return v;
return p[v] = dsu(p[v]);
}
void join(int a, int b){
a = dsu(a);
b = dsu(b);
if(a != b){
if(sz[a] < sz[b]) swap(a, b);
p[b] = a;
sz[a] += sz[b];
}
}
void dfs(int v){
mark[v] = true;
for(int e : adj[v]){
# | 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... |