This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// 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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |