oj.uz

답안 #705650

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
705650 2023-03-04T22:49:51 Z danikoynov 송신탑 (IOI22_towers) C++17
23 / 100
 4000 ms 7636 KB 
#include "towers.h"

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;

int n, h[maxn], pref[maxn], peak_pos;
int cnt = 0;


int par[maxn], rnk[maxn];

int find_leader(int v)
{
    return (v == par[v]) ? v : par[v] = find_leader(par[v]);
}

void unite(int v, int u)
{
    v = find_leader(v);
    u = find_leader(u);
    if (v == u)
        return;

    if (rnk[v] < rnk[u])
        swap(v, u);
    rnk[v] += rnk[u];
    par[u] = v;
}

int dp[maxn], bef[maxn], aft[maxn];

int tree[4 * maxn];

void build_tree(int root, int left, int right)
{
    if (left == right)
    {
        tree[root] = h[left];
        return;
    }

    int mid = (left + right) / 2;
    build_tree(root * 2, left, mid);
    build_tree(root * 2 + 1, mid + 1, right);

    tree[root] = max(tree[root * 2], tree[root * 2 + 1]);
}
void update(int root, int left, int right, int pos, int val)
{
    if (left == right)
    {
        tree[root] = val;
        return;
    }

    int mid = (left + right) / 2;
    if (pos <= mid)
        update(root * 2, left, mid, pos, val);
    else
        update(root * 2 + 1, mid + 1, right, pos, val);

    tree[root] = max(tree[root * 2], tree[root * 2 + 1]);
}

int query(int root, int left, int right, int qleft, int qright)
{
    if (left > qright || right < qleft)
        return 0;

    if (left >= qleft && right <= qright)
        return tree[root];

    int mid = (left + right) / 2;
    return max(query(root * 2, left, mid, qleft, qright),
               query(root * 2 + 1, mid + 1, right, qleft, qright));
}

vector < pair < int, int > > val;
void init(int N, std::vector<int> H)
{
    n = N;
    for (int i = 0; i < n; i ++)
        h[i + 1] = H[i];

    for (int i = 1; i <= n; i ++)
        if (h[i] > h[i - 1] && h[i] > h[i + 1])
            cnt ++;
    for (int i = 2; i < n; i ++)
    {
        pref[i] = pref[i - 1];
        if (h[i] > h[i - 1] && h[i] > h[i + 1])
        {
            pref[i] ++, peak_pos = i;

        }
    }

    build_tree(1, 1, n);
    vector < int > st;
    st.push_back(0);
    for (int i = 1; i <= n; i ++)
    {


        while(!st.empty() && h[st.back()] >= h[i])
            st.pop_back();
        bef[i] = st.back();
        st.push_back(i);
    }

    st.clear();
    st.push_back(n + 1);
    for (int i = n; i > 0; i --)
    {


        while(!st.empty() && h[st.back()] >= h[i])
            st.pop_back();
        aft[i] = st.back();
        st.push_back(i);
    }

    for (int i = 1; i <= n; i ++)
    {

        ///cout << bef[i] << " " << aft[i] << endl;
        int h1 = 0, h2 = 0;
        if (bef[i] != i - 1)
            h1 = query(1, 1, n, bef[i] + 1, i - 1);
        if (bef[i] == 0)
            h1 = 2e9 + 10;
        if (aft[i] != i + 1)
            h2 = query(1, 1, n, i + 1, aft[i] - 1);
        if (aft[i] == n + 1)
            h2 = 2e9 + 10;
        val.push_back({min(h1, h2) - h[i], i});
        ///cout << query(1, 1, n, bef[i] + 1)
    }

    sort(val.begin(), val.end());
    //for (int v : val)
    //    cout << v << " ";
    // cout << endl;
}


