Ruudukko

input/code.cpp: In function 'int main()':
input/code.cpp:33:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<unsigned int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for (int i = 0; i < POINTER_LIST[0].size(); i++)
      |                     ~~^~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:45:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<unsigned int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         for (int j = 0; j < POINTER_LIST[i].size(); j++)
      |                         ~~^~~~~~~~~~~~~~~~~~~~~~~~

#include <iostream>
#include <string.h>
#include <algorithm>
#include <vector>


int main() {

    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 (int i = 0; i < n*n; i++)
    {
        std::cin >> x;
        POINTER_LIST[x-1].push_back(i);
    }

    // DO the magic
    for (int i = 0; i < POINTER_LIST[0].size(); i++)
    {
        ROWS[POINTER_LIST[0][i] % n] += 1;
        COLUNMS[(int)(POINTER_LIST[0][i] / n)] += 1;

        TEMP_ROWS[POINTER_LIST[0][i] % n] += 1;
        TEMP_COLUNMS[(int)(POINTER_LIST[0][i] / n)] += 1;
    }

    unsigned int c = 0;
    for (int i = 1; i < n*n; i++)
    {
        for (int j = 0; j < POINTER_LIST[i].size(); j++)
        {
            c = ROWS[POINTER_LIST[i][j] % n] + COLUNMS[(int)(POINTER_LIST[i][j] / n)];
            routes_in_mod = (routes_in_mod + c) % 1000000007;
            TEMP_ROWS[POINTER_LIST[i][j] % n] += (c + 1) % 1000000007;
            TEMP_COLUNMS[(int)(POINTER_LIST[i][j] / n)] += (c + 1) % 1000000007;
        }

        for (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 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 2, 3

Verdict: ACCEPTED

Test 5

Group: 2, 3

Verdict: WRONG ANSWER

Test 6

Group: 2, 3

Verdict: WRONG ANSWER

Test 7

Group: 3

Verdict: ACCEPTED

Test 8

Group: 3

Verdict: WRONG ANSWER

Test 9

Group: 3

Verdict: WRONG ANSWER