| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1295779 | SabaKharebava | 장애물 (IOI25_obstacles) | C++20 | 65 ms | 7360 KiB |
#include<bits/stdc++.h>
using namespace std;
vector<int> mp;
void initialize(vector<int> t, vector<int> h) {
mp.resize(h.size()+1, 0);
for (int i = 1; i <= h.size(); i++) {
if (h[i-1] >= t[0])
mp[i] = 1;
mp[i] += mp[i-1];
}
}
bool can_reach(int l, int r, int s, int d) {
return !(mp[d+1]-mp[s]);
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
