# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
262940 |
2020-08-13T11:18:26 Z |
dolphingarlic |
라멘 (JOI14_ramen) |
C++14 |
|
1 ms |
384 KB |
#include "ramen.h"
void Ramen(int N) {
int lo = -1, hi = -1;
if (N & 1) lo = hi = N - 1;
for (int i = 0; i < N - 1; i += 2) {
if (~Compare(i, i + 1)) {
if (hi == -1 || ~Compare(i, hi)) hi = i;
if (lo == -1 || ~Compare(lo, i + 1)) lo = i + 1;
} else {
if (hi == -1 || ~Compare(i + 1, hi)) hi = i + 1;
if (lo == -1 || ~Compare(lo, i)) lo = i;
}
}
Answer(lo, hi);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
256 KB |
Output is correct |
4 |
Correct |
0 ms |
256 KB |
Output is correct |
5 |
Correct |
0 ms |
256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
256 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Correct |
0 ms |
256 KB |
Output is correct |
4 |
Correct |
0 ms |
256 KB |
Output is correct |
5 |
Correct |
0 ms |
256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
256 KB |
Output is correct |
2 |
Correct |
1 ms |
256 KB |
Output is correct |
3 |
Correct |
0 ms |
256 KB |
Output is correct |
4 |
Correct |
0 ms |
256 KB |
Output is correct |
5 |
Correct |
0 ms |
256 KB |
Output is correct |