Task: | Ruudukko |
Sender: | Lordoa |
Submission time: | 2022-11-08 19:12:55 +0200 |
Language: | Java |
Status: | READY |
Result: | 28 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 28 |
#2 | TIME LIMIT EXCEEDED | 0 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.14 s | 1, 2, 3 | details |
#2 | ACCEPTED | 0.14 s | 1, 2, 3 | details |
#3 | ACCEPTED | 0.14 s | 1, 2, 3 | details |
#4 | ACCEPTED | 0.18 s | 2, 3 | details |
#5 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#6 | WRONG ANSWER | 0.25 s | 2, 3 | details |
#7 | ACCEPTED | 0.58 s | 3 | details |
#8 | TIME LIMIT EXCEEDED | -- | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
// First Java program, although I've coded in C# so should be fast to pick up.import java.util.Scanner;public class App {static int[][] map = new int[1001][1001];static int[][] gps = new int[1001][1001];// This would be sooooo much easier if the array could just be made public, or if I could pass a pointer to the array...static int route(int n, int x, int y){int routes = 1;if (map[x][y]==1)return 1;if (gps[x][y]!=0)return gps[x][y];for (int i=0;i<n;i++){if (map[x][i]<map[x][y])routes += route(n,x,i);if (map[i][y]<map[x][y])routes += route(n,i,y);}gps[x][y] = routes;return routes;}// The idea to reduce computation time (pre-optimizing), is store the number of routes from a particular square. Trading memory for speed.public static void main(String[] args) throws Exception {Scanner input = new Scanner(System.in);int n = input.nextInt();input.nextLine();for (int i=0;i<n;i++){String line = input.nextLine();String[] arrline = line.split(" ",n);for (int j=0;j<n;j++){map[i][j] = Integer.parseInt(arrline[j]);}}int uwu = 0;for (int i=0;i<n;i++){for (int j=0;j<n;j++){uwu += route(n,i,j);}}System.out.println(uwu);// First tryyy OWO~~~!!!}}
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: TIME LIMIT EXCEEDED
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: WRONG ANSWER
input |
---|
100 2995 8734 1018 2513 7971 5063 ... |
correct output |
---|
964692694 |
user output |
---|
348370085 |
Test 7
Group: 3
Verdict: ACCEPTED
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
1000000 |
user output |
---|
1000000 |
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) |