oj.uz

Submission #810931

# Submission time Handle Problem Language Result Execution time Memory
810931 2023-08-06T17:42:43 Z alvingogo Comparing Plants (IOI20_plants) C++14
75 / 100
 796 ms 23792 KB 
#include "plants.h"
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;

struct ST{
    vector<pair<int,int> > st;
    void init(int x){
        st.resize(4*x);
    }
    void pull(int v){
        st[v].fs=min(st[2*v+1].fs,st[2*v+2].fs);
    }
    void upd(int v,int x){
        st[v].fs+=x;
        st[v].fs=max(st[v].fs,0);
        st[v].sc+=x;
    }
    void build(int v,int L,int R,vector<int>& x){
        if(L==R){
            st[v].fs=x[L];
            return;
        }
        int m=(L+R)/2;
        build(2*v+1,L,m,x);
        build(2*v+2,m+1,R,x);
        pull(v);
    }
    void pudo(int v){
        upd(2*v+1,st[v].sc);
        upd(2*v+2,st[v].sc);
        st[v].sc=0;
    }
    void update(int v,int L,int R,int l,int r,int t){
        if(L==l && R==r){
            upd(v,t);
            return;
        }
        pudo(v);
        int m=(L+R)/2;
        if(r<=m){
            update(2*v+1,L,m,l,r,t);
        }
        else if(l>m){
            update(2*v+2,m+1,R,l,r,t);
        }
        else{
            update(2*v+1,L,m,l,m,t);
            update(2*v+2,m+1,R,m+1,r,t);
        }
        pull(v);
    }
    int finds(int v,int L,int R){
        if(L==R){
            st[v].fs=1e9;
            return L;
        }
        if(st[v].fs>0){
            return -1;
        }
        int m=(L+R)/2;
        pudo(v);
        int a;
        if(st[2*v+1].fs>0){
            a=finds(2*v+2,m+1,R);
        }
        else{
            a=finds(2*v+1,L,m);
        }
        pull(v);
        return a;
    }
};
int k;
int n;
vector<int> a[2];
void get(vector<int> c,int g){
    stack<int> s;
    ST st;
    int m=2*n;
    a[g].resize(m);
    st.init(m);
    st.build(0,0,m-1,c);
    for(int i=0;i<2*n;i++){
        int x=st.finds(0,0,m-1);
        while(x<0){
            auto h=s.top();
            s.pop();
            st.update(0,0,m-1,h,m-1,-1);
            x=st.finds(0,0,m-1);
        }
        int l=x-k+1;
        a[g][x]=i;
        if(l<0){
            st.update(0,0,m-1,0,x,-1);
            //s.push(l+m);
            st.update(0,0,m-1,l+m,m-1,-1);
        }
        else{
            st.update(0,0,m-1,l,x,-1);
        }
    }
}
void init(int K, vector<int> r){
    k=K;
    n=r.size();
    vector<int> z(2*n);
    for(int i=0;i<n;i++){
        z[i]=z[i+n]=r[i];
    }
    get(z,0);
    for(auto& h:z){
        h=k-1-h;
    }
    get(z,1);
}