vector < int > act[maxn];
int cnt_query = 0;
int max_towers(int L, int R, int D)
{

    L ++;
    R ++;
    cnt_query ++;


    int lf = 0, rf = (int)(val.size()) - 1;
    while(lf <= rf)
    {
        int mf = (lf + rf) / 2;
        if (val[mf].first < D)
            lf = mf + 1;
        else
            rf = mf - 1;
    }
    ///vector < int > towers;
    int leftmost = n + 1, rightmost = 0, ans = 0;
    for (int i = lf; i < val.size(); i ++)
    {
        if (val[i].second >= L && val[i].second <= R)
        {
            ans ++;
            ///towers.push_back(val[i].second);
            leftmost = min(leftmost, val[i].second);
            rightmost = max(rightmost, val[i].second);
        }
    }

    if (leftmost > rightmost)
    {
        int lowest_tower = L;
        for (int tower = L + 1; tower <= R; tower ++)
        {
            if (h[tower] < h[lowest_tower])
                lowest_tower = tower;
        }
        leftmost = lowest_tower;
        rightmost = lowest_tower;
        ans = 1;
    }

    int highest_tower = 0;
    ///cout << leftmost << " " << rightmost << endl;
    for (int tower = leftmost - 1; tower >= L; tower --)
    {
        if (h[tower] + D <= highest_tower &&
            highest_tower >= h[leftmost] + D)
        {
            ans ++;
            break;
        }
        highest_tower = max(highest_tower, h[tower]);
    }

    highest_tower = 0;
    for (int tower = rightmost + 1; tower <= R; tower ++)
    {
        if (h[tower] + D <= highest_tower &&
            highest_tower >= h[rightmost] + D)
        {
            ans ++;
            break;
        }
         highest_tower = max(highest_tower, h[tower]);
    }

    return ans;



}

Compilation message

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

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3947 ms 5328 KB Output is correct
2 Execution timed out 4011 ms 7492 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

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

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 3 ms 2768 KB Output is correct
3 Correct 2 ms 2768 KB Output is correct
4 Correct 2 ms 2768 KB Output is correct
5 Correct 2 ms 2768 KB Output is correct
6 Correct 2 ms 2768 KB Output is correct
7 Correct 2 ms 2640 KB Output is correct
8 Correct 2 ms 2768 KB Output is correct
9 Correct 2 ms 2768 KB Output is correct
10 Correct 2 ms 2768 KB Output is correct
11 Correct 2 ms 2768 KB Output is correct
12 Correct 1 ms 2640 KB Output is correct
13 Correct 2 ms 2664 KB Output is correct
14 Correct 2 ms 2768 KB Output is correct
15 Correct 2 ms 2640 KB Output is correct
16 Correct 2 ms 2768 KB Output is correct
17 Correct 2 ms 2640 KB Output is correct
18 Correct 2 ms 2768 KB Output is correct
19 Correct 2 ms 2768 KB Output is correct
20 Correct 2 ms 2640 KB Output is correct
21 Correct 2 ms 2640 KB Output is correct
22 Correct 2 ms 2768 KB Output is correct
23 Correct 2 ms 2768 KB Output is correct
24 Correct 2 ms 2768 KB Output is correct
25 Correct 2 ms 2640 KB Output is correct
26 Correct 3 ms 2768 KB Output is correct
27 Correct 2 ms 2768 KB Output is correct
28 Correct 2 ms 2772 KB Output is correct
29 Correct 2 ms 2640 KB Output is correct
30 Correct 2 ms 2640 KB Output is correct
31 Correct 2 ms 2652 KB Output is correct
32 Correct 2 ms 2768 KB Output is correct
33 Correct 3 ms 2768 KB Output is correct
34 Correct 2 ms 2768 KB Output is correct
35 Correct 2 ms 2768 KB Output is correct
36 Correct 26 ms 5284 KB Output is correct
37 Correct 39 ms 7112 KB Output is correct
38 Correct 39 ms 7132 KB Output is correct
39 Correct 37 ms 7148 KB Output is correct
40 Correct 37 ms 7232 KB Output is correct
41 Correct 36 ms 7132 KB Output is correct
42 Correct 36 ms 7116 KB Output is correct
43 Correct 27 ms 7620 KB Output is correct
44 Correct 30 ms 7508 KB Output is correct
45 Correct 42 ms 7364 KB Output is correct
46 Correct 33 ms 7380 KB Output is correct
47 Correct 38 ms 7104 KB Output is correct
48 Correct 36 ms 7120 KB Output is correct
49 Correct 36 ms 7128 KB Output is correct
50 Correct 28 ms 7512 KB Output is correct
51 Correct 30 ms 7492 KB Output is correct
52 Correct 38 ms 7108 KB Output is correct
53 Correct 37 ms 7116 KB Output is correct
54 Correct 44 ms 7104 KB Output is correct
55 Correct 36 ms 7512 KB Output is correct
56 Correct 34 ms 7380 KB Output is correct
57 Correct 38 ms 7048 KB Output is correct
58 Correct 39 ms 7144 KB Output is correct
59 Correct 39 ms 7124 KB Output is correct
60 Correct 36 ms 7104 KB Output is correct
61 Correct 35 ms 7104 KB Output is correct
62 Correct 37 ms 7104 KB Output is correct
63 Correct 42 ms 7136 KB Output is correct
64 Correct 35 ms 7528 KB Output is correct
65 Correct 33 ms 7636 KB Output is correct
66 Correct 34 ms 7372 KB Output is correct
67 Correct 34 ms 7492 KB Output is correct

