oj.uz

Submission #755568

# Submission time Handle Problem Language Result Execution time Memory
755568 2023-06-10T11:09:11 Z MilosMilutinovic Radio Towers (IOI22_towers) C++17
0 / 100
 694 ms 19608 KB 
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;

vector<vector<int>> vec;

namespace sparse {
    int n;
    vector<int> logs;
    vector<vector<int>> st;
    void build(vector<int> h) {
        n = (int) h.size();
        logs.resize(n + 1);
        st.resize(n);
        for (int i = 0; i < n; i++) {
            st[i].resize(20);
            st[i][0] = h[i];
        }
        for (int j = 1; j < 20; j++)
            for (int i = 0; i + (1 << j) <= n; i++)
                st[i][j] = max(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);
        for (int i = 2; i <= n; i++) logs[i] = logs[i >> 1] + 1;
    }
    int query(int l, int r) {
        int k = logs[r - l + 1];
        return max(st[l][k], st[r - (1 << k) + 1][k]);
    }
};

void init(int n, vector<int> h) {
    vector<int> l_id(n), r_id(n);
    vector<int> stk;
    for (int i = 0; i < n; i++) {
        while (!stk.empty() && h[i] < h[stk.back()]) {
            stk.pop_back();
        }
        l_id[i] = (stk.empty() ? -1 : stk.back());
        stk.push_back(i);
    }
    stk.clear();
    for (int i = n - 1; i >= 0; i--) {
        while (!stk.empty() && h[i] < h[stk.back()]) {
            stk.pop_back();
        }
        r_id[i] = (stk.empty() ? -1 : stk.back());
        stk.push_back(i);
    }
    sparse::build(h);
    vector<int> order(n);
    iota(order.begin(), order.end(), 0);
    sort(order.begin(), order.end(), [&](int i, int j) { return h[i] < h[j]; });
    for (int _i = 1; _i < n; _i++) {
        int i = order[_i];
        int d = -1;
        if (l_id[i] != -1 && l_id[i] != i - 1)
            d = max(d, sparse::query(l_id[i], i) - h[i]);
        if (r_id[i] != -1 && r_id[i] != i + 1)
            d = max(d, sparse::query(i, r_id[i]) - h[i]);
//        assert(d != 0);
//        printf("%d %d\n", i + 1, d);
        vec.push_back({d, i, l_id[i], r_id[i]});
    }
    sort(vec.begin(), vec.end());
}

int find_first(int x) {
    int l = 0, r = vec.size() - 1, p = vec.size();
    while (l <= r) {
        int mid = l + r >> 1;
        if (vec[mid][0] >= x)
            r = mid - 1, p = mid;
        else
            l = mid + 1;
    }
    return vec.size() - p;
}

int max_towers(int l, int r, int d) {
    return max(1, find_first(d));
}


/*
7 1
10 20 60 40 50 30 70
0 6 17
*/

Compilation message

towers.cpp: In function 'int find_first(int)':
towers.cpp:69:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   69 |         int mid = l + r >> 1;
      |                   ~~^~~

Subtask #1
0 / 4.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 694 ms 19608 KB 1st lines differ - on the 1st token, expected: '11903', found: '66296'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 286 ms 4992 KB 1st lines differ - on the 1st token, expected: '7197', found: '14187'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

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

Subtask #7
0 / 23.0

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