제출 #771426

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
771426		PurpleCrayon	송신탑 (IOI22_towers)	C++17	0 / 100	4098 ms	7128 KiB

towers

#include "towers.h"
#include <bits/stdc++.h>
using namespace std;

#define sz(v) int(v.size())
#define ar array
typedef long long ll;
const int N = 1e5+10, MOD = 1e9+7;
const ll INF = 1e18+10;

int n, a[N];

void init(int _n, vector<int> H) {
    n = _n;
    for (int i = 0; i < n; i++) {
        a[i] = H[i];
    }
}

int max_towers(int l, int r, int d) {
    vector<int> a(r - l + 1);
    for (int i = 0; i < sz(a); i++) a[i] = ::a[i + l];
    n = sz(a);

    set<int> use;
    vector<int> p(n); iota(p.begin(), p.end(), 0);
    sort(p.begin(), p.end(), [&](int x, int y) { return a[x] > a[y]; });
    vector<int> one(n, -1), two(n, -1);
    for (int x : p) {
        auto it = use.lower_bound(x);
        if (it != use.end() && a[*it] - a[x] < d) continue;
        if (it != use.end()) one[x] = *it;

        if (it != use.begin() && a[*prev(it)] - a[x] < d) continue;
        if (it != use.begin()) two[x] = *prev(it);
        use.insert(x);
    }

    int ans = 0;
    for (int x : use) {
        auto it = use.find(x);
        int c1 = (next(it) == use.end() ? -1 : *next(it));
        int c2 = (it == use.begin() ? -1 : *prev(it));
        if (c1 == one[x] && c2 == two[x]) {
            ans++;
        }
    }

    return ans;
}

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