Task: | Ruudukko |
Sender: | adex720 |
Submission time: | 2022-11-13 10:32:09 +0200 |
Language: | Java |
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.12 s | 1, 2, 3 | details |
#2 | ACCEPTED | 0.12 s | 1, 2, 3 | details |
#3 | ACCEPTED | 0.12 s | 1, 2, 3 | details |
#4 | ACCEPTED | 0.29 s | 2, 3 | details |
#5 | WRONG ANSWER | 0.45 s | 2, 3 | details |
#6 | WRONG ANSWER | 0.44 s | 2, 3 | details |
#7 | TIME LIMIT EXCEEDED | -- | 3 | details |
#8 | TIME LIMIT EXCEEDED | -- | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
import java.util.Scanner;public class D {public static final int MODULO = (int) (Math.pow(10, 9)) - 7;public static void main(String[] args) {Scanner scanner = new Scanner(System.in);int n = Integer.parseInt(scanner.nextLine());int[][] luvut = new int[n][n];int[][] seuraavat = new int[n][n];for (int y = 0; y < n; y++) {String[] luvutString = scanner.nextLine().split(" ");for (int x = 0; x < n; x++) {luvut[x][y] = Integer.parseInt(luvutString[x]);}}long yhteensa = 0;for (int nykyinen = 1; nykyinen <= n * n; nykyinen++) {for (int x = 0; x < n; x++) {for (int y = 0; y < n; y++) {if (luvut[x][y] == nykyinen) {if (nykyinen == 1) {seuraavat[x][y] = 1;yhteensa++;if (yhteensa < 0) throw new NullPointerException();continue;}int seuraavia = 1; // 1 koska reitti voi loppua tähän ruutuunfor (int newY = 0; newY < n; newY++) {if (newY == y) continue;if (luvut[x][newY] < nykyinen) {seuraavia += seuraavat[x][newY];}}for (int newX = 0; newX < n; newX++) {if (newX == x) continue;if (luvut[newX][y] < nykyinen) {seuraavia += seuraavat[newX][y];}}seuraavia = seuraavia % MODULO;yhteensa += seuraavia;yhteensa = yhteensa % MODULO;seuraavat[x][y] = seuraavia;}}}}System.out.println(yhteensa);}}
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 |
---|
785391778 |
Test 6
Group: 2, 3
Verdict: WRONG ANSWER
input |
---|
100 2995 8734 1018 2513 7971 5063 ... |
correct output |
---|
964692694 |
user output |
---|
-967319057 |
Test 7
Group: 3
Verdict: TIME LIMIT EXCEEDED
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: TIME LIMIT EXCEEDED
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: TIME LIMIT EXCEEDED
input |
---|
1000 520283 805991 492643 75254 527... |
correct output |
---|
951147313 |
user output |
---|
(empty) |