oj.uz

답안 #787181

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
787181 2023-07-18T22:43:45 Z MilosMilutinovic 송신탑 (IOI22_towers) C++17
17 / 100
 896 ms 34508 KB 
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int L = 22;
int n, a[N], pl[N], pr[N], ord[N];
bool cmp(int i, int j) { return a[i] < a[j]; }
int mx[N][L], logs[N];
int qmx(int l, int r) {
    if (l > r) return (int) -1e9;
    int k = logs[r - l + 1];
    return max(mx[l][k], mx[r - (1 << k) + 1][k]);
}
void buildST() {
    for (int i = 1; i <= n; i++) mx[i][0] = a[i];
    for (int i = 2; i <= n; i++) logs[i] = logs[i >> 1] + 1;
    for (int j = 1; j < L; j++)
        for (int i = 1; i + (1 << j) <= n + 1; i++)
            mx[i][j] = max(mx[i][j - 1], mx[i + (1 << (j - 1))][j - 1]);
}
const int M = N * L;
int tsz, ls[M], rs[M], sum[M];
void modify(int& v, int p, int tl, int tr, int i, int x) {
    v = ++tsz;
    ls[v] = ls[p];
    rs[v] = rs[p];
    sum[v] = sum[p] + x;
    if (tl == tr) {
        return;
    }
    int mid = tl + tr >> 1;
    if (i <= mid) {
        modify(ls[v], ls[p], tl, mid, i, x);
    } else {
        modify(rs[v], rs[p], mid + 1, tr, i, x);
    }
}
int query(int v, int tl, int tr, int ql, int qr) {
    if (tl > tr || tl > qr || tr < ql) {
        return 0;
    }
    if (ql <= tl && tr <= qr) {
        return sum[v];
    }
    int mid = tl + tr >> 1;
    return query(ls[v], tl, mid, ql, qr) + query(rs[v], mid + 1, tr, ql, qr);
}
int find_first(int v, int tl, int tr, int p) {
    if (tr < p || !sum[v]) {
        return n + 1;
    }
    if (tl == tr) {
        return sum[v] > 0 ? tl : n + 1;
    }
    int mid = tl + tr >> 1;
    int ans_l = find_first(ls[v], tl, mid, p);
    if (ans_l == n + 1)
        return find_first(rs[v], mid + 1, tr, p);
    else
        return ans_l;
}
int find_last(int v, int tl, int tr, int p) {
    if (tl > p || !sum[v]) {
        return 0;
    }
    if (tl == tr) {
        return sum[v] > 0 ? tl : 0;
    }
    int mid = tl + tr >> 1;
    int ans_r = find_last(ls[v], mid + 1, tr, p);
    if (ans_r == 0)
        return find_last(ls[v], tl, mid, p);
    else
        return ans_r;
}
vector<pair<int, int>> qs;
vector<int> roots;
void init(int N, vector<int> H) {
    n = N;
    for (int i = 1; i <= n; i++) {
        a[i] = H[i - 1];
    }
    vector <int> stk;
    for (int i = 1; i <= n; i++) {
        while (!stk.empty() && a[stk.back()] > a[i]) stk.pop_back();
        pl[i] = (stk.empty() ? -1 : stk.back());
        stk.push_back(i);
    }
    stk.clear();
    for (int i = n; i >= 1; i--) {
        while (!stk.empty() && a[stk.back()] > a[i]) stk.pop_back();
        pr[i] = (stk.empty() ? -1 : stk.back());
        stk.push_back(i);
    }
    buildST();
    for (int i = 1; i <= n; i++) ord[i] = i;
    sort(ord + 1, ord + n + 1, cmp);
    for (int _i = 2; _i <= n; _i++) {
        int i = ord[_i];
        int D = 1.001e9;
        if (pl[i] != -1) D = min(D, qmx(pl[i] + 1, i) - a[i]);
        if (pr[i] != -1) D = min(D, qmx(i, pr[i] - 1) - a[i]);
        qs.emplace_back(D, i);
    }
    sort(qs.begin(), qs.end());
    roots.push_back(0);
    modify(roots.back(), roots.back(), 1, n, ord[1], 1);
    int sz = (int) qs.size();
    for (int i = sz - 1; i >= 0; i--) {
        int prv = (int) roots.back();
        roots.push_back(0);
        modify(roots.back(), prv, 1, n, qs[i].second, 1);
    }
    reverse(roots.begin(), roots.end());
}
int get_pos(int d) {
    int low = 0, high = (int) qs.size() - 1, res = high + 1;
    while (low <= high) {
        int mid = low + high >> 1;
        if (qs[mid].first >= d) {
            res = mid;
            high = mid - 1;
        } else {
            low = mid + 1;
        }
    }
    return res;
}
int max_towers(int L, int R, int D) {
    if (L == R) {
        return 1;
    }
    ++L; ++R;
    int p = get_pos(D);
    int ans = query(roots[p], 1, n, L, R);
    return ans;
}

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

