Submission #1255267

#TimeUsernameProblemLanguageResultExecution timeMemory
1255267tatais장애물 (IOI25_obstacles)C++20
24 / 100
67 ms7496 KiB
#include "obstacles.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> Sifilis;
void initialize(std::vector<int> T, std::vector<int> H) {
  Sifilis.resize(H.size()+1,0);
  for(int i=1;i<Sifilis.size();++i){
    Sifilis[i]+=Sifilis[i-1]+(H[i-1]>=T[T.size()-1]);
  }
  return;
}

bool can_reach(int L, int R, int S, int D) {
  return (Sifilis[S]==Sifilis[D]);//gracias papa dio por este momento 
}

#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...