# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1040190 | Soumya1 | Roller Coaster Railroad (IOI16_railroad) | C++17 | 34 ms | 20424 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 "railroad.h"
#include <bits/stdc++.h>
using namespace std;
const int mxN = 2e5 + 5;
int par[mxN], sz[mxN];
int find(int u) {
return (u == par[u] ? u : par[u] = find(par[u]));
}
bool merge(int u, int v) {
u = find(u), v = find(v);
if (u == v) return false;
if (sz[u] > sz[v]) swap(u, v);
par[u] = v;
sz[v] += sz[u];
return true;
}
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
int n = s.size();
vector<pair<int, int>> all;
for (int i : s) all.push_back({i, 0});
for (int i : t) all.push_back({i, 1});
for (int i = 0; i < all.size(); i++) par[i] = i, sz[i] = 1;
int cur = 0;
long long ans = 0;
vector<tuple<int, int, int>> edges;
sort(all.begin(), all.end());
for (int i = 0; i < n; i++) {
int x = lower_bound(all.begin(), all.end(), pair<int, int> {s[i], 0}) - all.begin();
int y = lower_bound(all.begin(), all.end(), pair<int, int> {t[i], 1}) - all.begin();
merge(x, y);
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... |