int compare_plants(int x, int y) {
    if(x>y){
        return -compare_plants(y,x);
    }
    if(a[0][x]>a[0][y] || a[1][y]>a[1][x+n]){
        return -1;
    }
    else if(a[1][x]>a[1][y] || a[0][y]>a[0][x+n]){
        return 1;
    }
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 56 ms 3228 KB Output is correct
7 Correct 96 ms 5236 KB Output is correct
8 Correct 303 ms 23252 KB Output is correct
9 Correct 328 ms 23260 KB Output is correct
10 Correct 326 ms 23256 KB Output is correct
11 Correct 308 ms 23284 KB Output is correct
12 Correct 312 ms 23248 KB Output is correct
13 Correct 343 ms 23260 KB Output is correct
14 Correct 321 ms 23268 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 0 ms 224 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 54 ms 3880 KB Output is correct
8 Correct 2 ms 312 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 50 ms 3796 KB Output is correct
11 Correct 47 ms 3756 KB Output is correct
12 Correct 51 ms 4008 KB Output is correct
13 Correct 51 ms 3908 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 0 ms 224 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 54 ms 3880 KB Output is correct
8 Correct 2 ms 312 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 50 ms 3796 KB Output is correct
11 Correct 47 ms 3756 KB Output is correct
12 Correct 51 ms 4008 KB Output is correct
13 Correct 51 ms 3908 KB Output is correct
14 Correct 85 ms 5176 KB Output is correct
15 Correct 667 ms 23272 KB Output is correct
16 Correct 90 ms 5268 KB Output is correct
17 Correct 647 ms 23268 KB Output is correct
18 Correct 486 ms 23516 KB Output is correct
19 Correct 460 ms 23516 KB Output is correct
20 Correct 796 ms 23792 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 45 ms 3708 KB Output is correct
4 Correct 332 ms 23344 KB Output is correct
5 Correct 412 ms 23268 KB Output is correct
6 Correct 558 ms 23252 KB Output is correct
7 Correct 777 ms 23272 KB Output is correct
8 Correct 648 ms 23252 KB Output is correct
9 Correct 357 ms 23256 KB Output is correct
10 Correct 357 ms 23276 KB Output is correct
11 Correct 306 ms 23260 KB Output is correct
12 Correct 356 ms 23248 KB Output is correct
13 Correct 424 ms 23256 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 10 ms 1068 KB Output is correct
8 Correct 11 ms 1004 KB Output is correct
9 Correct 10 ms 1008 KB Output is correct
10 Correct 10 ms 980 KB Output is correct
11 Correct 9 ms 980 KB Output is correct
12 Correct 11 ms 1076 KB Output is correct
13 Correct 15 ms 1092 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 296 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 406 ms 23392 KB Output is correct
7 Correct 457 ms 23264 KB Output is correct
8 Correct 681 ms 23004 KB Output is correct
9 Correct 595 ms 23044 KB Output is correct
10 Correct 345 ms 22908 KB Output is correct
11 Correct 504 ms 22992 KB Output is correct
12 Correct 326 ms 23012 KB Output is correct
13 Correct 411 ms 23008 KB Output is correct
14 Correct 500 ms 23012 KB Output is correct
15 Correct 566 ms 23020 KB Output is correct
16 Correct 352 ms 23216 KB Output is correct
17 Correct 373 ms 23196 KB Output is correct

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 56 ms 3228 KB Output is correct
7 Correct 96 ms 5236 KB Output is correct
8 Correct 303 ms 23252 KB Output is correct
9 Correct 328 ms 23260 KB Output is correct
10 Correct 326 ms 23256 KB Output is correct
11 Correct 308 ms 23284 KB Output is correct
12 Correct 312 ms 23248 KB Output is correct
13 Correct 343 ms 23260 KB Output is correct
14 Correct 321 ms 23268 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 0 ms 224 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Correct 54 ms 3880 KB Output is correct
22 Correct 2 ms 312 KB Output is correct
23 Correct 3 ms 468 KB Output is correct
24 Correct 50 ms 3796 KB Output is correct
25 Correct 47 ms 3756 KB Output is correct
26 Correct 51 ms 4008 KB Output is correct
27 Correct 51 ms 3908 KB Output is correct
28 Correct 85 ms 5176 KB Output is correct
29 Correct 667 ms 23272 KB Output is correct
30 Correct 90 ms 5268 KB Output is correct
31 Correct 647 ms 23268 KB Output is correct
32 Correct 486 ms 23516 KB Output is correct
33 Correct 460 ms 23516 KB Output is correct
34 Correct 796 ms 23792 KB Output is correct
35 Correct 1 ms 304 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 45 ms 3708 KB Output is correct
38 Correct 332 ms 23344 KB Output is correct
39 Correct 412 ms 23268 KB Output is correct
40 Correct 558 ms 23252 KB Output is correct
41 Correct 777 ms 23272 KB Output is correct
42 Correct 648 ms 23252 KB Output is correct
43 Correct 357 ms 23256 KB Output is correct
44 Correct 357 ms 23276 KB Output is correct
45 Correct 306 ms 23260 KB Output is correct
46 Correct 356 ms 23248 KB Output is correct
47 Correct 424 ms 23256 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 300 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 2 ms 340 KB Output is correct
54 Correct 10 ms 1068 KB Output is correct
55 Correct 11 ms 1004 KB Output is correct
56 Correct 10 ms 1008 KB Output is correct
57 Correct 10 ms 980 KB Output is correct
58 Correct 9 ms 980 KB Output is correct
59 Correct 11 ms 1076 KB Output is correct
60 Correct 15 ms 1092 KB Output is correct
61 Correct 41 ms 3440 KB Output is correct
62 Correct 65 ms 5092 KB Output is correct
63 Correct 325 ms 23240 KB Output is correct
64 Correct 388 ms 23360 KB Output is correct
65 Correct 461 ms 23256 KB Output is correct
66 Correct 549 ms 23356 KB Output is correct
67 Correct 600 ms 23064 KB Output is correct
68 Correct 344 ms 23000 KB Output is correct
69 Incorrect 468 ms 23068 KB Output isn't correct
70 Halted 0 ms 0 KB -