Subtask #4
0 / 14.0

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

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 457 ms 3920 KB Output is correct
2 Correct 2924 ms 7104 KB Output is correct
3 Correct 2914 ms 7120 KB Output is correct
4 Correct 3777 ms 7076 KB Output is correct
5 Correct 3970 ms 7116 KB Output is correct
6 Correct 3855 ms 7184 KB Output is correct
7 Correct 3874 ms 7104 KB Output is correct
8 Execution timed out 4010 ms 7532 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2640 KB Output is correct
2 Correct 3 ms 2768 KB Output is correct
3 Correct 2 ms 2768 KB Output is correct
4 Correct 2 ms 2768 KB Output is correct
5 Correct 2 ms 2768 KB Output is correct
6 Correct 2 ms 2768 KB Output is correct
7 Correct 2 ms 2640 KB Output is correct
8 Correct 2 ms 2768 KB Output is correct
9 Correct 2 ms 2768 KB Output is correct
10 Correct 2 ms 2768 KB Output is correct
11 Correct 2 ms 2768 KB Output is correct
12 Correct 1 ms 2640 KB Output is correct
13 Correct 2 ms 2664 KB Output is correct
14 Correct 2 ms 2768 KB Output is correct
15 Correct 2 ms 2640 KB Output is correct
16 Correct 2 ms 2768 KB Output is correct
17 Correct 2 ms 2640 KB Output is correct
18 Correct 2 ms 2768 KB Output is correct
19 Correct 2 ms 2768 KB Output is correct
20 Correct 2 ms 2640 KB Output is correct
21 Correct 2 ms 2640 KB Output is correct
22 Correct 2 ms 2768 KB Output is correct
23 Correct 2 ms 2768 KB Output is correct
24 Correct 2 ms 2768 KB Output is correct
25 Correct 2 ms 2640 KB Output is correct
26 Correct 3 ms 2768 KB Output is correct
27 Correct 2 ms 2768 KB Output is correct
28 Correct 2 ms 2772 KB Output is correct
29 Correct 2 ms 2640 KB Output is correct
30 Correct 2 ms 2640 KB Output is correct
31 Correct 2 ms 2652 KB Output is correct
32 Correct 2 ms 2768 KB Output is correct
33 Correct 3 ms 2768 KB Output is correct
34 Correct 2 ms 2768 KB Output is correct
35 Correct 2 ms 2768 KB Output is correct
36 Correct 26 ms 5284 KB Output is correct
37 Correct 39 ms 7112 KB Output is correct
38 Correct 39 ms 7132 KB Output is correct
39 Correct 37 ms 7148 KB Output is correct
40 Correct 37 ms 7232 KB Output is correct
41 Correct 36 ms 7132 KB Output is correct
42 Correct 36 ms 7116 KB Output is correct
43 Correct 27 ms 7620 KB Output is correct
44 Correct 30 ms 7508 KB Output is correct
45 Correct 42 ms 7364 KB Output is correct
46 Correct 33 ms 7380 KB Output is correct
47 Correct 38 ms 7104 KB Output is correct
48 Correct 36 ms 7120 KB Output is correct
49 Correct 36 ms 7128 KB Output is correct
50 Correct 28 ms 7512 KB Output is correct
51 Correct 30 ms 7492 KB Output is correct
52 Correct 38 ms 7108 KB Output is correct
53 Correct 37 ms 7116 KB Output is correct
54 Correct 44 ms 7104 KB Output is correct
55 Correct 36 ms 7512 KB Output is correct
56 Correct 34 ms 7380 KB Output is correct
57 Correct 38 ms 7048 KB Output is correct
58 Correct 39 ms 7144 KB Output is correct
59 Correct 39 ms 7124 KB Output is correct
60 Correct 36 ms 7104 KB Output is correct
61 Correct 35 ms 7104 KB Output is correct
62 Correct 37 ms 7104 KB Output is correct
63 Correct 42 ms 7136 KB Output is correct
64 Correct 35 ms 7528 KB Output is correct
65 Correct 33 ms 7636 KB Output is correct
66 Correct 34 ms 7372 KB Output is correct
67 Correct 34 ms 7492 KB Output is correct
68 Execution timed out 4045 ms 7084 KB Time limit exceeded
69 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3947 ms 5328 KB Output is correct
2 Execution timed out 4011 ms 7492 KB Time limit exceeded
3 Halted 0 ms 0 KB -