# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
825857 | AlphaMale06 | Monthly railway pass (LMIO18_menesinis_bilietas) | C++14 | 365 ms | 262144 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 F first
#define S second
#define mp make_pair
#define pb push_back
const int N = 5000005;
int p[N];
int sz[N];
set<int> reps;
set<pair<int, int>, less<pair<int, int>>> adj[N];
vector<pair<int, int>> paid;
void make(int v){p[v]=v; sz[v]=1;}
int rep(int v){
if(p[v]==v)return v;
return p[v]=rep(p[v]);
}
void unite(int v, int u){
v=rep(v);
u=rep(u);
if(u==v)return;
if(sz[u]>sz[v]){
swap(u, v);
}
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... |