oj.uz

답안 #1023095

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1023095 2024-07-14T09:36:16 Z JakobZorz 송신탑 (IOI22_towers) C++17
56 / 100
 4000 ms 41672 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>mn;
    vector<int>mx;
    vector<int>tree;
    Diff():tree(2*TREE_SIZE),mn(2*TREE_SIZE),mx(2*TREE_SIZE){}
    
    void update(int i,int x){
        i+=TREE_SIZE;
        mn[i]=x;
        mx[i]=x;
        tree[i]=0;
        i/=2;
        while(i){
            mn[i]=min(mn[2*i],mn[2*i+1]);
            mx[i]=max(mx[2*i],mx[2*i+1]);
            tree[i]=max(max(tree[2*i],tree[2*i+1]),mx[2*i]-mn[2*i+1]);
            i/=2;
        }
    }
    
    pair<pair<int,int>,int>get(int node,int rl,int rr,int l,int r){
        if(r<=rl||rr<=l)
            return{{(int)1e9+1,-1},0};
        if(l<=rl&&rr<=r)
            return{{mn[node],mx[node]},tree[node]};
        int mid=(rl+rr)/2;
        auto res1=get(2*node,rl,mid,l,r);
        auto res2=get(2*node+1,mid,rr,l,r);
        int mn1=res1.first.first;
        int mx1=res1.first.second;
        int r1=res1.second;
        int mn2=res2.first.first;
        int mx2=res2.first.second;
        int r2=res2.second;
        int mn=min(mn1,mn2);
        int mx=max(mx1,mx2);
        int rs=max(max(r1,r2),mx1-mn2);
        return{{mn,mx},rs};
    }
    
    int get(int l,int r){
        return get(1,0,TREE_SIZE,l,r).second;
    }
};

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[n-i-1]);
    }
}

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;
        }
        res+=diff2.get(n-l-1,n-L)>=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;
}

Compilation message

towers.cpp: In constructor 'Diff::Diff()':
towers.cpp:130:16: warning: 'Diff::tree' will be initialized after [-Wreorder]
  130 |     vector<int>tree;
      |                ^~~~
towers.cpp:128:16: warning:   'std::vector<int> Diff::mn' [-Wreorder]
  128 |     vector<int>mn;
      |                ^~
towers.cpp:131:5: warning:   when initialized here [-Wreorder]
  131 |     Diff():tree(2*TREE_SIZE),mn(2*TREE_SIZE),mx(2*TREE_SIZE){}
      |     ^~~~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1121 ms 27412 KB Output is correct
