# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
62984 | 2018-07-31T05:44:26 Z | sean617 | 라멘 (JOI14_ramen) | C++ | 3 ms | 656 KB |
#include "ramen.h" #include <vector> using namespace std; void Ramen(int N) { int i, mxi, mni; vector<int> mx, mn; mx.clear(), mn.clear(); for (i = 0; i < N - 1; i += 2) { if (Compare(i, i + 1) == 1) { mx.push_back(i); mn.push_back(i + 1); } else { mx.push_back(i + 1); mn.push_back(i); } } if (i == N - 1) mx.push_back(N - 1), mn.push_back(N - 1); mni = mn[0], mxi = mx[0]; for (i = 1; i < mn.size(); i++) if (Compare(mni, mn[i]) == 1) mni = mn[i]; for (i = 1; i < mx.size(); i++) if (Compare(mxi, mx[i]) == -1) mxi = mx[i]; Answer(mni, mxi); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 248 KB | Output is correct |
2 | Correct | 3 ms | 516 KB | Output is correct |
3 | Correct | 0 ms | 516 KB | Output is correct |
4 | Correct | 2 ms | 516 KB | Output is correct |
5 | Correct | 2 ms | 516 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 516 KB | Output is correct |
2 | Correct | 2 ms | 520 KB | Output is correct |
3 | Correct | 2 ms | 572 KB | Output is correct |
4 | Correct | 3 ms | 624 KB | Output is correct |
5 | Correct | 3 ms | 656 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 656 KB | Output is correct |
2 | Correct | 3 ms | 656 KB | Output is correct |
3 | Correct | 2 ms | 656 KB | Output is correct |
4 | Correct | 3 ms | 656 KB | Output is correct |
5 | Correct | 3 ms | 656 KB | Output is correct |