Submission #2404528

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
using LL = long long;
using P = pair<int, int>;
using Tapris = tuple<int, int, int>;

#define REP(i, n) for(LL i = 0; i < n; ++i)
#define FOR(i, a, n) for(LL i = a; i < n; ++i)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()

const int INF = (int)1e9;
const LL INFL = (LL)1e15;
const int MOD = 1e9 + 7;

int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};

//#define int long long

/*************** using variables ***************/
int n;
vector<int> p, a, b, r;
/**********************************************/

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

    cin >> n;
    p.resize(n);
    a.resize(n);
    b.resize(n);
    r.resize(n+1);
    REP(i, n) {cin >> p[i]; p[i]--; r[p[i]] = i+1; }

    REP(i, n){
        cout << 30000 * (i+1);
        if(i != n-1) cout << " ";
    }
    cout << endl;
    REP(i, n){
        cout << 30000 * (n - i) + r[i];
        if(i != n-1) cout << " ";
    }
    cout << endl;

}

Submission Info

Judge Result