제출 #1254591

#제출 시각아이디문제언어결과실행 시간메모리
1254591vpinx장애물 (IOI25_obstacles)C++20
24 / 100
73 ms9148 KiB
#include "obstacles.h" #include <bits/stdc++.h> using namespace std; vector<int> t, h, nv; void initialize(vector<int> _t, vector<int> _h) { int n = _t.size(), m = _h.size(); t.clear(); h.clear(); for (int i = 0; i < n; i++) t.push_back(_t[i]); for (int i = 0; i < m; i++) h.push_back(_h[i]); nv.assign(m, 0); for (int i = 0; i < m; i++) { if (t[n - 1] > h[i]) nv[i] = 1; } for (int i = 1; i < m; i++) nv[i] += nv[i - 1]; } bool can_reach(int l, int r, int s, int d) { int sum = nv[d] - (s == 0 ? 0 : nv[s - 1]); return (sum == d - s + 1); }
#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...