Submission

Status:

PPPPTPTPTPT

Score: 70

User: akuyga1

Language: c

Time: 1.050 second

Submitted On: 2024-10-03 11:12:47

#include<stdio.h>
int main(){
	int N,K;
	scanf("%d  %d",&N,&K);
	//assume that one tile one day one day +one set of ammo
	int front[N+1],back[N+1];
	int i,j;
	for(i=0;i<N;i++)scanf("%d",&front[i]);
	for(i=0;i<N;i++)scanf("%d",&back[i]);
	int ammo=0;
	for(i=0;i<N;i++){
		ammo=K;
		for(j=i;j<N&&ammo> 0;j++){//for for order line
			//prioritize front over back
			if(front[j]>0)
			{if(front[j]>=ammo){front[j]-=ammo;ammo=0;}
			else{ammo-=front[j];front[j]=0;}}
			if(back[j]>0&&ammo>0)
			{if(back[j]>=ammo){back[j]-=ammo;ammo=0;}
			else{ammo-=back[j];back[j]=0;}}

		}
		if(front[i]>0||back[i]>0){printf("GG");return(0);}
		}
	
	printf("YAY");
}