CSES - Datatähti 2021 alku - Results
Submission details
Task:Arpakuutiot
Sender:Epe
Submission time:2020-10-10 08:01:50 +0300
Language:C++ (C++17)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED35
#2ACCEPTED65
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2details
#2ACCEPTED0.01 s1, 2details
#3ACCEPTED0.01 s1, 2details
#4ACCEPTED0.01 s1, 2details
#5ACCEPTED0.01 s1, 2details
#6ACCEPTED0.01 s1, 2details
#7ACCEPTED0.01 s1, 2details
#8ACCEPTED0.01 s1, 2details
#9ACCEPTED0.01 s1, 2details
#10ACCEPTED0.01 s1, 2details
#11ACCEPTED0.01 s2details
#12ACCEPTED0.01 s2details
#13ACCEPTED0.01 s2details
#14ACCEPTED0.01 s2details
#15ACCEPTED0.01 s2details
#16ACCEPTED0.01 s2details
#17ACCEPTED0.01 s2details
#18ACCEPTED0.01 s2details
#19ACCEPTED0.01 s2details
#20ACCEPTED0.01 s2details
#21ACCEPTED0.01 s2details
#22ACCEPTED0.01 s2details
#23ACCEPTED0.01 s2details
#24ACCEPTED0.01 s2details
#25ACCEPTED0.01 s2details
#26ACCEPTED0.01 s2details
#27ACCEPTED0.01 s2details
#28ACCEPTED0.01 s2details
#29ACCEPTED0.01 s2details
#30ACCEPTED0.01 s2details
#31ACCEPTED0.01 s1, 2details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:290:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i<nline.length(); i++) {
                  ~^~~~~~~~~~~~~~~
input/code.cpp:348:45: warning: unused variable 'x_2' [-Wunused-variable]
      int x_1 = bot.first, y_1 = bot.second, x_2 = top.first, y_2 = top.second;
                                             ^~~
input/code.cpp:348:62: warning: unused variable 'y_2' [-Wunused-variable]
      int x_1 = bot.first, y_1 = bot.second, x_2 = top.first, y_2 = top.second;
                                                              ^~~
