| Task: | Ruudukko | 
| Sender: | Bean Benestrom | 
| Submission time: | 2022-11-13 18:00:44 +0200 | 
| Language: | C++ (C++17) | 
| 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.00 s | 1, 2, 3 | details | 
| #2 | ACCEPTED | 0.00 s | 1, 2, 3 | details | 
| #3 | ACCEPTED | 0.00 s | 1, 2, 3 | details | 
| #4 | ACCEPTED | 0.01 s | 2, 3 | details | 
| #5 | WRONG ANSWER | 0.01 s | 2, 3 | details | 
| #6 | WRONG ANSWER | 0.01 s | 2, 3 | details | 
| #7 | ACCEPTED | 0.42 s | 3 | details | 
| #8 | WRONG ANSWER | 0.66 s | 3 | details | 
| #9 | WRONG ANSWER | 0.98 s | 3 | details | 
Code
#include <iostream>
#include <vector>
int main() {
    unsigned int n;
    unsigned int x;
    unsigned int routes_in_mod = 0;     // MODULO: x % 1000000007
    std::cin >> n;
    if (n < 2) { std::cout << 1 << '\n'; return 0; }
    
    unsigned int ROWS[1000]    = { };
    unsigned int COLUNMS[1000] = { };
    unsigned int TEMP_ROWS[1000]    = { };
    unsigned int TEMP_COLUNMS[1000] = { };
    
    // POINTER LIST INITIALIZATION
    std::vector<unsigned int>* POINTER_LIST = new std::vector<unsigned int>[n*n]();
    // GET DATA LOCATION INTO POINTER LIST
    for (unsigned int i = 0; i < n*n; i++)
    {
        std::cin >> x;
        POINTER_LIST[x-1].push_back(i);
    }
    // DO the magic
    for (unsigned int i = 0; i < POINTER_LIST[0].size(); i++)
    {
        ROWS[POINTER_LIST[0][i] % n] += 1;
        COLUNMS[(unsigned int)(POINTER_LIST[0][i] / n)] += 1;
        TEMP_ROWS[POINTER_LIST[0][i] % n] += 1;
        TEMP_COLUNMS[(unsigned int)(POINTER_LIST[0][i] / n)] += 1;
    }
    unsigned int c = 0;
    for (unsigned int i = 1; i < n*n; i++)
    {
        for (unsigned int j = 0; j < POINTER_LIST[i].size(); j++)
        {
            c = (ROWS[POINTER_LIST[i][j] % n] + COLUNMS[(unsigned int)(POINTER_LIST[i][j] / n)]) % 1000000007;
            routes_in_mod = routes_in_mod + c;
            TEMP_ROWS[POINTER_LIST[i][j] % n] += c + 1;
            TEMP_COLUNMS[(unsigned int)(POINTER_LIST[i][j] / n)] += c + 1;
        }
        for (unsigned int j = 0; j < 1000; j++)
        {
            ROWS[j] = TEMP_ROWS[j];
            COLUNMS[j] = TEMP_COLUNMS[j];
        }
    }
    routes_in_mod = ( routes_in_mod + n*n) % 1000000007;
    
    // Deletion
    delete[] POINTER_LIST;
    // Answer
    std::cout << routes_in_mod << "\n";
    return 0;
}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 | 
|---|
| 905508501 | 
Test 6
Group: 2, 3
Verdict: WRONG ANSWER
| input | 
|---|
| 100 2995 8734 1018 2513 7971 5063 ...  | 
| correct output | 
|---|
| 964692694 | 
| user output | 
|---|
| 683798275 | 
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: WRONG ANSWER
| input | 
|---|
| 1000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...  | 
| correct output | 
|---|
| 229147081 | 
| user output | 
|---|
| 59869521 | 
Test 9
Group: 3
Verdict: WRONG ANSWER
| input | 
|---|
| 1000 520283 805991 492643 75254 527...  | 
| correct output | 
|---|
| 951147313 | 
| user output | 
|---|
| 148487589 | 
