Submission #1320055

#	Time	Username	Problem	Language	Result	Execution time	Memory
1320055		BigBadBully	송신탑 (IOI22_towers)	C++20	14 / 100	276 ms	2324 KiB

towers

#include "towers.h"

#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> v,pref;

bool check(int i)
{
    return ((i==0 || v[i] < v[i-1])&&(i==n-1 || v[i] < v[i+1]));
}

vector<int> raz;

void init(int N, std::vector<int> H) {
    v = H;
    n = N;
    pref.resize(n,0);
    for(int i = 0; i < n; i++)
        pref[i] = (i>0?pref[i-1]:0)+check(i);
    int prev = 0;
    for(;!check(prev);prev++);
    for(int i = prev+1,run = 0; i < n; i++)
    {
        if(check(i))
        {
            raz.push_back(run-max(v[i],v[prev]));
            prev = i;
            run = 0;
        }
        else
            run = max(v[i],run);
    }
}

int max_towers(int l, int r, int d) {
    if(l==r)return 1;
    if(d==1)
        return pref[r]-(l>0?pref[l-1]:0) - check(l)- check(r)+(v[l] < v[l+1])+(v[r]<v[r-1]);
    if(r-l==n-1)
    {
        return raz.end()-upper_bound(raz.begin(),raz.end(),d)+1;
    }
    return 41;
}

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