input/code.cpp:399:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int p = 0; p<u1.size(); p++) {
                    ~^~~~~~~~~~
input/code.cpp:403:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      if (p!=u1.size()-1 && !(p==u1.size()-2 && u1[p+1]==i))...

Code

#include <bits/stdc++.h>
#include <cstring>
inline int mo(int v1, unsigned m)
{
int v2 = v1%m;
if (v2<0) {
v2 += m;
}
return v2;
}
using namespace std;
pair<int, int> top, bot;
char arr[6][5];
inline bool yo(int x, int y)
{
return x>=0 && x<5 && y>=0 && y<5 && arr[y][x]!='.';
}
pair<int, int> op(int x, int y)
{
if (yo(x-1, y)) {
int yu1 = -1;
for (int yy = 0; yy<4; yy++) {
if (!yo(x-1, y-yy)) break;
if (yo(x-2, y-yy)) yu1 = y-yy;
}
if (yu1==-1) {
for (int yy = 0; yy<4; yy++) {
if (!yo(x-1, y+yy)) break;
if (yo(x-2, y+yy)) yu1 = y+yy;
}
}
if (yu1!=-1) {
return make_pair(x-2, yu1);
//return arr[yu1][x-2]-48;
}
}
if (yo(x+1, y)) {
int yu1 = -1;
for (int yy = 0; yy<4; yy++) {
if (!yo(x+1, y-yy)) break;
if (yo(x+2, y-yy)) yu1 = y-yy;
}
if (yu1==-1) {
for (int yy = 0; yy<4; yy++) {
if (!yo(x+1, y+yy)) break;
if (yo(x+2, y+yy)) yu1 = y+yy;
}
}
if (yu1!=-1) {
return make_pair(x+2, yu1);
//return arr[yu1][x+2]-48;
}
}
if (yo(x, y-1)) {
int yu1 = -1;
for (int xx = 0; xx<4; xx++) {
if (!yo(x-xx, y-1)) break;
if (yo(x-xx, y-2)) yu1 = x-xx;
}
if (yu1==-1) {
for (int xx = 0; xx<4; xx++) {
if (!yo(x+xx, y-1)) break;
if (yo(x+xx, y-2)) yu1 = x+xx;
}
}
if (yu1!=-1) {
return make_pair(yu1, y-2);
//return arr[y-2][yu1]-48;
}
}
if (yo(x, y+1)) {
int yu1 = -1;
for (int xx = 0; xx<4; xx++) {
if (!yo(x-xx, y+1)) break;
if (yo(x-xx, y+2)) yu1 = x-xx;
}
if (yu1==-1) {
for (int xx = 0; xx<4; xx++) {
if (!yo(x+xx, y+1)) break;
if (yo(x+xx, y+2)) yu1 = x+xx;
}
}
if (yu1!=-1) {
return make_pair(yu1, y+2);
//return arr[y+2][yu1]-48;
}
}
cout << "ASD 1:" << x << " " << y << endl;
exit(1);
}
int sides[4];
void cc(){
for(int i = 0; i < 4; i++) sides[i] = 0;
memset(arr, 0, 6*5);
}
void asd(int mx, int my){
bool mp[3][3] = {{0}};
for(int y = -1; y <= 1; y++){
for(int x = -1; x <= 1; x++){
mp[y+1][x+1] = yo(mx+x, my+y);
}
}
int x, y;
pair<int,int> up1, up2;
int a,b;
pair<int,int> p;
if(mp[0][1]||mp[2][1]){
if(mp[0][1]){
b = 1;
p = make_pair(0,-1);
} else {
b = 3;
p = make_pair(0,1);
}
if(mp[1][0]){
a = 0;
goto FOUND;
} else if (mp[1][2]){
a = 2;
goto FOUND;
}
}
if(mp[1][0]){
//0
a = 0;
if(mp[0][0]){
//1
b=1;
p = make_pair(-1,-1);
goto FOUND;
} else if (mp[2][0]){
//3
b=3;
p = make_pair(-1,1);
goto FOUND;
}
}
if(mp[0][1]){
//1
a = 1;
if(mp[0][0]){
//0
b=0;
p = make_pair(-1,-1);
goto FOUND;
} else if (mp[0][2]){
//2
b=2;
p = make_pair(1,-1);
goto FOUND;
}
}
if(mp[1][2]){
//2
a=2;
if(mp[0][2]){
//1
b=1;
p = make_pair(1,-1);
goto FOUND;
} else if (mp[2][2]){
//3
b=3;
p = make_pair(1,1);
goto FOUND;
}
}
if(mp[2][1]){
//3
a=3;
if(mp[2][0]){
//0
b=0;
p = make_pair(-1,1);
goto FOUND;
} else if (mp[2][2]){
//2
b=2;
p = make_pair(1,1);
goto FOUND;
}
}
goto NOT_FOUND;
FOUND:
up2 = op(mx+p.first, my+p.second);
sides[b] = arr[my+p.second][mx+p.first];
sides[mo(b+2,4)] = arr[up2.second][up2.first];
NOT_FOUND:
x = mx, y = my;
switch (a){
case 0:
x--;
break;
case 1:
y--;
break;
case 2:
x++;
break;
case 3:
y++;
}
up1 = op(x, y);
sides[a] = arr[y][x];
sides[mo(a+2,4)] = arr[up1.second][up1.first];
return;
}
int hsh(){
for(int i = 0; i < 4; i++){
if(sides[i] == 0){
int index = mo(i+2,4);
int tside = sides[index];
for(int y = 0; y < 5; y++){
for(int x = 0; x < 5; x++){
if(arr[y][x] == tside){
pair<int,int> p = op(x,y);
sides[i] = arr[p.second][p.first];
y=5;
break;
}
}
}
break;
}
}
int mn = 9999, mi = -1;
for(int i = 0; i < 4; i++) if(sides[i] < mn){
mn = sides[i];
mi = i;
}
int temp[4];
for(int i = 0; i < 4; i++){
temp[i] = sides[mo(mi+i,4)];
}
int t = arr[top.second][top.first]-48;
for(int i = 0; i < 4; i++){
t = t*10 + (temp[i]-48);
}
return t;
}
void rott(){
for(int n = 0; n <= 3; n++){
for(int m = n+1; m <= 4; m++){
swap(arr[n][m], arr[m][n]);
}
}
for(int y = 0; y < 2; y++){
for(int x = 0; x < 5; x++){
swap(arr[y][x], arr[4-y][x]);
}
}
}
int main()
{
int n = 0;
string nline;
getline(cin, nline);
for (int i = 0; i<nline.length(); i++) {
char c = nline[i];
if (c>47) {
n = n*10+c-48;
}
else {
break;
}
}
int mm[n];
map<int, vector<int>> m;
for (int t = 0; t<n; t++) {
cc();
int pos1x, pos1y;
for (int y = 0; y<5; y++) {
string line;
getline(cin, line);
for (int x = 0; x<5; x++) {
char c = line[x];
if(c == '1'){
pos1x = x;
pos1y = y;
}
arr[y][x] = c;
}
}
string line;
getline(cin, line);
bool flag = 1;
if(yo(pos1x-2, pos1y)){
rott();
rott();
rott();
} else if (yo(pos1x, pos1y+2)){
rott();
rott();
} else if(yo(pos1x+2, pos1y)){
rott();
} else if(!yo(pos1x, pos1y-2)){
flag = 0;
}
for (int y = 0; y<5; y++) {
for (int x = 0; x<5; x++) {
if (arr[y][x]=='1') {
if(yo(x-2, y)){
}
bot = make_pair(x, y);
top = op(x, y);
int x_1 = bot.first, y_1 = bot.second, x_2 = top.first, y_2 = top.second;
asd(x_1, y_1);
bool ok = true;
for(int i = 0; i < 4; i++){
if(sides[i] == 0){
ok = false;
break;
}
}
if(!ok) {
if (flag) {
if(yo(x_1-1, y_1-2)){
//0
sides[0] = arr[y_1-2][x_1-1];
} else if(yo(x_1-1, y_1-3)){
//0
sides[0] = arr[y_1-3][x_1-1];
}
if(yo(x_1+1, y_1-2)){
//2
sides[2] = arr[y_1-2][x_1+1];
} else if(yo(x_1+1, y_1-3)){
//2
sides[2] = arr[y_1-3][x_1+1];
}
} else {
}
}
break;
}
}
}
int u = hsh();
mm[t] = u;
auto it = m.find(u);
if (it==m.end()) {
vector<int> u1 = {t};
m[u] = u1;
}
else {
(*it).second.push_back(t);
}
}
for (int i = 0; i<n; i++) {
vector<int> u1 = (*(m.find(mm[i]))).second;
if (u1.size()>1) {
for (int p = 0; p<u1.size(); p++) {
int u2 = u1[p];
if (u2!=i) {
cout << (1+u2);
if (p!=u1.size()-1 && !(p==u1.size()-2 && u1[p+1]==i)) {
cout << ' ';
}
}
}
}
else {
cout << '-';
}
cout << '\n';
}
}

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
...

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
-
-