CSES - Datatähti 2023 alku - Results
Submission details
Task:Ruudukko
Sender:snowflake
Submission time:2022-11-12 00:30:21 +0200
Language:C++ (C++17)
Status:READY
Result:28
Feedback
groupverdictscore
#1ACCEPTED28
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2, 3details
#2ACCEPTED0.00 s1, 2, 3details
#3ACCEPTED0.00 s1, 2, 3details
#4ACCEPTED0.02 s2, 3details
#5ACCEPTED0.03 s2, 3details
#60.04 s2, 3details
#70.45 s3details
#80.48 s3details
#90.48 s3details

Code

#include<iostream>
#include<tuple>
using namespace std;
const long long dismo = 1000000007;
long long n = 0;
long long** multimatrix;
long long** savedx;
long long** savedy;
long long A(long long index_x, long long index_y)
{
long long squareval = multimatrix[index_x][index_y];
if(squareval == 1) return 0;
long long count = 0;
long long s0 = savedx[index_x][squareval - 1];
long long s1 = savedy[index_y][squareval - 1];
if (s0 == -1)
{
long long dia = 0;
for (long long i = 0; i < n; ++i)
{
if (multimatrix[i][index_y] >= squareval) continue;
long long 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)
{
long long ver = 0;
for (long long i = 0; i < n; ++i)
{
if (multimatrix[index_x][i] >= squareval) continue;
long long 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);
long long countLIBERAL = 0;
cin >> n;
long long sqrn = n * n;
multimatrix = new long long* [n];
savedx = new long long* [n];
savedy = new long long* [n];
for (long long i6 = 0; i6 < n; ++i6)
{
multimatrix[i6] = new long long[n];
savedx[i6] = new long long [sqrn];
savedy[i6] = new long long [sqrn];
for (long long 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 (long long lx = 0; lx < n; ++lx)
for (long long 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:

input
100
2995 8734 1018 2513 7971 5063 ...

correct output
964692694

user output
144999176

Test 7

Group: 3

Verdict:

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:

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:

input
1000
520283 805991 492643 75254 527...

correct output
951147313

user output
(empty)