# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
272944 | ipaljak | Roller Coaster Railroad (IOI16_railroad) | C++14 | 2067 ms | 57412 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;
#define TRACE(x) cerr << #x << " " << x << endl
#define _ << " " <<
using llint = long long;
int n, m;
llint sol;
vector<int> v;
map<int, int> deg, dad, open;
int find(int x) {
if (dad[x] == x) return x;
return dad[x] = find(dad[x]);
}
void unite(int x, int y) {
dad[find(x)] = find(y);
}
llint plan_roller_coaster(vector<int> s, vector<int> t) {
m = (int)s.size();
for (int i = 0; i < m; ++i) {
v.emplace_back(s[i]);
# | 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... |