Submission

Score: 30

User: C12

Problemset: Red Zone

Language: cpp

Time: 1.084 second

Submitted On: 2026-01-04 17:27:09

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

#define f first
#define s second
#define pii pair<ll,ll>
#define puii pair<ull,ull>
#define piii pair<ll,pii>
#define ll long long
#define ull unsigned long long
#define mp make_pair
 
#define mpiii(a,b,c) make_pair(a,make_pair(b,c));
// ll mod = 1000000007;

void solve(){
    ll n,m,l,d,pos;

    cin >> n >> m >> l >> d;

    ll cnt = n;
    vector<ll>v(n);

    for(int i = 0;i < n;i++){
        cin >> v[i];
    }

    for(int k = 0;k < m;k++){
        cin >> pos;
        pos--;
        for(int i = max(0LL,pos-l);i <= min(n-1,pos+l);i++){
            if(v[i] > 0){
                v[i] -= d;
                if(v[i] <= 0)
                    cnt--;
            }
        }
        if(cnt <= 0){
            cout << (k + 1);
            return;
        }
    }

    cout << -1;


    return;
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    ll q;
 
    // cin >> q;

    // while(q--)
        solve(); 

    return 0;
}
/*
6 8 1 4
4 7 6 2 5 3
1
3
6
1
4
6
5
3


*/