Task: | Summat |
Sender: | rasastusni |
Submission time: | 2020-09-27 10:46:30 +0300 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 12 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 12 |
#2 | RUNTIME ERROR | 0 |
#3 | RUNTIME ERROR | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#2 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#3 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#4 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#5 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#6 | ACCEPTED | 0.01 s | 2, 3 | details |
#7 | RUNTIME ERROR | 0.01 s | 2, 3 | details |
#8 | RUNTIME ERROR | 0.01 s | 2, 3 | details |
#9 | RUNTIME ERROR | 0.01 s | 2, 3 | details |
#10 | RUNTIME ERROR | 0.01 s | 2, 3 | details |
#11 | ACCEPTED | 0.04 s | 3 | details |
#12 | RUNTIME ERROR | 0.04 s | 3 | details |
#13 | RUNTIME ERROR | 0.04 s | 3 | details |
#14 | RUNTIME ERROR | 0.04 s | 3 | details |
#15 | RUNTIME ERROR | 0.04 s | 3 | details |
Code
#include <algorithm> #include <iostream> #include <vector> #include <set> using namespace std; int n; int b[5000]; int bss[5000]; int M[5000][100]; int c; set<int> pivoted; int seq[100]; void find(int depth) { if (depth == n) { int asd[100]; int c = 0; for (int i = 0; i < n; ++i) { for (int a = i + 1; a < n; ++a) { asd[c++] = seq[i] + seq[a]; } } sort(asd, asd + c); if (equal(asd, asd+c, bss)) { for (int i = 0; i < n - 1; ++i) { cout << seq[i] << " "; } cout << seq[n-1] << endl; exit(0); } return; } for (int i = 1; i <= 5; ++i) { seq[depth] = i; find(depth + 1); } } int find_pivot(int i) { for (int a = 0; a < c; ++a) { if (M[a][i] != 0 && pivoted.find(a) == pivoted.end()) { if (M[a][i] != 1) { int bs = M[a][i]; for (int k = 0; k < n; ++k) { int orig = M[a][k]; M[a][k] /= bs; if (M[a][k] * bs != orig) { //cout << "O M G" << endl; } } int orig = b[a]; b[a] /= bs; if (b[a] * bs != orig) { //cout << "O M G" << endl; } } //cout << i << endl; //for (int k = 0; k < n; ++k) { // cout << M[a][k] << " "; //} //cout << endl; pivoted.insert(a); return a; } } return -1; } void gauss() { for (int i = 0; i < n; ++i) { //for (int a = 0; a < c; ++a) { //for (int k = 0; k < n; ++k) { // cout << M[a][k] << " "; //} //cout << b[a] << endl; //} int pivot = find_pivot(i); //cout << pivot << endl; if (pivot == -1) continue; for (int a = 0; a < c; ++a) { if (a != pivot && M[a][i] != 0) { int bs = M[a][i]; for (int k = 0; k < n; ++k) { M[a][k] -= bs * M[pivot][k]; } b[a] -= bs * b[pivot]; } } } } int main() { cin >> n; for (int i = 0; i < n*(n-1)/2; ++i) { cin >> b[i]; bss[i] = b[i]; } for (int i = 0; i < n; ++i) { for (int a = i + 1; a < n; ++a) { M[c][i] = 1; M[c][a] = 1; ++c; } } gauss(); sort(bss, bss + n*(n-1)/2); find(0); for (auto x : pivoted) { cout << b[x]; if (x != *pivoted.rbegin()) cout << " "; } cout << endl; //for (int i = 0; i < c; ++i) { // for (int k = 0; k < n; ++k) { // cout << M[i][k]; // } // cout << endl; // cout << b[i] << endl; //} }
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
5 2 2 2 2 2 2 2 2 2 2 |
correct output |
---|
1 1 1 1 1 |
user output |
---|
1 1 1 1 1 |
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
5 3 4 5 5 6 6 7 7 8 9 |
correct output |
---|
1 2 3 4 5 |
user output |
---|
1 2 3 4 5 |
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
5 5 6 6 6 9 9 9 10 10 10 |
correct output |
---|
1 4 5 5 5 |
user output |
---|
1 4 5 5 5 |
Test 4
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
5 2 3 3 6 6 6 6 7 7 10 |
correct output |
---|
1 1 2 5 5 |
user output |
---|
1 1 2 5 5 |
Test 5
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
5 4 5 5 5 5 6 6 6 7 7 |
correct output |
---|
2 2 3 3 4 |
user output |
---|
2 2 3 3 4 |
Test 6
Group: 2, 3
Verdict: ACCEPTED
input |
---|
20 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
user output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
Test 7
Group: 2, 3
Verdict: RUNTIME ERROR
input |
---|
20 3 4 5 5 6 6 7 7 7 8 8 8 9 9 9 ... |
correct output |
---|
1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
(empty) |
Error:
*** stack smashing detected ***: <unknown> terminated
Test 8
Group: 2, 3
Verdict: RUNTIME ERROR
input |
---|
20 52 55 55 57 62 62 63 64 66 71 ... |
correct output |
---|
1 51 54 54 56 61 61 62 63 65 7... |
user output |
---|
(empty) |
Error:
*** stack smashing detected ***: <unknown> terminated
Test 9
Group: 2, 3
Verdict: RUNTIME ERROR
input |
---|
20 25 30 31 32 36 39 40 41 45 45 ... |
correct output |
---|
8 17 22 23 24 28 43 50 53 55 6... |
user output |
---|
(empty) |
Error:
*** stack smashing detected ***: <unknown> terminated
Test 10
Group: 2, 3
Verdict: RUNTIME ERROR
input |
---|
20 9 10 14 17 17 20 21 22 24 25 2... |
correct output |
---|
1 8 9 13 16 19 30 32 38 40 43 ... |
user output |
---|
(empty) |
Error:
*** stack smashing detected ***: <unknown> terminated
Test 11
Group: 3
Verdict: ACCEPTED
input |
---|
100 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ... |
correct output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
user output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... Truncated |
Test 12
Group: 3
Verdict: RUNTIME ERROR
input |
---|
100 3 4 5 5 6 6 7 7 7 8 8 8 9 9 9 ... |
correct output |
---|
1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
(empty) |
Error:
*** stack smashing detected ***: <unknown> terminated
Test 13
Group: 3
Verdict: RUNTIME ERROR
input |
---|
100 502824619 505239810 505668108 ... |
correct output |
---|
1 502824618 505239809 50566810... |
user output |
---|
(empty) |
Error:
*** stack smashing detected ***: <unknown> terminated
Test 14
Group: 3
Verdict: RUNTIME ERROR
input |
---|
100 17871832 41618648 51611938 538... |
correct output |
---|
3939271 13932561 37679377 4989... |
user output |
---|
(empty) |
Error:
*** stack smashing detected ***: <unknown> terminated
Test 15
Group: 3
Verdict: RUNTIME ERROR
input |
---|
100 70588435 115481965 116040218 1... |
correct output |
---|
5902586 64685849 109579379 110... |
user output |
---|
(empty) |
Error:
*** stack smashing detected ***: <unknown> terminated