Submission #771411

#TimeUsernameProblemLanguageResultExecution timeMemory
771411PurpleCrayonRadio Towers (IOI22_towers)C++17
0 / 100
361 ms1892 KiB
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;

#define sz(v) int(v.size())
#define ar array
typedef long long ll;
const int N = 1e5+10, MOD = 1e9+7;
const ll INF = 1e18+10;

int n, a[N];
int ps[N];

void init(int _n, vector<int> H) {
    n = _n;
    for (int i = 0; i < n; i++) {
        a[i] = H[i];
    }

    for (int i = 1; i < n-1; i++) {
        if (a[i-1] > a[i] && a[i] < a[i-1]) {
            ps[i] = 1;
        }
    }

    for (int i = 1; i < n; i++) ps[i] += ps[i-1];
}

int max_towers(int l, int r, int d) {
    assert(d == 1);
    if (r - l + 1 <= 2) return 1;
    return ps[r-1] - ps[l] + (a[l] < a[l+1]) + (a[r] < a[r-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...