CSES - Datatähti 2021 alku

CSES - Datatähti 2021 alku - Results

Submission details
Task:	Ratsun reitit
Sender:	T
Submission time:	2020-10-08 02:43:06 +0300
Language:	C++11
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	WRONG ANSWER	0.01 s	1, 2, 3	details
#2	WRONG ANSWER	0.01 s	1, 2, 3	details
#3	WRONG ANSWER	0.01 s	1, 2, 3	details
#4	WRONG ANSWER	0.01 s	1, 2, 3	details
#5	WRONG ANSWER	0.01 s	1, 2, 3	details
#6	WRONG ANSWER	0.01 s	1, 2, 3	details
#7	WRONG ANSWER	0.01 s	1, 2, 3	details
#8	WRONG ANSWER	0.01 s	2, 3	details
#9	WRONG ANSWER	0.01 s	2, 3	details
#10	WRONG ANSWER	0.01 s	2, 3	details
#11	WRONG ANSWER	0.01 s	3	details
#12	WRONG ANSWER	0.01 s	3	details
#13	WRONG ANSWER	0.01 s	3	details

Code

/**
 * Datat?hti 2021 alku
 * Arpakuutiot/Dice
 * @author TRS
 */
//Include
#include <bits/stdc++.h>
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <utility>
#include <list>
#include <queue>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <regex>
#include <iterator>
//Definitions
using namespace std;
using ll = long long;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<pii> vpii;
#define pb push_back
#define mp make_pair
#define mt make_tuple
//Constants
#define infinity 0x3f3f3f3f
#define linfinity 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007
const int MX = 21;
int dice[MX][5][5];
int answer[MX][MX];
int n;
int checkDice(int a1[4], int a2[4]) {
    if (a1[0] == a2[0] && a1[1] == a2[1] && a1[2] == a2[2] && a1[3] == a2[3]) {
        return 1;
    } 
    if (a1[0] == a2[1] && a1[1] == a2[2] && a1[2] == a2[3] && a1[3] == a2[0]) {
        return 1;
    }  
    if (a1[0] == a2[2] && a1[1] == a2[3] && a1[2] == a2[0] && a1[3] == a2[1]) {
        return 1;
    }  
    if (a1[0] == a2[3] && a1[1] == a2[0] && a1[2] == a2[1] && a1[3] == a2[2]) {
        return 1;
    } 
    return 0;
}
int result(int dice1[5][5], int dice2[5][5]) {
	int d1[7] = {0, dice1[0][0], dice1[0][1], dice1[0][2], dice1[1][1], dice1[2][1], dice1[3][1]};
	int d2[7] = {0, dice2[0][0], dice2[0][1], dice2[0][2], dice2[1][1], dice2[2][1], dice2[3][1]};
    int d2side[4] = {d2[2], d2[4], d2[5], d2[6]};
    if (d1[1] == d2[1]) {
        if (d1[3] != d2[3]) {
            return 0;
        }
        int d1side[4] = {d1[2], d1[4], d1[5], d1[6]};
        return checkDice(d1side, d2side);
    }
    if (d1[2] == d2[1]) {
        if (d1[5] != d2[3]) {
            return 0;
        }
        int d1side[4] = {d1[1], d1[6], d1[3], d1[4]};
        return checkDice(d1side, d2side);
    }
    if (d1[3] == d2[1]) {
        if (d1[1] != d2[3]) {
            return 0;
        }
        int d1side[4] = {d1[2], d1[6], d1[5], d1[4]};
        return checkDice(d1side, d2side);
    }
    if (d1[4] == d2[1]) {
        if (d1[6] != d2[3]) {
            return 0;
        }
        int d1side[4] = {d1[1], d1[2], d1[3], d1[5]};
        return checkDice(d1side, d2side);
    }
    if (d1[5] == d2[1]) {
        if (d1[2] != d2[3]) {
            return 0;
        }
        int d1side[4] = {d1[1], d1[4], d1[3], d1[6]};
        return checkDice(d1side, d2side);
    }
    if (d1[6] == d2[1]) {
        if (d1[4] != d2[3]) {
            return 0;
        }
        int d1side[4] = {d1[1], d1[5], d1[3], d1[2]};
        return checkDice(d1side, d2side);
    }
    return 0;
}
void convertDice(int d[5][5]) {
    int d0[5][5];
    int minRow = 5, minColumn = 5, maxRow = 0, maxColumn = 0;
    for (int i = 0; i < 5; i++) {
        for (int j = 0; j < 5; j++) {
            d0[i][j] = 0;
            if (d[i][j] != 0) {
                if (i < minRow) {
                    minRow = i;
                }
                if (i > maxRow) {
                    maxRow = i;
                }
                if (j < minColumn) {
                    minColumn = j;
                }
                if (j > maxColumn) {
                    maxColumn = j;
                }
            }
        }
    }
    if (maxRow - minRow < maxColumn - minColumn) {
        for (int i = minRow; i <= maxRow; i++) {
            for (int j = minColumn; j <= maxColumn; j++) {
                d0[j - minColumn][2 - i + minRow] = d[i][j];
            }
        }
    }
    else {
        for (int i = minRow; i <= maxRow; i++) {
            for (int j = minColumn; j <= maxColumn; j++) {
                d0[i - minRow][j - minColumn] = d[i][j];
            }
        }
    }
    for (int i = 0; i < 4; i++) {
        if (d0[i][1] == 0) {
            d0[i][1] = d0[i][0] + d0[i][2];
            d0[i][0] = d0[i][2] = 0;
        }
    }
    for (int j = 0; j < 3; j++) {
        if (d0[0][j] == 0) {
            d0[0][j] = d0[1][j] + d0[2][j] + d0[3][j];
            d0[1][j] = d0[2][j] = d0[3][j] = 0;
        }
    }
    for (int i = 0; i < 5; i++) {
        for (int j = 0; j < 5; j++) {
            d[i][j] = d0[i][j];
        }
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n;
	for (int i = 0; i < n; i++) {
        for (int j = 0; j < 5; j++) {
            for (int k = 0; k < 5; k++) {
                dice[i][j][k] = 0;
                char c = getchar();
                if (c < '7' && c > '0') { 
                    dice[i][j][k] = c - '0';
                }
            }
            getchar();
        }
        //convertDice(dice[i]);
        getchar();
	}
	for (int i = 0; i < n; i++) {
        answer[i][i] = 0;
        for (int j = i + 1; j < n; j++) {
            answer[i][j] = result(dice[i], dice[j]);
            answer[j][i] = answer[i][j];
        }
	}
	for (int i = 0; i < n; i++) {
        int similar = 0;
        for (int j = 0; j < n; j++) {
            if (answer[i][j]) {
                if (similar) {
                    putchar(' ');
                }
                printf("%d", j + 1);
                similar = 1;
            }
        }
        if (!similar) {
            putchar('-');
        }
        putchar('\n');
	}
}

Test details

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`4` view save

correct output
`0 3 2 5 3 4 1 2 2 1 4 3 5 2 3 2` view save

user output
`2 3 4 1 3 4 1 2 4 1 2 3` view save

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`5` view save

correct output
`0 3 2 3 2 3 4 1 2 3 2 1 4 3 2 3 2 3 2 3 2 3 2 3 4` view save

user output
`2 3 4 5 1 3 4 5 1 2 4 5 1 2 3 5 1 2 3 4` view save

Test 3

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`6` view save

correct output
`0 3 2 3 2 3 3 4 1 2 3 4 2 1 4 3 2 3 3 2 3 2 3 4 2 3 2 3 4 3 ...` view save

user output
`2 3 4 5 6 1 3 4 5 6 1 2 4 5 6 1 2 3 5 6 1 2 3 4 6 ...` view save

Test 4

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`7` view save

correct output
`0 3 2 3 2 3 4 3 4 1 2 3 4 3 2 1 4 3 2 3 4 3 2 3 2 3 4 3 2 3 2 3 4 3 4 ...` view save

user output
`2 3 4 5 6 7 1 3 4 5 6 7 1 2 4 5 6 7 1 2 3 5 6 7 1 2 3 4 6 7 ...` view save

Test 5

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`8` view save

correct output
`0 3 2 3 2 3 4 5 3 4 1 2 3 4 3 4 2 1 4 3 2 3 4 5 3 2 3 2 3 4 3 4 2 3 2 3 4 3 4 5 ...` view save

user output
`2 3 4 5 6 7 8 1 3 4 5 6 7 8 1 2 4 5 6 7 8 1 2 3 5 6 7 8 1 2 3 4 6 7 8 ...` view save

Test 6

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`9` view save

correct output
`0 3 2 3 2 3 4 5 4 3 4 1 2 3 4 3 4 5 2 1 4 3 2 3 4 5 4 3 2 3 2 3 4 3 4 5 2 3 2 3 4 3 4 5 4 ...` view save

user output
`2 3 4 5 6 7 8 9 1 3 4 5 6 7 8 9 1 2 4 5 6 7 8 9 1 2 3 5 6 7 8 9 1 2 3 4 6 7 8 9 ...` view save

Test 7

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`10` view save

correct output
`0 3 2 3 2 3 4 5 4 5 3 4 1 2 3 4 3 4 5 6 2 1 4 3 2 3 4 5 4 5 3 2 3 2 3 4 3 4 5 6 2 3 2 3 4 3 4 5 4 5 ...` view save

user output
`2 3 4 5 6 7 8 9 10 1 3 4 5 6 7 8 9 10 1 2 4 5 6 7 8 9 10 1 2 3 5 6 7 8 9 10 1 2 3 4 6 7 8 9 10 ...` view save

Test 8

Group: 2, 3

Verdict: WRONG ANSWER

input
`25` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
`2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

Test 9

Group: 2, 3

Verdict: WRONG ANSWER

input
`49` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
`2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

Test 10

Group: 2, 3

Verdict: WRONG ANSWER

input
`50` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
`2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

Test 11

Group: 3

Verdict: WRONG ANSWER

input
`75` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
`2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

Test 12

Group: 3

Verdict: WRONG ANSWER

input
`99` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
`2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

Test 13

Group: 3

Verdict: WRONG ANSWER

input
`100` view save

correct output
`0 3 2 3 2 3 4 5 4 5 6 7 6 7 8 ...` view save

user output
`2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

Datatähti 2021 alku

Ratsun reitit

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Tasks

Submissions (T)