#1030743 (C) No.2986 Permutation Puzzle

提出ソース
結果

問題	No.2986 Permutation Puzzle
ユーザー	👑 ygussany
提出日時	2024-12-11 01:03:45
言語	C (gcc 13.3.0)
結果	AC
実行時間	259 ms / 2,000 ms
コード長	6,714 bytes
コンパイル時間	617 ms
コンパイル使用メモリ	44,040 KB
実行使用メモリ	5,248 KB
最終ジャッジ日時	2024-12-11 01:03:49
合計ジャッジ時間	3,850 ms
ジャッジサーバーID （参考情報）	judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン	結果
sample	AC * 4
other	AC * 40
権限があれば一括ダウンロードができます
ソースコード

raw source code
プレゼンテーションモードにする

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
#include <stdio.h>
#define MT_N 624
#define MT_M 397
#define MT_MATRIX_A 0x9908b0dfUL
#define MT_UPPER_MASK 0x80000000UL
#define MT_LOWER_MASK 0x7fffffffUL
static unsigned int mt[MT_N];
static int mti = MT_N + 1;
void init_genrand(unsigned int s)
{
    mt[0] = s & 0xffffffffUL;
    for (mti = 1; mti < MT_N; mti++) {
        mt[mti] = (1812433253UL * (mt[mti-1] ^ (mt[mti-1] >> 30)) + mti); 
        mt[mti] &= 0xffffffffUL;
    }
}
unsigned int genrand()
{
    unsigned int y;
    static unsigned int mag01[2] = {0x0UL, MT_MATRIX_A};
    if (mti >= MT_N) {
        int kk;
        if (mti == MT_N + 1) init_genrand(5489UL);
        
        for (kk = 0; kk < MT_N - MT_M; kk++) {
            y = (mt[kk] & MT_UPPER_MASK) | (mt[kk+1] & MT_LOWER_MASK);
            mt[kk] = mt[kk+MT_M] ^ (y >> 1) ^ mag01[y&0x1UL];
        }
        for (; kk < MT_N - 1; kk++) {
            y = (mt[kk] & MT_UPPER_MASK) | (mt[kk+1] & MT_LOWER_MASK);
            mt[kk] = mt[kk+(MT_M-MT_N)] ^ (y >> 1) ^ mag01[y&0x1UL];
        }
        y = (mt[MT_N-1] & MT_UPPER_MASK) | (mt[0] & MT_LOWER_MASK);
        mt[MT_N-1] = mt[MT_M-1] ^ (y >> 1) ^ mag01[y&0x1UL];
        mti = 0;
    }
  
    y = mt[mti++];
    y ^= (y >> 11);
    y ^= (y << 7) & 0x9d2c5680UL;
    y ^= (y << 15) & 0xefc60000UL;
    y ^= (y >> 18);
    return y;
}
int is_same(int N, int A[][10], int B[][10])
{
    int i, j;
    for (i = 0; i < N; i++) for (j = 0; j < N; j++) if (A[i][j] != B[i][j]) return 0;
    return 1;
}
int main()
{
    int i, j, N, K, A[10][10], B[10][10];
    scanf("%d %d", &N, &K);
    for (i = 0; i < N; i++) for (j = 0; j < N; j++) scanf("%d", &(A[i][j]));
    for (i = 0; i < N; i++) for (j = 0; j < N; j++) scanf("%d", &(B[i][j]));
    
    int k = 0, ans[5][2], tmp[10][10], AA[10][10];
    for (i = 0; i < N; i++) for (j = 0; j < N; j++) AA[i][j] = A[i][j];
    while (1) {
        for (i = 0; i < N; i++) for (j = 0; j < N; j++) A[i][j] = AA[i][j];
        k = 0;
        while (is_same(N, A, B) == 0 && k < K) {
            ans[k][0] = genrand() % 2;
            ans[k][1] = genrand() % N;
            if (ans[k][0] == 0) {
                for (i = 0; i < N; i++) for (j = 0; j < N; j++) tmp[A[ans[k][1]][i]-1][j] = A[i][j];
            } else {
                for (j = 0; j < N; j++) for (i = 0; i < N; i++) tmp[i][A[j][ans[k][1]]-1] = A[i][j];
            }
            for (i = 0; i < N; i++) for (j = 0; j < N; j++) A[i][j] = tmp[i][j];
            /*
            if (ans[k][0] == 0) printf("R ");
            else printf("C ");
            printf("%d\n", ans[k][1] + 1);      
            for (i = 0; i < N; i++) {
                for (j = 0; j < N; j++) printf("%d ", A[i][j]);
                printf("\n");
            }
            fflush(stdout);
            */
            
            k++;
        }
        if (is_same(N, A, B) != 0) break;
    }
    
    int h, kk = 0, anss[1001][2], x;
    for (i = 0; i < N; i++) for (j = 0; j < N; j++) A[i][j] = AA[i][j];
    for (h = 0; h < k - 1; h++) {
        if (ans[h][0] == 0) {
            for (i = 0; i < N; i++) for (j = 0; j < N; j++) tmp[A[ans[h][1]][i]-1][j] = A[i][j];
        } else {
            for (j = 0; j < N; j++) for (i = 0; i < N; i++) tmp[i][A[j][ans[h][1]]-1] = A[i][j];
        }
        for (i = 0; i < N; i++) for (j = 0; j < N; j++) A[i][j] = tmp[i][j];
    }
    if (is_same(N, A, B) == 0) {
        if (ans[h][0] == 0) x = A[ans[h][1]][0];
        else x = A[0][ans[h][1]];
        while (is_same(N, A, B) == 0) {
            if (ans[h][0] == 0) for (i = 0; B[i][0] != x; i++);
            else for (i = 0; B[0][i] != x; i++);
            anss[kk][0] = ans[h][0];
            anss[kk][1] = i;
            if (ans[h][0] == 0) {
                for (i = 0; i < N; i++) for (j = 0; j < N; j++) tmp[B[anss[kk][1]][i]-1][j] = B[i][j];
            } else {
                for (j = 0; j < N; j++) for (i = 0; i < N; i++) tmp[i][B[j][anss[kk][1]]-1] = B[i][j];
            }
            for (i = 0; i < N; i++) for (j = 0; j < N; j++) B[i][j] = tmp[i][j];
            kk++;
        }
    }
    for (i = 0; i < N; i++) for (j = 0; j < N; j++) A[i][j] = AA[i][j];
    for (h = 0; h < k - 2; h++) {
        if (ans[h][0] == 0) {
            for (i = 0; i < N; i++) for (j = 0; j < N; j++) tmp[A[ans[h][1]][i]-1][j] = A[i][j];
        } else {
            for (j = 0; j < N; j++) for (i = 0; i < N; i++) tmp[i][A[j][ans[h][1]]-1] = A[i][j];
        }
        for (i = 0; i < N; i++) for (j = 0; j < N; j++) A[i][j] = tmp[i][j];
    }
    if (is_same(N, A, B) == 0) {
        if (ans[h][0] == 0) x = A[ans[h][1]][0];
        else x = A[0][ans[h][1]];
        while (is_same(N, A, B) == 0) {
            if (ans[h][0] == 0) for (i = 0; B[i][0] != x; i++);
            else for (i = 0; B[0][i] != x; i++);
            anss[kk][0] = ans[h][0];
            anss[kk][1] = i;
            if (ans[h][0] == 0) {
                for (i = 0; i < N; i++) for (j = 0; j < N; j++) tmp[B[anss[kk][1]][i]-1][j] = B[i][j];
            } else {
                for (j = 0; j < N; j++) for (i = 0; i < N; i++) tmp[i][B[j][anss[kk][1]]-1] = B[i][j];
            }
            for (i = 0; i < N; i++) for (j = 0; j < N; j++) B[i][j] = tmp[i][j];
            kk++;
        }
    }
    for (i = 0; i < N; i++) for (j = 0; j < N; j++) A[i][j] = AA[i][j];
    for (h = 0; h < k - 3; h++) {
        if (ans[h][0] == 0) {
            for (i = 0; i < N; i++) for (j = 0; j < N; j++) tmp[A[ans[h][1]][i]-1][j] = A[i][j];
        } else {
            for (j = 0; j < N; j++) for (i = 0; i < N; i++) tmp[i][A[j][ans[h][1]]-1] = A[i][j];
        }
        for (i = 0; i < N; i++) for (j = 0; j < N; j++) A[i][j] = tmp[i][j];
    }
    if (is_same(N, A, B) == 0) {
        if (ans[h][0] == 0) x = A[ans[h][1]][0];
        else x = A[0][ans[h][1]];
        while (is_same(N, A, B) == 0) {
            if (ans[h][0] == 0) for (i = 0; B[i][0] != x; i++);
            else for (i = 0; B[0][i] != x; i++);
            anss[kk][0] = ans[h][0];
            anss[kk][1] = i;
            if (ans[h][0] == 0) {
                for (i = 0; i < N; i++) for (j = 0; j < N; j++) tmp[B[anss[kk][1]][i]-1][j] = B[i][j];
            } else {
                for (j = 0; j < N; j++) for (i = 0; i < N; i++) tmp[i][B[j][anss[kk][1]]-1] = B[i][j];
            }
            for (i = 0; i < N; i++) for (j = 0; j < N; j++) B[i][j] = tmp[i][j];
            kk++;
        }
    }
    for (i = 0; i < N; i++) for (j = 0; j < N; j++) A[i][j] = AA[i][j];
    for (h = 0; h < k - 4; h++) {
        if (ans[h][0] == 0) {
            for (i = 0; i < N; i++) for (j = 0; j < N; j++) tmp[A[ans[h][1]][i]-1][j] = A[i][j];
        } else {
            for (j = 0; j < N; j++) for (i = 0; i < N; i++) tmp[i][A[j][ans[h][1]]-1] = A[i][j];
        }
        for (i = 0; i < N; i++) for (j = 0; j < N; j++) A[i][j] = tmp[i][j];
    }
    if (is_same(N, A, B) == 0) {
        if (ans[h][0] == 0) x = A[ans[h][1]][0];
        else x = A[0][ans[h][1]];
        while (is_same(N, A, B) == 0) {
            if (ans[h][0] == 0) for (i = 0; B[i][0] != x; i++);
            else for (i = 0; B[0][i] != x; i++);
            anss[kk][0] = ans[h][0];
            anss[kk][1] = i;
            if (ans[h][0] == 0) {
                for (i = 0; i < N; i++) for (j = 0; j < N; j++) tmp[B[anss[kk][1]][i]-1][j] = B[i][j];
            } else {
                for (j = 0; j < N; j++) for (i = 0; i < N; i++) tmp[i][B[j][anss[kk][1]]-1] = B[i][j];
            }
            for (i = 0; i < N; i++) for (j = 0; j < N; j++) B[i][j] = tmp[i][j];
            kk++;
        }
    }
    
    printf("%d\n", kk);
    for (i = 0; i < kk; i++) {
        if (anss[i][0] == 0) printf("R ");
        else printf("C ");
        printf("%d\n", anss[i][1] + 1);
    }
    fflush(stdout);
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
yukicoder

結果

ソースコード
