| Task: | Arpakuutiot |
| Sender: | caro |
| Submission time: | 2020-10-01 16:18:22 +0300 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 35 |
| #2 | ACCEPTED | 65 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.01 s | 1, 2 | details |
| #2 | ACCEPTED | 0.01 s | 1, 2 | details |
| #3 | ACCEPTED | 0.01 s | 1, 2 | details |
| #4 | ACCEPTED | 0.01 s | 1, 2 | details |
| #5 | ACCEPTED | 0.01 s | 1, 2 | details |
| #6 | ACCEPTED | 0.01 s | 1, 2 | details |
| #7 | ACCEPTED | 0.01 s | 1, 2 | details |
| #8 | ACCEPTED | 0.01 s | 1, 2 | details |
| #9 | ACCEPTED | 0.01 s | 1, 2 | details |
| #10 | ACCEPTED | 0.01 s | 1, 2 | details |
| #11 | ACCEPTED | 0.01 s | 2 | details |
| #12 | ACCEPTED | 0.01 s | 2 | details |
| #13 | ACCEPTED | 0.01 s | 2 | details |
| #14 | ACCEPTED | 0.01 s | 2 | details |
| #15 | ACCEPTED | 0.01 s | 2 | details |
| #16 | ACCEPTED | 0.01 s | 2 | details |
| #17 | ACCEPTED | 0.01 s | 2 | details |
| #18 | ACCEPTED | 0.01 s | 2 | details |
| #19 | ACCEPTED | 0.01 s | 2 | details |
| #20 | ACCEPTED | 0.01 s | 2 | details |
| #21 | ACCEPTED | 0.01 s | 2 | details |
| #22 | ACCEPTED | 0.01 s | 2 | details |
| #23 | ACCEPTED | 0.01 s | 2 | details |
| #24 | ACCEPTED | 0.01 s | 2 | details |
| #25 | ACCEPTED | 0.01 s | 2 | details |
| #26 | ACCEPTED | 0.01 s | 2 | details |
| #27 | ACCEPTED | 0.01 s | 2 | details |
| #28 | ACCEPTED | 0.01 s | 2 | details |
| #29 | ACCEPTED | 0.01 s | 2 | details |
| #30 | ACCEPTED | 0.01 s | 2 | details |
| #31 | ACCEPTED | 0.01 s | 1, 2 | details |
Compiler report
input/code.cpp: In function 'int main()':
input/code.cpp:226:46: warning: 'f' may be used uninitialized in this function [-Wmaybe-uninitialized]
if(t[i][1 + l] != t[j][sa[f][(k + l) % 4]]) break;
~~~~~~~~~~~~~~~~~^Code
#include <bits/stdc++.h>
typedef unsigned char uchar;
typedef unsigned int uint;
using namespace std;
int nets[11][6][3] = {
1, 0, 5,
1, 1, 4,
1, 2, 0,
1, 3, 2,
0, 3, 1,
2, 3, 3,
1, 0, 5,
1, 1, 4,
1, 2, 0,
0, 2, 1,
1, 3, 2,
2, 3, 3,
1, 0, 4,
0, 1, 1,
1, 1, 0,
1, 2, 2,
1, 3, 5,
2, 3, 3,
0, 0, 1,
1, 0, 4,
1, 1, 0,
1, 2, 2,
1, 3, 5,
2, 3, 3,
1, 0, 4,
0, 1, 1,
1, 1, 0,
1, 2, 2,
1, 3, 5,
2, 2, 3,
1, 0, 5,
1, 1, 4,
1, 2, 0,
1, 3, 2,
0, 2, 1,
2, 2, 3,
1, 0, 5,
1, 1, 4,
1, 2, 0,
0, 2, 1,
2, 2, 3,
2, 3, 2,
1, 0, 4,
0, 1, 1,
1, 1, 0,
1, 2, 2,
2, 2, 3,
2, 3, 5,
0, 0, 4,
0, 1, 1,
1, 1, 0,
1, 2, 2,
1, 3, 5,
2, 3, 3,
0, 0, 4,
0, 1, 1,
1, 1, 0,
1, 2, 2,
2, 2, 3,
2, 3, 5,
0, 0, 3,
0, 1, 4,
0, 2, 1,
1, 2, 0,
1, 3, 2,
1, 4, 5,
};
int mir[4][2] = {
1, 1,
-1, 1,
1, -1,
-1, -1,
};
int mirr[6][4] = {
0, 0, 0, 0,
1, 3, 1, 3,
2, 2, 4, 4,
3, 1, 3, 1,
4, 4, 2, 2,
5, 5, 5, 5,
};
int sa[6][4] = {
1, 2, 3, 4,
5, 2, 0, 4,
1, 5, 3, 0,
0, 2, 5, 4,
0, 3, 5, 1,
3, 2, 1, 4,
};
int ind(int n, int r, int m, int f, int c){
return n * 6 * 4 * 4 * 3 + 6 * 4 * 3 * r + 6 * 3 * m + f * 3 + c;
}
int* GenRot(){
int *netss = (int*)malloc(sizeof(int) * 11 * 4 * 4 * 6 * 3);
for(int i = 0; i < 11; i++){
memcpy(netss + i * 4 * 4 * 6 * 3, nets[i], sizeof(int) * 6 * 3);
for(int j = 1; j < 4; j++){
for(int k = 0; k < 6; k++){
int x = -netss[ind(i, j - 1, 0, k, 1)];
int y = netss[ind(i, j - 1, 0, k, 0)];
int z = netss[ind(i, j - 1, 0, k, 2)];
netss[ind(i, j, 0, k, 0)] = x;
netss[ind(i, j, 0, k, 1)] = y;
netss[ind(i, j, 0, k, 2)] = z;
}
}
for(int j = 0; j < 4; j++){
for(int l = 0; l < 4; l++){
int minx = 1234;
int miny = 1234;
for(int k = 0; k < 6; k++){
netss[ind(i, j, l, k, 0)] = mir[l][0] * netss[ind(i, j, 0, k, 0)];
netss[ind(i, j, l, k, 1)] = mir[l][1] * netss[ind(i, j, 0, k, 1)];
netss[ind(i, j, l, k, 2)] = mirr[netss[ind(i, j, 0, k, 2)]][l];
minx = min(minx, netss[ind(i, j, l, k, 0)]);
miny = min(miny, netss[ind(i, j, l, k, 1)]);
}
for(int k = 0; k < 6; k++){
netss[ind(i, j, l, k, 0)] -= minx;
netss[ind(i, j, l, k, 1)] -= miny;
//printf("%d %d ", netss[ind(i, j, k, 0)], netss[ind(i, j, k, 1)]);
//printf("%d ", netss[ind(i, j, k, 2)]);
}
//printf("\n");
}
}
}
return netss;
}
int main(){
int *rot = GenRot();
uint n;
cin >> n;
uchar t[n][6] = {};
for(uint i = 0; i < n; i++){
uchar s[5][5];
cin >> s[0];
cin >> s[1];
cin >> s[2];
cin >> s[3];
cin >> s[4];
int cc = 0;
int c[6][3];
int minx = 23497;
int miny = 23497;
for(int j = 0; j < 5; j++){
for(int k = 0; k < 5; k++){
if(s[j][k] != '.'){
c[cc][0] = k;
c[cc][1] = j;
c[cc][2] = s[j][k] - '0';
cc++;
minx = min(minx, k);
miny = min(miny, j);
}
}
}
for(int j = 0; j < 6; j++){
c[j][0] -= minx;
c[j][1] -= miny;
}
for(int j = 0; j < 11; j++){
for(int k = 0; k < 4; k++){
for(int l = 0; l < 4; l++){
int match = 1;
for(int m = 0; m < 6; m++){
int nn = 0;
for(int n = 0; n < 6; n++){
if(c[n][0] == rot[ind(j, k, l, m, 0)] && c[n][1] == rot[ind(j, k, l, m, 1)]){
t[i][rot[ind(j, k, l, m, 2)]] = c[n][2];
nn = 1;
//printf("%d %d %d\n", c[m][0], c[m][1], m);
break;
}
}
if(!nn) {
match = 0;
break;
}
}
//printf("asdf %d\n", match);
if(match) goto next;
}
}
}
next:;
//printf("%d %d %d %d %d %d\n", t[i][0], t[i][1], t[i][2], t[i][3], t[i][4], t[i][5]);
}
for(uint i = 0; i < n; i++){
uint found = 0;
for(uint j = 0; j < n; j++){
if(i == j) continue;
int f;
for(int k = 0; k < 6; k++){
if(t[j][k] == t[i][0]) {
f = k;
break;
}
}
for(int k = 0; k < 4; k++){
int l;
for(l = 0; l < 4; l++){
//printf("%d %d ", t[i][1 + l], t[j][sa[f][(k + l) % 4]]);
if(t[i][1 + l] != t[j][sa[f][(k + l) % 4]]) break;
}
//printf("\n");
if(l == 4){
found = 1;
cout << (j + 1) << ' ';
break;
}
}
}
if(!found){
cout << "-";
}
cout << '\n';
}
return 0;
}
Test details
Test 1
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 3 165.. .4... .3... .2... ... |
| correct output |
|---|
| 3 - 1 |
| user output |
|---|
| 3 - 1 |
Test 2
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 264.. .5... .3... .1... ... |
| correct output |
|---|
| 3 4 5 1 2 5 2 4 |
| user output |
|---|
| 3 4 5 1 2 5 2 4 |
Test 3
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 152.. .4... .3... .6... ... |
| correct output |
|---|
| 3 5 4 1 5 2 1 3 |
| user output |
|---|
| 3 5 4 1 5 2 1 3 |
Test 4
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 142.. .6... .3... .5... ... |
| correct output |
|---|
| 4 5 3 2 1 5 1 4 |
| user output |
|---|
| 4 5 3 2 1 5 1 4 |
Test 5
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 123.. .4... .6... .5... ... |
| correct output |
|---|
| 3 4 5 1 2 5 2 4 |
| user output |
|---|
| 3 4 5 1 2 5 2 4 |
Test 6
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 213.. .6... .4... .5... ... |
| correct output |
|---|
| 4 5 3 2 1 5 1 4 |
| user output |
|---|
| 4 5 3 2 1 5 1 4 |
Test 7
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 314.. .5... .2... .6... ... |
| correct output |
|---|
| 3 4 5 1 2 5 2 4 |
| user output |
|---|
| 3 4 5 1 2 5 2 4 |
Test 8
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 163.. .2... .5... .4... ... |
| correct output |
|---|
| 4 5 3 2 1 5 1 4 |
| user output |
|---|
| 4 5 3 2 1 5 1 4 |
Test 9
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 264.. .1... .3... .5... ... |
| correct output |
|---|
| 2 3 1 3 1 2 5 4 |
| user output |
|---|
| 2 3 1 3 1 2 5 4 |
Test 10
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 214.. .3... .5... .6... ... |
| correct output |
|---|
| 5 3 4 2 4 2 3 1 |
| user output |
|---|
| 5 3 4 2 4 2 3 1 |
Test 11
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 10 .41.. .5... .2... 36... ... |
| correct output |
|---|
| 9 4 6 8 7 10 2 6 8 - ... |
| user output |
|---|
| 9 4 6 8 7 10 2 6 8 - ... |
Test 12
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 10 5.... 1436. .2... ..... ... |
| correct output |
|---|
| 5 8 6 10 4 7 9 3 7 9 1 8 ... |
| user output |
|---|
| 5 8 6 10 4 7 9 3 7 9 1 8 ... |
Test 13
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 10 2.... 41... .63.. .5... ... |
| correct output |
|---|
| 4 9 10 5 6 7 8 - 1 9 10 2 6 7 8 ... |
| user output |
|---|
| 4 9 10 5 6 7 8 - 1 9 10 2 6 7 8 ... |
Test 14
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 10 1.... 634.. ..52. ..... ... |
| correct output |
|---|
| 2 3 4 5 6 9 10 1 3 4 5 6 9 10 1 2 4 5 6 9 10 1 2 3 5 6 9 10 1 2 3 4 6 9 10 ... |
| user output |
|---|
| 2 3 4 5 6 9 10 1 3 4 5 6 9 10 1 2 4 5 6 9 10 1 2 3 5 6 9 10 1 2 3 4 6 9 10 ... Truncated |
Test 15
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 10 .2... 4516. 3.... ..... ... |
| correct output |
|---|
| 5 7 9 10 8 4 6 3 6 1 7 9 10 ... |
| user output |
|---|
| 5 7 9 10 8 4 6 3 6 1 7 9 10 ... |
Test 16
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 10 .56.. .2... .4... 31... ... |
| correct output |
|---|
| 4 9 3 5 10 2 5 10 1 9 2 3 10 ... |
| user output |
|---|
| 4 9 3 5 10 2 5 10 1 9 2 3 10 ... |
Test 17
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 10 ..62. .31.. 45... ..... ... |
| correct output |
|---|
| 2 3 4 8 1 3 4 8 1 2 4 8 1 2 3 8 6 7 9 10 ... |
| user output |
|---|
| 2 3 4 8 1 3 4 8 1 2 4 8 1 2 3 8 6 7 9 10 ... Truncated |
Test 18
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 10 532.. .4... .1... .6... ... |
| correct output |
|---|
| 3 8 9 5 6 1 8 9 7 10 2 6 ... |
| user output |
|---|
| 3 8 9 5 6 1 8 9 7 10 2 6 ... |
Test 19
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 10 .64.. .1... .3... 52... ... |
| correct output |
|---|
| 2 5 6 7 8 9 1 5 6 7 8 9 4 10 3 10 1 2 6 7 8 9 ... |
| user output |
|---|
| 2 5 6 7 8 9 1 5 6 7 8 9 4 10 3 10 1 2 6 7 8 9 ... Truncated |
Test 20
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 10 .4... 326.. .1... .5... ... |
| correct output |
|---|
| 4 7 8 6 9 10 5 1 7 8 3 ... |
| user output |
|---|
| 4 7 8 6 9 10 5 1 7 8 3 ... |
Test 21
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 20 .6... .4... 31... .25.. ... |
| correct output |
|---|
| 3 7 11 16 6 1 7 11 16 5 19 4 19 ... |
| user output |
|---|
| 3 7 11 16 6 1 7 11 16 5 19 4 19 ... Truncated |
Test 22
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 20 3.... 5614. ..2.. ..... ... |
| correct output |
|---|
| 7 10 11 17 20 12 4 9 13 15 18 3 9 13 15 18 8 14 16 ... |
| user output |
|---|
| 7 10 11 17 20 12 4 9 13 15 18 3 9 13 15 18 8 14 16 ... Truncated |
Test 23
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 20 42... .316. .5... ..... ... |
| correct output |
|---|
| 5 12 13 15 18 16 20 6 8 14 9 19 1 12 13 15 18 ... |
| user output |
|---|
| 5 12 13 15 18 16 20 6 8 14 9 19 1 12 13 15 18 ... Truncated |
Test 24
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 20 ..5.. .623. 41... ..... ... |
| correct output |
|---|
| 2 6 11 12 13 1 6 11 12 13 5 16 18 7 14 3 16 18 ... |
| user output |
|---|
| 2 6 11 12 13 1 6 11 12 13 5 16 18 7 14 3 16 18 ... Truncated |
Test 25
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 20 .46.. 53... .1... .2... ... |
| correct output |
|---|
| 2 3 5 7 15 17 19 1 3 5 7 15 17 19 1 2 5 7 15 17 19 8 10 11 14 1 2 3 7 15 17 19 ... |
| user output |
|---|
| 2 3 5 7 15 17 19 1 3 5 7 15 17 19 1 2 5 7 15 17 19 8 10 11 14 1 2 3 7 15 17 19 ... Truncated |
Test 26
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 20 .61.. .4... 35... .2... ... |
| correct output |
|---|
| 8 10 20 3 17 18 19 2 17 18 19 14 15 6 7 9 13 ... |
| user output |
|---|
| 8 10 20 3 17 18 19 2 17 18 19 14 15 6 7 9 13 ... Truncated |
Test 27
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 20 ..2.. 1463. .5... ..... ... |
| correct output |
|---|
| 2 3 5 6 9 20 1 3 5 6 9 20 1 2 5 6 9 20 11 19 1 2 3 6 9 20 ... |
| user output |
|---|
| 2 3 5 6 9 20 1 3 5 6 9 20 1 2 5 6 9 20 11 19 1 2 3 6 9 20 ... Truncated |
Test 28
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 20 ...4. 5132. 6.... ..... ... |
| correct output |
|---|
| 2 8 10 12 13 19 1 8 10 12 13 19 4 5 15 16 17 3 5 15 16 17 3 4 15 16 17 ... |
| user output |
|---|
| 2 8 10 12 13 19 1 8 10 12 13 19 4 5 15 16 17 3 5 15 16 17 3 4 15 16 17 ... Truncated |
Test 29
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 20 .2... .31.. 45... 6.... ... |
| correct output |
|---|
| 5 8 9 14 17 3 10 16 2 10 16 13 15 19 1 8 9 14 17 ... |
| user output |
|---|
| 5 8 9 14 17 3 10 16 2 10 16 13 15 19 1 8 9 14 17 ... Truncated |
Test 30
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 20 3.... 452.. .1... .6... ... |
| correct output |
|---|
| 3 7 8 9 14 15 16 19 4 12 13 17 1 7 8 9 14 15 16 19 2 12 13 17 11 20 ... |
| user output |
|---|
| 3 7 8 9 14 15 16 19 4 12 13 17 1 7 8 9 14 15 16 19 2 12 13 17 11 20 ... Truncated |
Test 31
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 2 546.. .3... .2... .1... ... |
| correct output |
|---|
| - - |
| user output |
|---|
| - - |
