# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1208508 | omsincoconut | Roller Coaster Railroad (IOI16_railroad) | C++17 | 2096 ms | 4168 KiB |
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll plan_roller_coaster(vector<int> s, vector<int> t) {
int n = s.size();
vector<int> perm(n);
iota(perm.begin(), perm.end(), 0);
ll ans = (ll)1e18;
do {
ll val = 0;
for (int i = 0; i < n-1; i++)
val += max(0, t[perm[i]] - s[perm[i+1]]);
ans = min(ans, val);
} while (next_permutation(perm.begin(), perm.end()));
return ans;
}
컴파일 시 표준 에러 (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... |