| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1296595 | gabo | 장애물 (IOI25_obstacles) | C++20 | 2091 ms | 5916 KiB |
#include "obstacles.h"
#include <bits/stdc++.h>
using namespace std;
int N,M;
vector<int> T_gl, H_gl;
void initialize(std::vector<int> T, std::vector<int> H) {
T_gl = T;
H_gl = H;
N = (int)T.size();
M = (int)H.size();
}
bool can_reach(int L, int R, int S, int D) {
if (N==1) {
int temp=T_gl[0];
vector<int> can(M,0);
for (int i=0;i<M;i++) {
if (temp>H_gl[i]) {
can[i]=1;
}
}
if (D>=S) {
for (int i=S;i<=D;i++) {
if (!can[i]) {
return false;
}
}
return true;
}else {
for (int i=D;i<=S;i++) {
if (!can[i]) {
return false;
}
}
return true;
}
}
return false;
}
| # | 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... | ||||
