| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1342533 | thesentro | 송신탑 (IOI22_towers) | C++20 | 272 ms | 2196 KiB |
#include "towers.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
#define ll long long
ll idx = -1;
vector<ll>v;
void init(int N, std::vector<int> H)
{
for (auto i:H) v.push_back(i);
for (int i=1 ; i<N-1 ; i++)
{
if (H[i]>H[i-1] and H[i+1]<H[i])
idx = i;
}
}
int max_towers(int L, int R, int D)
{
if (idx==-1) return 1;
if (idx>L and idx<R and v[idx]-v[L]>=D and v[idx]-v[R]>=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... | ||||
