Codeforces Round #557 (Div. 2) [based on Forethought Future Cup - Final Round] B. Double Matrix

• Time : O(nm)
• Space : O(1)

#include <bits/stdc++.h>

#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")//Comment optimisations for interactive problems (use endl)
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")

using namespace std;

struct PairHash {
    inline std::size_t operator()(const std::pair<int, int> &v) const { return v.first * 31 + v.second; }
};

// speed
#define Code ios_base::sync_with_stdio(false);
#define By ios::sync_with_stdio(0);
#define Sumfi cout.tie(NULL);

// alias
using ll = long long;
using ld = long double;

// constants
const ld PI = 3.14159265358979323846;  /* pi */
const ll INF = 1e18;
const ld EPS = 1e-9;
const ll MAX_N = 202020;
const ll mod = 998244353;

// typedef
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef array<ll,3> all3;
typedef array<ll,5> all5;
typedef vector<all3> vall3;
typedef vector<all5> vall5;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef unordered_set<ll> usll;
typedef unordered_set<pll, PairHash> uspll;
typedef unordered_map<ll, ll> umll;

// macros
#define rep(i,n) for(ll i=0;i<n;i++)
#define rrep(i,m,n) for(ll i=n;i>=m;i--)
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)

ll __gcd(ll x, ll y) { return !y ? x : __gcd(y, x % y); }
ll __lcm(ll x, ll y) { return x * y / __gcd(x,y); }

using namespace std;

bool check(vvll& A) {
    ll n = A.size(), m = A[0].size();
    rep(i, n) {
        rep(j, m - 1) {
            if(A[i][j] >= A[i][j + 1]) return false;
        }
    }
    rep(i, m) {
        rep(j, n - 1) {
            if(A[j][i] >= A[j + 1][i]) return false;
        }
    }
    return true;
}

string solve(vvll& A, vvll& B) {
    ll n = A.size(), m = A[0].size();
    rep(i,n) {
        rep(j,m) {
            if(A[i][j] > B[i][j])
                swap(A[i][j], B[i][j]);
        }
    }
    return check(A) and check(B) ? "Possible" : "Impossible";
}

int main() {
    Code By Sumfi

    //cout.precision(12);

    ll tc = 1;
    //cin>>tc;
    for (ll i = 1; i <= tc; i++) {
        ll n,m;
        cin>>n>>m;
        vvll A(n,vll(m)), B(n,vll(m));
        rep(i,n) rep(j,m) cin>>A[i][j];
        rep(i,n) rep(j,m) cin>>B[i][j];
        cout<<solve(A,B)<<endl;
    }
    return 0;
}