— Dark mode

Datatähti 2021 alku

Arpakuutiot

  • Start: 2020-09-28 00:00:00
  • End: 2020-10-12 00:00:00
Submission details
Task:Arpakuutiot
Sender:Mahtimursu
Submission time:2020-09-29 12:15:05 +0300
Language:C++ (C++11)
Status:READY
Result:35
Feedback
groupverdictscore
#1ACCEPTED35
#20
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
#200.01 s2details
#21ACCEPTED0.01 s2details
#22ACCEPTED0.01 s2details
#230.01 s2details
#240.01 s2details
#25ACCEPTED0.01 s2details
#260.01 s2details
#270.01 s2details
#28ACCEPTED0.01 s2details
#29ACCEPTED0.01 s2details
#30ACCEPTED0.01 s2details
#31ACCEPTED0.01 s1, 2details

Code

#include <bits/stdc++.h>

typedef long long ll;

#define M 1000000007

using namespace std;

struct Dice {
    char top = 1, left = 1, bottom = 1, right = 1, back = 1, val = 1;
};

string field[5];

void print(Dice d) {
    cout << "  " << d.top << endl;
    cout << d.left << " " << d.val << " " << d.right << endl;
    cout << "  " << d.bottom << endl;
    cout << "  " << d.back << endl;
}

bool eq(Dice d1, Dice d2) {
    if (d1.back != d2.back) return false;

    vector<char> d1or;
    vector<char> d2or;

    d1or.push_back(d1.top);
    d1or.push_back(d1.left);
    d1or.push_back(d1.bottom);
    d1or.push_back(d1.right);

    d2or.push_back(d2.top);
    d2or.push_back(d2.left);
    d2or.push_back(d2.bottom);
    d2or.push_back(d2.right);

    for (int rot = 0; rot < 4; ++rot) {
        for (int i = 0; i <= 4; ++i) {
            if (i == 4) return true;
            if (d1or[i] != d2or[(i + rot) % 4]) break;
        }
    }

    return false;
}

Dice rotaten(Dice d, char target) {
    Dice ret;
    ret = d;
    if (d.val == target) return ret;
    else if (d.top == target) {
        ret.top = d.back;
        ret.back = d.bottom;
        ret.bottom = d.val;
        ret.val = target;
    } else if (d.back == target) {
        int t = d.top;
        ret.top = d.bottom;
        ret.bottom = t;

        ret.back = d.val;
        ret.val = target;
    } else if (d.bottom == target) {
        ret.bottom = d.back;
        ret.back = d.top;
        ret.top = d.val;
        ret.val = target;
    } else if (d.left == target) {
        ret.left = d.back;
        ret.back = d.right;
        ret.right = d.val;
        ret.val = target;
    } else {
        ret.right = d.back;
        ret.back = d.left;
        ret.left = d.val;
        ret.val = target;
    }
    return ret;
}

Dice ho4row() {
    int row = 0;
    int scol = 5;

    for (int i = 0; i < 5; ++i) {
        int cnt = 0;
        for (int j = 0; j < 5; ++j) {
            if (field[i][j] != '.') {
                cnt++;
                scol = min(scol, j);
            }
        }
        if (cnt == 4) {
            row = i;
            break;
        }
    }

    Dice d;

    vector<char> r;

    for (int i = scol; i < scol + 4; i++) {
        r.push_back(field[row][i]);
    }

    d.val = r[0];
    d.right = r[1];
    d.back = r[2];
    d.left = r[3];

    for (int i = 0; i < 5; ++i) {
        if (field[row-1][i] != '.') {
            d.top = field[row-1][i];
        }
        if (field[row+1][i] != '.') {
            d.bottom = field[row+1][i];
        }
    }

    

    return d;
}

