oj.uz

Submission #101581

# Submission time Handle Problem Language Result Execution time Memory
101581 2019-03-19T04:39:46 Z lyc popa (BOI18_popa) C++14
0 / 100
 13 ms 392 KB 
#include <popa.h>

int solve(int N, int* Left, int* Right) {
    int rt = 0;
    for (int i = 0; i < N; ++i) Left[i] = Right[i] = -1;

    for (int i = 1; i < N; ++i) {
        int same = query(0, rt, rt, i);
        if (same && Right[rt] == -1) {
            Right[rt] = i;
        }
        else {
            Left[i] = rt;
            rt = i;
        }
    }
    return rt;
}

Subtask #1
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 392 KB not a valid solution
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 316 KB not a valid solution
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 384 KB not a valid solution
2 Halted 0 ms 0 KB -