| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1332503 | opeleklanos | 송신탑 (IOI22_towers) | C++20 | 222 ms | 1560 KiB |
#include <iostream>
#include <vector>
using namespace std;
int k = 0;
vector<int> h;
int n;
void init (int n1, vector<int> h1){
for(int i = 1; i<n; i++){
if(h[i] > h[i-1]) k = i;
}
h = h1;
n = n1;
}
int max_towers(int l, int r, int d){
if(l+1 == r || k<=l || k>=r) return 1;
if(h[l] + d <= h[r]) return 2;
return 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... | ||||
