Task: | Ruudukko |
Sender: | snowflake |
Submission time: | 2022-11-08 13:37:32 +0200 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
#3 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details |
#2 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details |
#3 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details |
#4 | WRONG ANSWER | 0.01 s | 2, 3 | details |
#5 | WRONG ANSWER | 0.01 s | 2, 3 | details |
#6 | WRONG ANSWER | 0.01 s | 2, 3 | details |
#7 | TIME LIMIT EXCEEDED | -- | 3 | details |
#8 | TIME LIMIT EXCEEDED | -- | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include<iostream>using namespace std;const long long dismo = 1000000007;long long n = 0;long long** multimatrix;long long** saved;long long A(long long index_x, long long index_y){long long save = saved[index_x][index_y];if (save != -1)return save;long long count = 0;long long squareval = multimatrix[index_x][index_y];if (index_x != 0){for (long long i = 0; i < index_x; ++i){long long boo = (squareval - multimatrix[i][index_y] > 0);if (!boo) continue;count += boo;count += A(i, index_y);}}if (index_x != n - 1){for (long long i = index_x + 1; i < n; ++i){long long boo = (squareval - multimatrix[i][index_y] > 0);if (!boo) continue;count += boo;count += A(i, index_y);}}if (index_y != 0){for (long long i = 0; i < index_y; ++i){long long boo = (squareval - multimatrix[index_x][i] > 0);if (!boo) continue;count += boo;count += A(index_x, i);}}if (index_y != n - 1){for (long long i = index_y + 1; i < n; ++i){long long boo = (squareval - multimatrix[index_x][i] > 0);if (!boo) continue;count += boo;count += A(index_x, i);}}saved[index_x][index_y] = count;return count;}int main(){long long countLIBERAL = 0;cin >> n;multimatrix = new long long* [n];for (long long ih = 0; ih < n; ++ih)multimatrix[ih] = new long long[n];saved = new long long* [n];for (long long ij = 0; ij < n; ++ij)saved[ij] = new long long[n];for (long long i6 = 0; i6 < n; ++i6)for (long long i7 = 0; i7 < n; ++i7)saved[i6][i7] = -1;// for (long long ix = 0; ix < n; ++ix)// for (long long iy = 0; iy < n; ++iy)// cin >> multimatrix[ix][iy];long long x = 0;long long x2 = 0;long long hi;while(cin >> hi){multimatrix[x][x % n] = hi;if(x2 >= n){x++;x2 = 0;}}for (long long lx = 0; lx < n; ++lx)for (long long ny = 0; ny < n; ++ny){countLIBERAL += A(lx, ny);}cout << countLIBERAL % dismo + n * n;return 0;}
Test details
Test 1
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
3 1 1 1 1 1 1 1 1 1 |
correct output |
---|
9 |
user output |
---|
13 |
Test 2
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
3 1 2 3 6 5 4 7 8 9 |
correct output |
---|
135 |
user output |
---|
13 |
Test 3
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
3 7 8 1 4 5 4 3 9 6 |
correct output |
---|
57 |
user output |
---|
13 |
Test 4
Group: 2, 3
Verdict: WRONG ANSWER
input |
---|
100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
10000 |
user output |
---|
10198 |
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 |
---|
10198 |
Test 6
Group: 2, 3
Verdict: WRONG ANSWER
input |
---|
100 2995 8734 1018 2513 7971 5063 ... |
correct output |
---|
964692694 |
user output |
---|
10198 |
Test 7
Group: 3
Verdict: TIME LIMIT EXCEEDED
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: TIME LIMIT EXCEEDED
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: TIME LIMIT EXCEEDED
input |
---|
1000 520283 805991 492643 75254 527... |
correct output |
---|
951147313 |
user output |
---|
(empty) |