Submission
Status:
PP-TTPTPTPT
Subtask/Task Score:
50/100
Score: 50
User: Weathery
Problemset: ซอมบี้
Language: cpp
Time: 1.097 second
Submitted On: 2026-10-06 16:16:59
#include <iostream>
using namespace std;
int main() {
int n,k,i,j,p,d;
cin >> n >> k;
int z[2][n];
for (i=0;i<2;i++) for (j=0;j<n;j++) cin >> z[i][j];
for (p=0;p<n;p++) {
d=k;
for (i=0;i<n&&d>0;i++) {
for (j=0;j<2&&d>0;j++) {
if (z[j][i]>0) {
z[j][i]-=d;
}
if (z[j][i]<0) {
d=z[j][i]*-1;
z[j][i]=0;
}
}
}
if (z[0][0]>0 || z[1][0]>0) {
cout << "GG";
return 0;
}
for (i=0;i<2;i++) {
for (j=0;j<n;j++) {
z[i][j] = z[i][j+1];
}
}
}
cout << "YAY";
return 0;
}