Submission #762287

#TimeUsernameProblemLanguageResultExecution timeMemory
762287raysh07송신탑 (IOI22_towers)C++17
0 / 100
499 ms1056 KiB
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;

int k;

void init(int N, vector<int> H) {
    k = -1;
    for (int i = 0; i < N; i++){
        bool good = true;
        if (i != 0) good &= H[i] > H[i - 1];
        if (i != N - 1) good &= H[i] > H[i + 1];
        
        if (good) k = i;
    }
    assert(k != -1);
}

int max_towers(int L, int R, int D) {
    if (L < k && R > k) 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...