oj.uz

답안 #1023027

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1023027 2024-07-14T08:50:04 Z JakobZorz 송신탑 (IOI22_towers) C++17
23 / 100
 4000 ms 36384 KB 
#include"towers.h"
#include<vector>
#include<iostream>
using namespace std;

const int TREE_SIZE=1<<17;

int n;
vector<int>arr;
vector<int>thres;
vector<int>prv,nxt;
vector<vector<int>>arr_rmq;
vector<vector<pair<int,int>>>arr_rmq2;
vector<vector<int>>thres_rmq;

void init_prev(){
    prv.resize(n);
    vector<int>s;
    for(int i=0;i<n;i++){
        while(s.size()&&arr[s.back()]>arr[i])
            s.pop_back();
        if(s.empty())
            prv[i]=-1;
        else
            prv[i]=s.back();
        s.push_back(i);
    }
}

void init_nxt(){
    nxt.resize(n);
    vector<int>s;
    for(int i=n-1;i>=0;i--){
        while(s.size()&&arr[s.back()]>arr[i])
            s.pop_back();
        if(s.empty())
            nxt[i]=-1;
        else
            nxt[i]=s.back();
        s.push_back(i);
    }
}

void init_arr_rmq(){
    arr_rmq=vector<vector<int>>(20,vector<int>(n));
    arr_rmq[0]=arr;
    for(int p=1;p<20;p++){
        for(int i=0;i+(1<<p)<=n;i++){
            arr_rmq[p][i]=max(arr_rmq[p-1][i],arr_rmq[p-1][i+(1<<(p-1))]);
        }
    }
}

int get_arr_max(int l,int r){
    int pw2=2;
    int p=0;
    while(pw2<r-l){
        pw2*=2;
        p++;
    }
    pw2/=2;
    return max(arr_rmq[p][l],arr_rmq[p][r-pw2]);
}

void init_thres(){
    thres.resize(n);
    for(int i=0;i<n;i++){
        int mn=2e9;
        
        if(prv[i]!=-1){
            int mx1=get_arr_max(prv[i],i);
            mn=min(mn,mx1);
        }
        
        if(nxt[i]!=-1){
            int mx2=get_arr_max(i,nxt[i]);
            mn=min(mn,mx2);
        }
        
        thres[i]=mn-arr[i];
    }
}

void init_thres_rmq(){
    thres_rmq=vector<vector<int>>(20,vector<int>(n));
    thres_rmq[0]=thres;
    for(int p=1;p<20;p++){
        for(int i=0;i+(1<<p)<=n;i++){
            thres_rmq[p][i]=max(thres_rmq[p-1][i],thres_rmq[p-1][i+(1<<(p-1))]);
        }
    }
}

int get_thres_max(int l,int r){
    int pw2=2;
    int p=0;
    while(pw2<r-l){
        pw2*=2;
        p++;
    }
    pw2/=2;
    return max(thres_rmq[p][l],thres_rmq[p][r-pw2]);
}

void init_arr_rmq2(){
    arr_rmq2=vector<vector<pair<int,int>>>(20,vector<pair<int,int>>(n));
    for(int i=0;i<n;i++)
        arr_rmq2[0][i]={arr[i],i};
    for(int p=1;p<20;p++){
        for(int i=0;i+(1<<p)<=n;i++){
            arr_rmq2[p][i]=min(arr_rmq2[p-1][i],arr_rmq2[p-1][i+(1<<(p-1))]);
        }
    }
}

pair<int,int>get_arr_min(int l,int r){
    int pw2=2;
    int p=0;
    while(pw2<r-l){
        pw2*=2;
        p++;
    }
    pw2/=2;
    return min(arr_rmq2[p][l],arr_rmq2[p][r-pw2]);
}

struct Diff{
    vector<int>arr;
    Diff():arr(TREE_SIZE){}
    
    void update(int i,int x){
        arr[i]=x;
    }
    
    int get(int l,int r){
        int res=0,mx=0;
        for(int i=l;i<r;i++){
            res=max(res,mx-arr[i]);
            mx=max(mx,arr[i]);
        }
        return res;
    }
};

Diff diff1,diff2;

