| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1305907 | alosza | 장애물 (IOI25_obstacles) | C++20 | 61 ms | 6332 KiB |
#include <bits/stdc++.h>
using namespace std;
vector<int> t, h;
void initialize(vector<int> T, vector<int> H)
{
t = T;
h = H;
for(int i = 0; i < H.size(); i++) cout << H[i] << "_";
}
bool can_reach(int L, int R, int S, int D)
{
for(int i = S; i <= D; i++)
{
if(t[0] <= h[i]) return false;
}
return true;
}| # | 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... | ||||
