Ruudukko

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
 
struct Sq
{
    LL val, x, y;
};
 
bool SoSanh(Sq a, Sq b)
{
    return a.val < b.val;
}
 
LL Cal(LL a[100][100], LL x, LL y, LL n)
{
    LL r, ans = 0;
    for(r = 0; r < x; r++)
        ans += a[r][y];
    for(r = x + 1; r < n; r++)
        ans += a[r][y];
    for(r = 0; r < y; r++)
        ans += a[x][r];
    for(r = y + 1; r < n; r++)
        ans += a[x][r];
    return ans;
}
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
 
    static LL a[100][100];
    static LL draft[100][100];
    static Sq k[10000];
    LL n, i, j, m = 0, s, ans = 0;
    cin >> n;
    for(i = 0; i < n; i++)
        for(j = 0; j < n; j++)
        {
            cin >> k[m].val;
            k[m].x = i;
            k[m].y = j;
            m++;
        }
    sort(k, k + m, SoSanh);
    i = 0;
    while(i < m && j < m)
    {
        j = i;
        vector <pair<LL, LL>> v;
        while(k[j].val == k[i].val && j < m)
        {
            v.push_back({k[j].x, k[j].y});
            draft[k[j].x][k[j].y] = Cal(a, k[j].x, k[j].y, n);
            draft[k[j].x][k[j].y]++;
            j++;
        }
        i = j;
        s = v.size();
        for(j = 0; j < s; j++)
            a[v[j].first][v[j].second] = draft[v[j].first][v[j].second];
    }
    /*for(i = 0; i < n; i++)
    {
        for(j = 0; j < n; j++)
            cout << a[i][j];
        cout << "\n";
    }*/
    for(i = 0; i < n; i++)
        for(j = 0; j < n; j++)
            ans += a[i][j];
    cout << ans;
    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: RUNTIME ERROR

Test 8

Group: 3

Verdict: RUNTIME ERROR

Test 9

Group: 3

Verdict: RUNTIME ERROR