QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#355980#6432. Puzzle in InazumaPorNPtreeRE 9ms4728kbC++145.4kb2024-03-17 14:23:112024-03-17 14:23:13

Judging History

你现在查看的是最新测评结果

  • [2024-03-17 14:23:13]
  • 评测
  • 测评结果:RE
  • 用时:9ms
  • 内存:4728kb
  • [2024-03-17 14:23:11]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

const int N = 105;

int n, a[N][N];
vector< pair< pair< pair<int, int>, pair<int, int> >, int> > res;

void input()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) {
        for (int j = i + 1; j <= n; ++j) {
            scanf("%d", &a[i][j]);
        }
    }
    int s = 0;
    for (int i = 1; i <= n; ++i) {
        for (int j = i + 1; j <= n; ++j) {
            int x;
            scanf("%d", &x);
            a[i][j] = x - a[i][j];
            a[j][i] = a[i][j];
            s += a[i][j];
        }
    }
    if (s) {
        puts("-1");
        exit(0);
    }
    return;
}

void add(int a, int b, int c, int d, int e)
{
    res.push_back({{{a, b}, {c, d}}, e});
    e = -e;
    ::a[a][b] += e, ::a[a][c] += e, ::a[a][d] += e;
    ::a[b][c] -= e, ::a[b][d] -= e, ::a[c][d] -= e;
    ::a[b][a] += e, ::a[c][a] += e, ::a[d][a] += e;
    ::a[c][b] -= e, ::a[d][b] -= e, ::a[d][c] -= e;
    return;
}

void tmodify(int a, int b, int c, int d, int e, int v)
{
    add(d, a, b, e, v);
    add(d, a, b, c, -v);
    add(e, a, c, d, -v);
    add(e, a, b, c, v);
    return;
}

void modify(int a, int b, int c, int d, int e, int f, int v)
{
    tmodify(a, b, c, d, e, v);
    tmodify(a, b, c, f, e, -v);
    return;
}

void modify(int a, int d, int f, int v)
{
    int b = 0, c = 0, e = 0;
    for (int i = 1; i <= n; ++i) {
        if (i != a && i != d && i != f) {
            if (!b) {
                b = i;
            } else if (!c) {
                c = i;
            } else if (!e) {
                e = i;
            }
        }
    }
    if (n == 5) {
        e = c, c = b, b = f;
        assert(!(v & 1));
        v = -v / 2;
        tmodify(a, b, c, d, e, v);
        tmodify(a, b, e, d, c, v);
        return;
    }
    modify(a, b, c, d, e, f, v);
    return;
}

void print()
{
    printf("%d\n", (int)res.size());
    for (int i = 0; i < (int)res.size(); ++i) {
        printf("%d %d %d %d %d\n", res[i].first.first.first, res[i].first.first.second, res[i].first.second.first, res[i].first.second.second, res[i].second);
    }
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            assert(!a[i][j]);
        }
    }
    return;
}

int b[N][N];

