| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1067252 | n1k | 송신탑 (IOI22_towers) | C++17 | 4078 ms | 3800 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> h;
void init(int N, std::vector<int> H) {
n = N;
h = H;
}
int find(int l, int r, int d, long long minh){
//cerr<<l<<" "<<r<<endl;
if(l>r) return 0;
array<int, 2> mx = {0};
for(int i=l; i<=r; i++){
mx = max(mx, {h[i], i});
}
return max({int(mx[0]+d<=minh), find(l, mx[1]-1, d, mx[0]) + find(mx[1] + 1, r, d, mx[0])});
}
int max_towers(int L, int R, int D) {
return find(L, R, D, 1e18);
}| # | 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... | ||||
