# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
237063 | Berted | Monthly railway pass (LMIO18_menesinis_bilietas) | C++14 | 733 ms | 70060 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 <iostream>
#include <vector>
#include <set>
#define pii pair<int, int>
#define pub push_back
#define si set<int>
#define fst first
#define snd second
using namespace std;
int n, m, pr[500001] = {}, sz[500001] = {}, comp = 0;
vector<pii> edge;
vector<si> adj;
int findRep(int x) {return pr[x] = (pr[x] == x) ? x : findRep(pr[x]);}
void joinG(int a, int b)
{
a = findRep(a), b = findRep(b);
if (a != b)
{
pr[b] = a;
sz[a] += sz[b];
sz[b] = 0;
comp--;
}
}
int main()
{
ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
int res = 0;
cin >> n >> m;
for (int i = 0; i < n; i++) {adj.pub(si()); pr[i] = i; sz[i] = 1;}
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... |