Dice ho3row() {
    int row = 0;
    int scol = 5;

    for (int i = 0; i < 5; ++i) {
        int cnt = 0;
        scol = 5;
        for (int j = 0; j < 5; ++j) {
            if (field[i][j] != '.') {
                cnt++;
                scol = min(scol, j);
            }
        }
        if (cnt == 3) {
            row = i;
            break;
        }
    }

    // Special case where theres double 3-line

    int cnt = 0;

    for (int j = 0; j < 5; ++j) {
        if (field[row+1][j] != '.') {
            cnt++;
        }
    }

    if (cnt == 3) {
        // Is first lower
        /*
        .....
        345..
        ..126
        .....
        .....
        */
        Dice d;
        if (scol == 2) {
            d.top = field[row][scol];
            d.val = field[row+1][scol];
            d.right = field[row][scol+1];
            d.bottom = field[row][scol+2];
            d.left = field[row+1][scol-1];
            d.back = field[row+1][scol-2];
        } else {
            d.bottom = field[row][scol];
            d.left = field[row][scol+1];
            d.top = field[row][scol+2];
            d.val = field[row+1][scol+2];
            d.right = field[row+1][scol+3];
            d.back = field[row+1][scol+4];
        }
        return d;
    }
    

    Dice d;

    vector<char> r;

    for (int i = scol; i < scol + 3; i++) {
        r.push_back(field[row][i]);
    }

    

    d.val = r[0];
    d.right = r[1];
    d.back = r[2];

    for (int i = scol; i < scol + 3; ++i) {
        if (field[row-1][i] != '.') {
            d.top = field[row-1][i];
            r.push_back(field[row-1][i]);
        }
        if (field[row+1][i] != '.') {
            d.bottom = field[row+1][i];
            r.push_back(field[row+1][i]);
        }
    }

    sort(r.begin(), r.end());

    /*for (char c : r) {
        cout << c << endl;
    }
*/
    char c = '1';

    int i = 0;
    while (r[i] == c) {
        i++;
        c++;
    }

    d.left = c;

    

    return d;
}

Dice ve4row() {

    int col = 0;
    int srow = 5;

    for (int i = 0; i < 5; ++i) {
        int cnt = 0;
        srow = 5;

        for (int j = 0; j < 5; ++j) {
            if (field[j][i] != '.') {
                cnt++;
                srow = min(srow, j);
            }
        }

        if (cnt == 4) {
            col = i;
            break;
        }
    }

    Dice d;

    vector<char> r;

    for (int i = srow; i < srow + 4; i++) {
        r.push_back(field[i][col]);
    }

    d.val = r[0];
    d.right = r[1];
    d.back = r[2];
    d.left = r[3];

    for (int i = 0; i < 5; ++i) {
        if (field[i][col-1] != '.') {
            d.bottom = field[i][col-1];
        } 
        if (field[i][col+1] != '.') {
            d.top = field[i][col+1];
            
        }
    }

    return d;

}

Dice ve3row() {
    int col = 0;
    int srow = 5;

    for (int i = 0; i < 5; ++i) {
        int cnt = 0;
        srow = 5;

        for (int j = 0; j < 5; ++j) {
            if (field[j][i] != '.') {
                cnt++;
                srow = min(srow, j);
            }
        }

        if (cnt == 3) {
            col = i;
            break;
        }
    }

    // Check for double 3-line

    int cnt = 0;

    for (int j = 0; j < 5; ++j) {
        if (field[j][col+1] != '.') {
            cnt++;
        }
    }

    if (cnt == 3) {
        // Is first lower
        Dice d;
        if (srow == 2) {
            d.val = field[srow][col];
            d.right = field[srow][col+1];
            d.top = field[srow-1][col+1];
            d.left = field[srow-2][col+1];
            d.bottom = field[srow+1][col];
            d.back = field[srow+2][col];
        } else {
            d.right = field[srow][col];
            d.top = field[srow+1][col];
            d.left = field[srow+2][col];
            d.val = field[srow+2][col+1];
            d.bottom = field[srow+3][col+1];
            d.back = field[srow+4][col+1];
        }
        return d;
    }

    Dice d;

    vector<char> r;
    for (int i = srow; i < srow + 3; i++) {
        r.push_back(field[i][col]);
    }

    
    d.val = r[0];
    d.right = r[1];
    d.back = r[2];

    

    for (int i = srow; i < srow + 3; ++i) {
        if (field[i][col-1] != '.') {
            d.bottom = field[i][col-1];
            r.push_back(field[i][col-1]);
        } 
        if (field[i][col+1] != '.') {
            d.top = field[i][col+1];
            r.push_back(field[i][col+1]);
        }
    }

    sort(r.begin(), r.end());

    char c = '1';

    int i = 0;
    while (r[i] == c) {
        i++;
        c++;
    }

    d.left = c;

    

    return d;

}

