# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
921020 | gelastropod | Monthly railway pass (LMIO18_menesinis_bilietas) | C++14 | 521 ms | 90292 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 nSets;
vector<int> dsu;
int find(int x)
{
if (dsu[x] == x) return x;
return dsu[x] = find(dsu[x]);
}
void join(int a, int b)
{
a = find(a), b = find(b);
if (a == b) return;
dsu[a] = b;
nSets--;
}
signed main()
{
int N, M, a, b, ans = 0;
cin >> N >> M;
char t;
for (int i = 0; i < N; i++) dsu.push_back(i);
nSets = N;
vector<vector<pair<int, bool>>> adjlist(N, vector<pair<int, bool>>());
for (int i = 0; i < M; i++)
{
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... |