# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1069782 | TheQuantiX | Roller Coaster Railroad (IOI16_railroad) | C++17 | 68 ms | 15288 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;
constexpr ll INF = 1000000000000000000LL;
ll n, m, q, k, x, y, a, b, c;
long long plan_roller_coaster(vector<int> s, vector<int> t) {
n = (int) s.size();
if (n <= 16) {
vector< vector<ll> > dp((1 << n), vector<ll>(n, INF));
ll ans = INF;
for (int i = 1; i < (1 << n); i++) {
vector<int> v;
for (int j = 0; j < n; j++) {
if ((i >> j) & 1) {
v.push_back(j);
}
}
for (auto j : v) {
if (v.size() == 1) {
dp[i][j] = 0;
}
else {
for (int k = 0; k < n; k++) {
if (!((i >> k) & 1) || j == k) {
continue;
}
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... |