# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1208513 | omsincoconut | Roller Coaster Railroad (IOI16_railroad) | C++17 | 42 ms | 6468 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<pair<ll, ll>> ts(n);
for (int i = 0; i < n; i++) ts[i] = make_pair((ll)t[i], (ll)s[i]);
sort(ts.begin(), ts.end());
ll ans = 0;
for (int i = 0; i < n-1; i++) ans += max(0LL, ts[i+1].first - ts[i].second);
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... |