Submission #827934

#TimeUsernameProblemLanguageResultExecution timeMemory
827934Seb송신탑 (IOI22_towers)C++17
4 / 100
685 ms1872 KiB
#include "towers.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

#define f first
#define s second

ll k,h[100005];

void init(int N, std::vector<int> H) {
    for (int i=0;i<N;i++) {
        h[i] = H[i];
        if (i>0 && i<N-1 && H[i] > H[i-1] && H[i] > H[i+1]) k = i;
    }
    return;
}

int max_towers(int L, int R, int D) {
if (L > k || k > R) return 1;
if (h[L] <= h[k]-D && h[R] <= h[k]-D) return 2;
else 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...