Submission #1300759

#	Time	Username	Problem	Language	Result	Execution time	Memory
1300759		nataliaa	장애물 (IOI25_obstacles)	C++20	10 / 100	67 ms	8192 KiB

obstacles

#include "obstacles.h"
#include<bits/stdc++.h>
using namespace std;
int f[200005];
int 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(s==d) return true;
    if(s>d) swap(s,d);
    if(f[d]-f[s]==0) return true;
    return false;
}

• Subtask 0: 0 / 0
• Subtask 1: 10 / 10
• Subtask 2: 0 / 14
• Subtask 3: 0 / 13
• Subtask 4: 0 / 21
• Subtask 5: 0 / 25
• Subtask 6: 0 / 17