Submission #1752991

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<functional>
#include<queue>
#include <iomanip>
#include<map>
#include<limits>
#include<cmath>
#include<algorithm>
#include<bitset>
#include<utility>
#include<complex>
#include<cstdlib>
#include<set>
#include<cctype>

#define DBG cerr << '!' << endl;
#define REP(i,n) for(int (i) = (0);(i) < (n);++i)
#define rep(i,s,g) for(int (i) = (s);(i) < (g);++i)
#define rrep(i,s,g) for(int (i) = (s);i >= (g);--(i))
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {for(int i = 0;i < (n);i++)cerr << v[i] << ' ';cerr << endl << endl;}
#define SHOW2d(v,i,j) {for(int aaa = 0;aaa < i;aaa++){for(int bbb = 0;bbb < j;bbb++)cerr << v[aaa][bbb] << ' ';cerr << endl;}cerr << endl;}
#define ALL(v) v.begin(),v.end()

using namespace std;

typedef long long ll;
typedef vector<int> iv;
typedef vector<iv> iiv;
typedef vector<string> sv;

ll a[20010];
ll b[20010];
ll p[20010];

int main()
{
	
	int n;cin >> n;
	REP(i,n)cin >> p[i];
	REP(i,n)
	{
		a[i+1] = (i+1)*30000;
		b[n-i] = (i+1)*30000;
	}
	REP(i,n)
	{
		b[p[i]] += i+1;
	}
	
	REP(i,n-1)cout << a[i+1] << ' ';cout << a[n] << endl;
	REP(i,n-1)cout << b[i+1] << ' ';cout << b[n] << endl;
	
	
	return 0;
}

Submission Info

Judge Result