| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1322767 | kargneq | 장애물 (IOI25_obstacles) | C++20 | 2094 ms | 5896 KiB |
#include "obstacles.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> He;
int t;
void initialize(std::vector<int> T, std::vector<int> H) {
t = T[0];
He = H;
}
bool can_reach(int L, int R, int S, int D) {
if (S > D) {
while (S > D) {
S--;
if (t <= He[S]) return false;
}
if (S == D) return true;
} else if (S < D) {
while (S < D) {
S++;
if (t <= He[S]) return false;
}
if (S == D) return true;
} else return true;
}
컴파일 시 표준 에러 (stderr) 메시지
| # | 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... | ||||
