oj.uz

Submission #997839

# Submission time Handle Problem Language Result Execution time Memory
997839 2024-06-13T02:03:00 Z bachhoangxuan Comparing Plants (IOI20_plants) C++17
59 / 100
 365 ms 25148 KB 
#include "plants.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5+5;
const int inf = 1e9;
int n,k;
vector<int> R;
set<int> ss,cc;

void cal(int x,int y){
    cc.erase(y);
    if((y-x+n)%n>=k){
        //cout << "add " << y << '\n';
        cc.insert(y);
    }
}
void add(int x){
    if(ss.empty()){
        ss.insert(x);
        cc.insert(x);
        //cout << "add " << x << '\n';
        return;
    }
    auto it=ss.lower_bound(x);
    if(it!=ss.end()) cal(x,*it);
    else cal(x,*ss.begin());
    if(it==ss.begin()) cal(*ss.rbegin(),x);
    else{
        it--;
        cal(*it,x);
    }
    ss.insert(x);
}
void del(int x){
    cc.erase(x);ss.erase(x);
    if(ss.empty()) return;
    auto it=ss.lower_bound(x);
    int y=(it!=ss.end()?*it:*ss.begin());
    cc.insert(y);
}

int tree[4*maxn],lazy[4*maxn];
void build(int l,int r,int id){
    lazy[id]=0;
    if(l==r){
        tree[id]=R[l];
        return;
    }
    int mid=(l+r)>>1;
    build(l,mid,id<<1);build(mid+1,r,id<<1|1);
    tree[id]=min(tree[id<<1],tree[id<<1|1]);
}
void getnew(int id,int val){
    tree[id]-=val;
    lazy[id]+=val;
}
void pushdown(int id){
    if(!lazy[id]) return;
    getnew(id<<1,lazy[id]);
    getnew(id<<1|1,lazy[id]);
    lazy[id]=0;
}
void get(int l,int r,int id){
    if(tree[id]>0) return;
    if(l==r){
        tree[id]=inf;
        //cout << "add2 " << l << '\n';
        add(l);
        return;
    }
    pushdown(id);
    int mid=(l+r)>>1;
    get(l,mid,id<<1);get(mid+1,r,id<<1|1);
    tree[id]=min(tree[id<<1],tree[id<<1|1]);
}
void update(int l,int r,int id,int tl,int tr){
    if(tr<l || r<tl) return;
    if(tl<=l && r<=tr){
        getnew(id,1);
        return;
    }
    pushdown(id);
    int mid=(l+r)>>1;
    update(l,mid,id<<1,tl,tr);update(mid+1,r,id<<1|1,tl,tr);
    tree[id]=min(tree[id<<1],tree[id<<1|1]);
}
vector<int> solve(vector<int> r){
    R=r;
    vector<int> p(n);
    ss.clear();cc.clear();
    build(0,n-1,1);
    for(int i=n-1;i>=0;i--){
        get(0,n-1,1);
        int x=*cc.begin();
        if((int)cc.size()>1 && x==0) x=*cc.rbegin();
        p[x]=i;del(x);
        //cout << "P " << x << ' ' << i << '\n';
        if(x>=k-1) update(0,n-1,1,x-k+1,x);
        else{
            update(0,n-1,1,0,x);
            update(0,n-1,1,n-(k-x)+1,n-1);
        }
    }
    return p;
}

vector<int> A,B;
void init(int _k, std::vector<int> r) {
    k=_k;
    n=(int)r.size();
    A=solve(r);
    for(int i=0;i<n;i++) r[i]=k-1-r[i];
    B=solve(r);
    for(int i=0;i<n;i++) B[i]=n-1-B[i];
    //for(int i=0;i<n;i++) cout << P[i] << ' ';
    //cout << '\n';
}

int compare_plants(int x, int y) {
    bool lt=(B[x]>B[y]),rt=(A[x]<A[y]);
	return ((lt && rt)?0:(lt?1:-1));
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Incorrect 0 ms 2396 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 2 ms 2472 KB Output is correct
7 Correct 41 ms 7288 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 39 ms 7184 KB Output is correct
11 Correct 37 ms 7248 KB Output is correct
12 Correct 45 ms 7548 KB Output is correct
13 Correct 47 ms 7180 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 2 ms 2472 KB Output is correct
7 Correct 41 ms 7288 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 39 ms 7184 KB Output is correct
11 Correct 37 ms 7248 KB Output is correct
12 Correct 45 ms 7548 KB Output is correct
13 Correct 47 ms 7180 KB Output is correct
14 Correct 67 ms 10036 KB Output is correct
15 Correct 331 ms 16192 KB Output is correct
16 Correct 61 ms 10188 KB Output is correct
17 Correct 336 ms 16360 KB Output is correct
18 Correct 289 ms 19796 KB Output is correct
19 Correct 288 ms 21056 KB Output is correct
20 Correct 311 ms 16448 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 38 ms 5196 KB Output is correct
4 Correct 239 ms 18720 KB Output is correct
5 Correct 286 ms 16424 KB Output is correct
6 Correct 324 ms 15936 KB Output is correct
7 Correct 346 ms 15940 KB Output is correct
8 Correct 341 ms 16196 KB Output is correct
9 Correct 265 ms 16976 KB Output is correct
10 Correct 290 ms 16452 KB Output is correct
11 Correct 219 ms 24148 KB Output is correct
12 Correct 241 ms 25148 KB Output is correct
13 Correct 277 ms 21596 KB Output is correct

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Incorrect 0 ms 2396 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 312 ms 14812 KB Output is correct
7 Correct 342 ms 14916 KB Output is correct
8 Correct 361 ms 15172 KB Output is correct
9 Correct 329 ms 15336 KB Output is correct
10 Correct 264 ms 16500 KB Output is correct
11 Correct 287 ms 15592 KB Output is correct
12 Correct 257 ms 17764 KB Output is correct
13 Correct 275 ms 15340 KB Output is correct
14 Correct 322 ms 14920 KB Output is correct
15 Correct 365 ms 15164 KB Output is correct
16 Correct 284 ms 16448 KB Output is correct
17 Correct 275 ms 14912 KB Output is correct

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Incorrect 0 ms 2396 KB Output isn't correct
5 Halted 0 ms 0 KB -