oj.uz

답안 #810910

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
810910 2023-08-06T17:22:27 Z alvingogo 식물 비교 (IOI20_plants) C++14
100 / 100
 530 ms 23576 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){
    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);
        }
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 41 ms 3148 KB Output is correct
7 Correct 63 ms 5044 KB Output is correct
8 Correct 283 ms 23128 KB Output is correct
9 Correct 274 ms 23208 KB Output is correct
10 Correct 277 ms 23164 KB Output is correct
11 Correct 277 ms 23180 KB Output is correct
12 Correct 278 ms 23184 KB Output is correct
13 Correct 271 ms 23128 KB Output is correct
14 Correct 275 ms 23184 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 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 3 ms 468 KB Output is correct
7 Correct 49 ms 3808 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 436 KB Output is correct
10 Correct 49 ms 3780 KB Output is correct
11 Correct 45 ms 3600 KB Output is correct
12 Correct 46 ms 3900 KB Output is correct
13 Correct 50 ms 3684 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 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 3 ms 468 KB Output is correct
7 Correct 49 ms 3808 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 436 KB Output is correct
10 Correct 49 ms 3780 KB Output is correct
11 Correct 45 ms 3600 KB Output is correct
12 Correct 46 ms 3900 KB Output is correct
13 Correct 50 ms 3684 KB Output is correct
14 Correct 77 ms 5132 KB Output is correct
15 Correct 530 ms 23224 KB Output is correct
16 Correct 78 ms 5140 KB Output is correct
17 Correct 521 ms 23296 KB Output is correct
18 Correct 358 ms 23552 KB Output is correct
19 Correct 357 ms 23576 KB Output is correct
20 Correct 505 ms 23152 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 43 ms 3428 KB Output is correct
4 Correct 295 ms 23184 KB Output is correct
5 Correct 340 ms 23132 KB Output is correct
6 Correct 406 ms 23132 KB Output is correct
7 Correct 477 ms 23160 KB Output is correct
8 Correct 492 ms 23160 KB Output is correct
9 Correct 325 ms 23200 KB Output is correct
10 Correct 304 ms 23164 KB Output is correct
11 Correct 274 ms 23160 KB Output is correct
12 Correct 312 ms 23180 KB Output is correct
13 Correct 356 ms 23336 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 388 KB Output is correct
7 Correct 10 ms 1076 KB Output is correct
8 Correct 10 ms 1108 KB Output is correct
9 Correct 10 ms 1100 KB Output is correct
10 Correct 10 ms 1080 KB Output is correct
11 Correct 10 ms 1096 KB Output is correct
12 Correct 10 ms 1108 KB Output is correct
13 Correct 10 ms 1108 KB Output is correct

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 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 1 ms 212 KB Output is correct
5 Correct 2 ms 308 KB Output is correct
6 Correct 339 ms 23168 KB Output is correct
7 Correct 403 ms 23136 KB Output is correct
8 Correct 474 ms 23144 KB Output is correct
9 Correct 516 ms 23148 KB Output is correct
10 Correct 313 ms 23036 KB Output is correct
11 Correct 407 ms 23324 KB Output is correct
12 Correct 295 ms 23132 KB Output is correct
13 Correct 346 ms 23232 KB Output is correct
14 Correct 416 ms 23144 KB Output is correct
15 Correct 474 ms 23084 KB Output is correct
16 Correct 303 ms 23128 KB Output is correct
17 Correct 331 ms 23208 KB Output is correct

Subtask #7
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 41 ms 3148 KB Output is correct
7 Correct 63 ms 5044 KB Output is correct
8 Correct 283 ms 23128 KB Output is correct
9 Correct 274 ms 23208 KB Output is correct
10 Correct 277 ms 23164 KB Output is correct
11 Correct 277 ms 23180 KB Output is correct
12 Correct 278 ms 23184 KB Output is correct
13 Correct 271 ms 23128 KB Output is correct
14 Correct 275 ms 23184 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 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 3 ms 468 KB Output is correct
21 Correct 49 ms 3808 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 3 ms 436 KB Output is correct
24 Correct 49 ms 3780 KB Output is correct
25 Correct 45 ms 3600 KB Output is correct
26 Correct 46 ms 3900 KB Output is correct
27 Correct 50 ms 3684 KB Output is correct
28 Correct 77 ms 5132 KB Output is correct
29 Correct 530 ms 23224 KB Output is correct
30 Correct 78 ms 5140 KB Output is correct
31 Correct 521 ms 23296 KB Output is correct
32 Correct 358 ms 23552 KB Output is correct
33 Correct 357 ms 23576 KB Output is correct
34 Correct 505 ms 23152 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 296 KB Output is correct
37 Correct 43 ms 3428 KB Output is correct
38 Correct 295 ms 23184 KB Output is correct
39 Correct 340 ms 23132 KB Output is correct
40 Correct 406 ms 23132 KB Output is correct
41 Correct 477 ms 23160 KB Output is correct
42 Correct 492 ms 23160 KB Output is correct
43 Correct 325 ms 23200 KB Output is correct
44 Correct 304 ms 23164 KB Output is correct
45 Correct 274 ms 23160 KB Output is correct
46 Correct 312 ms 23180 KB Output is correct
47 Correct 356 ms 23336 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 300 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 388 KB Output is correct
54 Correct 10 ms 1076 KB Output is correct
55 Correct 10 ms 1108 KB Output is correct
56 Correct 10 ms 1100 KB Output is correct
57 Correct 10 ms 1080 KB Output is correct
58 Correct 10 ms 1096 KB Output is correct
59 Correct 10 ms 1108 KB Output is correct
60 Correct 10 ms 1108 KB Output is correct
61 Correct 42 ms 3316 KB Output is correct
62 Correct 63 ms 5032 KB Output is correct
63 Correct 293 ms 23160 KB Output is correct
64 Correct 340 ms 23180 KB Output is correct
65 Correct 419 ms 23164 KB Output is correct
66 Correct 482 ms 23156 KB Output is correct
67 Correct 513 ms 23288 KB Output is correct
68 Correct 314 ms 23140 KB Output is correct
69 Correct 413 ms 23344 KB Output is correct
70 Correct 293 ms 23196 KB Output is correct
71 Correct 353 ms 23364 KB Output is correct
72 Correct 418 ms 23176 KB Output is correct
73 Correct 472 ms 23156 KB Output is correct
74 Correct 297 ms 23040 KB Output is correct
75 Correct 330 ms 23152 KB Output is correct