# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1192298 | Mousa_Aboubaker | Roller Coaster Railroad (IOI16_railroad) | C++20 | 2096 ms | 4164 KiB |
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
long long plan_roller_coaster(vector<int> s, vector<int> t) {
int n = s.size();
vector<int> ord(n);
iota(ord.begin(), ord.end(), 0);
long long mn = 1e18 + 10;
do
{
long long needed = 0;
long long curr = 1;
for(int j = 0; j < n; j++)
{
int i = ord[j];
needed += max(0ll, curr - s[i]);
curr = t[i];
}
// for(int i = 0; i < n; i++)
// cout << ord[i] << ' ';
// cout << '\n';
// cout << needed << '\n';
if(mn > needed)
mn = needed;
} while(next_permutation(ord.begin(), ord.end()));
return mn;
}
컴파일 시 표준 에러 (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... |