oj.uz

Submission #810873

# Submission time Handle Problem Language Result Execution time Memory
810873 2023-08-06T16:59:51 Z alvingogo Comparing Plants (IOI20_plants) C++14
100 / 100
 587 ms 23380 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].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){
    queue<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.front();
            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);
        }
        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 0 ms 212 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 39 ms 3036 KB Output is correct
7 Correct 62 ms 4896 KB Output is correct
8 Correct 278 ms 23060 KB Output is correct
9 Correct 272 ms 23004 KB Output is correct
10 Correct 270 ms 22908 KB Output is correct
11 Correct 272 ms 23000 KB Output is correct
12 Correct 272 ms 23000 KB Output is correct
13 Correct 273 ms 23028 KB Output is correct
14 Correct 268 ms 22904 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 54 ms 3564 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 47 ms 3584 KB Output is correct
11 Correct 43 ms 3508 KB Output is correct
12 Correct 43 ms 3728 KB Output is correct
13 Correct 47 ms 3540 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 54 ms 3564 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 47 ms 3584 KB Output is correct
11 Correct 43 ms 3508 KB Output is correct
12 Correct 43 ms 3728 KB Output is correct
13 Correct 47 ms 3540 KB Output is correct
14 Correct 76 ms 5012 KB Output is correct
15 Correct 510 ms 23020 KB Output is correct
16 Correct 75 ms 5032 KB Output is correct
17 Correct 508 ms 23052 KB Output is correct
18 Correct 358 ms 23356 KB Output is correct
19 Correct 361 ms 23380 KB Output is correct
20 Correct 538 ms 22944 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 41 ms 3240 KB Output is correct
4 Correct 291 ms 22916 KB Output is correct
5 Correct 338 ms 23000 KB Output is correct
6 Correct 402 ms 23056 KB Output is correct
7 Correct 472 ms 23004 KB Output is correct
8 Correct 526 ms 23016 KB Output is correct
9 Correct 311 ms 23024 KB Output is correct
10 Correct 303 ms 23024 KB Output is correct
11 Correct 285 ms 23004 KB Output is correct
12 Correct 307 ms 22996 KB Output is correct
13 Correct 352 ms 23264 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 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 1 ms 340 KB Output is correct
7 Correct 9 ms 832 KB Output is correct
8 Correct 9 ms 980 KB Output is correct
9 Correct 9 ms 852 KB Output is correct
10 Correct 9 ms 980 KB Output is correct
11 Correct 9 ms 980 KB Output is correct
12 Correct 9 ms 852 KB Output is correct
13 Correct 9 ms 904 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 334 ms 23052 KB Output is correct
7 Correct 416 ms 23064 KB Output is correct
8 Correct 465 ms 23012 KB Output is correct
9 Correct 497 ms 23020 KB Output is correct
10 Correct 306 ms 22992 KB Output is correct
11 Correct 401 ms 23136 KB Output is correct
12 Correct 284 ms 22940 KB Output is correct
13 Correct 336 ms 23000 KB Output is correct
14 Correct 407 ms 22972 KB Output is correct
15 Correct 519 ms 23008 KB Output is correct
16 Correct 298 ms 23004 KB Output is correct
17 Correct 322 ms 23004 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 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 39 ms 3036 KB Output is correct
7 Correct 62 ms 4896 KB Output is correct
8 Correct 278 ms 23060 KB Output is correct
9 Correct 272 ms 23004 KB Output is correct
10 Correct 270 ms 22908 KB Output is correct
11 Correct 272 ms 23000 KB Output is correct
12 Correct 272 ms 23000 KB Output is correct
13 Correct 273 ms 23028 KB Output is correct
14 Correct 268 ms 22904 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 54 ms 3564 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 3 ms 468 KB Output is correct
24 Correct 47 ms 3584 KB Output is correct
25 Correct 43 ms 3508 KB Output is correct
26 Correct 43 ms 3728 KB Output is correct
27 Correct 47 ms 3540 KB Output is correct
28 Correct 76 ms 5012 KB Output is correct
29 Correct 510 ms 23020 KB Output is correct
30 Correct 75 ms 5032 KB Output is correct
31 Correct 508 ms 23052 KB Output is correct
32 Correct 358 ms 23356 KB Output is correct
33 Correct 361 ms 23380 KB Output is correct
34 Correct 538 ms 22944 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 41 ms 3240 KB Output is correct
38 Correct 291 ms 22916 KB Output is correct
39 Correct 338 ms 23000 KB Output is correct
40 Correct 402 ms 23056 KB Output is correct
41 Correct 472 ms 23004 KB Output is correct
42 Correct 526 ms 23016 KB Output is correct
43 Correct 311 ms 23024 KB Output is correct
44 Correct 303 ms 23024 KB Output is correct
45 Correct 285 ms 23004 KB Output is correct
46 Correct 307 ms 22996 KB Output is correct
47 Correct 352 ms 23264 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 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 1 ms 340 KB Output is correct
54 Correct 9 ms 832 KB Output is correct
55 Correct 9 ms 980 KB Output is correct
56 Correct 9 ms 852 KB Output is correct
57 Correct 9 ms 980 KB Output is correct
58 Correct 9 ms 980 KB Output is correct
59 Correct 9 ms 852 KB Output is correct
60 Correct 9 ms 904 KB Output is correct
61 Correct 39 ms 3232 KB Output is correct
62 Correct 60 ms 4896 KB Output is correct
63 Correct 294 ms 23008 KB Output is correct
64 Correct 345 ms 23008 KB Output is correct
65 Correct 417 ms 23008 KB Output is correct
66 Correct 562 ms 23024 KB Output is correct
67 Correct 587 ms 22992 KB Output is correct
68 Correct 317 ms 23004 KB Output is correct
69 Correct 409 ms 23200 KB Output is correct
70 Correct 315 ms 23012 KB Output is correct
71 Correct 339 ms 23000 KB Output is correct
72 Correct 422 ms 22992 KB Output is correct
73 Correct 519 ms 22992 KB Output is correct
74 Correct 306 ms 22908 KB Output is correct
75 Correct 379 ms 22992 KB Output is correct