Submission #65178

#TimeUsernameProblemLanguageResultExecution timeMemory
65178spencercomptonpopa (BOI18_popa)C++14
0 / 100
61 ms440 KiB
#include <bits/stdc++.h> #include "popa.h" using namespace std; // int query(int a, int b, int c, int d){ // return 1; // } vector<int> le; vector<int> ri; int f(int l, int r){ if(l>r){ return -1; } if(l==r){ le[l] = -1; ri[r] = -1; return l; } for(int i = l; i<=r; i++){ if(query(l,r,i,i)==1){ le[l] = f(l,i-1); ri[r] = f(i+1,r); return i; } } assert(false); return -69; } int solve(int n, int* left, int *right){ le.resize(n); ri.resize(n); int ret = f(0,n-1); for(int i = 0; i<n; i++){ left[i] = le[i]; right[i] = ri[i]; } return ret; } // int main(){ // }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...