# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
100055 | 2019-03-09T07:52:00 Z | helloworldworld | Roller Coaster Railroad (IOI16_railroad) | C++14 | 2000 ms | 4280 KB |
#include "railroad.h" #include <bits/stdc++.h> using namespace std; long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) { int n = (int) s.size(); int arr[n]; for(int i=0;i<n;i++) arr[i]=i; long long mini,cur; for(int i=1;i<n;i++){ if(t[i-1]>s[i]) cur+=t[i-1]-s[i]; } mini=cur; while(next_permutation(arr,arr+n)){ for(int i=1;i<n;i++){ if(t[i-1]>s[i]) cur+=t[i-1]-s[i]; } if(mini>cur) mini=cur; } return mini; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | n = 2 |
2 | Correct | 2 ms | 384 KB | n = 2 |
3 | Correct | 3 ms | 384 KB | n = 2 |
4 | Correct | 3 ms | 384 KB | n = 2 |
5 | Correct | 2 ms | 384 KB | n = 2 |
6 | Correct | 2 ms | 384 KB | n = 2 |
7 | Incorrect | 2 ms | 256 KB | answer is not correct: 79364658 instead of 0 |
8 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | n = 2 |
2 | Correct | 2 ms | 384 KB | n = 2 |
3 | Correct | 3 ms | 384 KB | n = 2 |
4 | Correct | 3 ms | 384 KB | n = 2 |
5 | Correct | 2 ms | 384 KB | n = 2 |
6 | Correct | 2 ms | 384 KB | n = 2 |
7 | Incorrect | 2 ms | 256 KB | answer is not correct: 79364658 instead of 0 |
8 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2017 ms | 4280 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | n = 2 |
2 | Correct | 2 ms | 384 KB | n = 2 |
3 | Correct | 3 ms | 384 KB | n = 2 |
4 | Correct | 3 ms | 384 KB | n = 2 |
5 | Correct | 2 ms | 384 KB | n = 2 |
6 | Correct | 2 ms | 384 KB | n = 2 |
7 | Incorrect | 2 ms | 256 KB | answer is not correct: 79364658 instead of 0 |
8 | Halted | 0 ms | 0 KB | - |