| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1293181 | aren_dance | 장애물 (IOI25_obstacles) | C++20 | 66 ms | 7368 KiB |
#include <bits/stdc++.h>
using namespace std;
const int N=3e5+1;
int nxt[N];
void initialize(std::vector<int> t, std::vector<int> h) {
int m=h.size();
for(int i=0; i<m; ++i) {
nxt[i]=m+1;
}
for(int i=0; i<m; ++i) {
if(t[0]>h[i]) {
if(i!=0) {
nxt[i]=min(i,nxt[i-1]);
}
else{
nxt[i]=i;
}
}
}
}
bool can_reach(int l, int r, int s, int d) {
if(s>d){
swap(s,d);
}
if(nxt[d]<=s) {
return 1;
}
return 0;
}| # | 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... | ||||
