oj.uz

답안 #978868

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
978868 2024-05-09T20:37:34 Z canadavid1 송신탑 (IOI22_towers) C++17
11 / 100
 4000 ms 2656 KB 
#include "towers.h"

#include <vector>
#include <numeric>
#include <algorithm>
struct SegmentTree
{
private:
    std::vector<int> data;
    struct SegTreeReference
    {
    private:
        const int pos;
        SegmentTree& t;
    public:
        SegTreeReference(int pos,SegmentTree& t) : pos(pos), t(t) {}
        int operator=(int val)
        {
            t.assign(pos,val);
            return val;
        }
        operator int() const {return t.data[t.data.size()/2+pos];}
    };
public:
    SegmentTree() : data(0) {}
    SegmentTree(int num) : data(num*2,0) {}
    SegmentTree(const std::vector<int>& vec) : data(vec.size()*2)
    {
        
        for(int i = 0; i < vec.size(); i++) data[vec.size()+i] = vec[i];
        for(int i = vec.size()-1; i > 0; i--)
            data[i] = std::max(data[2*i],data[2*i+1]);
    }
    void assign(int pos, int val)
    {
        data[pos] = val;
        pos >>= 1;
        for(;pos>0;pos>>=1)
            data[pos] = std::max(data[2*pos],data[2*pos+1]);
        
    }
    SegTreeReference operator[](int pos)
    {
        return SegTreeReference(pos,*this);
    }
    int query(int l, int r)
    {
        l += data.size()/2;
        r += data.size()/2;
        int o = -(1<<31);
        while(l < r)
        {
            if(l&1) o = std::max(o,data[l++]);
            if(r&1) o = std::max(o,data[--r]);
            l>>=1;
            r>>=1;
        }
        return o;
    }
    void push_back(int v)
    {
        int N = data.size()/2;
        data.push_back(data[N]);
        data.push_back(v);
        data[N] = std::max(data[2*N],data[2*N+1]);
    }
    
};

std::vector<int> H;
int m;
void init(int N, std::vector<int> _H) {
    H = std::move(_H);
}

int max_towers(int L, int R, int D) {
    std::vector<int> idx_sorted(H.size());
    SegmentTree st(H);
    std::iota(idx_sorted.begin(),idx_sorted.end(),0);
    std::sort(idx_sorted.begin(),idx_sorted.end(),[](auto a, auto b) {return H[a] < H[b];});
    std::vector<int> included;
    for(auto i : idx_sorted)
    {
        if(i < L || i > R) continue;
        bool inv = false;
        for(auto j : included)
        {
            auto l = std::min(i,j);
            l++;
            auto r = std::max(i,j);
            if(l==r) {inv = true;break;}
            auto c = st.query(l,r);
            if(H[i] > c-D || H[j] > c-D) {inv = true;break;}
        }
        if(!inv) included.push_back(i);
    }
    return included.size();
}


/*
    WLOG all leased towers are local minima or endpoints
    DONE s1: "concave": lease extrema if possible
    s2: N <= 1000, Q=1
    s23: Q = 1
    s4: D = 1
    s46: D fixed
    s5: L,R is entire range

    WLOG use smallest tower
    use next smallest that works
        need to quickly check if it works (logn time)
        or not (subtask 2)
    repeat
*/

Compilation message

towers.cpp: In constructor 'SegmentTree::SegmentTree(const std::vector<int>&)':
towers.cpp:30:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |         for(int i = 0; i < vec.size(); i++) data[vec.size()+i] = vec[i];
      |                        ~~^~~~~~~~~~~~
towers.cpp: In member function 'int SegmentTree::query(int, int)':
towers.cpp:50:17: warning: integer overflow in expression of type 'int' results in '-2147483648' [-Woverflow]
   50 |         int o = -(1<<31);
      |                 ^~~~~~~~

Subtask #1
0 / 4.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 504 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 20 ms 596 KB Output is correct
17 Correct 4 ms 340 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 30 ms 464 KB Output is correct
21 Correct 40 ms 344 KB Output is correct
22 Correct 37 ms 464 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 3 ms 344 KB Output is correct
27 Correct 12 ms 452 KB Output is correct
28 Correct 8 ms 344 KB Output is correct
29 Correct 9 ms 456 KB Output is correct
30 Correct 3 ms 344 KB Output is correct
31 Correct 4 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 2522 ms 1980 KB Output is correct
37 Correct 747 ms 2600 KB Output is correct
38 Correct 716 ms 2584 KB Output is correct
39 Correct 55 ms 2356 KB Output is correct
40 Correct 1211 ms 2656 KB Output is correct
41 Execution timed out 4051 ms 2476 KB Time limit exceeded
42 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

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

Subtask #5
0 / 17.0

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

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 504 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 20 ms 596 KB Output is correct
17 Correct 4 ms 340 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 30 ms 464 KB Output is correct
21 Correct 40 ms 344 KB Output is correct
22 Correct 37 ms 464 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 3 ms 344 KB Output is correct
27 Correct 12 ms 452 KB Output is correct
28 Correct 8 ms 344 KB Output is correct
29 Correct 9 ms 456 KB Output is correct
30 Correct 3 ms 344 KB Output is correct
31 Correct 4 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 2522 ms 1980 KB Output is correct
37 Correct 747 ms 2600 KB Output is correct
38 Correct 716 ms 2584 KB Output is correct
39 Correct 55 ms 2356 KB Output is correct
40 Correct 1211 ms 2656 KB Output is correct
41 Execution timed out 4051 ms 2476 KB Time limit exceeded
42 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

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