# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
921043 | zhehan | Monthly railway pass (LMIO18_menesinis_bilietas) | C++14 | 495 ms | 140500 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 int long long
int parent[500000];
int f(int a){
if(parent[a]==a){
return a;
}
return parent[a]=f(parent[a]);
}
void u(int a,int b){
parent[f(a)]=f(b);
}
signed main()
{
int n,m;
cin>>n>>m;
for(int i{1};i<n+1;++i){
parent[i]=i;
}
map<int,vector<int>> ma;
for(int i{};i<m;++i){
int a,b;
char c;
# | 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... |