| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1300748 | nataliaa | 장애물 (IOI25_obstacles) | C++20 | 0 ms | 0 KiB |
#include "obstacles.h"
#include<bits/stdc++.h>
using namespace std;
int f[200005], l[200005];
int n, m;
void initialize(vector<int> T, vector<int> H){
n = T.size(), m = H.size();
for(int i = 0; i <m; i++){
if(T[0]<=H[i]) f[i+1]++;
if(T[n-1]<=H[i]) l[i+1]++;
}
for(int i = 1; i < m; i++){
f[i+1]+=f[i];
l[i+1]+=l[i];
}
}
bool can_reach(int l, int r, int s, int d){
if(n==1) {
if(f[d]-f[s-1]==0) return true;
}
else {
if(l[d]-l[s-1]==0) return true;
}
return true;
}
