제출 #95156

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
95156		updown1	popa (BOI18_popa)	C++17	0 / 100	11 ms	376 KiB

popa

#include <popa.h>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, a, b) for(int i=a; i<b; i++)
#define ffi For(i, 0, N)
#define ffj For(j, 0, P)
#define ffa ffi ffj
#define s <<" "<<
//#define c <<" : "<<
#define w cout
#define e endl//"\n"
#define pb push_back
#define mp make_pair
#define a first
#define b second
//#define int ll
//500,000,000 operations
const int MAXN = 1000;
//Global Variables
int solve(int N, int* l, int* r) {
    ffi l[i] = r[i] = -1;
    int root = 0;
    For (i, 1, N) {
        if (query(i-1, i, i, i)) {
            /// it's the root
            l[i] = root;
            root = i;
        }
        else {
            r[i-1] = i;
        }
    }
    return root;
}

• Subtask 1: 0 / 37
• Subtask 2: 0 / 24
• Subtask 3: 0 / 39