Submission #979565

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream> 
#include<map>
#include <iomanip>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
using namespace std;
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)
#define LONGINF 1000000000000000000
int wow[30000] = {};
int topper[30000] = {};
int botter[30000] = {};
int main() {
	int n;
	cin >> n;
	for (int i = 1;i <= n;++i) {
		int tmp;
		cin >> tmp;
		wow[tmp-1] = i * 2;
	}
	for (int i = 0;i < n;++i) {
		if (wow[i] == 2) {
			topper[i] = 1000000;
			for (int q = i + 1;q < n;++q) {
				topper[q] = topper[q - 1] + wow[q];
			}
			for (int q = i - 1;q >= 0;--q) {
				topper[q] = topper[q + 1] - wow[q];
			}
			goto ok;
		}
	}
ok:;
	for (int i = 0;i < n;++i) {
		botter[i] = 2000000 - topper[i] + wow[i];
	}
	REP(i, n) {
		cout << topper[i] << " ";
	}
	cout << endl;
	REP(i, n) {
		cout << botter[i] << " ";
	}
	cout << endl;
		return 0;
}

Submission Info

Judge Result