| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1234560 | Ghulam_Junaid | 송신탑 (IOI22_towers) | C++20 | 4061 ms | 1568 KiB |
#include <bits/stdc++.h>
#include "towers.h"
using namespace std;
int k;
vector<int> h;
void init(int n, vector<int> H) {
h = H;
}
int max_towers(int L, int R, int D) {
int ans = 1;
int last = L;
int mx = 0;
for (int i = L + 1; i <= R; i ++){
mx = max(mx, h[i]);
if (h[last] + D <= mx and h[i] + D <= mx){
last = i;
mx = 0;
ans++;
continue;
}
if (h[last] > h[i]){
last = i;
mx = 0;
}
}
return ans;
}| # | 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... | ||||
