Submission #56353925

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(x) x.begin(), x.end()
const int iinf = 1e9 + 10;
const ll linf = 1e18 + 10;
const int mod = 1'000'000'007;
int mm(int a, int b){ return (a*1ll*b) % mod; }
//---------------------------------------------------------------------
const int multitest = 0;

void solve(){
    int n; cin >> n;
    vector <int> p(n), q(n), ip(n), iq(n);
    for (int & x : p){
        cin >> x; x--;
    }
    for (int & x : q){
        cin >> x; x--;
    }

    vector <vector<int>> ans(n, vector<int>(n, -1));
    // for (int i = 0; i < n; i++) ip[p[i]] = i;
    // for (int i = 0; i < n; i++) iq[q[i]] = i;
    ip = p, iq = q;

    for (int j = 0; j < n; j++){
        int row = ip[j], col = iq[n-1-j];
        // cout << row << " " << col << endl;
        for (int i = 0; i < n; i++){
            if (ans[i][col] == -1) ans[i][col] = 1;
        }
        for (int i = 0; i < n; i++){            
            if (ans[row][i] == -1) ans[row][i] = 0;
        }
    }
    for (int i = 0; i < n; i++){
        for (int j = 0; j < n; j++){
            cout << ans[i][j];
        }
        cout << "\n";
    }

}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int T = 1; 
    if (multitest) cin >> T;
    while (T--) 
        solve();

    return 0;
}

Submission Info

Judge Result