Submission #41038017

---

Source Code Expand

/* InTheBloom_Template v1.04 (BETA) Last updated: 2023/4/25 */
/* Repository: https://github.com/InTheBloom/InTheBloom_Library */

/* Originally includes 'in_out.c', 'debug.c' */

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define EPRINT_INT(x) {\
    long long Z = x;\
    fprintf(stderr, "Line %d: %s = %lld\n", __LINE__, #x, Z);\
}
#define EPRINT_STR(x) {\
    fprintf(stderr, "Line %d: %s = %s\n", __LINE__, #x, x);\
}
#define EPRINT_INT_ARRAY(x, n) do {\
    if (n > 0) {\
        fprintf(stderr, "Line %d: %s = [", __LINE__, #x);\
        for (int qq = 0; qq < n - 1; qq++) {\
            long long Z = x[qq];\
            fprintf(stderr, "%lld, ", Z);\
        }\
    long long Z = x[n - 1];\
    fprintf(stderr, "%lld]\n", Z);\
    } else {\
        fprintf(stderr, "[]\n");\
    }\
} while (0)

#define NEWLINE fprintf(stderr, "\n")

int read_int (void) {
    int x;
    scanf("%d", &x);
    return x;
}

double read_double (void) {
    double x;
    scanf("%lf", &x);
    return x;
}

long long read_long_long (void) {
    long long x;
    scanf("%lld", &x);
    return x;
}

void read_str (char *x) {
    scanf("%s", x);
}

void read_int_array (int *x, int n) {
    for (int i = 0; i < n; i++) {
        scanf("%d", &x[i]);
    }
}

void read_long_long_array (long long *x, int n) {
    for (int i = 0; i < n; i++) {
        scanf("%lld", &x[i]);
    }
}

// Defined with macros to support multiple types.

#define print_int_array_with_space(x, n) do {\
    for (int i = 0; i < n; i++) {\
        long long Z = x[i];\
        printf("%lld ", Z);\
    }\
    printf("\n");\
} while (0)

#define print_int_array_with_newlines(x, n) do {\
    for (int i = 0; i < n; i++) {\
        long long Z = x[i];\
        printf("%lld\n", Z);\
    }\
} while (0)

#define print_int(x) do {\
    long long Z = x;\
    printf("%lld\n", Z);\
} while (0)

_Bool is_samemap (int H, int W, char A[H][W + 1], char B[H][W + 1]) {
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) {
            if (A[i][j] != B[i][j]) {
                return 0;
            }
        }
    }

    return 1;
}

void side_shift (int H, int W, char A[H][W + 1]) {
    char tmp[H][W + 1];
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) {
            tmp[i][(j + 1) % W] = A[i][j];
        }
    }

    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) {
            A[i][j] = tmp[i][j];
        }
    }
}

void vertical_shift (int H, int W, char A[H][W + 1]) {
    char tmp[H][W + 1];
    for (int j = 0; j < W; j++) {
        for (int i = 0; i < H; i++) {
            tmp[(i + 1) % H][j] = A[i][j];
        }
    }

    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) {
            A[i][j] = tmp[i][j];
        }
    }
}

void solve (int H, int W, char A[H][W + 1], char B[H][W + 1]) {
    _Bool is_ok = 0;
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) {
            side_shift(H, W, A);
            if (is_samemap(H, W, A, B)) {
                is_ok = 1;
                i = H;
                break;
            }
        }
        vertical_shift(H, W, A);
    }

    if (is_ok) {
        puts("Yes");
    } else {
        puts("No");
    }
}

int main (void) {
    int H = read_int(), W = read_int();
    char A[H][W + 1], B[H][W + 1];

    for (int j = 0; j < H; j++) {
        read_str(A[j]);
    }

    for (int j = 0; j < H; j++) {
        read_str(B[j]);
    }
    solve(H, W, A, B);

    return 0;
}

Submission Info

Judge Result