Submission
Status:
(PPPP-SSSSSSSS)(-SSSSSS)(SSSSSSSSS)
Subtask/Task Score:
{0/30}{0/30}{0/40}
Score: 0
User: navysrimuang
Problemset: Red Zone
Language: cpp
Time: 0.007 second
Submitted On: 2026-03-19 13:31:50
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
cin.tie(0)->sync_with_stdio(0);
int n,m,l,d;
cin >> n >> m >> l >> d;
vector<ll> hs(n+1);
for(int i =1;i<=n;i++) cin >> hs[i];
for(int i = 1;i<=m;i++){
int x;
cin >> x;
for(int j = max(1,l-x);j<=min(l+x,n);j++){
hs[j] -= d;
}
bool ok = 1;
for(int j = 1;j<=n;j++) if(hs[j] > 0) ok = 0;
if(ok){
cout << i << "\n";
return 0;
}
}
cout << -1 << "\n";
return 0;
}