oj.uz

답안 #1022994

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

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]);
}

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();
}

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;
    }
    
    {
        int mx=0;
        for(int i=last;i<=R;i++){
            if(max(arr[i],arr[last])+D<=mx){
                res++;
                break;
            }
            mx=max(mx,arr[i]);
        }
    }
    
    return res;
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1601 ms 21012 KB Output is correct
2 Execution timed out 4050 ms 35164 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

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

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 940 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 1 ms 1112 KB Output is correct
11 Correct 1 ms 1112 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 1112 KB Output is correct
14 Correct 1 ms 1112 KB Output is correct
15 Correct 1 ms 1112 KB Output is correct
16 Correct 1 ms 1108 KB Output is correct
17 Correct 1 ms 1112 KB Output is correct
18 Correct 1 ms 1112 KB Output is correct
19 Correct 1 ms 1112 KB Output is correct
20 Correct 1 ms 1112 KB Output is correct
21 Correct 1 ms 1112 KB Output is correct
22 Correct 1 ms 1112 KB Output is correct
23 Correct 1 ms 1112 KB Output is correct
24 Correct 1 ms 920 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 1112 KB Output is correct
27 Correct 1 ms 1112 KB Output is correct
28 Correct 1 ms 1112 KB Output is correct
29 Correct 1 ms 1112 KB Output is correct
30 Correct 1 ms 1112 KB Output is correct
31 Correct 1 ms 1112 KB Output is correct
32 Correct 1 ms 1112 KB Output is correct
33 Correct 1 ms 1112 KB Output is correct
34 Correct 1 ms 1112 KB Output is correct
35 Correct 1 ms 1112 KB Output is correct
36 Correct 21 ms 23128 KB Output is correct
37 Correct 31 ms 35280 KB Output is correct
38 Correct 29 ms 35272 KB Output is correct
39 Correct 31 ms 35292 KB Output is correct
40 Correct 28 ms 35188 KB Output is correct
41 Correct 28 ms 35272 KB Output is correct
42 Correct 30 ms 35272 KB Output is correct
43 Correct 28 ms 35144 KB Output is correct
44 Correct 27 ms 35296 KB Output is correct
45 Correct 27 ms 35160 KB Output is correct
46 Correct 29 ms 35184 KB Output is correct
47 Correct 30 ms 35272 KB Output is correct
48 Correct 28 ms 35240 KB Output is correct
49 Correct 28 ms 35272 KB Output is correct
50 Correct 29 ms 35232 KB Output is correct
51 Correct 29 ms 35252 KB Output is correct
52 Correct 30 ms 35164 KB Output is correct
53 Correct 29 ms 35280 KB Output is correct
54 Correct 29 ms 35248 KB Output is correct
55 Correct 28 ms 35144 KB Output is correct
56 Correct 27 ms 35224 KB Output is correct
57 Correct 28 ms 34012 KB Output is correct
58 Correct 29 ms 35272 KB Output is correct
59 Correct 29 ms 35280 KB Output is correct
60 Correct 28 ms 35280 KB Output is correct
61 Correct 33 ms 35272 KB Output is correct
62 Correct 28 ms 35272 KB Output is correct
63 Correct 30 ms 35280 KB Output is correct
64 Correct 34 ms 35136 KB Output is correct
65 Correct 26 ms 35292 KB Output is correct
66 Correct 37 ms 35124 KB Output is correct
67 Correct 27 ms 35168 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2297 ms 34764 KB Output is correct
2 Correct 3061 ms 35272 KB Output is correct
3 Correct 3020 ms 35280 KB Output is correct
4 Correct 3059 ms 35252 KB Output is correct
5 Correct 3118 ms 35272 KB Output is correct
6 Correct 3183 ms 35252 KB Output is correct
7 Correct 3148 ms 35272 KB Output is correct
8 Execution timed out 4067 ms 35252 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 720 ms 8604 KB Output is correct
2 Execution timed out 4067 ms 35280 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 940 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 1 ms 1112 KB Output is correct
11 Correct 1 ms 1112 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 1112 KB Output is correct
14 Correct 1 ms 1112 KB Output is correct
15 Correct 1 ms 1112 KB Output is correct
16 Correct 1 ms 1108 KB Output is correct
17 Correct 1 ms 1112 KB Output is correct
18 Correct 1 ms 1112 KB Output is correct
19 Correct 1 ms 1112 KB Output is correct
20 Correct 1 ms 1112 KB Output is correct
21 Correct 1 ms 1112 KB Output is correct
22 Correct 1 ms 1112 KB Output is correct
23 Correct 1 ms 1112 KB Output is correct
24 Correct 1 ms 920 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 1112 KB Output is correct
27 Correct 1 ms 1112 KB Output is correct
28 Correct 1 ms 1112 KB Output is correct
29 Correct 1 ms 1112 KB Output is correct
30 Correct 1 ms 1112 KB Output is correct
31 Correct 1 ms 1112 KB Output is correct
32 Correct 1 ms 1112 KB Output is correct
33 Correct 1 ms 1112 KB Output is correct
34 Correct 1 ms 1112 KB Output is correct
35 Correct 1 ms 1112 KB Output is correct
36 Correct 21 ms 23128 KB Output is correct
37 Correct 31 ms 35280 KB Output is correct
38 Correct 29 ms 35272 KB Output is correct
39 Correct 31 ms 35292 KB Output is correct
40 Correct 28 ms 35188 KB Output is correct
41 Correct 28 ms 35272 KB Output is correct
42 Correct 30 ms 35272 KB Output is correct
43 Correct 28 ms 35144 KB Output is correct
44 Correct 27 ms 35296 KB Output is correct
45 Correct 27 ms 35160 KB Output is correct
46 Correct 29 ms 35184 KB Output is correct
47 Correct 30 ms 35272 KB Output is correct
48 Correct 28 ms 35240 KB Output is correct
49 Correct 28 ms 35272 KB Output is correct
50 Correct 29 ms 35232 KB Output is correct
51 Correct 29 ms 35252 KB Output is correct
52 Correct 30 ms 35164 KB Output is correct
53 Correct 29 ms 35280 KB Output is correct
54 Correct 29 ms 35248 KB Output is correct
55 Correct 28 ms 35144 KB Output is correct
56 Correct 27 ms 35224 KB Output is correct
57 Correct 28 ms 34012 KB Output is correct
58 Correct 29 ms 35272 KB Output is correct
59 Correct 29 ms 35280 KB Output is correct
60 Correct 28 ms 35280 KB Output is correct
61 Correct 33 ms 35272 KB Output is correct
62 Correct 28 ms 35272 KB Output is correct
63 Correct 30 ms 35280 KB Output is correct
64 Correct 34 ms 35136 KB Output is correct
65 Correct 26 ms 35292 KB Output is correct
66 Correct 37 ms 35124 KB Output is correct
67 Correct 27 ms 35168 KB Output is correct
68 Correct 2297 ms 34764 KB Output is correct
69 Correct 3061 ms 35272 KB Output is correct
70 Correct 3020 ms 35280 KB Output is correct
71 Correct 3059 ms 35252 KB Output is correct
72 Correct 3118 ms 35272 KB Output is correct
73 Correct 3183 ms 35252 KB Output is correct
74 Correct 3148 ms 35272 KB Output is correct
75 Execution timed out 4067 ms 35252 KB Time limit exceeded
76 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1601 ms 21012 KB Output is correct
2 Execution timed out 4050 ms 35164 KB Time limit exceeded
3 Halted 0 ms 0 KB -