CSES - Datatähti 2023 alku - Results
Submission details
Task:Ruudukko
Sender:NiiiloM
Submission time:2022-11-06 23:20:53 +0200
Language:Java
Status:READY
Result:28
Feedback
groupverdictscore
#1ACCEPTED28
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.12 s1, 2, 3details
#2ACCEPTED0.12 s1, 2, 3details
#3ACCEPTED0.12 s1, 2, 3details
#4ACCEPTED0.28 s2, 3details
#5--2, 3details
#6--2, 3details
#7--3details
#8--3details
#9--3details

Code

import java.io.IOException;
import java.util.ArrayList;
import java.util.Random;
import java.util.Scanner;

public class Ruudukko {

    public static void main(String[] args) throws IOException {
        // System.out.println("Alkaa");
        Scanner lukija = new Scanner(System.in);
        //Random random = new Random();
        int koko = readInt();
        //long startTime = System.nanoTime();
        //int koko = 100;
        Long[][] numerot = new Long[koko][koko];
        Long[][] siirtojenMaara = new Long[koko][koko];
        long pieninI = koko * koko;

        for (int y = 0; y < koko; y++) {
            for (int x = 0; x < koko; x++) {
                long numero = (long) readInt();
                //long numero = (long) random.nextInt(koko * koko) + 1;
                if (numero < pieninI) {
                    pieninI = numero;
                }
                numerot[x][y] = numero;
                siirtojenMaara[x][y] = (long) 0;
            }
        }
       // long stopTime = System.nanoTime();
       // System.out.println((double) (stopTime - startTime) / 1000000000);
      //  startTime = System.nanoTime();
        for (int y = 0; y < koko; y++) {
            for (int x = 0; x < koko; x++) {
                if (numerot[x][y] == pieninI) {
                    siirtojenMaara[x][y] = (long) 1;
                }
            }
        }
        Boolean onkoListattu = false;
        ArrayList<Long> pystyRivit = new ArrayList<>();
        ArrayList<Long> vaakaRivit = new ArrayList<>();
        /*  Long[][] rivitJaSarakkeet = new Long[koko][2];
        for (int y = 0; y < 2; y++) {
            for (int x = 0; x < koko; x++) {
                rivitJaSarakkeet[x][y] = (long) 0;
            }
        }*/
        for (int i = (int) pieninI + 1; i <= koko * koko; i++) {
            for (int y = 0; y < koko; y++) {
                for (int x = 0; x < koko; x++) {
                    if (numerot[x][y] == i) {
                        if (!onkoListattu) {
                            pystyRivit = new ArrayList<>();
                            vaakaRivit = new ArrayList<>();
                            for (int kopiointiY = 0; kopiointiY < koko; kopiointiY++) {
                                long rivinSumma = 0;
                                long pystySumma = 0;
                                for (int kopiointiX = 0; kopiointiX < koko; kopiointiX++) {
                                    rivinSumma = rivinSumma + siirtojenMaara[kopiointiX][kopiointiY];
                                    pystySumma = pystySumma + siirtojenMaara[kopiointiY][kopiointiX];
                                }
                                vaakaRivit.add(kopiointiY, rivinSumma);
                                pystyRivit.add(kopiointiY, pystySumma);
                                onkoListattu = true;
                            }

                        }
                        siirtojenMaara[x][y] += (long) (pystyRivit.get(x) + vaakaRivit.get(y) + 1) % 1000000007;
                    }
                }

            }
            onkoListattu = false;
        }

        long siirtojayhteensa = 0;
        for (int y = 0; y < koko; y++) {
            for (int x = 0; x < koko; x++) {
                siirtojayhteensa = siirtojayhteensa + siirtojenMaara[x][y];
            }
        }

        System.out.println((int) Math.round(siirtojayhteensa % 1000000007));
       // long stopTime = System.nanoTime();
       // System.out.println((double) (stopTime - startTime) / 1000000000);
    }

    private static int readInt() throws IOException {
        int luettava = 0;
        boolean dig = false;
        for (int i = 0; (i = System.in.read()) != -1;) {
            if (i >= '0' && i <= '9') {
                dig = true;
                luettava = luettava * 10 + i - '0';
            } else if (dig) {
                break;
            }
        }
        return luettava;
    }
}

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