oj.uz

Submission #1026385

# Submission time Handle Problem Language Result Execution time Memory
1026385 2024-07-18T03:57:39 Z Mardonbekhazratov Radio Towers (IOI22_towers) C++17
4 / 100
 4000 ms 2532 KB 
#include "towers.h"

#include <vector>
#include <algorithm>
#include <iostream>
#include <map>
#include <set>

using namespace std;

struct SegTree{
    int N;
    vector<int>tree;

    int merge(int a,int b){
        return max(a,b);
    }

    void build(int n){
        N=1;
        while(N<n) N<<=1;
        
        tree.assign(2*N,0);
    }

    void update(int v,int l,int r,int id,int x){
        if(r-l==1){
            tree[v]=x;
            return;
        }
        int mid=(l+r)/2;
        if(id<mid) update(v<<1,l,mid,id,x);
        else update(v<<1|1,mid,r,id,x);
        tree[v]=merge(tree[v<<1],tree[v<<1|1]);
    }

    void update(int id,int x){
        return update(1,0,N,id,x);
    }

    int get(int v,int l,int r,int ql,int qr){
        if(ql>=r || l>=qr) return 0;
        if(l>=ql && qr>=r) return tree[v];

        int mid=(l+r)/2;
        return merge(get(v<<1,l,mid,ql,qr),get(v<<1|1,mid,r,ql,qr));
    }

    int get(int l,int r){
        return get(1,0,N,l,r);
    }
};

int n,k;
vector<int>h;
bool su1=true;


void init(int N, std::vector<int> H) {
    n=N;
    h=H;
    k=0;
    bool ok=true;
    for(int i=1;i<n;i++){
        if(h[i]>h[i-1] && ok) k=i;
        else{
            if(h[i]>h[i-1]) su1=false;
            ok=false;
        }
    }
}

int max_towers(int L, int R, int D) {
    if(su1){
        if(L<k && R>k && h[k]-D>=h[L] && h[k]-D>=h[R]) return 2;
        return 1;
    }
    vector<int>a,dp(R-L+1);
    dp[0]=1;
    for(int i=L;i<=R;i++){
        a.push_back(h[i]);
    }
    
    // map<int,int>mp;
    // vector<int>b=a;
    // sort(b.begin(),b.end());
    // int c=0;
    // for(int x:b) m[x]=c++;
    // SegTree S;
    // S.build(c);
    
    int ans=1,mx=0;
    set<pair<int,int>>s={{a[0],0}};
    for(int i=1;i<a.size();i++){
        dp[i]=mx;
        dp[i]++;
        ans=max(ans,dp[i]);
        s.insert({a[i],i});
        while(a[i]-D>=(*s.begin()).first){
            auto x=*s.begin();
            mx=max(mx,dp[x.second]);
            s.erase(s.begin());
        }
    }
    return ans;
}

Compilation message

towers.cpp: In function 'int max_towers(int, int, int)':
towers.cpp:94:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |     for(int i=1;i<a.size();i++){
      |                 ~^~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 285 ms 1112 KB Output is correct
2 Correct 669 ms 1380 KB Output is correct
3 Correct 655 ms 1368 KB Output is correct
4 Correct 641 ms 1368 KB Output is correct
5 Correct 636 ms 1368 KB Output is correct
6 Correct 642 ms 1368 KB Output is correct
7 Correct 670 ms 1368 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '13', found: '16'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '13', found: '16'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

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

Subtask #5
0 / 17.0

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

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '13', found: '16'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 285 ms 1112 KB Output is correct
2 Correct 669 ms 1380 KB Output is correct
3 Correct 655 ms 1368 KB Output is correct
4 Correct 641 ms 1368 KB Output is correct
5 Correct 636 ms 1368 KB Output is correct
6 Correct 642 ms 1368 KB Output is correct
7 Correct 670 ms 1368 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '13', found: '16'
12 Halted 0 ms 0 KB -