oj.uz

답안 #810930

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
810930 2023-08-06T17:42:33 Z alvingogo 식물 비교 (IOI20_plants) C++14
100 / 100
 749 ms 24680 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

# 결과 실행 시간 메모리 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 1 ms 300 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 39 ms 3952 KB Output is correct
7 Correct 65 ms 5828 KB Output is correct
8 Correct 338 ms 23956 KB Output is correct
9 Correct 300 ms 23876 KB Output is correct
10 Correct 310 ms 23896 KB Output is correct
11 Correct 376 ms 23948 KB Output is correct
12 Correct 308 ms 24048 KB Output is correct
13 Correct 297 ms 23888 KB Output is correct
14 Correct 299 ms 23936 KB Output is correct

Subtask #2
14.0 / 14.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 224 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 51 ms 4532 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 71 ms 4492 KB Output is correct
11 Correct 50 ms 4376 KB Output is correct
12 Correct 47 ms 4596 KB Output is correct
13 Correct 50 ms 4520 KB Output is correct

Subtask #3
13.0 / 13.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 224 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 51 ms 4532 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 71 ms 4492 KB Output is correct
11 Correct 50 ms 4376 KB Output is correct
12 Correct 47 ms 4596 KB Output is correct
13 Correct 50 ms 4520 KB Output is correct
14 Correct 82 ms 5924 KB Output is correct
15 Correct 577 ms 23912 KB Output is correct
16 Correct 82 ms 5912 KB Output is correct
17 Correct 713 ms 23924 KB Output is correct
18 Correct 410 ms 24320 KB Output is correct
19 Correct 426 ms 24344 KB Output is correct
20 Correct 650 ms 23928 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 47 ms 4272 KB Output is correct
4 Correct 351 ms 24040 KB Output is correct
5 Correct 440 ms 24152 KB Output is correct
6 Correct 705 ms 24184 KB Output is correct
7 Correct 614 ms 24176 KB Output is correct
8 Correct 677 ms 24168 KB Output is correct
9 Correct 352 ms 24176 KB Output is correct
10 Correct 354 ms 24180 KB Output is correct
11 Correct 434 ms 24180 KB Output is correct
12 Correct 373 ms 24192 KB Output is correct
13 Correct 412 ms 24384 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 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 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 10 ms 1208 KB Output is correct
8 Correct 15 ms 1236 KB Output is correct
9 Correct 10 ms 1284 KB Output is correct
10 Correct 10 ms 1192 KB Output is correct
11 Correct 10 ms 1156 KB Output is correct
12 Correct 10 ms 1284 KB Output is correct
13 Correct 10 ms 1236 KB Output is correct

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 0 ms 296 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 429 ms 24148 KB Output is correct
7 Correct 483 ms 24308 KB Output is correct
8 Correct 749 ms 24432 KB Output is correct
9 Correct 691 ms 24428 KB Output is correct
10 Correct 360 ms 24432 KB Output is correct
11 Correct 527 ms 24668 KB Output is correct
12 Correct 350 ms 24416 KB Output is correct
13 Correct 509 ms 24428 KB Output is correct
14 Correct 529 ms 24404 KB Output is correct
15 Correct 619 ms 24424 KB Output is correct
16 Correct 345 ms 24408 KB Output is correct
17 Correct 375 ms 24424 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 1 ms 300 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 39 ms 3952 KB Output is correct
7 Correct 65 ms 5828 KB Output is correct
8 Correct 338 ms 23956 KB Output is correct
9 Correct 300 ms 23876 KB Output is correct
10 Correct 310 ms 23896 KB Output is correct
11 Correct 376 ms 23948 KB Output is correct
12 Correct 308 ms 24048 KB Output is correct
13 Correct 297 ms 23888 KB Output is correct
14 Correct 299 ms 23936 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 224 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 51 ms 4532 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 3 ms 468 KB Output is correct
24 Correct 71 ms 4492 KB Output is correct
25 Correct 50 ms 4376 KB Output is correct
26 Correct 47 ms 4596 KB Output is correct
27 Correct 50 ms 4520 KB Output is correct
28 Correct 82 ms 5924 KB Output is correct
29 Correct 577 ms 23912 KB Output is correct
30 Correct 82 ms 5912 KB Output is correct
31 Correct 713 ms 23924 KB Output is correct
32 Correct 410 ms 24320 KB Output is correct
33 Correct 426 ms 24344 KB Output is correct
34 Correct 650 ms 23928 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 300 KB Output is correct
37 Correct 47 ms 4272 KB Output is correct
38 Correct 351 ms 24040 KB Output is correct
39 Correct 440 ms 24152 KB Output is correct
40 Correct 705 ms 24184 KB Output is correct
41 Correct 614 ms 24176 KB Output is correct
42 Correct 677 ms 24168 KB Output is correct
43 Correct 352 ms 24176 KB Output is correct
44 Correct 354 ms 24180 KB Output is correct
45 Correct 434 ms 24180 KB Output is correct
46 Correct 373 ms 24192 KB Output is correct
47 Correct 412 ms 24384 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 0 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 1 ms 212 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 10 ms 1208 KB Output is correct
55 Correct 15 ms 1236 KB Output is correct
56 Correct 10 ms 1284 KB Output is correct
57 Correct 10 ms 1192 KB Output is correct
58 Correct 10 ms 1156 KB Output is correct
59 Correct 10 ms 1284 KB Output is correct
60 Correct 10 ms 1236 KB Output is correct
61 Correct 42 ms 4620 KB Output is correct
62 Correct 66 ms 6352 KB Output is correct
63 Correct 330 ms 24432 KB Output is correct
64 Correct 385 ms 24436 KB Output is correct
65 Correct 548 ms 24436 KB Output is correct
66 Correct 653 ms 24432 KB Output is correct
67 Correct 611 ms 24572 KB Output is correct
68 Correct 490 ms 24544 KB Output is correct
69 Correct 475 ms 24680 KB Output is correct
70 Correct 323 ms 24588 KB Output is correct
71 Correct 420 ms 24500 KB Output is correct
72 Correct 516 ms 24560 KB Output is correct
73 Correct 594 ms 24556 KB Output is correct
74 Correct 338 ms 24560 KB Output is correct
75 Correct 397 ms 24544 KB Output is correct