제출 #732027

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
732027		alextodoran	송신탑 (IOI22_towers)	C++17	23 / 100	4088 ms	19072 KiB

towers

/**
 _  _   __  _ _ _  _  _ _
 |a  ||t  ||o    d | |o  |
| __    _| | _ | __|  _ |
| __ |/_  | __  /__\ / _\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N_MAX = 100000;
const int E_MAX = 17;

int N;
int H[N_MAX];

int rmx[N_MAX][E_MAX];
int rmn[N_MAX][E_MAX];

int fmx (int i, int j) {
    return (H[i] > H[j] ? i : j);
}
int fmn (int i, int j) {
    return (H[i] < H[j] ? i : j);
}

void init (int _N, vector <int> _H) {
    N = _N;
    for (int i = 0; i < N; i++) {
        H[i] = _H[i];
        rmx[i][0] = rmn[i][0] = i;
    }
    for (int e = 1; e < E_MAX; e++) {
        for (int i = 0; i + (1 << e) - 1 < N; i++) {
            rmx[i][e] = fmx(rmx[i][e - 1], rmx[i + (1 << (e - 1))][e - 1]);
            rmn[i][e] = fmn(rmn[i][e - 1], rmn[i + (1 << (e - 1))][e - 1]);
        }
    }
}

int getmx (int l, int r) {
    int e = 31 - __builtin_clz(r - l + 1);
    return fmx(rmx[l][e], rmx[r - (1 << e) + 1][e]);
}
int getmn (int l, int r) {
    int e = 31 - __builtin_clz(r - l + 1);
    return fmn(rmn[l][e], rmn[r - (1 << e) + 1][e]);
}

int max_towers (int L, int R, int D) {
    if (L > R) {
        return 0;
    }
    if (L == R) {
        return 1;
    }
    int K = getmx(L, R);
    int mxtL = max_towers(L, K - 1, D);
    int mxtR = max_towers(K + 1, R, D);
    return (H[getmn(L, K)] <= H[K] - D && H[getmn(K, R)] <= H[K] - D ? mxtL + mxtR : max(mxtL, mxtR));
}

• Subtask 1: 0 / 4
• Subtask 2: 11 / 11
• Subtask 3: 12 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 17
• Subtask 6: 0 / 19
• Subtask 7: 0 / 23