Submission

Score: 30

User: njoop

Problemset: Red Zone

Language: cpp

Time: 1.066 second

Submitted On: 2025-04-11 13:02:07

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

int n, m, l, d, arr[100010], bomb[100010], sw[100010], cnt;

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> m >> l >> d;
    for(int i=1; i<=n; i++) {
        cin >> arr[i];
    }
    for(int i=1; i<=m; i++) {
        cin >> bomb[i];
        for(int j=max(1LL, bomb[i]-l); j<=min(n, bomb[i]+l); j++) {
            if(arr[j] > 0 && arr[j]-d <= 0) cnt++;
            arr[j] -= d;
        }
        if(cnt == n) {
            cout << i;
            return 0;
        }
    }
    cout << -1;
}