Dice special() {
    // Handle case where layout is 
    /*
    XX...
    .XX..
    ..XX.
    .....
    .....
    */
    // or
    /*
    ...XX
    ..XX.
    .XX..
    .....
    .....
    */
    bool typeA = true;

    int x = 0, y = 0;
    bool found = false;
    for (int i = 0; i < 5; ++i) {
        if (found) break;
        for (int j = 0; j < 5; ++j) {
            if (field[i][j] != '.') {
                y = i;
                x = j;
                found = true;
                break;
            }
        }
    }

    if (x == 3 || field[y+1][x+1] == '.') {
        typeA = false;
    }

    Dice d;
    if (typeA) {
        d.val = field[y+1][x+1];
        d.top = field[y][x+1];
        d.left = field[y][x];
        d.right = field[y+1][x+2];
        d.bottom = field[y+2][x+2];
        d.back = field[y+2][x+3];

        vector<char> vals = {d.val, d.top, d.bottom, d.left, d.right, d.back};
    sort(vals.begin(), vals.end());
    char look = '1';
    for (char i = 0; i <= 5; ++i) {
        if (vals[i] != look) {
            exit(-1);
        }
        look++;
    }

    } else {
        d.val = field[y+1][x];
        d.top = field[y][x];
        d.left = field[y+1][x-1];
        d.right = field[y][x+1];
        d.bottom = field[y+2][x-1];
        d.back = field[y+2][x-2];
    }

    

    return d;
}

Dice parse() {
    

    for (int i = 0; i < 5; ++i) {
        cin >> field[i];
    }

    // Max horizontal row

    int hmx = 0;

    for (int i = 0; i < 5; ++i) {
        int streak = 0;
        for (int j = 0; j < 5; ++j) {
            if (field[i][j] != '.') streak++;
            else {
                hmx = max(hmx, streak);
                streak = 0;
            }
        }
        hmx = max(hmx, streak);
    }

    int vmx = 0;

    for (int i = 0; i < 5; ++i) {
        int streak = 0;
        for (int j = 0; j < 5; ++j) {
            if (field[j][i] != '.') streak++;
            else {
                vmx = max(vmx, streak);
                streak = 0;
            }
        }
        vmx = max(vmx, streak);
    }

    if (hmx == 4) {
        return ho4row();
    } else if (vmx == 4) {
        return ve4row();
    } else if (hmx == 3) {
        return ho3row();
    } else if (vmx == 3) {
        return ve3row();
    }
    
    return special();
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;

    vector<Dice> d;

	for (int i = 0; i < n; ++i) {
        d.push_back(rotaten(parse(), '1'));
        //print(d[i]);
	}

    /*for (Dice x : d) {
        vector<char> vals = {x.val, x.top, x.bottom, x.left, x.right, x.back};
    sort(vals.begin(), vals.end());
    char look = '1';
    for (char i = 0; i <= 5; ++i) {
        if (vals[i] != look) {
            exit(-1);
        }
        look++;
    }
    }*/

    /*for (int i = 0; i < n; ++i) {
        print(d[i]);
        cout << endl;
    }*/

    for (int i = 0; i < n; ++i) {
        vector<int> e;
        for (int j = 0; j < n; ++j) {
            if (j == i) continue;
            if (eq(d[i], d[j])) {
                e.push_back(j+1);
            }
        }
        if (e.size() == 0) {
            cout << "-" << endl;
        } else {
            for (int val : e) {
                cout << val << " ";
            }
            cout << endl;
        }
    }

	return 0;
}

Test details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
3
165..
.4...
.3...
.2...
...
view save

correct output
3
-
1
view save

user output
3 
-
1 
view save

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
5
264..
.5...
.3...
.1...
...
view save

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

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

Test 3

Group: 1, 2

Verdict: ACCEPTED

input
5
152..
.4...
.3...
.6...
...
view save

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

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

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
5
142..
.6...
.3...
.5...
...
view save

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

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

Test 5

Group: 1, 2

Verdict: ACCEPTED

input
5
123..
.4...
.6...
.5...
...
view save

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

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

Test 6

Group: 1, 2

Verdict: ACCEPTED

input
5
213..
.6...
.4...
.5...
...
view save

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

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

Test 7

Group: 1, 2

Verdict: ACCEPTED

input
5
314..
.5...
.2...
.6...
...
view save

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

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

Test 8

Group: 1, 2

Verdict: ACCEPTED

input
5
163..
.2...
.5...
.4...
...
view save

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

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

Test 9

Group: 1, 2

Verdict: ACCEPTED

input
5
264..
.1...
.3...
.5...
...
view save

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

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

Test 10

Group: 1, 2

Verdict: ACCEPTED

input
5
214..
.3...
.5...
.6...
...
view save

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

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

Test 11

Group: 2

Verdict: ACCEPTED

input
10
.41..
.5...
.2...
36...
...
view save

correct output
9
4 6 8
7 10
2 6 8
-
...
view save

user output
9 
4 6 8 
7 10 
2 6 8 
-
...
view save

Test 12

Group: 2

Verdict: ACCEPTED

