Task: | Ruudukko |
Sender: | snowflake |
Submission time: | 2022-11-13 20:54:59 +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.02 s | 2, 3 | details |
#5 | WRONG ANSWER | 0.20 s | 2, 3 | details |
#6 | WRONG ANSWER | 0.20 s | 2, 3 | details |
#7 | RUNTIME ERROR | 0.46 s | 3 | details |
#8 | RUNTIME ERROR | 0.46 s | 3 | details |
#9 | RUNTIME ERROR | 0.46 s | 3 | details |
Code
#include <iostream> #include <vector> #include <tuple> using namespace std; const int dismo = 1000000007; int n = 0; int** multimatrix; int** saved; vector<tuple<int, int>>** occROW; // tuple<index_x, index_y> int A(int index_x, int index_y) { int squareval = multimatrix[index_x][index_y]; int svalmo = squareval - 1; if (squareval == 1) return 0; int save = saved[index_x][index_y]; if (save != -1) return save; int count = 0; for (int i = 0; i < svalmo; ++i) { vector<tuple<int, int>> vex = occROW[index_y][i]; int oursize = vex.size(); count += oursize; for (int m = 0; m < oursize; ++m) { tuple<int, int> tup = vex[m]; count += A(get<0>(tup), get<1>(tup)); } count %= dismo; } for (int i = 0; i < n; ++i) { if (i == index_y) continue; int ne = multimatrix[index_x][i]; if (ne == 1) { count++; continue; } if (ne >= squareval) continue; int coconut = saved[index_x][i]; if (coconut == -1) { count = (count + A(index_x, i) + 1) % dismo; } else { count = (count + coconut + 1) % dismo; } count %= dismo; } saved[index_x][index_y] = count; return count; } int main() { ios::sync_with_stdio(0); cin.tie(0); int countLIBERAL = 0; cin >> n; int sqrn = n * n; occROW = new vector<tuple<int, int>>* [n]; for (int i = 0; i < n; ++i) { occROW[i] = new vector<tuple<int, int>>[sqrn]; for (int iu = 0; iu < sqrn; ++iu) { occROW[i][iu] = vector<tuple<int, int>>(); } } multimatrix = new int* [n]; saved = new int* [n]; for (int i = 0; i < n; ++i) { multimatrix[i] = new int[n]; saved[i] = new int[n]; for (int i7 = 0; i7 < n; ++i7) { saved[i][i7] = -1; int mycin = 0; cin >> mycin; multimatrix[i][i7] = mycin; occROW[i7][mycin - 1].push_back(make_tuple(i, i7)); } } 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 |
---|
-89668212 |
Test 6
Group: 2, 3
Verdict: WRONG ANSWER
input |
---|
100 2995 8734 1018 2513 7971 5063 ... |
correct output |
---|
964692694 |
user output |
---|
746072695 |
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) |