void init(int N,vector<int>H){
    arr=H;
    n=(int)arr.size();
    init_prev();
    init_nxt();
    init_arr_rmq();
    init_thres();
    init_thres_rmq();
    init_arr_rmq2();
    for(int i=0;i<n;i++){
        diff1.update(i,arr[i]);
        diff2.update(i,-arr[i]);
    }
}

int max_towers(int L,int R,int D){
    int res=0;
    for(int i=L;i<=R;i++){
        if(thres[i]>=D){
            res++;
        }
    }
    
    int first=-1,last=-1;
    if(get_thres_max(L,R+1)<D){
        first=get_arr_min(L,R+1).second;
        last=first;
        res=1;
    }else{
        {
            int l=L,r=R+1;
            while(l<r-1){
                int mid=(l+r)/2;
                if(get_thres_max(L,mid)>=D)
                    r=mid;
                else
                    l=mid;
            }
            first=l;
        }
        
        {
            int l=L,r=R+1;
            while(l<r-1){
                int mid=(l+r)/2;
                if(get_thres_max(mid,R+1)>=D)
                    l=mid;
                else
                    r=mid;
            }
            last=l;
        }
    }
    
    if(get_arr_max(L,first)>=arr[first]+D){
        int l=L,r=first;
        while(l<r-1){
            int mid=(l+r)/2;
            if(get_arr_max(mid,first)>=arr[first]+D)
                l=mid;
            else
                r=mid;
        }
        int trans=l;
        
        int diff=0;
        int mx=0;
        for(int i=trans;i>=L;i--){
            diff=max(diff,mx-arr[i]);
            mx=max(mx,arr[i]);
        }
        
        res+=diff>=D;
    }
    
    if(get_arr_max(last,R+1)>=arr[last]+D){
        int l=last,r=R+1;
        while(l<r-1){
            int mid=(l+r)/2;
            if(get_arr_max(last,mid)>=arr[last]+D)
                r=mid;
            else
                l=mid;
        }
        res+=diff1.get(l,R+1)>=D;
    }
    
    return res;
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1411 ms 22292 KB Output is correct
2 Execution timed out 4062 ms 36180 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1368 KB Output is correct
2 Correct 1 ms 2136 KB Output is correct
3 Correct 1 ms 2136 KB Output is correct
4 Correct 1 ms 2136 KB Output is correct
5 Correct 2 ms 2136 KB Output is correct
6 Correct 2 ms 2136 KB Output is correct
7 Correct 1 ms 2136 KB Output is correct
8 Correct 1 ms 2136 KB Output is correct
9 Correct 1 ms 2136 KB Output is correct
10 Correct 1 ms 2136 KB Output is correct
11 Correct 1 ms 2136 KB Output is correct
12 Correct 1 ms 1368 KB Output is correct
13 Correct 2 ms 2136 KB Output is correct
14 Correct 1 ms 1988 KB Output is correct
15 Correct 1 ms 2136 KB Output is correct
16 Correct 2 ms 2136 KB Output is correct
17 Correct 2 ms 2136 KB Output is correct
18 Correct 1 ms 2136 KB Output is correct
19 Correct 1 ms 2136 KB Output is correct
20 Correct 2 ms 2136 KB Output is correct
21 Correct 1 ms 2132 KB Output is correct
22 Correct 1 ms 2136 KB Output is correct
23 Correct 1 ms 2136 KB Output is correct
24 Correct 2 ms 2136 KB Output is correct
25 Correct 1 ms 1624 KB Output is correct
26 Correct 2 ms 2136 KB Output is correct
27 Correct 1 ms 2136 KB Output is correct
28 Correct 1 ms 2132 KB Output is correct
29 Correct 2 ms 2136 KB Output is correct
30 Correct 2 ms 2136 KB Output is correct
31 Correct 1 ms 2136 KB Output is correct
32 Correct 1 ms 2136 KB Output is correct
33 Correct 1 ms 2136 KB Output is correct
34 Correct 2 ms 2136 KB Output is correct
35 Correct 1 ms 2136 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1368 KB Output is correct
2 Correct 1 ms 2136 KB Output is correct
3 Correct 1 ms 2136 KB Output is correct
4 Correct 1 ms 2136 KB Output is correct
5 Correct 2 ms 2136 KB Output is correct
6 Correct 2 ms 2136 KB Output is correct
7 Correct 1 ms 2136 KB Output is correct
8 Correct 1 ms 2136 KB Output is correct
9 Correct 1 ms 2136 KB Output is correct
10 Correct 1 ms 2136 KB Output is correct
11 Correct 1 ms 2136 KB Output is correct
12 Correct 1 ms 1368 KB Output is correct
13 Correct 2 ms 2136 KB Output is correct
14 Correct 1 ms 1988 KB Output is correct
15 Correct 1 ms 2136 KB Output is correct
16 Correct 2 ms 2136 KB Output is correct
17 Correct 2 ms 2136 KB Output is correct
18 Correct 1 ms 2136 KB Output is correct
19 Correct 1 ms 2136 KB Output is correct
20 Correct 2 ms 2136 KB Output is correct
21 Correct 1 ms 2132 KB Output is correct
22 Correct 1 ms 2136 KB Output is correct
23 Correct 1 ms 2136 KB Output is correct
24 Correct 2 ms 2136 KB Output is correct
25 Correct 1 ms 1624 KB Output is correct
26 Correct 2 ms 2136 KB Output is correct
27 Correct 1 ms 2136 KB Output is correct
28 Correct 1 ms 2132 KB Output is correct
29 Correct 2 ms 2136 KB Output is correct
30 Correct 2 ms 2136 KB Output is correct
31 Correct 1 ms 2136 KB Output is correct
32 Correct 1 ms 2136 KB Output is correct
33 Correct 1 ms 2136 KB Output is correct
34 Correct 2 ms 2136 KB Output is correct
35 Correct 1 ms 2136 KB Output is correct
36 Correct 22 ms 24152 KB Output is correct
37 Correct 40 ms 36296 KB Output is correct
38 Correct 37 ms 36300 KB Output is correct
39 Correct 32 ms 36264 KB Output is correct
40 Correct 32 ms 36136 KB Output is correct
41 Correct 32 ms 36296 KB Output is correct
42 Correct 31 ms 36304 KB Output is correct
43 Correct 36 ms 36160 KB Output is correct
44 Correct 31 ms 36168 KB Output is correct
45 Correct 40 ms 36372 KB Output is correct
46 Correct 29 ms 36176 KB Output is correct
47 Correct 34 ms 36276 KB Output is correct
48 Correct 37 ms 36296 KB Output is correct
49 Correct 30 ms 36296 KB Output is correct
50 Correct 47 ms 36164 KB Output is correct
51 Correct 47 ms 36132 KB Output is correct
52 Correct 31 ms 36304 KB Output is correct
53 Correct 40 ms 36340 KB Output is correct
54 Correct 31 ms 36292 KB Output is correct
55 Correct 31 ms 36160 KB Output is correct
56 Correct 32 ms 36224 KB Output is correct
57 Correct 39 ms 35036 KB Output is correct
58 Correct 34 ms 36296 KB Output is correct
59 Correct 35 ms 36304 KB Output is correct
60 Correct 43 ms 36296 KB Output is correct
61 Correct 32 ms 36148 KB Output is correct
62 Correct 42 ms 36304 KB Output is correct
63 Correct 35 ms 36296 KB Output is correct
64 Correct 35 ms 36160 KB Output is correct
65 Correct 50 ms 36160 KB Output is correct
66 Correct 31 ms 36184 KB Output is correct
67 Correct 27 ms 36192 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2396 ms 36052 KB Output is correct
2 Correct 3246 ms 36384 KB Output is correct
3 Correct 3214 ms 36296 KB Output is correct
4 Correct 3180 ms 36296 KB Output is correct
5 Correct 3139 ms 36304 KB Output is correct
6 Correct 3204 ms 36296 KB Output is correct
7 Correct 3260 ms 36296 KB Output is correct
8 Execution timed out 4069 ms 36304 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 743 ms 9816 KB Output is correct
2 Execution timed out 4091 ms 36296 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1368 KB Output is correct
2 Correct 1 ms 2136 KB Output is correct
3 Correct 1 ms 2136 KB Output is correct
4 Correct 1 ms 2136 KB Output is correct
5 Correct 2 ms 2136 KB Output is correct
6 Correct 2 ms 2136 KB Output is correct
7 Correct 1 ms 2136 KB Output is correct
8 Correct 1 ms 2136 KB Output is correct
9 Correct 1 ms 2136 KB Output is correct
10 Correct 1 ms 2136 KB Output is correct
11 Correct 1 ms 2136 KB Output is correct
12 Correct 1 ms 1368 KB Output is correct
13 Correct 2 ms 2136 KB Output is correct
14 Correct 1 ms 1988 KB Output is correct
15 Correct 1 ms 2136 KB Output is correct
16 Correct 2 ms 2136 KB Output is correct
17 Correct 2 ms 2136 KB Output is correct
18 Correct 1 ms 2136 KB Output is correct
19 Correct 1 ms 2136 KB Output is correct
20 Correct 2 ms 2136 KB Output is correct
21 Correct 1 ms 2132 KB Output is correct
22 Correct 1 ms 2136 KB Output is correct
23 Correct 1 ms 2136 KB Output is correct
24 Correct 2 ms 2136 KB Output is correct
25 Correct 1 ms 1624 KB Output is correct
26 Correct 2 ms 2136 KB Output is correct
27 Correct 1 ms 2136 KB Output is correct
28 Correct 1 ms 2132 KB Output is correct
29 Correct 2 ms 2136 KB Output is correct
30 Correct 2 ms 2136 KB Output is correct
31 Correct 1 ms 2136 KB Output is correct
32 Correct 1 ms 2136 KB Output is correct
33 Correct 1 ms 2136 KB Output is correct
34 Correct 2 ms 2136 KB Output is correct
35 Correct 1 ms 2136 KB Output is correct
36 Correct 22 ms 24152 KB Output is correct
37 Correct 40 ms 36296 KB Output is correct
38 Correct 37 ms 36300 KB Output is correct
39 Correct 32 ms 36264 KB Output is correct
40 Correct 32 ms 36136 KB Output is correct
41 Correct 32 ms 36296 KB Output is correct
42 Correct 31 ms 36304 KB Output is correct
43 Correct 36 ms 36160 KB Output is correct
44 Correct 31 ms 36168 KB Output is correct
45 Correct 40 ms 36372 KB Output is correct
46 Correct 29 ms 36176 KB Output is correct
47 Correct 34 ms 36276 KB Output is correct
48 Correct 37 ms 36296 KB Output is correct
49 Correct 30 ms 36296 KB Output is correct
50 Correct 47 ms 36164 KB Output is correct
51 Correct 47 ms 36132 KB Output is correct
52 Correct 31 ms 36304 KB Output is correct
53 Correct 40 ms 36340 KB Output is correct
54 Correct 31 ms 36292 KB Output is correct
55 Correct 31 ms 36160 KB Output is correct
56 Correct 32 ms 36224 KB Output is correct
57 Correct 39 ms 35036 KB Output is correct
58 Correct 34 ms 36296 KB Output is correct
59 Correct 35 ms 36304 KB Output is correct
60 Correct 43 ms 36296 KB Output is correct
61 Correct 32 ms 36148 KB Output is correct
62 Correct 42 ms 36304 KB Output is correct
63 Correct 35 ms 36296 KB Output is correct
64 Correct 35 ms 36160 KB Output is correct
65 Correct 50 ms 36160 KB Output is correct
66 Correct 31 ms 36184 KB Output is correct
67 Correct 27 ms 36192 KB Output is correct
68 Correct 2396 ms 36052 KB Output is correct
69 Correct 3246 ms 36384 KB Output is correct
70 Correct 3214 ms 36296 KB Output is correct
71 Correct 3180 ms 36296 KB Output is correct
72 Correct 3139 ms 36304 KB Output is correct
73 Correct 3204 ms 36296 KB Output is correct
74 Correct 3260 ms 36296 KB Output is correct
75 Execution timed out 4069 ms 36304 KB Time limit exceeded
76 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1411 ms 22292 KB Output is correct
2 Execution timed out 4062 ms 36180 KB Time limit exceeded
3 Halted 0 ms 0 KB -