Submission #689638

#	Time	Username	Problem	Language	Result	Execution time	Memory
689638		lohacho	송신탑 (IOI22_towers)	C++17	11 / 100	4042 ms	8184 KiB

towers

#include "towers.h"

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

int n;
vector<int> a;

void init(int N, std::vector<int> H) {
    n = N;
    a = H;
}

int max_towers(int L, int R, int D) {
    vector<vector<int>> srt;
    for(int i = L; i <= R; ++i){
        srt.push_back({a[i], i});
    }

    sort(srt.begin(), srt.end());

    vector<int> chk(n);
    for(int i = 0; i < (int)srt.size(); ++i){
        int now = srt[i][1];

        if(now < L || now > R){
            continue;
        }

        int r = now + 1, can = 1;
        while(r <= R && a[r] < a[now] + D){
            if(chk[r]){
                can = 0;

                break;
            }
            ++r;
        }

        int l = now - 1;
        while(l >= L && a[l] < a[now] + D){
            if(chk[l]){
                can = 0;

                break;
            }
            --l;
        }

        chk[now] = can;
    }

    return accumulate(chk.begin(), chk.end(), 0ll);
}

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