結果

問題 No.1779 Magical Swap
ユーザー 👑 ygussany
提出日時 2021-12-08 00:32:12
言語 C
(gcc 13.3.0)
結果
WA  
実行時間 -
コード長 1,816 bytes
コンパイル時間 131 ms
コンパイル使用メモリ 31,360 KB
実行使用メモリ 13,072 KB
最終ジャッジ日時 2024-07-08 04:18:01
合計ジャッジ時間 1,301 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 15 WA * 3
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <stdio.h>
char flag[100003] = {};
typedef struct List {
    struct List *next;
    int v, num;
} list;
#define HASH 1000003
const int H_Mod = HASH;
int solve(int N, int A[], int B[])
{
    int h, i, j;
    static int q[200003], head, tail;
    static list *hash[HASH] = {}, d[200003], *p;
    for (i = 1, j = 0, tail = 0; i <= N; i++) {
        if (flag[i] == 0 && i * 2 > N) {
            if (A[i] != B[i]) {
                for (head = 0; head < tail; head++) hash[q[head] % H_Mod] = NULL;
                return 0;
            }
        } else {
            h = A[i] % H_Mod;
            for (p = hash[h]; p != NULL; p = p->next) if (p->v == A[i]) break;
            if (p != NULL) p->num++;
            else {
                q[tail++] = A[i];
                d[j].v = A[i];
                d[j].num = 1;
                d[j].next = hash[h];
                hash[h] = &(d[j++]);
            }
            h = B[i] % H_Mod;
            for (p = hash[h]; p != NULL; p = p->next) if (p->v == B[i]) break;
            if (p != NULL) p->num--;
            else {
                q[tail++] = B[i];
                d[j].v = B[i];
                d[j].num = -1;
                d[j].next = hash[h];
                hash[h] = &(d[j++]);
            }
        }
    }
    for (head = 0; head < tail; head++) {
        h = q[head] % H_Mod;
        for (p = hash[h]; p != NULL; p = p->next) {
            if (p->num != 0) {
                for (; head < tail; head++) hash[q[head] % H_Mod] = NULL;
                return 0;
            }
        }
        hash[h] = NULL;
    }
    return 1;
}
int main()
{
    int i, j, t, T, N, A[100003], B[100003];
    for (i = 2; i <= 100000; i++) {
        if (flag[i] != 0) continue;
        for (j = i * 2; j <= 100000; j += i) flag[j] = 1;
    }
    scanf("%d", &T);
    for (t = 1; t <= T; t++) {
        scanf("%d", &N);
        if (N > 100000) return -1;
        for (i = 1; i <= N; i++) {
            scanf("%d", &(A[i]));
            if (A[i] <= 0 || A[i] > 1000000000) return -1;
        }
        for (i = 1; i <= N; i++) {
            scanf("%d", &(B[i]));
            if (B[i] <= 0 || B[i] > 1000000000) return -1;
        }
        if (solve(N, A, B) == 0) printf("No\n");
        else printf("Yes\n");
    }
    fflush(stdout);
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0