oj.uz

답안 #787113

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
787113 2023-07-18T20:27:37 Z alexander707070 송신탑 (IOI22_towers) C++17
23 / 100
 4000 ms 7172 KB 
#include<bits/stdc++.h>
#define MAXN 100007
using namespace std;
 
int n,h[MAXN],maxh,num,delta,from[MAXN],to[MAXN];
int dp[MAXN],ans,pref[MAXN],se,te;
 
pair<int,int> tree[4*MAXN];
int mins[4*MAXN];
 
pair<int,int> combine(pair<int,int> fr,pair<int,int> sc){
    if(fr.first>sc.first)return fr;
    return sc;
}
 
void build(int v,int l,int r){
    if(l==r){
        tree[v]={h[l],l};
        mins[v]=h[l];
    }else{
        int tt=(l+r)/2;
        build(2*v,l,tt);
        build(2*v+1,tt+1,r);
        tree[v]=combine(tree[2*v],tree[2*v+1]);
        mins[v]=min(mins[2*v],mins[2*v+1]);
    }
}
 
pair<int,int> best(int v,int l,int r,int ll,int rr){
    if(ll>rr)return {-1,0};
    if(l==ll and r==rr){
        return tree[v];
    }else{
        int tt=(l+r)/2;
        return combine( best(2*v,l,tt,ll,min(tt,rr)) , best(2*v+1,tt+1,r,max(tt+1,ll),rr) );
    }
}
 
int minh(int v,int l,int r,int ll,int rr){
    if(ll>rr)return 1000000000;
    if(l==ll and r==rr){
        return mins[v];
    }else{
        int tt=(l+r)/2;
        return min( minh(2*v,l,tt,ll,min(tt,rr)) , minh(2*v+1,tt+1,r,max(tt+1,ll),rr) );
    }
}

vector<int> st,poss,lt,rt;
 
void calc(){
    for(int i=1;i<=n;i++){
        while(!st.empty() and h[i]>h[st.back()]){
            st.pop_back();
        }
        st.push_back(i);

        int l=-1,r=st.size(),tt;
        while(l+1<r){
            tt=(l+r)/2;
            if(h[st[tt]]>=h[i]+delta){
                l=tt;
            }else{
                r=tt;
            }
        }

        if(l!=-1 and minh(1,1,n,st[l],i)>=h[i])from[i]=st[l];
        else from[i]=0;
    }

    while(!st.empty())st.pop_back();

    for(int i=n;i>=1;i--){
        while(!st.empty() and h[i]>h[st.back()]){
            st.pop_back();
        }
        st.push_back(i);

        int l=-1,r=st.size(),tt;
        while(l+1<r){
            tt=(l+r)/2;
            if(h[st[tt]]>=h[i]+delta){
                l=tt;
            }else{
                r=tt;
            }
        }
        if(l!=-1 and minh(1,1,n,i,st[l])>=h[i])to[i]=st[l];
        else to[i]=n+1;
    }

    for(int i=1;i<=n;i++){
        if(from[i]>=1 and to[i]<=n){
            poss.push_back(i);
        }
        if(to[i]<=n)lt.push_back(i);
        if(from[i]>=1)rt.push_back(i);
    }
}

void init(int N,vector<int> H){
    n=N;
    for(int i=1;i<=n;i++){
        h[i]=H[i-1];
    }
    build(1,1,n);
}
 
int solve(int l,int r,int maxh,int d){
    if(l>r)return 0;
 
    int pos=best(1,1,n,l,r).second;
 
    int z=0;
    if(minh(1,1,n,l,r)<=maxh)z=1;
 
    return max(z, solve(l,pos-1,h[pos]-d,d)+solve(pos+1,r,h[pos]-d,d) );
}
 
int max_towers(int L, int R, int D){
    if(delta==0){
        delta=D;
        calc();
    }

    L++; R++;
    if(D==delta){
        ans=0;

        int l=-1,r=poss.size(),tt;
        while(l+1<r){
            tt=(l+r)/2;
            if(from[poss[tt]]>=L){
                r=tt;
            }else{
                l=tt;
            }
        }
        se=r;

        l=-1; r=poss.size();
        while(l+1<r){
            tt=(l+r)/2;
            if(to[poss[tt]]<=R){
                l=tt;
            }else{
                r=tt;
            }
        }
        te=l;

        if(se<=te)ans+=te-se+1;

        if(se==poss.size())se=R+1;
        else se=poss[se];

        if(te==-1)te=L-1;
        else te=poss[te];

        l=-1; r=lt.size();
        while(l+1<r){
            tt=(l+r)/2;
            if(to[lt[tt]]<se){
                l=tt;
            }else{
                r=tt;
            }
        }
        if(l!=-1 and lt[l]>=L)ans++;

        l=-1; r=rt.size();
        while(l+1<r){
            tt=(l+r)/2;
            if(from[rt[tt]]>te){
                r=tt;
            }else{
                l=tt;
            }
        }
        if(r!=rt.size() and rt[r]<=R)ans++;

        if(ans==0)ans++;

        return ans;   
    }

    return solve(L,R,1000000000,D);
}
 
