Submission #101592

#	Time	Username	Problem	Language	Result	Execution time	Memory
101592		lyc	popa (BOI18_popa)	C++14	0 / 100	10 ms	384 KiB

popa

#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
• Subtask 2: 0 / 24
• Subtask 3: 0 / 39