Ruudukko

input/code.cpp: In function 'void set_io(std::string)':
input/code.cpp:19:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |         freopen((filename + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:20:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |         freopen((filename + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define fi first
#define se second
#define sz size
#define rsz resize
#define ii pair<int,int>
#define vi vector<int>
#define vvi vector<vector<int>>

void set_io(string filename = "") {
    ios::sync_with_stdio(0);
    cin.tie(0);

    if (filename != "") {
        freopen((filename + ".in").c_str(), "r", stdin);
        freopen((filename + ".out").c_str(), "w", stdout);
    }
}

int N;

int main() {
	set_io("");

    cin >> N;
    int map[N][N];
    ll dp[N][N];
    vector<pair<int, ii>> s;

    for (int i = 0; i < N; i++)
        for (int j = 0; j < N; j++) {
            dp[j][i] = 1;
            cin >> map[j][i];
            s.pb(make_pair(map[j][i], ii(j, i)));
        }
    
    sort(all(s));

    int h = s[0].fi, i = 1;
    for (auto &n : s) {
        int c = n.fi, cx = n.se.fi, cy = n.se.se;

        if (h < c) {
            i++;
            h = c;
        }

        n.fi = i;
        map[cx][cy] = i;
    }
    vector<multiset<pair<int, ii>>> xp(N), yp(N);

    for (auto n : s) {
        int cx = n.se.fi, cy = n.se.se, cw = n.fi;
        ll cp = dp[cx][cy];

        auto i = xp[cx].upper_bound(pair<int, ii>(-cw, ii(1005, 1005)));
        int ncw;
        while (i != xp[cx].end()) {
            ncw = i->fi;
            cp = (cp + dp[i->se.fi][i->se.se]) % 1000000007;
            i = xp[cx].upper_bound(pair<int, ii>(ncw, i->se));
        }
        
        i = yp[cy].upper_bound(pair<int, ii>(-cw, ii(1005, 1005)));
        while (i != yp[cy].end()) {
            ncw = i->fi;
            cp = (cp + dp[i->se.fi][i->se.se]) % 1000000007;
            i = yp[cy].upper_bound(pair<int, ii>(ncw, i->se));
        }

        xp[cx].insert(pair<int, ii>(-cw, ii(cx, cy)));
        yp[cy].insert(pair<int, ii>(-cw, ii(cx, cy)));
        dp[cx][cy] = cp;
    }

    ll ans = 0;
    for (int i = 0; i < N; i++)
        for (int j = 0; j < N; j++)
            ans = (ans + dp[j][i]) % 1000000007;

    cout << ans << endl;
}

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: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED