| Task: | Ruudukko | 
| Sender: | NiiiloM | 
| Submission time: | 2022-11-03 03:03:38 +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.13 s | 1, 2, 3 | details | 
| #2 | ACCEPTED | 0.13 s | 1, 2, 3 | details | 
| #3 | ACCEPTED | 0.12 s | 1, 2, 3 | details | 
| #4 | TIME LIMIT EXCEEDED | -- | 2, 3 | details | 
| #5 | TIME LIMIT EXCEEDED | -- | 2, 3 | details | 
| #6 | TIME LIMIT EXCEEDED | -- | 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;
/**
 *
 * @author NM
 */
public class Ruudukko {
    public static void main(String[] args) {
        Scanner lukija = new Scanner(System.in);
        int koko = lukija.nextInt();
        Integer[][] numerot = new Integer[koko][koko];
        Integer[][] siirtojenMaara = new Integer[koko][koko];
        for (int y = 0; y < koko; y++) {
            for (int x = 0; x < koko; x++) {
                numerot[x][y] = lukija.nextInt();
                siirtojenMaara[x][y] = 0;
            }
        }
        boolean ensimmainenIollut = false;
        boolean ensimmainenIollutApu = false;
        for (int i = 1; i <= koko * koko; i++) {
            for (int y = 0; y < koko; y++) {
                Integer[][] siirtojenMaaraKopio = new Integer[koko][koko];
                for (int kopiointiY = 0; kopiointiY < koko; kopiointiY++) {
                    for (int kopiointiX = 0; kopiointiX < koko; kopiointiX++) {
                        siirtojenMaaraKopio[kopiointiX][kopiointiY] = siirtojenMaara[kopiointiX][kopiointiY];
                    }
                }
                for (int x = 0; x < koko; x++) {
                    if (numerot[x][y] == i && ensimmainenIollut) {
                        //lasketaan pystysumma
                        for (int yApu = 0; yApu < koko; yApu++) {
                            if (yApu == y) {
                                continue;
                            }
                            siirtojenMaara[x][y] = siirtojenMaara[x][y] + siirtojenMaaraKopio[x][yApu];
                        }
                        //lasketaan vaakasumma
                        for (int xApu = 0; xApu < koko; xApu++) {
                            if (xApu == x) {
                                continue;
                            }
                            siirtojenMaara[x][y] = siirtojenMaara[x][y] + siirtojenMaaraKopio[xApu][y];
                        }
                        
                        siirtojenMaara[x][y] = siirtojenMaara[x][y] + 1;
                    } else if (numerot[x][y] == i && ensimmainenIollut == false) {
                        siirtojenMaara[x][y] = siirtojenMaara[x][y] + 1;
                        ensimmainenIollutApu = true;
                    }
                }
            }
            if (ensimmainenIollutApu) {
                ensimmainenIollut = true;
            }
            
        }
        long siirtojayhteensä = 0;
        for (int y = 0; y < koko; y++) {
            for (int x = 0; x < koko; x++) {
                siirtojayhteensä = siirtojayhteensä + siirtojenMaara[x][y];
            }
        }
        System.out.println((int) Math.round(siirtojayhteensä % 1000000007));
    }
}
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: TIME LIMIT EXCEEDED
| input | 
|---|
| 100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...  | 
| correct output | 
|---|
| 10000 | 
| user output | 
|---|
| (empty) | 
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: TIME LIMIT EXCEEDED
| input | 
|---|
| 100 2995 8734 1018 2513 7971 5063 ...  | 
| correct output | 
|---|
| 964692694 | 
| user output | 
|---|
| (empty) | 
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) | 
