| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1190289 | Amr | Radio Towers (IOI22_towers) | C++20 | 257 ms | 1564 KiB |
#include "towers.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll k;
vector<int> a;
void init(int N, std::vector<int> H) {
k = N;
a = H;
for(int i = 0; i < N-1; i++) if(a[i]>a[i+1]) {k = i; break;}
}
int max_towers(int L, int R, int D) {
if(L<k&&R>k&&max(a[L],a[R])<=a[k]-D) 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... | ||||
