CSES - Datatähti 2023 alku - Results
Submission details
Task:Ruudukko
Sender:snowflake
Submission time:2022-11-07 18:29:44 +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.01 s2, 3details
#5--2, 3details
#60.02 s2, 3details
#7--3details
#8--3details
#9--3details

Code

#include<iostream>
using namespace std;


const int dismo = 1000000007;

int n = 0;

int** multimatrix;
int** saved;

int A(int index_x, int index_y)
{
	int save = saved[index_x][index_y];
	if (save != -1)
	{
		return save;
	}


	int count = 0;
	int squareval = multimatrix[index_x][index_y];

	if (index_x != 0)
	{
		for (int i = 0; i < index_x; ++i)
		{
			int boo = (squareval - multimatrix[i][index_y] > 0);
			if (!boo) continue;
			count += boo;
			count += A(i, index_y);
		}
	}

	if (index_x != n - 1)
	{
		for (int i = index_x + 1; i < n; ++i)
		{
			int boo = (squareval - multimatrix[i][index_y] > 0);
			if (!boo) continue;
			count += boo;
			count += A(i, index_y);
		}
	}

	if (index_y != 0)
	{
		for (int i = 0; i < index_y; ++i)
		{
			int boo = (squareval - multimatrix[index_x][i] > 0);
			if (!boo) continue;
			count += boo;
			count += A(index_x, i);
		}
	}

	if (index_y != n - 1)
	{
		for (int i = index_y + 1; i < n; ++i)
		{
			int 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()
{
	int countLIBERAL = 0;

	cin >> n;

	multimatrix = new int* [n];
	for (int ih = 0; ih < n; ++ih)
		multimatrix[ih] = new int[n];

	saved = new int* [n];
	for (int ij = 0; ij < n; ++ij)
		saved[ij] = new int[n];

	for (int i6 = 0; i6 < n; ++i6)
		for (int i7 = 0; i7 < n; ++i7)
			saved[i6][i7] = -1;

	for (int ix = 0; ix < n; ++ix)
		for (int iy = 0; iy < n; ++iy)
			cin >> multimatrix[ix][iy];


	for (int lx = 0; lx < n; ++lx)
		for (int 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: 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:

input
100
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
187458477

user output
(empty)

Test 6

Group: 2, 3

Verdict:

input
100
2995 8734 1018 2513 7971 5063 ...

correct output
964692694

user output
348370085

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)