oj.uz

Submission #101592

# Submission time Handle Problem Language Result Execution time Memory
101592 2019-03-19T04:47:09 Z lyc popa (BOI18_popa) C++14
0 / 100
 10 ms 384 KB 
#include <popa.h>
int solve(int N, int* Left, int* Right) {
    int rt = 0, last = 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);
        //cout << 0 << " " << rt << " vs " << rt << " " << i << " :: " << same << endl;
        if (same) {
            Right[last] = i;
            last = i;
        }
        else {
            Left[i] = rt;
            rt = i;
            last = i;
        }
    }
    return rt;
}

Subtask #1
0 / 37.0

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

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 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 10 ms 384 KB not a valid solution
2 Halted 0 ms 0 KB -