Compilation message

towers.cpp: In function 'void modify(int&, int, int, int, int, int)':
towers.cpp:31:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   31 |     int mid = tl + tr >> 1;
      |               ~~~^~~~
towers.cpp: In function 'int query(int, int, int, int, int)':
towers.cpp:45:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   45 |     int mid = tl + tr >> 1;
      |               ~~~^~~~
towers.cpp: In function 'int find_first(int, int, int, int)':
towers.cpp:55:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   55 |     int mid = tl + tr >> 1;
      |               ~~~^~~~
towers.cpp: In function 'int find_last(int, int, int, int)':
towers.cpp:69:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   69 |     int mid = tl + tr >> 1;
      |               ~~~^~~~
towers.cpp: In function 'int get_pos(int)':
towers.cpp:119:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  119 |         int mid = low + high >> 1;
      |                   ~~~~^~~~~~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 400 ms 20012 KB 1st lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 848 KB Output is correct
3 Correct 1 ms 848 KB Output is correct
4 Correct 1 ms 848 KB Output is correct
5 Correct 1 ms 848 KB Output is correct
6 Correct 1 ms 848 KB Output is correct
7 Incorrect 1 ms 848 KB 1st lines differ - on the 1st token, expected: '34', found: '33'
8 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 848 KB Output is correct
3 Correct 1 ms 848 KB Output is correct
4 Correct 1 ms 848 KB Output is correct
5 Correct 1 ms 848 KB Output is correct
6 Correct 1 ms 848 KB Output is correct
7 Incorrect 1 ms 848 KB 1st lines differ - on the 1st token, expected: '34', found: '33'
8 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 675 ms 33832 KB 1st lines differ - on the 1st token, expected: '11903', found: '11902'
2 Halted 0 ms 0 KB -

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 7840 KB Output is correct
2 Correct 562 ms 34040 KB Output is correct
3 Correct 778 ms 34044 KB Output is correct
4 Correct 896 ms 34096 KB Output is correct
5 Correct 742 ms 34080 KB Output is correct
6 Correct 848 ms 34024 KB Output is correct
7 Correct 757 ms 34092 KB Output is correct
8 Correct 704 ms 34448 KB Output is correct
9 Correct 716 ms 34460 KB Output is correct
10 Correct 599 ms 34296 KB Output is correct
11 Correct 541 ms 34384 KB Output is correct
12 Correct 57 ms 34076 KB Output is correct
13 Correct 58 ms 34084 KB Output is correct
14 Correct 55 ms 34092 KB Output is correct
15 Correct 36 ms 34508 KB Output is correct
16 Correct 50 ms 34208 KB Output is correct
17 Correct 61 ms 32900 KB Output is correct
18 Correct 61 ms 34108 KB Output is correct
19 Correct 56 ms 34108 KB Output is correct
20 Correct 63 ms 34000 KB Output is correct
21 Correct 60 ms 34040 KB Output is correct
22 Correct 55 ms 34004 KB Output is correct
23 Correct 56 ms 34076 KB Output is correct
24 Correct 38 ms 34496 KB Output is correct
25 Correct 39 ms 34460 KB Output is correct
26 Correct 45 ms 34340 KB Output is correct
27 Correct 39 ms 34472 KB Output is correct
28 Correct 1 ms 860 KB Output is correct
29 Correct 1 ms 848 KB Output is correct
30 Correct 1 ms 848 KB Output is correct
31 Correct 1 ms 848 KB Output is correct
32 Correct 1 ms 848 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 848 KB Output is correct
35 Correct 1 ms 848 KB Output is correct
36 Correct 1 ms 848 KB Output is correct
37 Correct 1 ms 848 KB Output is correct
38 Correct 1 ms 848 KB Output is correct
39 Correct 1 ms 848 KB Output is correct
40 Correct 1 ms 848 KB Output is correct
41 Correct 1 ms 848 KB Output is correct
42 Correct 1 ms 848 KB Output is correct
43 Correct 1 ms 848 KB Output is correct

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 848 KB Output is correct
3 Correct 1 ms 848 KB Output is correct
4 Correct 1 ms 848 KB Output is correct
5 Correct 1 ms 848 KB Output is correct
6 Correct 1 ms 848 KB Output is correct
7 Incorrect 1 ms 848 KB 1st lines differ - on the 1st token, expected: '34', found: '33'
8 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 400 ms 20012 KB 1st lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -