# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
115652 | gs18065 | 허수아비 (JOI14_scarecrows) | C++14 | 610 ms | 25160 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 <bits/stdc++.h>
#define N 200005
using namespace std;
int n,d[N],num,lev,val[N],root[N],loc[N],pre[N];
long long int ans;
struct emp{
int s,e,in;
}p[N],temp[N];
bool cmp1(emp a,emp b){
return a.s<b.s;
}
vector<int> m[N];
int read_tree(int x,int tree[]){
int y=0;
while(x<=N){
y=max(tree[x],y);
x+=(x&-x);
}
return y;
}
void update_tree(int x,int y,int tree[]){
while(x>0){
tree[x]=max(tree[x],y);
x-=(x&-x);
}
}
int read(int x,int y,int tre[]){
int k=0;
while(x>0){
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... |