제출 #1300777

#제출 시각아이디문제언어결과실행 시간메모리
1300777nataliaa장애물 (IOI25_obstacles)C++20
24 / 100
115 ms7444 KiB
//#include "obstacles.h"
#include<bits/stdc++.h>
using namespace std;
bool t1;
int n, m;
vector<int> t;
int f[200005];
void initialize(vector<int> T, vector<int> H){
     n = T.size(), m = H.size(); 
     for(int i = 1; i <n; i++ ) {
         if(T[i]<T[i-1]) {
             t1 = false; break;
         }
     }
    for(int i = 0; i <m; i++){
        if(T[n-1]<=H[i]) f[i+1]++;
    }
    for(int i = 1; i < m; i++){
        f[i+1]+=f[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;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...