| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1301361 | tamir1 | 장애물 (IOI25_obstacles) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "obstacles.h"
using namespace std;
static int N, M;
static vector<int> Tval, Hval;
static vector<int> c;
static vector<int> b;
void initialize(vector<int> T, vector<int> H) {
Tval = T;
Hval = H;
N = Tval.size();
M = Hval.size();
c.assign(M, 0);
b.assign(M, -1);
int d = Tval[N-1];
int mx=-1;
for(i=0; i<M; i++) {
mx=max(mx, Hval[i]);
}
}
bool can_reach(int L, int R, int S, int D) {
if(d>mx) {
return true;
}
else {
return false;
}
}
