Ruudukko

input/code.cpp: In function 'int main()':
input/code.cpp:95:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<GridCell>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |         for(int k = 0; k < sameNumbers.size(); k++){
      |                        ~~^~~~~~~~~~~~~~~~~~~~

#include <bits/stdc++.h>

using namespace std;


class GridCell{
public:
    int x;
    int y;
    int value;
    GridCell(){
        this->x = -1;
        this->y = -1;
        this->value = -1;
    };
    GridCell(int x, int y, int value){
        this->x = x;
        this->y = y;
        this->value = value;
    }

    bool isEqual(const GridCell &B){
        return this->value == B.value;
    }
};
bool compare(GridCell A, GridCell B){
    return A.value > B.value;
}

int TwoIntHash(int a, int b) {
    return a >= b ? a * a + a + b : a + b * b;
}



int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);


    // INPUT
    int gridSize;
    cin >> gridSize;
    int* grid = new int[gridSize * gridSize];
    vector<GridCell> gridValues;
    int rowSums[gridSize];
    int colSums[gridSize];
    for (int y = 0; y < gridSize; y++){
        for (int x = 0; x < gridSize; x++){
            int val;
            cin >> val;
            grid[(y * gridSize) + x] = val;
            gridValues.push_back(GridCell(x, y, val));
        }
        rowSums[y] = 0;
        colSums[y] = 1;
    }
    sort(gridValues.begin(), gridValues.end(), compare);


    /*int gridSize = 1000;
    int* grid = new int[gridSize * gridSize];
    vector<GridCell> gridValues(gridSize * gridSize);
    int rowSums[gridSize];
    int colSums[gridSize];
    for (int y = 0; y < gridSize; y++){
        for (int x = 0; x < gridSize; x++){
            grid[(y * gridSize) + x] = (x+1) * (y+1);
            gridValues[(y * gridSize) + x] = GridCell(x, y, grid[(y * gridSize) + x]);
        }
        rowSums[y] = 0;
        colSums[y] = 1;
    }
    sort(gridValues.begin(), gridValues.end(), compare);*/


    //auto start = std::chrono::high_resolution_clock::now();
    
    // ALG
    unsigned long long int totalCount = 0;
    for (int i = 0; i < gridSize * gridSize; i++){
        vector<GridCell> sameNumbers;
        vector<int> sameCellValues;

        do{
            int n = (rowSums[gridValues[i].y] + colSums[gridValues[i].x]) % 1000000007;
            sameNumbers.push_back(gridValues[i]);
            sameCellValues.push_back(n);
            totalCount = (totalCount + n) % 1000000007;
            i++;
        } while (i < gridSize * gridSize && gridValues[i].isEqual(sameNumbers[0]));
        i--;

        for(int k = 0; k < sameNumbers.size(); k++){
            GridCell c = sameNumbers[k];
            int val = sameCellValues[k];
            rowSums[c.y] = (rowSums[c.y] + val) % 1000000007;
            colSums[c.x] = (colSums[c.x] + val) % 1000000007;
        }

    }

    //auto end = std::chrono::high_resolution_clock::now();
    //cout << "TIME: " << std::chrono::duration_cast<std::chrono::milliseconds>(end-start).count() / 1000.0 << "\n"; 
    
    cout << totalCount;
}

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: ACCEPTED

Test 6

Group: 2, 3

Verdict: ACCEPTED

Test 7

Group: 3

Verdict: ACCEPTED

Test 8

Group: 3

Verdict: ACCEPTED

Test 9

Group: 3

Verdict: ACCEPTED