| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1258323 | medmdg | 장애물 (IOI25_obstacles) | C++20 | 69 ms | 7496 KiB |
#include "obstacles.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> c;
void initialize(vector<int> T, vector<int> H) {
c.clear();
c.resize(H.size());
for(int i=0;i<H.size();i++){
if(H[i]>=T.back())c[i]=1;
}
for(int i=1;i<H.size();i++)c[i]+=c[i-1];
}
bool can_reach(int L, int R, int S, int D) {
return c[D]==c[S];
}
| # | 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... | ||||
