oj.uz

Submission #1022973

# Submission time Handle Problem Language Result Execution time Memory
1022973 2024-07-14T08:08:35 Z JakobZorz Radio Towers (IOI22_towers) C++17
23 / 100
 4000 ms 19012 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<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(int N,vector<int>H){
    arr=H;
    n=(int)arr.size();
    init_prev();
    init_nxt();
    init_arr_rmq();
    init_thres();
    init_thres_rmq();
}

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

# Verdict Execution time Memory Grader output
1 Execution timed out 4011 ms 11284 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 0 ms 600 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 0 ms 600 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 0 ms 600 KB Output is correct
33 Correct 1 ms 600 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 1 ms 600 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 0 ms 600 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 0 ms 600 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 0 ms 600 KB Output is correct
33 Correct 1 ms 600 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 1 ms 600 KB Output is correct
36 Correct 14 ms 12376 KB Output is correct
37 Correct 24 ms 18640 KB Output is correct
38 Correct 29 ms 18632 KB Output is correct
39 Correct 21 ms 18632 KB Output is correct
40 Correct 21 ms 18640 KB Output is correct
41 Correct 21 ms 18644 KB Output is correct
42 Correct 21 ms 18640 KB Output is correct
43 Correct 21 ms 18812 KB Output is correct
44 Correct 20 ms 18760 KB Output is correct
45 Correct 20 ms 18776 KB Output is correct
46 Correct 21 ms 18768 KB Output is correct
47 Correct 21 ms 18648 KB Output is correct
48 Correct 22 ms 18640 KB Output is correct
49 Correct 21 ms 18632 KB Output is correct
50 Correct 21 ms 19012 KB Output is correct
51 Correct 20 ms 18768 KB Output is correct
52 Correct 22 ms 18808 KB Output is correct
53 Correct 24 ms 18640 KB Output is correct
54 Correct 20 ms 18612 KB Output is correct
55 Correct 20 ms 18760 KB Output is correct
56 Correct 20 ms 18824 KB Output is correct
57 Correct 22 ms 18132 KB Output is correct
58 Correct 22 ms 18640 KB Output is correct
59 Correct 27 ms 18704 KB Output is correct
60 Correct 21 ms 18640 KB Output is correct
61 Correct 22 ms 18640 KB Output is correct
62 Correct 30 ms 18640 KB Output is correct
63 Correct 21 ms 18640 KB Output is correct
64 Correct 21 ms 18576 KB Output is correct
65 Correct 20 ms 18760 KB Output is correct
66 Correct 20 ms 18776 KB Output is correct
67 Correct 20 ms 18784 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2318 ms 18644 KB Output is correct
2 Correct 3073 ms 18632 KB Output is correct
3 Correct 3028 ms 18712 KB Output is correct
4 Correct 3104 ms 18872 KB Output is correct
5 Correct 3027 ms 18640 KB Output is correct
6 Correct 3043 ms 18640 KB Output is correct
7 Correct 2997 ms 18640 KB Output is correct
8 Execution timed out 4019 ms 18760 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 750 ms 4800 KB Output is correct
2 Execution timed out 4083 ms 18640 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 0 ms 600 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 0 ms 600 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 0 ms 600 KB Output is correct
33 Correct 1 ms 600 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 1 ms 600 KB Output is correct
36 Correct 14 ms 12376 KB Output is correct
37 Correct 24 ms 18640 KB Output is correct
38 Correct 29 ms 18632 KB Output is correct
39 Correct 21 ms 18632 KB Output is correct
40 Correct 21 ms 18640 KB Output is correct
41 Correct 21 ms 18644 KB Output is correct
42 Correct 21 ms 18640 KB Output is correct
43 Correct 21 ms 18812 KB Output is correct
44 Correct 20 ms 18760 KB Output is correct
45 Correct 20 ms 18776 KB Output is correct
46 Correct 21 ms 18768 KB Output is correct
47 Correct 21 ms 18648 KB Output is correct
48 Correct 22 ms 18640 KB Output is correct
49 Correct 21 ms 18632 KB Output is correct
50 Correct 21 ms 19012 KB Output is correct
51 Correct 20 ms 18768 KB Output is correct
52 Correct 22 ms 18808 KB Output is correct
53 Correct 24 ms 18640 KB Output is correct
54 Correct 20 ms 18612 KB Output is correct
55 Correct 20 ms 18760 KB Output is correct
56 Correct 20 ms 18824 KB Output is correct
57 Correct 22 ms 18132 KB Output is correct
58 Correct 22 ms 18640 KB Output is correct
59 Correct 27 ms 18704 KB Output is correct
60 Correct 21 ms 18640 KB Output is correct
61 Correct 22 ms 18640 KB Output is correct
62 Correct 30 ms 18640 KB Output is correct
63 Correct 21 ms 18640 KB Output is correct
64 Correct 21 ms 18576 KB Output is correct
65 Correct 20 ms 18760 KB Output is correct
66 Correct 20 ms 18776 KB Output is correct
67 Correct 20 ms 18784 KB Output is correct
68 Correct 2318 ms 18644 KB Output is correct
69 Correct 3073 ms 18632 KB Output is correct
70 Correct 3028 ms 18712 KB Output is correct
71 Correct 3104 ms 18872 KB Output is correct
72 Correct 3027 ms 18640 KB Output is correct
73 Correct 3043 ms 18640 KB Output is correct
74 Correct 2997 ms 18640 KB Output is correct
75 Execution timed out 4019 ms 18760 KB Time limit exceeded
76 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4011 ms 11284 KB Time limit exceeded
2 Halted 0 ms 0 KB -