Submission #626880

#TimeUsernameProblemLanguageResultExecution timeMemory
626880kkkkkkkkRadio Towers (IOI22_towers)C++17
0 / 100
509 ms1456 KiB
#include "towers.h"
#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;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...