Submission #1215677

#TimeUsernameProblemLanguageResultExecution timeMemory
1215677Nelt송신탑 (IOI22_towers)C++20
4 / 100
254 ms1832 KiB
#include "towers.h"
#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;
const ll N = 1e5 + 5, inf = 2e18, lg = 17;
ll a[N], n, lef[N], rig[N], up[lg][N];
ll suf[N];
ll mn[N], mn1[N];
ll ind = 1;
void init(int N, vector<int> H)
{
    n = N;
    for (ll i = 1; i <= n; i++)
        a[i] = H[i - 1];
    for (ll i = 1; i < n; i++) if (a[i] < a[i + 1]) ind = i + 1;
}

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