input
10
5....
1436.
.2...
.....
...
view save

correct output
5 8
6 10
4 7 9
3 7 9
1 8
...
view save

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

Test 13

Group: 2

Verdict: ACCEPTED

input
10
2....
41...
.63..
.5...
...
view save

correct output
4 9 10
5 6 7 8
-
1 9 10
2 6 7 8
...
view save

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

Test 14

Group: 2

Verdict: ACCEPTED

input
10
1....
634..
..52.
.....
...
view save

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

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

correct output
5 7 9 10
8
4 6
3 6
1 7 9 10
...
view save

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

Test 16

Group: 2

Verdict: ACCEPTED

input
10
.56..
.2...
.4...
31...
...
view save

correct output
4 9
3 5 10
2 5 10
1 9
2 3 10
...
view save

user output
4 9 
3 5 10 
2 5 10 
1 9 
2 3 10 
...
view save

Test 17

Group: 2

Verdict: ACCEPTED

input
10
..62.
.31..
45...
.....
...
view save

correct output
2 3 4 8
1 3 4 8
1 2 4 8
1 2 3 8
6 7 9 10
...
view save

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

correct output
3 8 9
5 6
1 8 9
7 10
2 6
...
view save

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

Test 19

Group: 2

Verdict: ACCEPTED

input
10
.64..
.1...
.3...
52...
...
view save

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

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:

input
10
.4...
326..
.1...
.5...
...
view save

correct output
4 7 8
6 9 10
5
1 7 8
3
...
view save

user output
(empty)

Test 21

Group: 2

Verdict: ACCEPTED

input
20
.6...
.4...
31...
.25..
...
view save

correct output
3 7 11 16
6
1 7 11 16
5 19
4 19
...
view save

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

correct output
7 10 11 17 20
12
4 9 13 15 18
3 9 13 15 18
8 14 16
...
view save

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:

input
20
42...
.316.
.5...
.....
...
view save

correct output
5 12 13 15 18
16 20
6 8 14
9 19
1 12 13 15 18
...
view save

user output
(empty)

Test 24

Group: 2

Verdict:

input
20
..5..
.623.
41...
.....
...
view save

correct output
2 6 11 12 13
1 6 11 12 13
5 16 18
7 14
3 16 18
...
view save

user output
2 11 12 13 
1 11 12 13 
5 16 18 
7 14 
3 16 18 
...
Truncated

Test 25

Group: 2

Verdict: ACCEPTED

input
20
.46..
53...
.1...
.2...
...
view save

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

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:

input
20
.61..
.4...
35...
.2...
...
view save

correct output
8 10 20
3 17 18 19
2 17 18 19
14 15
6 7 9 13
...
view save

user output
8 10 20 
3 17 18 19 
2 17 18 19 
14 15 
6 7 13 
...
Truncated

Test 27

Group: 2

Verdict:

input
20
..2..
1463.
.5...
.....
...
view save

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

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

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

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

correct output
5 8 9 14 17
3 10 16
2 10 16
13 15 19
1 8 9 14 17
...
view save

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

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

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

correct output
-
-
view save

user output
-
-
view save

Tasks

A Sanalista-B Ratsun reitit-C Alitaulukot-D 2021-luvut-E Arpakuutiot-

Submissions (Mahtimursu)

2020-09-29 16:11:31 1002020-09-29 16:05:59 352020-09-29 16:05:45 352020-09-29 16:05:09 352020-09-29 16:04:36 352020-09-29 12:30:32 352020-09-29 12:27:32 352020-09-29 12:25:59 352020-09-29 12:20:23 352020-09-29 12:17:11 352020-09-29 12:15:05 352020-09-29 12:12:37 352020-09-29 12:11:49 352020-09-29 12:10:15 352020-09-29 12:01:51 352020-09-29 12:00:33 352020-09-29 11:44:26 352020-09-29 11:44:06 352020-09-29 11:43:12 352020-09-29 11:42:48 352020-09-29 11:42:26 2020-09-29 11:40:45 352020-09-29 11:40:08 352020-09-29 11:37:36 352020-09-29 11:37:05 02020-09-29 00:31:52 352020-09-29 00:31:23 352020-09-29 00:19:15 352020-09-29 00:10:22 352020-09-28 23:45:53 02020-09-28 23:34:37 02020-09-28 17:00:41 02020-09-28 15:20:24 352020-09-28 15:05:03 02020-09-28 14:52:10 02020-09-28 14:35:19 02020-09-28 14:35:02 02020-09-28 14:27:30 02020-09-28 14:13:54 0