Submission #1295117

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<pint> vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=n-1;i>=(0);i--)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define all(v) (v).begin(),(v).end()
#define eall(v) unique(all(v), v.end())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll INFF = 1e18;

int N;
int p[20010];
int a[20010], b[20010];

int main(void){
	cin >> N;
	rep(i, N) cin >> p[i];
	rep(i, N) p[i]--;
	rep(i, N) a[p[i]] = i + 1;
	rep(i, N) a[i] += 20001 * i;
	rep(i, N) b[i] = INF -  20001 * i;
	rep(i, N)printf("%d ", a[i]);
	printf("\n");
	rep(i, N)printf("%d ", b[i]);
	printf("\n");
	/*
	rep(i, N){
		printf("%lld\n", a[i] + b[i]);
	}
	*/
	return 0;
}

Submission Info

Judge Result