Submission #1332508

#TimeUsernameProblemLanguageResultExecution timeMemory
1332508opeleklanos송신탑 (IOI22_towers)C++20
4 / 100
271 ms1564 KiB
#include <iostream>
#include <vector>
using namespace std;

int k = 0;

vector<int> h;
int n;

void init (int n1, vector<int> h1){
    n = n1;
    h = h1;
    for(int i = 1; i<n; i++){
        if(h[i] > h[i-1]) k = i;
    }
}

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