/*
int main(){
    init(7, {10, 20, 60, 40, 50, 30, 70});
    cout<<max_towers(1,5,10)<<"\n";
    cout<<max_towers(0, 6, 17)<<"\n";
}
*/

Compilation message

towers.cpp: In function 'int max_towers(int, int, int)':
towers.cpp:155:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  155 |         if(se==poss.size())se=R+1;
      |            ~~^~~~~~~~~~~~~
towers.cpp:181:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  181 |         if(r!=rt.size() and rt[r]<=R)ans++;
      |            ~^~~~~~~~~~~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4102 ms 7172 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

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

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 392 KB Output is correct
36 Correct 25 ms 3380 KB Output is correct
37 Correct 23 ms 5092 KB Output is correct
38 Correct 33 ms 5708 KB Output is correct
39 Correct 16 ms 4916 KB Output is correct
40 Correct 34 ms 5808 KB Output is correct
41 Correct 36 ms 5440 KB Output is correct
42 Correct 38 ms 5792 KB Output is correct
43 Correct 31 ms 6080 KB Output is correct
44 Correct 32 ms 6188 KB Output is correct
45 Correct 17 ms 5684 KB Output is correct
46 Correct 36 ms 5568 KB Output is correct
47 Correct 47 ms 5812 KB Output is correct
48 Correct 38 ms 5796 KB Output is correct
49 Correct 38 ms 5808 KB Output is correct
50 Correct 29 ms 6196 KB Output is correct
51 Correct 24 ms 6256 KB Output is correct
52 Correct 42 ms 5764 KB Output is correct
53 Correct 49 ms 5768 KB Output is correct
54 Correct 51 ms 5828 KB Output is correct
55 Correct 27 ms 6188 KB Output is correct
56 Correct 33 ms 6152 KB Output is correct
57 Correct 26 ms 5324 KB Output is correct
58 Correct 31 ms 5408 KB Output is correct
59 Correct 44 ms 5760 KB Output is correct
60 Correct 43 ms 5916 KB Output is correct
61 Correct 34 ms 5824 KB Output is correct
62 Correct 30 ms 5716 KB Output is correct
63 Correct 34 ms 5820 KB Output is correct
64 Correct 30 ms 5824 KB Output is correct
65 Correct 24 ms 5808 KB Output is correct
66 Correct 32 ms 5560 KB Output is correct
67 Correct 24 ms 5712 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 733 ms 5812 KB Output is correct
2 Incorrect 813 ms 5832 KB 12418th lines differ - on the 1st token, expected: '1', found: '2'
3 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4046 ms 1616 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 392 KB Output is correct
36 Correct 25 ms 3380 KB Output is correct
37 Correct 23 ms 5092 KB Output is correct
38 Correct 33 ms 5708 KB Output is correct
39 Correct 16 ms 4916 KB Output is correct
40 Correct 34 ms 5808 KB Output is correct
41 Correct 36 ms 5440 KB Output is correct
42 Correct 38 ms 5792 KB Output is correct
43 Correct 31 ms 6080 KB Output is correct
44 Correct 32 ms 6188 KB Output is correct
45 Correct 17 ms 5684 KB Output is correct
46 Correct 36 ms 5568 KB Output is correct
47 Correct 47 ms 5812 KB Output is correct
48 Correct 38 ms 5796 KB Output is correct
49 Correct 38 ms 5808 KB Output is correct
50 Correct 29 ms 6196 KB Output is correct
51 Correct 24 ms 6256 KB Output is correct
52 Correct 42 ms 5764 KB Output is correct
53 Correct 49 ms 5768 KB Output is correct
54 Correct 51 ms 5828 KB Output is correct
55 Correct 27 ms 6188 KB Output is correct
56 Correct 33 ms 6152 KB Output is correct
57 Correct 26 ms 5324 KB Output is correct
58 Correct 31 ms 5408 KB Output is correct
59 Correct 44 ms 5760 KB Output is correct
60 Correct 43 ms 5916 KB Output is correct
61 Correct 34 ms 5824 KB Output is correct
62 Correct 30 ms 5716 KB Output is correct
63 Correct 34 ms 5820 KB Output is correct
64 Correct 30 ms 5824 KB Output is correct
65 Correct 24 ms 5808 KB Output is correct
66 Correct 32 ms 5560 KB Output is correct
67 Correct 24 ms 5712 KB Output is correct
68 Correct 733 ms 5812 KB Output is correct
69 Incorrect 813 ms 5832 KB 12418th lines differ - on the 1st token, expected: '1', found: '2'
70 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4102 ms 7172 KB Time limit exceeded
2 Halted 0 ms 0 KB -