제출 #522431

#제출 시각아이디문제언어결과실행 시간메모리
522431ntabc05101popa (BOI18_popa)C++14
0 / 100
3059 ms264 KiB
#include<bits/stdc++.h> #include "popa.h" using namespace std; #define taskname "" int solve(int N, int *Left, int *Right) { for (int i = 0; i < N; i++) { Left[i] = Right[i] = 1; } vector<int> st(1, 0); for (int i = 1; i < N; i++) { int y = -1; while (!st.empty()) { int x = st.back(); while (~Left[x]) { x = Left[x]; } if (query(x, i, st.back(), st.back())) { break; } y = st.back(); st.pop_back(); } if (!st.empty()) { Right[st.back()] = i; } Left[i] = y; st.push_back(i); } while (st.size() > 1) { st.pop_back(); } return st.back(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...