Task: | Ruudukko |
Sender: | snowflake |
Submission time: | 2022-11-13 21:04:16 +0200 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 61 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 28 |
#2 | ACCEPTED | 33 |
#3 | RUNTIME ERROR | 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 | ACCEPTED | 0.19 s | 2, 3 | details |
#6 | ACCEPTED | 0.19 s | 2, 3 | details |
#7 | RUNTIME ERROR | 0.46 s | 3 | details |
#8 | RUNTIME ERROR | 0.47 s | 3 | details |
#9 | RUNTIME ERROR | 0.46 s | 3 | details |
Code
#include <iostream>#include <vector>#include <tuple>using namespace std;typedef long long ll;const ll dismo = 1000000007;ll n = 0;ll** multimatrix;ll** saved;vector<tuple<ll, ll>>** occROW; // tuple<index_x, index_y>ll A(ll index_x, ll index_y){ll squareval = multimatrix[index_x][index_y];ll svalmo = squareval - 1;if (squareval == 1)return 0;ll save = saved[index_x][index_y];if (save != -1)return save;ll count = 0;for (ll i = 0; i < svalmo; ++i){vector<tuple<ll, ll>> vex = occROW[index_y][i];ll oursize = vex.size();count += oursize;for (ll m = 0; m < oursize; ++m){tuple<ll, ll> tup = vex[m];count += A(get<0>(tup), get<1>(tup));}count %= dismo;}for (ll i = 0; i < n; ++i){if (i == index_y) continue;ll ne = multimatrix[index_x][i];if (ne == 1){count++;continue;}if (ne >= squareval) continue;ll 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);ll countLIBERAL = 0;cin >> n;ll sqrn = n * n;occROW = new vector<tuple<ll, ll>>* [n];for (ll i = 0; i < n; ++i){occROW[i] = new vector<tuple<ll, ll>>[sqrn];for (ll iu = 0; iu < sqrn; ++iu){occROW[i][iu] = vector<tuple<ll, ll>>();}}multimatrix = new ll* [n];saved = new ll* [n];for (ll i = 0; i < n; ++i){multimatrix[i] = new ll[n];saved[i] = new ll[n];for (ll i7 = 0; i7 < n; ++i7){saved[i][i7] = -1;ll mycin = 0;cin >> mycin;multimatrix[i][i7] = mycin;occROW[i7][mycin - 1].push_back(make_tuple(i, i7));}}for (ll lx = 0; lx < n; ++lx)for (ll 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: ACCEPTED
input |
---|
100 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
correct output |
---|
187458477 |
user output |
---|
187458477 |
Test 6
Group: 2, 3
Verdict: ACCEPTED
input |
---|
100 2995 8734 1018 2513 7971 5063 ... |
correct output |
---|
964692694 |
user output |
---|
964692694 |
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) |