| Task: | Ruudukko | 
| Sender: | Kemm1706 | 
| Submission time: | 2024-01-11 19:00:08 +0200 | 
| Language: | C++ (C++11) | 
| Status: | READY | 
| Result: | 100 | 
| group | verdict | score | 
|---|---|---|
| #1 | ACCEPTED | 28 | 
| #2 | ACCEPTED | 33 | 
| #3 | ACCEPTED | 39 | 
| 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 | ACCEPTED | 0.01 s | 2, 3 | details | 
| #6 | ACCEPTED | 0.01 s | 2, 3 | details | 
| #7 | ACCEPTED | 0.26 s | 3 | details | 
| #8 | ACCEPTED | 0.29 s | 3 | details | 
| #9 | ACCEPTED | 0.39 s | 3 | details | 
Compiler report
input/code.cpp: In function 'bool sosanh(item, item)':
input/code.cpp:15:7: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
   15 |     if(a.val == b.val)
      |       ^Code
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector <ll> vl;
typedef vector <vl> vvl;
const ll modd = 1e9 + 7;
struct item
{
    ll val, x, y;
};
bool sosanh(item a, item b)
{
    if(a.val == b.val)
        if(a.x == b.x)
            return a.y < b.y;
        else
            return a.x < b.x;
    return a.val < b.val;
}
void out(vl a)
{
    for(auto x : a)
        cerr << x << " ";
    cerr << "\n";
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    ll n, m, i, j, k = 0, l;
    cin >> n;
    m = n * n;
    vector <item> a(m);
    queue <item> q;
    item draft;
    vvl ans(n, vl(n, 0));
    for(i = 0; i < n; i++)
        for(j = 0; j < n; j++)
        {
            cin >> a[k].val;
            a[k].x = i;
            a[k].y = j;
            k++;
        }
    sort(a.begin(), a.end(), sosanh);
    vl sx(n, 0), sy(n, 0);
    i = j = 0;
    while(i < m)
    {
        while(j < m && a[j].val == a[i].val)
        {
            k = a[j].x; l = a[j].y;
            ans[k][l] += sx[k] + sy[l] + 1; ans[k][l] %= modd;
            draft.val = ans[k][l]; draft.x = k; draft.y = l;
            q.push(draft);
            j++;
        }
        while(!q.empty())
        {
            draft = q.front();
            q.pop();
            sx[draft.x] += draft.val; sx[draft.x] %= modd;
            sy[draft.y] += draft.val; sy[draft.y] %= modd;
        }
        i = j;
    }
    k = 0;
    for(i = 0; i < n; i++)
        for(j = 0; j < n; j++)
        {
            k += ans[i][j];
            k %= modd;
        }
    cout << k;
    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: ACCEPTED
| input | 
|---|
| 100 1 2 3 4 5 6 7 8 9 10 11 12 13 ...  | 
| correct output | 
|---|
| 187458477 | 
| user output | 
|---|
| 187458477 | 
Test 6
Group: 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 100 2995 8734 1018 2513 7971 5063 ...  | 
| correct output | 
|---|
| 964692694 | 
| user output | 
|---|
| 964692694 | 
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: ACCEPTED
| input | 
|---|
| 1000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...  | 
| correct output | 
|---|
| 229147081 | 
| user output | 
|---|
| 229147081 | 
Test 9
Group: 3
Verdict: ACCEPTED
| input | 
|---|
| 1000 520283 805991 492643 75254 527...  | 
| correct output | 
|---|
| 951147313 | 
| user output | 
|---|
| 951147313 | 
