| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1025064 | 0npata | Roller Coaster Railroad (IOI16_railroad) | C++17 | 337 ms | 131920 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 vec vector
#define int long long
const int MXN = 16;
const int INF = 1e18;
int dist[MXN][MXN];
int dp[MXN][MXN][(1<<MXN) + 1];
long long plan_roller_coaster(std::vector<int32_t> s, std::vector<int32_t> t) {
int n = s.size();
for(int i = 0; i<n; i++) {
for(int j = 0; j<n; j++) {
if(i==j) continue;
dist[i][j] = max(t[i]-s[j], 0);
}
}
for(int i = 0; i<(1<<n); i++) {
for(int j = 0; j<n; j++) {
for(int k = 0; k<n; k++) {
dp[j][k][i] = INF;
| # | 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... | ||||
