# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1118326 | crafticat | Roller Coaster Railroad (IOI16_railroad) | C++17 | 316 ms | 41044 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>
#ifndef DEBUG
#include "railroad.h"
#endif
using namespace std;
template<typename T>
using V = vector<T>;
using ll = long long;
using vi = V<int>;
using pi = pair<int,int>;
constexpr int INF = 1e9 + 7;
#define F0R(i, n) for (int i = 0; i < n;i++)
#define FOR(i, j , n) for (int i = j ;i < n;i++)
struct Seg {
Seg *left = nullptr, *right = nullptr;
int l, r, mid;
pi v;
Seg(int l, int r, vi &arr) : l(l) ,r(r), mid((l + r) / 2) {
if (r - l > 1) {
left = new Seg(l, mid, arr);
right = new Seg(mid, r, arr);
v = min(left->v, right->v);
} else
v = {arr[l], l};
}
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... |