Submission #1438075

---

Source Code Expand

#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "math.h"
#include "utility"
#include "string"
#include "map"
#include "unordered_map"
#include "iomanip"
#include "random"

using namespace std;
const long long int MOD = 1000000007;

long long int power(long long int x, long long int n, long long int M) {
	long long int tmp = 1;

	if (n > 0) {
		tmp = power(x, n / 2, M);
		if (n % 2 == 0) tmp = (tmp*tmp) % M;
		else tmp = (((tmp*tmp) % M)*x) % M;
	}
	return tmp;
}

long long int N, M, K, Q, W, H, L, R;
long long int ans;

using namespace std;


int main() {
	ios::sync_with_stdio(false);
	cin >> N;
	long long int num[100000];
	for (int i = 1; i <= N; i++) {
		cin >> num[i];
		num[i] = num[i] * MOD + i;
	}
	sort(num + 1, num + N + 1);
	for (int i = 1; i <= N; i++) {
		if (i > 1)cout << " ";
		cout << i*N;
	}
	cout << endl;
	for (int i = 1; i <= N; i++) {
		if (i > 1)cout << " ";
		cout << (N - i + 1)*N + num[i] % MOD;
	}
	cout << endl;
	return 0;
}

Submission Info

Judge Result