Submission #626879

#	Time	Username	Problem	Language	Result	Execution time	Memory
626879		kkkkkkkk	송신탑 (IOI22_towers)	C++17	0 / 100	701 ms	1440 KiB

towers

#include <bits/stdc++.h>

using namespace std;

vector<int> visini;
int N,k=0;

void init(int n,vector<int> H)
{
    N=n;
    visini=H;
    k=0;
    for (int i=1;i<N;i++)
        if (visini[i]<visini[i-1])
            k=i;
}

int max_towers(int l,int r,int d)
{
    if (l<=k&&k<=r&&visini[k]-d>=visini[l]&&visini[k]-d>=visini[r])
        return 2;
    return 1;
}

• 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