Task: | Ruudukko |
Sender: | snowflake |
Submission time: | 2022-11-12 00:38:07 +0200 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 28 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 28 |
#2 | WRONG ANSWER | 0 |
#3 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
#2 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
#3 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
#4 | ACCEPTED | 0.01 s | 2, 3 | details |
#5 | WRONG ANSWER | 0.03 s | 2, 3 | details |
#6 | WRONG ANSWER | 0.03 s | 2, 3 | details |
#7 | RUNTIME ERROR | 0.45 s | 3 | details |
#8 | RUNTIME ERROR | 0.48 s | 3 | details |
#9 | RUNTIME ERROR | 0.48 s | 3 | details |
Code
#include<iostream> #include<tuple> using namespace std; const int dismo = 1000000007; int n = 0; int** multimatrix; int** savedx; int** savedy; int A(int index_x, int index_y) { int squareval = multimatrix[index_x][index_y]; if(squareval == 1) return 0; int count = 0; int s0 = savedx[index_x][squareval - 1]; int s1 = savedy[index_y][squareval - 1]; if (s0 == -1) { int dia = 0; for (int i = 0; i < n; ++i) { if (multimatrix[i][index_y] >= squareval) continue; int adi = multimatrix[i][index_y] == 1 ? 1 : A(i, index_y) + 1; count = (count + adi) % dismo; dia += adi; } savedx[index_x][squareval - 1] = dia; } else { count = (count + s0) % dismo; } if (s1 == -1) { int ver = 0; for (int i = 0; i < n; ++i) { if (multimatrix[index_x][i] >= squareval) continue; int adi = multimatrix[index_x][i] == 1 ? 1 : A(index_x, i) + 1; count = (count + adi) % dismo; ver += adi; } savedy[index_y][squareval - 1] = ver; } else { count = (count + s1) % dismo; } return count; } int main() { ios::sync_with_stdio(0); cin.tie(0); int countLIBERAL = 0; cin >> n; int sqrn = n * n; multimatrix = new int* [n]; savedx = new int* [n]; savedy = new int* [n]; for (int i6 = 0; i6 < n; ++i6) { multimatrix[i6] = new int[n]; savedx[i6] = new int [sqrn]; savedy[i6] = new int [sqrn]; for (int i7 = 0; i7 < n; ++i7) { cin >> multimatrix[i6][i7]; } } for (int i = 0; i < n; ++i) { for (int um = 0; um < sqrn; ++um) { savedx[i][um] = -1; savedy[i][um] = -1; } } for (int lx = 0; lx < n; ++lx) for (int ny = 0; ny < n; ++ny) { countLIBERAL += A(lx, ny); } cout << (countLIBERAL + sqrn) % dismo; return 0; }
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
3 1 1 1 1 1 1 1 1 1 |
correct output |
---|
9 |
user output |
---|
9 |
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
3 1 2 3 6 5 4 7 8 9 |
correct output |
---|
135 |
user output |
---|
135 |
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
3 7 8 1 4 5 4 3 9 6 |
correct output |
---|
57 |
user output |
---|
57 |
Test 4
Group: 2, 3
Verdict: ACCEPTED
input |
---|
100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
10000 |
user output |
---|
10000 |
Test 5
Group: 2, 3
Verdict: WRONG ANSWER
input |
---|
100 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
correct output |
---|
187458477 |
user output |
---|
-669644314 |
Test 6
Group: 2, 3
Verdict: WRONG ANSWER
input |
---|
100 2995 8734 1018 2513 7971 5063 ... |
correct output |
---|
964692694 |
user output |
---|
-275577561 |
Test 7
Group: 3
Verdict: RUNTIME ERROR
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
1000000 |
user output |
---|
(empty) |
Test 8
Group: 3
Verdict: RUNTIME ERROR
input |
---|
1000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
correct output |
---|
229147081 |
user output |
---|
(empty) |
Test 9
Group: 3
Verdict: RUNTIME ERROR
input |
---|
1000 520283 805991 492643 75254 527... |
correct output |
---|
951147313 |
user output |
---|
(empty) |