Submission #1173006

#TimeUsernameProblemLanguageResultExecution timeMemory
1173006SpyrosAlivRadio Towers (IOI22_towers)C++20
0 / 100
255 ms1688 KiB
#include <bits/stdc++.h>
using namespace std;

int n;
vector<int> a;
int mxPos = 0, mx = 0;

void init(int N, vector<int> A) {
    n = N;
    a.push_back(0);
    for (int i = 0; i < n; i++) a.push_back(A[i]);
    for (int i = 1; i <= n; i++) {
        if (a[i] > mx) {
            mx = a[i];
            mxPos = i;
        }
    }
}

int max_towers(int l, int r, int d) {
    if (l >= mxPos || r <= mxPos) return 1;
    int upp = max(a[l], a[r]) + d;
    if (upp > mx) return 1;
    else return 2;
}
#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...