# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1130925 | yellowtoad | Roller Coaster Railroad (IOI16_railroad) | C++20 | 452 ms | 43492 KiB |
#include "railroad.h"
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
long long d[400010], ans, cnt, p[400010];
vector<int> discrete;
vector<pair<long long,pair<int,int>>> edge;
map<int,int> mp;
int dsu(int u) {
if (p[u] == u) return u;
return p[u] = dsu(p[u]);
}
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
s.push_back(1e9); t.push_back(1);
int n = (int) s.size();
for (int i = 0; i < n; i++) {
discrete.push_back(s[i]);
discrete.push_back(t[i]);
}
sort(discrete.begin(),discrete.end());
for (int i = 0; i < discrete.size(); i++) mp[discrete[i]] = i;
for (int i = 0; i < n; i++) {
int u = mp[s[i]], v = mp[t[i]];
d[u]--;
d[v]++;
edge.push_back({0,{u,v}});
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... |