CSES - Datatähti 2023 alku - Results
Submission details
Task:Ruudukko
Sender:Septicuss
Submission time:2022-10-31 03:58:33 +0200
Language:Java
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.07 s1, 2, 3details
#20.07 s1, 2, 3details
#30.07 s1, 2, 3details
#40.11 s2, 3details
#5--2, 3details
#6--2, 3details
#70.39 s3details
#8--3details
#9--3details

Code

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.StringTokenizer;
public class D430 {
static final long mod = 1000000007;
static int n;
static int c = 0;
static int[][] grid;
public static void main(String[] args) {
FastReader reader = new FastReader();
PrintWriter writer = new PrintWriter(new OutputStreamWriter(System.out));
n = reader.nextInt();
grid = new int[n][n];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
grid[i][j] = reader.nextInt();
reader.close();
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
if (grid[i][j] == 1) continue;
// System.out.println(grid[i][j] + " produced " + sumFrom(i, j));
c += sumFrom(i, j) % mod;
}
if (c == 0) c = 1;
writer.println(c);
writer.flush();
writer.close();
}
/*-
* GRID HAS X, Y
*
* x ->
* 0 1 2
* y 1 A B
* ⬇ 2 C D
*/
static int sumFrom(int y, int x) {
int value = grid[y][x];
int sum = 0;
if (value == 1) return 1;
for (int i = 0; i < n; i++) {
int horizontal = grid[y][i];
int vertical = grid[i][x];
if (horizontal < value) {
sum += horizontal == 1 ? 1 : sumFrom(y, i) + 1;
}
if (vertical < value) {
sum += vertical == 1 ? 1 : sumFrom(i, x) + 1;
}
}
return sum;
}
static class FastReader {
private BufferedReader br;
private StringTokenizer st;
public FastReader() {
br = new BufferedReader(new InputStreamReader(System.in));
}
void close() {
try {
br.close();
} catch (IOException e) {
e.printStackTrace();
}
st = null;
br = null;
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
int nextInt() {
return Integer.parseInt(next());
}
BigInteger nextBigInteger() {
return new BigInteger(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
long nextLong() {
return Long.parseLong(next());
}
}
}

Test details

Test 1

Group: 1, 2, 3

Verdict:

input
3
1 1 1
1 1 1
1 1 1

correct output
9

user output
1

Test 2

Group: 1, 2, 3

Verdict:

input
3
1 2 3
6 5 4
7 8 9

correct output
135

user output
126

Test 3

Group: 1, 2, 3

Verdict:

input
3
7 8 1
4 5 4
3 9 6

correct output
57

user output
48

Test 4

Group: 2, 3

Verdict:

input
100
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
10000

user output
1

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
(empty)

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
1

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)