oj.uz

Submission #262926

# Submission time Handle Problem Language Result Execution time Memory
262926 2020-08-13T11:10:50 Z dolphingarlic 라멘 (JOI14_ramen) C++14
50 / 100
 1 ms 256 KB 
#include "ramen.h"
#include <algorithm>

int ord[600];

void Ramen(int N) {
    std::srand(69420);
    if (N == 1) {
        Answer(0, 0);
        return;
    }
    for (int i = 0; i < N; i++) ord[i] = i;
    std::random_shuffle(ord, ord + N);
    int lo = ord[0], hi = ord[1];
    if (Compare(lo, hi) == 1) lo = ord[1], hi = ord[0];
    for (int i = 2; i < N; i++) {
        if (Compare(lo, ord[i]) == 1) lo = ord[i];
        else if (Compare(ord[i], hi) == 1) hi = ord[i];
    }
    Answer(lo, hi);
}

Subtask #1
20.0 / 20.0

# 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 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 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

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Runtime error 0 ms 256 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -