Ruudukko

input/code.cpp: In function 'bool compare(lol&, lol&)':
input/code.cpp:18:24: warning: self-comparison always evaluates to false [-Wtautological-compare]
   18 |             return a.x < a.x;
      |                    ~~~ ^ ~~~

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

using namespace std;
typedef long long ll;
struct lol {
    int value;
    int y;
    int x;
};
int M = 1000000007;
bool compare(lol &a, lol &b) {
    if (a.value == b.value) {
        if (a.y == b.y) {
            return a.x < a.x;
        }
        return a.y < b.y;
    }
    return a.value < b.value;
}
ll d[1010][1010];
ll rivit[1010];
ll kolumnit[1010];

int main() {
    cin.tie(0);
    iostream::sync_with_stdio(0);
    int n; cin >> n;
    vector<lol> v;
    v.reserve(n*n);
    for (int y = 0; y < n; y++) {
        for (int x = 0; x < n; x++) {
            int val; cin >> val;
            v.push_back({val,y,x});
        }   
    }
    sort(v.begin(),v.end(),compare);
    int curnumber = v[0].value;
    vector<lol> toedit;

    ll sum = 0;
    for (lol &pair : v) {
        if (pair.value != curnumber) {
            for (lol p : toedit) {
                rivit[p.y] += d[p.y][p.x];
                rivit[p.y] %= M;
                kolumnit[p.x] += d[p.y][p.x];
                kolumnit[p.x] %= M;
            }
            toedit.clear();
            curnumber = pair.value;
        }
        int y = pair.y;
        int x = pair.x;
        d[y][x] += rivit[y] + kolumnit[x] + 1;
        d[y][x] %= M;
        sum += d[y][x];
        sum %= M;
        toedit.push_back(pair);
    }
    cout << sum;
}

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