Submission

----T-T-T-T

Score: 0

User: tankunkid

Problemset: ซอมบี้

Language: cpp

Time: 1.065 second

Submitted On: 2024-09-28 11:31:55

#include <stdio.h>

int main() {
    int N, K, sum, d = 0;
    scanf("%d %d", &N, &K);
    int A[N], B[N];
    for (int i = 0; i < N; i++) {
        scanf("%d", &A[i]);
    }
    for (int i = 0; i < N; i++) {
        scanf("%d", &B[i]);
    }
    while (d == 0) {
        sum = 0;
        for (int blt = 0; blt < K; blt++) {
            int i = 0;
            if (A[0] > 0) {
                A[0] -= 1;
            } else if (B[0] > 0) {
                B[0] -= 1;
            } else if (A[0] == 0 && B[0] == 0) {
                while (d == 0) {
                    i++;
                    if (A[i] > 0) {
                        A[i] -= 1;
                        break;
                    } else if (B[i] > 0) {
                        B[i] -= 1;
                        break;
                    }
                }
            }
        }
        for (int l = 0; l < N; l++) {
                printf("%d ", A[l]);
        }
        printf("\n");
        for (int l = 0; l < N; l++) {
            printf("%d ", B[l]);
        }
        printf("\n");

        if (A[0] > 0 || B[0] > 0) {
            printf("GG");
            return 0;
        }
        for (int abc = 0; abc < N; abc++) {
            sum += A[abc];
        }
        for (int abc = 0; abc < N; abc++) {
            sum += B[abc];
        }
        if (sum == 0) {
            printf("YAY");
            return 0;
        }
        for (int j = 0; j < N-1; j++) {
            A[j] = A[j+1];
        }
        A[N-1] = 0;
        for (int j = 0; j < N-1; j++) {
            B[j] = B[j+1];
        }
        B[N-1] = 0;


    }
}