Submission #1369274

#TimeUsernameProblemLanguageResultExecution timeMemory
1369274leolin0214Radio Towers (IOI22_towers)C++20
0 / 100
140 ms1816 KiB
#include "towers.h"

#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>

#define ff first
#define ss second
#define pii pair<int, int>

using namespace std;

int n = 0;
int k = 0;
vector<int> h;

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

int max_towers(int L, int R, int D) {
    int lim = n-D;
    return (L < k && k < R && max(h[R], h[L]) <= lim) ? 2 : 1;
}   
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...