제출 #1295776

#제출 시각아이디문제언어결과실행 시간메모리
1295776SabaKharebava장애물 (IOI25_obstacles)C++20
0 / 100
51 ms5828 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 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...