| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1258320 | medmdg | Obstacles for a Llama (IOI25_obstacles) | C++20 | 139 ms | 14408 KiB |
#include "obstacles.h"
#include<bits/stdc++.h>
using namespace std;
set<int> cut;
void initialize(vector<int> T, vector<int> H) {
for(int i=0;i<H.size();i++){
if(H[i]>=T.back())cut.insert(i);
}
}
bool can_reach(int L, int R, int S, int D) {
set<int>::iterator t;
t=cut.lower_bound(S);
if(t==cut.end())return true;
return (*t)>D;
}
| # | 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... | ||||
