# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
642829 | JvThunder | Monthly railway pass (LMIO18_menesinis_bilietas) | C++14 | 366 ms | 27372 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.
// JvThunder ORZ Template
#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define pii pair<int,int>
typedef long long ll;
using namespace std;
const int N = 5e5+5;
int n,m;
int par[N];
int sz[N];
int deg[N];
vector<pii> train;
vector<pii> bus;
int find(int x)
{
if(par[x]==x) return x;
return par[x] = find(par[x]);
}
void join(int a,int b)
{
int ra = find(a); int rb = find(b);
if(ra==rb) return;
par[rb] = ra;
sz[ra] += sz[rb];
# | 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... |