signed main()
{
    input();
    if (n >= 6) {
        for (int i = 1; i <= n; ++i) {
            for (int j = i + 1; j <= n; ++j) {
                if (a[i][j]) {
                    int z = -1;
                    for (int k = i + 1; k <= n; ++k) {
                        if (k != i && k != j) {
                            z = k;
                            break;
                        }
                    }
                    modify(j, i, z, a[i][j]);
                }
            }
        }
        print();
    } else if (n == 5) {
        for (int z = 0; z < 1024; ++z) {
            for (int i = 1; i <= n; ++i) {
                for (int j = 1; j <= n; ++j) {
                    b[i][j] = a[i][j];
                }
            }
            res.clear();
            int C = 0;
            for (int i = 1; i <= n; ++i) {
                for (int j = 1; j <= n; ++j) {
                    if (j != i) {
                        int ta = 0, tb = 0, tc = 0;
                        for (int k = 1; k <= n; ++k) {
                            if (k != i && k != j) {
                                if (!ta) {
                                    ta = k;
                                } else if (!tb) {
                                    tb = k;
                                } else if (!tc) {
                                    tc = k;
                                }
                            }
                        }
                        add(i, ta, tb, tc, (z >> (C++)) & 1);
                    }
                }
            }
            int flag = 1;
            for (int i = 1; i <= n; ++i) {
                for (int j = 1; j <= n; ++j) {
                    flag &= !(a[i][j] & 1);
                }
            }
            if (!flag) {
                for (int i = 1; i <= n; ++i) {
                    for (int j = 1; j <= n; ++j) {
                        a[i][j] = b[i][j];
                    }
                }
                continue;
            }
            for (int i = 1; i <= n; ++i) {
                for (int j = i + 1; j <= n; ++j) {
                    if (a[i][j]) {
                        int z = -1;
                        for (int k = i + 1; k <= n; ++k) {
                            if (k != i && k != j) {
                                z = k;
                                break;
                            }
                        }
                        modify(j, i, z, a[i][j]);
                    }
                }
            }
            print();
        }
        puts("-1");
    } else {
        if (a[1][2] + a[3][4] || a[1][3] + a[2][4] || a[1][4] + a[2][3]) {
            puts("-1");
        } else {
            if (((a[1][2] + a[1][3]) & 1) || ((a[1][2] + a[1][4]) & 1) || ((a[1][3] + a[1][4]) & 1)) {
                puts("-1");
            } else {
                add(2, 1, 3, 4, -(a[1][3] + a[1][4]) / 2);
                add(3, 1, 2, 4, -(a[1][2] + a[1][4]) / 2);
                add(4, 1, 2, 3, -(a[1][2] + a[1][3]) / 2);
                print();
            }
        }
    }
    return 0;
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3940kb

input:

4
0 1 1
0 0
1
1 0 0
1 1
0

output:

3
2 1 3 4 1
3 1 2 4 0
4 1 2 3 0

result:

ok n=4

Test #2:

score: 0
Accepted
time: 0ms
memory: 3848kb

input:

4
3 3 3
0 0
0
0 0 0
3 3
3

output:

3
2 1 3 4 3
3 1 2 4 3
4 1 2 3 3

result:

ok n=4

Test #3:

score: 0
Accepted
time: 0ms
memory: 3748kb

input:

5
-12 15 -12 1
37 14 7
7 9
-11
12 5 1 13
-1 -4 -7
-5 -9
18

output:

-1

result:

ok n=5

Test #4:

score: 0
Accepted
time: 0ms
memory: 3824kb

input:

4
37 81 -38
-79 -8
-42
20 -55 80
-23 -43
37

output:

-1

result:

ok n=4

Test #5:

score: 0
Accepted
time: 0ms
memory: 3576kb

input:

5
-22 63 -23 7
-11 36 66
66 -77
36
-87 -17 95 -65
-93 53 63
-54 -56
-77

output:

-1

result:

ok n=5

Test #6:

score: 0
Accepted
time: 0ms
memory: 3620kb

input:

6
-59 77 100 -28 -80
-14 -19 34 0
-8 34 44
58 38
7
87 -53 -57 -79 86
-19 -97 -51 -29
42 -14 61
-6 25
-24

output:

-1

result:

ok n=6

Test #7:

score: 0
Accepted
time: 0ms
memory: 3836kb

input:

10
96 -62 71 43 -41 62 37 -17 -73
-51 55 89 63 -17 81 98 78
-96 -70 -16 78 -63 49 86
20 -76 -21 8 -32 16
-93 45 -65 99 65
9 81 47 -2
-50 94 2
29 -77
77
67 -91 -97 -13 -75 -8 -79 21 -86
-44 -55 -92 19 -62 47 25 -88
-89 -10 1 94 -61 78 -70
8 30 -54 -9 19 -60
35 -21 -79 40 92
-56 -12 -56 2
-38 23 -31
2...

output:

-1

result:

ok n=10

Test #8:

score: 0
Accepted
time: 1ms
memory: 3828kb

input:

30
79 75 -71 -8 36 26 -38 -45 43 44 64 52 -23 -64 -73 97 -79 70 24 58 -9 11 14 58 -95 -88 -10 -80 -47
20 -55 86 89 -39 15 26 -32 38 -23 -30 -12 -4 81 39 -13 -43 -11 -38 -70 14 32 -67 -54 38 -80 -80 97
-49 -92 53 -94 -60 -77 -80 -11 75 51 43 52 -28 58 -26 71 -85 66 96 -61 52 -100 -49 93 92 -37 62
-55...

output:

-1

result:

ok n=30

Test #9:

score: 0
Accepted
time: 0ms
memory: 3644kb

input:

50
-47 49 10 46 -54 -70 -39 36 -1 100 -78 -27 23 43 15 -21 71 48 -82 95 85 -11 -99 35 -44 -31 70 -94 12 -45 -81 75 62 89 14 85 -82 -25 2 5 54 -25 -96 -30 -12 -70 13 -51 15
-48 -13 -53 49 19 -62 -15 -99 54 29 17 67 31 -58 80 -2 -97 -40 59 64 84 15 -32 76 -18 35 76 68 -69 47 51 -26 64 -70 71 14 -3 47 ...

output:

-1

result:

ok n=50

Test #10:

score: 0
Accepted
time: 1ms
memory: 3752kb

input:

100
-25 31 38 48 -19 32 87 -10 -30 -88 -79 98 -99 56 -52 -86 -89 51 77 -36 -52 72 -78 48 30 42 -45 84 -75 -71 -83 -48 92 -44 6 -83 -87 -82 -17 40 -44 82 64 -90 89 -34 88 10 -26 -84 -51 -29 86 -55 55 78 12 -38 -96 28 -78 52 -30 85 72 79 57 8 71 -68 -81 -21 14 44 -42 -26 42 95 20 -78 18 29 100 39 -19 ...

output:

-1

result:

ok n=100

Test #11:

score: 0
Accepted
time: 0ms
memory: 3632kb

input:

4
75 -69 93
78 24
-61
75 59 80
-50 31
-55

output:

-1

result:

ok n=4

Test #12:

score: 0
Accepted
time: 0ms
memory: 3816kb

input:

4
44 -25 -81
84 8
95
-70 -21 82
32 28
74

output:

-1

result:

ok n=4

Test #13:

score: 0
Accepted
time: 0ms
memory: 3720kb

input:

4
91 -18 -46
-80 -34
38
-25 18 -40
-35 86
-53

output:

-1

result:

ok n=4

Test #14:

score: 0
Accepted
time: 0ms
memory: 3632kb

input:

5
-16 92 -94 -83
-83 16 -74
75 3
-43
-28 45 -63 -100
-11 -39 -80
62 -14
21

output:

-1

result:

ok n=5

Test #15:

score: 0
Accepted
time: 1ms
memory: 3624kb

input:

5
-95 7 -3 76
57 -85 -98
-64 -28
70
5 48 -42 -99
-56 22 21
-51 74
-85

output:

-1

result:

ok n=5

Test #16:

score: 0
Accepted
time: 1ms
memory: 3772kb

input:

5
-10 31 33 -71
33 -49 4
72 -72
65
-74 55 20 41
61 62 -83
50 -1
-95

output:

-1

result:

ok n=5

Test #17:

score: 0
Accepted
time: 0ms
memory: 3764kb

input:

6
65 -33 2 -67 83
40 93 -28 86
54 -30 -11
56 40
-66
82 42 -32 -56 98
1 85 17 45
-12 -3 -50
-39 6
100

output:

112
1 2 4 6 17
1 2 4 5 -17
6 2 5 1 -17
6 2 4 5 17
3 2 4 6 -17
3 2 4 5 17
6 2 5 3 17
6 2 4 5 -17
1 3 4 6 75
1 3 4 5 -75
6 3 5 1 -75
6 3 4 5 75
2 3 4 6 -75
2 3 4 5 75
6 3 5 2 75
6 3 4 5 -75
1 4 3 6 -34
1 4 3 5 34
6 4 5 1 34
6 4 3 5 -34
2 4 3 6 34
2 4 3 5 -34
6 4 5 2 -34
6 4 3 5 34
1 5 3 6 11
1 5 3 4 -...

result:

ok n=6

Test #18:

score: 0
Accepted
time: 1ms
memory: 3964kb

input:

10
-68 -48 27 80 89 -22 -43 34 43
-41 -4 -10 -90 -62 -11 83 22
-64 -77 84 -20 -56 -56 -79
49 -54 90 19 75 6
41 6 -33 -29 -39
45 -27 7 6
-57 93 -53
-46 -85
-37
40 -49 -32 -28 -16 -71 -97 -99 -67
6 34 -65 -97 95 -99 72 -34
81 32 16 -49 -71 61 -83
89 -23 2 35 -20 50
-14 32 83 31 -43
-15 74 -87 22
-56 -...

output:

352
1 2 4 6 108
1 2 4 5 -108
6 2 5 1 -108
6 2 4 5 108
3 2 4 6 -108
3 2 4 5 108
6 2 5 3 108
6 2 4 5 -108
1 3 4 6 -1
1 3 4 5 1
6 3 5 1 1
6 3 4 5 -1
2 3 4 6 1
2 3 4 5 -1
6 3 5 2 -1
6 3 4 5 1
1 4 3 6 -59
1 4 3 5 59
6 4 5 1 59
6 4 3 5 -59
2 4 3 6 59
2 4 3 5 -59
6 4 5 2 -59
6 4 3 5 59
1 5 3 6 -108
1 5 3 4...

result:

ok n=10

Test #19:

score: 0
Accepted
time: 1ms
memory: 4072kb

input:

30
-14 20 -41 -72 25 -17 -90 -2 12 -45 -13 -43 78 -3 15 -25 -5 43 38 -59 -20 -25 29 0 18 -54 49 -13 -88
87 -6 -53 -40 -13 6 -50 -38 -73 -15 95 88 -48 86 96 -63 -2 -49 -85 -19 -44 -11 -94 -51 -68 -71 -40 9
-11 -35 73 6 -10 -67 39 37 6 -3 81 -39 -89 -49 38 17 -25 2 11 -100 22 52 -39 -24 8 -78 13
51 81...

output:

3472
1 2 4 6 -46
1 2 4 5 46
6 2 5 1 46
6 2 4 5 -46
3 2 4 6 46
3 2 4 5 -46
6 2 5 3 -46
6 2 4 5 46
1 3 4 6 -23
1 3 4 5 23
6 3 5 1 23
6 3 4 5 -23
2 3 4 6 23
2 3 4 5 -23
6 3 5 2 -23
6 3 4 5 23
1 4 3 6 6
1 4 3 5 -6
6 4 5 1 -6
6 4 3 5 6
2 4 3 6 -6
2 4 3 5 6
6 4 5 2 6
6 4 3 5 -6
1 5 3 6 97
1 5 3 4 -97
6 5 ...

result:

ok n=30

Test #20:

score: 0
Accepted
time: 3ms
memory: 3940kb

input:

50
-98 59 55 -73 49 29 73 -28 51 -81 77 88 -54 -2 58 6 17 -56 15 66 8 -86 96 -41 -33 93 84 4 -14 18 46 64 3 -73 -3 -65 49 30 35 -84 82 -66 93 83 -46 -42 95 -88 32
82 -2 -69 78 -69 -29 95 -25 -96 23 -78 -2 12 77 -79 65 13 17 69 14 91 82 43 -91 -25 6 8 17 -98 8 17 36 17 -80 91 -3 -35 -88 91 -89 80 25 ...

output:

9752
1 2 4 6 17
1 2 4 5 -17
6 2 5 1 -17
6 2 4 5 17
3 2 4 6 -17
3 2 4 5 17
6 2 5 3 17
6 2 4 5 -17
1 3 4 6 -76
1 3 4 5 76
6 3 5 1 76
6 3 4 5 -76
2 3 4 6 76
2 3 4 5 -76
6 3 5 2 -76
6 3 4 5 76
1 4 3 6 -106
1 4 3 5 106
6 4 5 1 106
6 4 3 5 -106
2 4 3 6 106
2 4 3 5 -106
6 4 5 2 -106
6 4 3 5 106
1 5 3 6 4
1...

result:

ok n=50

Test #21:

score: 0
Accepted
time: 6ms
memory: 4724kb

input:

100
-93 27 9 49 -69 -2 26 37 -10 -52 43 81 96 -10 32 46 -18 13 14 59 -58 3 -68 33 -62 -13 39 93 15 -81 -6 96 -81 -50 77 50 93 95 11 79 86 25 -28 48 77 5 -9 89 9 -62 86 -45 -50 70 -94 75 12 47 73 -26 -83 -29 -28 -70 -31 58 -67 63 47 9 -95 -52 94 -22 -96 -84 16 53 -14 -98 -11 26 -59 -28 -60 -80 -76 -2...

output:

39568
1 2 4 6 147
1 2 4 5 -147
6 2 5 1 -147
6 2 4 5 147
3 2 4 6 -147
3 2 4 5 147
6 2 5 3 147
6 2 4 5 -147
1 3 4 6 63
1 3 4 5 -63
6 3 5 1 -63
6 3 4 5 63
2 3 4 6 -63
2 3 4 5 63
6 3 5 2 63
6 3 4 5 -63
1 4 3 6 80
1 4 3 5 -80
6 4 5 1 -80
6 4 3 5 80
2 4 3 6 -80
2 4 3 5 80
6 4 5 2 80
6 4 3 5 -80
1 5 3 6 -7...

result:

ok n=100

Test #22:

score: 0
Accepted
time: 0ms
memory: 3856kb

input:

4
63 -85 -96
73 -75
-24
-17 1 -24
-83 -8
-13

output:

-1

result:

ok n=4

Test #23:

score: 0
Accepted
time: 1ms
memory: 3688kb

input:

5
25 -22 24 37
-48 67 25
97 -55
57
-82 -44 -25 27
-35 89 81
88 37
71

output:

-1

result:

ok n=5

Test #24:

score: 0
Accepted
time: 1ms
memory: 3760kb

input:

6
-59 84 42 67 72
-51 -86 -37 -2
61 -84 -78
-8 -81
76
61 41 -3 32 -74
30 -39 -37 -13
-23 100 -24
-90 -41
-4

output:

112
1 2 4 6 120
1 2 4 5 -120
6 2 5 1 -120
6 2 4 5 120
3 2 4 6 -120
3 2 4 5 120
6 2 5 3 120
6 2 4 5 -120
1 3 4 6 -43
1 3 4 5 43
6 3 5 1 43
6 3 4 5 -43
2 3 4 6 43
2 3 4 5 -43
6 3 5 2 -43
6 3 4 5 43
1 4 3 6 -45
1 4 3 5 45
6 4 5 1 45
6 4 3 5 -45
2 4 3 6 45
2 4 3 5 -45
6 4 5 2 -45
6 4 3 5 45
1 5 3 6 -35
...

result:

ok n=6

Test #25:

score: 0
Accepted
time: 0ms
memory: 3924kb

input:

7
98 -77 33 -59 44 21
-71 -78 42 82 -60
6 76 96 -18
53 96 1
-72 -53
-86
69 40 -13 -11 63 55
-70 86 -49 -29 -34
-4 -51 67 19
-81 1 70
-77 10
13

output:

160
1 2 4 6 -29
1 2 4 5 29
6 2 5 1 29
6 2 4 5 -29
3 2 4 6 29
3 2 4 5 -29
6 2 5 3 -29
6 2 4 5 29
1 3 4 6 117
1 3 4 5 -117
6 3 5 1 -117
6 3 4 5 117
2 3 4 6 -117
2 3 4 5 117
6 3 5 2 117
6 3 4 5 -117
1 4 3 6 -46
1 4 3 5 46
6 4 5 1 46
6 4 3 5 -46
2 4 3 6 46
2 4 3 5 -46
6 4 5 2 -46
6 4 3 5 46
1 5 3 6 48
1...

result:

ok n=7

Test #26:

score: 0
Accepted
time: 2ms
memory: 4056kb

input:

37
1 -86 11 -63 -41 -21 99 14 28 17 63 66 24 53 2 -79 9 -95 -63 -40 12 -9 -71 90 -33 -13 -22 -36 50 31 -63 -1 7 -35 100 97
-57 -66 60 57 -30 8 32 -95 99 -67 -1 14 -75 83 42 -17 86 90 -33 -52 21 48 12 -69 -37 -25 74 -14 39 -20 65 38 14 -59 89
59 -3 91 76 -16 20 1 -85 51 -23 -24 49 10 -28 -11 -96 16 -...

output:

5288
1 2 4 6 -84
1 2 4 5 84
6 2 5 1 84
6 2 4 5 -84
3 2 4 6 84
3 2 4 5 -84
6 2 5 3 -84
6 2 4 5 84
1 3 4 6 13
1 3 4 5 -13
6 3 5 1 -13
6 3 4 5 13
2 3 4 6 -13
2 3 4 5 13
6 3 5 2 13
6 3 4 5 -13
1 4 3 6 1
1 4 3 5 -1
6 4 5 1 -1
6 4 3 5 1
2 4 3 6 -1
2 4 3 5 1
6 4 5 2 1
6 4 3 5 -1
1 5 3 6 104
1 5 3 4 -104
6 ...

result:

ok n=37

Test #27:

score: 0
Accepted
time: 5ms
memory: 4056kb

input:

71
100 39 36 -14 -71 -95 1 23 -66 -23 58 46 83 67 16 95 -77 21 -87 20 69 -50 -74 -69 90 75 -18 84 -45 63 63 51 34 58 -51 90 -91 -50 -89 58 3 63 56 -58 -51 16 72 -36 36 64 -67 38 42 -93 76 -51 0 21 58 37 -4 26 -22 -12 72 93 -98 51 -11 -47
95 95 -17 -51 67 -38 63 74 52 89 80 -94 37 -18 -73 -32 -94 17 ...

output:

19856
1 2 4 6 -22
1 2 4 5 22
6 2 5 1 22
6 2 4 5 -22
3 2 4 6 22
3 2 4 5 -22
6 2 5 3 -22
6 2 4 5 22
1 3 4 6 49
1 3 4 5 -49
6 3 5 1 -49
6 3 4 5 49
2 3 4 6 -49
2 3 4 5 49
6 3 5 2 49
6 3 4 5 -49
1 4 3 6 -101
1 4 3 5 101
6 4 5 1 101
6 4 3 5 -101
2 4 3 6 101
2 4 3 5 -101
6 4 5 2 -101
6 4 3 5 101
1 5 3 6 99...

result:

ok n=71

Test #28:

score: 0
Accepted
time: 8ms
memory: 4680kb

input:

97
-73 49 60 15 -5 57 94 79 -7 51 -26 -21 -78 -67 31 90 7 46 -75 -82 3 24 -28 81 -77 -100 53 65 6 -63 17 100 13 -19 14 67 -31 7 92 45 61 58 -83 8 65 93 -35 94 97 97 80 -45 63 -15 57 -40 -65 -67 -32 12 -26 -99 32 -62 28 27 -25 52 -45 39 27 -34 78 65 -23 91 -71 -46 5 -36 84 -11 44 44 -74 -62 -91 -75 2...

output:

37120
1 2 4 6 113
1 2 4 5 -113
6 2 5 1 -113
6 2 4 5 113
3 2 4 6 -113
3 2 4 5 113
6 2 5 3 113
6 2 4 5 -113
1 3 4 6 -85
1 3 4 5 85
6 3 5 1 85
6 3 4 5 -85
2 3 4 6 85
2 3 4 5 -85
6 3 5 2 -85
6 3 4 5 85
1 4 3 6 -128
1 4 3 5 128
6 4 5 1 128
6 4 3 5 -128
2 4 3 6 128
2 4 3 5 -128
6 4 5 2 -128
6 4 3 5 128
1 ...

result:

ok n=97

Test #29:

score: 0
Accepted
time: 3ms
memory: 4012kb

input:

59
-83 56 51 -64 30 35 52 -22 -54 -36 76 25 37 39 -26 -10 2 -99 71 95 -67 -2 33 9 -79 97 -18 -56 -54 99 -2 -3 -64 -42 -72 81 -84 5 -39 93 -72 -90 19 4 95 -30 28 -1 -81 -59 47 15 -94 -59 87 0 82 26
42 76 56 47 -5 26 -76 85 -16 -16 68 -19 26 -93 0 24 -47 20 16 -63 75 -36 -2 -88 38 -14 -70 27 -98 -70 4...

output:

13664
1 2 4 6 154
1 2 4 5 -154
6 2 5 1 -154
6 2 4 5 154
3 2 4 6 -154
3 2 4 5 154
6 2 5 3 154
6 2 4 5 -154
1 3 4 6 -71
1 3 4 5 71
6 3 5 1 71
6 3 4 5 -71
2 3 4 6 71
2 3 4 5 -71
6 3 5 2 -71
6 3 4 5 71
1 4 3 6 -28
1 4 3 5 28
6 4 5 1 28
6 4 3 5 -28
2 4 3 6 28
2 4 3 5 -28
6 4 5 2 -28
6 4 3 5 28
1 5 3 6 81...

result:

ok n=59

Test #30:

score: 0
Accepted
time: 9ms
memory: 4728kb

input:

100
33 54 -87 -27 79 -67 -64 29 -32 49 -43 87 29 -64 38 -27 47 -67 -57 -66 -84 -67 68 -34 -12 -50 -55 -75 -96 0 71 -49 46 -39 63 -48 -60 -53 -92 18 -33 51 1 47 -100 42 81 -40 -14 43 -51 -7 -77 30 -20 -93 -99 -70 26 52 -58 -74 57 -54 -3 93 58 -90 32 -100 -72 51 -93 48 19 84 -89 77 55 12 -45 -5 39 5 -...

output:

39528
1 2 4 6 27
1 2 4 5 -27
6 2 5 1 -27
6 2 4 5 27
3 2 4 6 -27
3 2 4 5 27
6 2 5 3 27
6 2 4 5 -27
1 3 4 6 -69
1 3 4 5 69
6 3 5 1 69
6 3 4 5 -69
2 3 4 6 69
2 3 4 5 -69
6 3 5 2 -69
6 3 4 5 69
1 4 3 6 84
1 4 3 5 -84
6 4 5 1 -84
6 4 3 5 84
2 4 3 6 -84
2 4 3 5 84
6 4 5 2 84
6 4 3 5 -84
1 5 3 6 10
1 5 3 4...

result:

ok n=100

Test #31:

score: 0
Accepted
time: 9ms
memory: 4632kb

input:

100
68 -49 44 23 8 57 17 32 21 46 43 -84 -62 63 -83 99 -63 59 -11 31 83 -62 -24 66 -50 81 30 -55 -7 -82 68 73 -31 -33 -65 -91 -70 -68 73 50 -87 86 58 14 8 -24 31 37 66 -46 38 -64 -79 13 15 88 -29 29 -84 0 -10 -75 -100 -26 -50 -38 36 -35 85 48 58 -98 5 63 40 -61 93 -52 -37 16 -6 72 -77 -83 -87 50 -20...

output:

39544
1 2 4 6 -57
1 2 4 5 57
6 2 5 1 57
6 2 4 5 -57
3 2 4 6 57
3 2 4 5 -57
6 2 5 3 -57
6 2 4 5 57
1 3 4 6 71
1 3 4 5 -71
6 3 5 1 -71
6 3 4 5 71
2 3 4 6 -71
2 3 4 5 71
6 3 5 2 71
6 3 4 5 -71
1 4 3 6 -44
1 4 3 5 44
6 4 5 1 44
6 4 3 5 -44
2 4 3 6 44
2 4 3 5 -44
6 4 5 2 -44
6 4 3 5 44
1 5 3 6 39
1 5 3 4...

result:

ok n=100

Test #32:

score: 0
Accepted
time: 9ms
memory: 4620kb

input:

100
-54 27 -16 97 15 -92 -66 73 -13 12 44 -10 -47 95 -25 -67 21 73 -19 -7 96 1 98 66 -58 16 -49 26 9 -97 90 -58 -17 -26 69 1 -37 -40 33 -36 14 -74 -44 -83 -44 66 -52 -11 95 -66 46 -72 37 67 28 40 -63 37 -24 -29 24 28 41 2 -41 71 -29 25 26 93 59 11 -66 -60 70 24 -42 -65 79 -56 -24 77 23 51 -19 25 9 3...

output:

39536
1 2 4 6 78
1 2 4 5 -78
6 2 5 1 -78
6 2 4 5 78
3 2 4 6 -78
3 2 4 5 78
6 2 5 3 78
6 2 4 5 -78
1 3 4 6 -91
1 3 4 5 91
6 3 5 1 91
6 3 4 5 -91
2 3 4 6 91
2 3 4 5 -91
6 3 5 2 -91
6 3 4 5 91
1 4 3 6 -84
1 4 3 5 84
6 4 5 1 84
6 4 3 5 -84
2 4 3 6 84
2 4 3 5 -84
6 4 5 2 -84
6 4 3 5 84
1 5 3 6 -108
1 5 3...

result:

ok n=100

Test #33:

score: 0
Accepted
time: 1ms
memory: 3676kb

input:

5
96 70 0 -25
3 10 -61
-40 8
58
62 43 24 82
-81 -49 68
88 -20
-98

output:

-1

result:

ok n=5

Test #34:

score: 0
Accepted
time: 1ms
memory: 3812kb

input:

5
43 -6 -77 19
84 1 -9
-87 67
-68
-42 -48 77 65
17 -1 -86
-22 -42
49

output:

-1

result:

ok n=5

Test #35:

score: 0
Accepted
time: 1ms
memory: 3740kb

input:

5
-85 -81 -99 97
10 -58 -26
-7 48
1
71 -68 -86 -65
84 41 -74
-84 41
-60

output:

-1

result:

ok n=5

Test #36:

score: -100
Runtime Error

input:

5
-59 -76 -34 15
-16 76 -35
82 -35
-41
-70 -91 31 82
94 -50 -1
8 -37
-89

output:


result: