# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102829 | pavel | Editor (BOI15_edi) | C++14 | 3071 ms | 359800 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <stack>
#include <set>
using namespace std;
typedef pair<int,int> ii;
const int MAXN = 1<<19;
int n;
stack<int> a[MAXN];
int b[MAXN], p[MAXN];
int seg[2*MAXN];
void add(int x, int idx){
a[x].push(idx);
seg[MAXN+x]=a[x].top();
for(int i=(MAXN+x)/2;i>0;i/=2){
seg[i]=max(seg[i*2], seg[i*2+1]);
}
}
void rem(int x){
a[x].pop();
if(a[x].empty()) seg[MAXN+x]=-1;
else seg[MAXN+x]=a[x].top();
for(int i=(MAXN+x)/2;i>0;i/=2){
seg[i]=max(seg[i*2], seg[i*2+1]);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |