Submission #702862

#TimeUsernameProblemLanguageResultExecution timeMemory
702862Halogenpopa (BOI18_popa)C++14
100 / 100
99 ms424 KiB
#include <bits/stdc++.h> #include "popa.h" using namespace std; int rl[1005], rr[1005]; int solve(int N, int*l, int *r) { memset(rl, -1, sizeof(rl)); memset(rr, -1, sizeof(rr)); stack<int> s; s.push(-1); for (int i = 0; i < N; i++) { int last = -1; while (s.size() > 1) { int cur = s.top(); s.pop(); if (!query(s.top() + 1, cur, cur, i)) { last = cur; continue; } s.push(cur); rr[cur] = i; break; } if (s.size() > 1) rr[s.top()] = i; rl[i] = last; s.push(i); } for (int i = 0; i < N; i++) { l[i] = rl[i]; r[i] = rr[i]; } while(s.size() > 2) s.pop(); return s.top(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...