# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
332152 | quocnguyen1012 | Roller Coaster Railroad (IOI16_railroad) | C++14 | 287 ms | 19800 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;
using ll = long long;
const int maxn = 4e5 + 5;
int lab[maxn], deg[maxn];
int n;
int findset(int u) {
if (lab[u] == u) return u;
return lab[u] = findset(lab[u]);
}
bool join(int u, int v) {
u = findset(u); v = findset(v);
if (u == v) return false;
lab[v] = u;
return true;
}
long long plan_roller_coaster(vector<int> s, vector<int> t) {
vector<int> coor;
n = s.size();
for (int & i : s) coor.push_back(i);
for (int & i : t) coor.push_back(i);
sort(coor.begin(), coor.end());
coor.erase(unique(coor.begin(), coor.end()), coor.end());
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... |