Submission

Score: 0

User: august

Problemset: Red Zone

Language: cpp

Time: 0.007 second

Submitted On: 2025-12-07 09:58:26

#include <bits/stdc++.h>
using namespace std;

int main() {
	cin.tie(0)->sync_with_stdio(0);
		
	int n,m,l,d;
	cin>> n>> m>> l>> d;
	
	vector<int> a(n+1);
	for (int i=1; i<=n; i++) cin>> a[i];
	
	int cnt=0;
	for (int i=0; i<m; i++) {
		int k;
		cin>> k;
		
		int l=max(1,k-l), r=min(n, k+l);
		for (int j=l; j<=r; j++) {
			if (a[j] <= 0) continue;
			a[j]-=d;
			if (a[j] <= 0) {
				cnt++;
			}
		}
		if (cnt == n) {
			cout<< i+1;
			return 0;
		}
	}
	cout<< -1;
}