제출 #832449

#제출 시각아이디문제언어결과실행 시간메모리
832449fatemetmhr송신탑 (IOI22_towers)C++17
4 / 100
778 ms1468 KiB
// komak!

#include "towers.h"
#include <bits/stdc++.h>

using namespace std;

#define debug(x) cerr << "(" << (#x) << "): " << (x) << endl;
#define all(x)   x.begin(), x.end()
#define fi       first
#define se       second
#define mp       make_pair
#define pb       push_back

typedef long long ll;

const ll mod   = 1e9 + 7;
const int maxn5 = 1e5 + 10;

int mxid, h[maxn5];

void init(int n, std::vector<int> H) {

    mxid = 0;
    for(int i = 0; i < n; i++){
        h[i] = H[i];
        if(h[i] > h[mxid])
            mxid = i;
    }

}

int max_towers(int l, int r, int d) {

    return (l < mxid && r > mxid && h[l] + d <= h[mxid] && h[r] + d <= h[mxid]) + 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...