# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
920947 | simuyu | Monthly railway pass (LMIO18_menesinis_bilietas) | C++14 | 718 ms | 88300 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 ll long long
#define f first
#define s second
vector<set<long> > adjs; // note that will have to findSet each of these.
class UFDS
{
public:
vector<long> parent, sizes;
long num_sets;
UFDS(long n) {
for (long i=0; i<n; i++) {
parent.push_back(i);
}
for (long i=0; i<n; i++) {
sizes.push_back(1);
}
num_sets = n;
}
long findSet(long i) {
if (parent[i] == i) return i;
vector<long> elems; // path compression
while (parent[i] != i) {
elems.push_back(i);
i = parent[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... |