2 Correct 3660 ms 41300 KB Output is correct
3 Correct 3708 ms 41296 KB Output is correct
4 Correct 3802 ms 41292 KB Output is correct
5 Correct 3700 ms 41284 KB Output is correct
6 Execution timed out 4013 ms 41356 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

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

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6744 KB Output is correct
2 Correct 4 ms 7076 KB Output is correct
3 Correct 3 ms 7256 KB Output is correct
4 Correct 3 ms 7256 KB Output is correct
5 Correct 5 ms 7256 KB Output is correct
6 Correct 5 ms 7256 KB Output is correct
7 Correct 4 ms 7256 KB Output is correct
8 Correct 3 ms 7256 KB Output is correct
9 Correct 4 ms 7256 KB Output is correct
10 Correct 4 ms 7256 KB Output is correct
11 Correct 4 ms 7256 KB Output is correct
12 Correct 3 ms 6488 KB Output is correct
13 Correct 4 ms 7256 KB Output is correct
14 Correct 4 ms 7256 KB Output is correct
15 Correct 4 ms 7256 KB Output is correct
16 Correct 3 ms 7256 KB Output is correct
17 Correct 4 ms 7256 KB Output is correct
18 Correct 6 ms 7256 KB Output is correct
19 Correct 4 ms 7256 KB Output is correct
20 Correct 4 ms 7256 KB Output is correct
21 Correct 5 ms 7256 KB Output is correct
22 Correct 6 ms 7256 KB Output is correct
23 Correct 3 ms 7256 KB Output is correct
24 Correct 3 ms 7256 KB Output is correct
25 Correct 5 ms 6744 KB Output is correct
26 Correct 4 ms 7256 KB Output is correct
27 Correct 4 ms 7168 KB Output is correct
28 Correct 4 ms 7256 KB Output is correct
29 Correct 4 ms 7256 KB Output is correct
30 Correct 4 ms 7256 KB Output is correct
31 Correct 4 ms 7256 KB Output is correct
32 Correct 4 ms 7256 KB Output is correct
33 Correct 6 ms 7256 KB Output is correct
34 Correct 3 ms 7320 KB Output is correct
35 Correct 3 ms 7256 KB Output is correct
36 Correct 39 ms 29348 KB Output is correct
37 Correct 51 ms 41424 KB Output is correct
38 Correct 49 ms 41420 KB Output is correct
39 Correct 49 ms 41416 KB Output is correct
40 Correct 52 ms 41304 KB Output is correct
41 Correct 47 ms 41428 KB Output is correct
42 Correct 47 ms 41440 KB Output is correct
43 Correct 46 ms 41288 KB Output is correct
44 Correct 49 ms 41288 KB Output is correct
45 Correct 46 ms 41304 KB Output is correct
46 Correct 47 ms 41304 KB Output is correct
47 Correct 60 ms 41416 KB Output is correct
48 Correct 47 ms 41420 KB Output is correct
49 Correct 48 ms 41424 KB Output is correct
50 Correct 49 ms 41280 KB Output is correct
51 Correct 47 ms 41444 KB Output is correct
52 Correct 67 ms 41416 KB Output is correct
53 Correct 48 ms 41420 KB Output is correct
54 Correct 50 ms 41476 KB Output is correct
55 Correct 46 ms 41280 KB Output is correct
56 Correct 48 ms 41344 KB Output is correct
57 Correct 48 ms 40156 KB Output is correct
58 Correct 51 ms 41424 KB Output is correct
59 Correct 51 ms 41424 KB Output is correct
60 Correct 51 ms 41416 KB Output is correct
61 Correct 54 ms 41416 KB Output is correct
62 Correct 48 ms 41416 KB Output is correct
63 Correct 62 ms 41428 KB Output is correct
64 Correct 45 ms 41288 KB Output is correct
65 Correct 48 ms 41276 KB Output is correct
66 Correct 48 ms 41296 KB Output is correct
67 Correct 54 ms 41304 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2595 ms 41172 KB Output is correct
2 Correct 3465 ms 41416 KB Output is correct
3 Correct 3350 ms 41424 KB Output is correct
4 Correct 3285 ms 41428 KB Output is correct
5 Correct 3516 ms 41424 KB Output is correct
6 Correct 3301 ms 41424 KB Output is correct
7 Correct 3449 ms 41672 KB Output is correct
8 Correct 3324 ms 41288 KB Output is correct
9 Correct 3393 ms 41288 KB Output is correct
10 Correct 3437 ms 41408 KB Output is correct
11 Correct 3281 ms 41408 KB Output is correct
12 Correct 3374 ms 41292 KB Output is correct
13 Correct 3519 ms 41312 KB Output is correct
14 Correct 3 ms 6488 KB Output is correct
15 Correct 3 ms 7256 KB Output is correct
16 Correct 4 ms 7256 KB Output is correct
17 Correct 58 ms 41416 KB Output is correct
18 Correct 60 ms 41428 KB Output is correct
19 Correct 48 ms 41348 KB Output is correct
20 Correct 49 ms 41288 KB Output is correct
21 Correct 48 ms 41296 KB Output is correct
22 Correct 49 ms 41424 KB Output is correct
23 Correct 51 ms 41424 KB Output is correct
24 Correct 49 ms 41416 KB Output is correct
25 Correct 46 ms 41288 KB Output is correct
26 Correct 47 ms 41348 KB Output is correct
27 Correct 4 ms 7256 KB Output is correct
28 Correct 3 ms 7256 KB Output is correct
29 Correct 3 ms 7256 KB Output is correct
30 Correct 5 ms 7256 KB Output is correct
31 Correct 3 ms 7256 KB Output is correct
32 Correct 4 ms 7256 KB Output is correct
33 Correct 3 ms 7276 KB Output is correct
34 Correct 4 ms 7256 KB Output is correct
35 Correct 3 ms 7256 KB Output is correct
36 Correct 3 ms 7256 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 773 ms 14936 KB Output is correct
2 Execution timed out 4016 ms 41404 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6744 KB Output is correct
2 Correct 4 ms 7076 KB Output is correct
3 Correct 3 ms 7256 KB Output is correct
4 Correct 3 ms 7256 KB Output is correct
5 Correct 5 ms 7256 KB Output is correct
6 Correct 5 ms 7256 KB Output is correct
7 Correct 4 ms 7256 KB Output is correct
8 Correct 3 ms 7256 KB Output is correct
9 Correct 4 ms 7256 KB Output is correct
10 Correct 4 ms 7256 KB Output is correct
11 Correct 4 ms 7256 KB Output is correct
12 Correct 3 ms 6488 KB Output is correct
13 Correct 4 ms 7256 KB Output is correct
14 Correct 4 ms 7256 KB Output is correct
15 Correct 4 ms 7256 KB Output is correct
16 Correct 3 ms 7256 KB Output is correct
17 Correct 4 ms 7256 KB Output is correct
18 Correct 6 ms 7256 KB Output is correct
19 Correct 4 ms 7256 KB Output is correct
20 Correct 4 ms 7256 KB Output is correct
21 Correct 5 ms 7256 KB Output is correct
22 Correct 6 ms 7256 KB Output is correct
23 Correct 3 ms 7256 KB Output is correct
24 Correct 3 ms 7256 KB Output is correct
25 Correct 5 ms 6744 KB Output is correct
26 Correct 4 ms 7256 KB Output is correct
27 Correct 4 ms 7168 KB Output is correct
28 Correct 4 ms 7256 KB Output is correct
29 Correct 4 ms 7256 KB Output is correct
30 Correct 4 ms 7256 KB Output is correct
31 Correct 4 ms 7256 KB Output is correct
32 Correct 4 ms 7256 KB Output is correct
33 Correct 6 ms 7256 KB Output is correct
34 Correct 3 ms 7320 KB Output is correct
35 Correct 3 ms 7256 KB Output is correct
36 Correct 39 ms 29348 KB Output is correct
37 Correct 51 ms 41424 KB Output is correct
38 Correct 49 ms 41420 KB Output is correct
39 Correct 49 ms 41416 KB Output is correct
40 Correct 52 ms 41304 KB Output is correct
41 Correct 47 ms 41428 KB Output is correct
42 Correct 47 ms 41440 KB Output is correct
43 Correct 46 ms 41288 KB Output is correct
44 Correct 49 ms 41288 KB Output is correct
45 Correct 46 ms 41304 KB Output is correct
46 Correct 47 ms 41304 KB Output is correct
47 Correct 60 ms 41416 KB Output is correct
48 Correct 47 ms 41420 KB Output is correct
49 Correct 48 ms 41424 KB Output is correct
50 Correct 49 ms 41280 KB Output is correct
51 Correct 47 ms 41444 KB Output is correct
52 Correct 67 ms 41416 KB Output is correct
53 Correct 48 ms 41420 KB Output is correct
54 Correct 50 ms 41476 KB Output is correct
55 Correct 46 ms 41280 KB Output is correct
56 Correct 48 ms 41344 KB Output is correct
57 Correct 48 ms 40156 KB Output is correct
58 Correct 51 ms 41424 KB Output is correct
59 Correct 51 ms 41424 KB Output is correct
60 Correct 51 ms 41416 KB Output is correct
61 Correct 54 ms 41416 KB Output is correct
62 Correct 48 ms 41416 KB Output is correct
63 Correct 62 ms 41428 KB Output is correct
64 Correct 45 ms 41288 KB Output is correct
65 Correct 48 ms 41276 KB Output is correct
66 Correct 48 ms 41296 KB Output is correct
67 Correct 54 ms 41304 KB Output is correct
68 Correct 2595 ms 41172 KB Output is correct
69 Correct 3465 ms 41416 KB Output is correct
70 Correct 3350 ms 41424 KB Output is correct
71 Correct 3285 ms 41428 KB Output is correct
72 Correct 3516 ms 41424 KB Output is correct
73 Correct 3301 ms 41424 KB Output is correct
74 Correct 3449 ms 41672 KB Output is correct
75 Correct 3324 ms 41288 KB Output is correct
76 Correct 3393 ms 41288 KB Output is correct
77 Correct 3437 ms 41408 KB Output is correct
78 Correct 3281 ms 41408 KB Output is correct
79 Correct 3374 ms 41292 KB Output is correct
80 Correct 3519 ms 41312 KB Output is correct
81 Correct 3 ms 6488 KB Output is correct
82 Correct 3 ms 7256 KB Output is correct
83 Correct 4 ms 7256 KB Output is correct
84 Correct 58 ms 41416 KB Output is correct
85 Correct 60 ms 41428 KB Output is correct
86 Correct 48 ms 41348 KB Output is correct
87 Correct 49 ms 41288 KB Output is correct
88 Correct 48 ms 41296 KB Output is correct
89 Correct 49 ms 41424 KB Output is correct
90 Correct 51 ms 41424 KB Output is correct
91 Correct 49 ms 41416 KB Output is correct
92 Correct 46 ms 41288 KB Output is correct
93 Correct 47 ms 41348 KB Output is correct
94 Correct 4 ms 7256 KB Output is correct
95 Correct 3 ms 7256 KB Output is correct
96 Correct 3 ms 7256 KB Output is correct
97 Correct 5 ms 7256 KB Output is correct
98 Correct 3 ms 7256 KB Output is correct
99 Correct 4 ms 7256 KB Output is correct
100 Correct 3 ms 7276 KB Output is correct
101 Correct 4 ms 7256 KB Output is correct
102 Correct 3 ms 7256 KB Output is correct
103 Correct 3 ms 7256 KB Output is correct
104 Correct 2574 ms 37628 KB Output is correct
105 Correct 3490 ms 41416 KB Output is correct
106 Correct 3576 ms 41416 KB Output is correct
107 Correct 3454 ms 41416 KB Output is correct
108 Correct 3738 ms 41416 KB Output is correct
109 Correct 3509 ms 41420 KB Output is correct
110 Correct 3562 ms 41416 KB Output is correct
111 Correct 3398 ms 41280 KB Output is correct
112 Correct 3298 ms 41288 KB Output is correct
113 Correct 3468 ms 41316 KB Output is correct
114 Correct 3340 ms 41312 KB Output is correct

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1121 ms 27412 KB Output is correct
2 Correct 3660 ms 41300 KB Output is correct
3 Correct 3708 ms 41296 KB Output is correct
4 Correct 3802 ms 41292 KB Output is correct
5 Correct 3700 ms 41284 KB Output is correct
6 Execution timed out 4013 ms 41356 KB Time limit exceeded
7 Halted 0 ms 0 KB -