제출 #1178268

#제출 시각아이디문제언어결과실행 시간메모리
1178268PagodePaivaRadio Towers (IOI22_towers)C++20
0 / 100
194 ms1572 KiB
#include<bits/stdc++.h>
#include "towers.h"
#include <vector>
#define fr first
#define sc second

using namespace std;

const int N = 100010;
int v[N];
int n;
int big;

void init(int mm, std::vector<int> h) {
    n = mm;
    for(int i = 1;i <= n;i++)
        v[i] = h[i-1];
    big = 1;
    for(int i = 1;i <= n;i++){
        if(v[i] > v[big]) big = i;
    }
}

int max_towers(int L, int R, int D) {
    if(R <= big) return 1;
    if(L >= big) return 1;
    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...