Problem:
Score : 400 points

Problem Statement

#nck {
width: 30px;
height: auto;
}

You are given a permutation p of the set {1, 2, ..., N}. Please construct two sequences of positive integers a_1, a_2, ..., a_N and b_1, b_2, ..., b_N satisfying the following conditions:

1 \leq a_i, b_i \leq 10^9 for all i

a_1 < a_2 < ... < a_N

b_1 > b_2 > ... > b_N

a_{p_1}+b_{p_1} < a_{p_2}+b_{p_2} < ... < a_{p_N}+b_{p_N}

Constraints

2 \leq N \leq 20,000

p is a permutation of the set {1, 2, ..., N}

Input

The input is given from Standard Input in the following format:

N
p_1 p_2 ... p_N

Output

The output consists of two lines. The first line contains a_1, a_2, ..., a_N seperated by a space. The second line contains b_1, b_2, ..., b_N seperated by a space.

It can be shown that there always exists a solution for any input satisfying the constraints.

Sample Input 1

2
1 2

Sample Output 1

1 4
5 4

a_1 + b_1 = 6 and a_2 + b_2 = 8. So this output satisfies all conditions.

Sample Input 2

3
3 2 1

Sample Output 2

1 2 3
5 3 1

Sample Input 3

3
2 3 1

Sample Output 3

5 10 100
100 10 1

Solution in C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

class Magatro
{
    static int N = int.Parse(Console.ReadLine());
    static int[] P = Console.ReadLine().Split(' ').Select(s => int.Parse(s)).ToArray();
    static void Main()
    {
        int[] A = new int[N];
        int[] B = new int[N];
        int[] Ans = new int[N];
        bool[] a = new bool[N];
        int max = 1;
        for(int i = 0; i < N; i++)
        {
            if (i != 0)
            {
                max = Math.Max(max, Math.Abs(P[i] - P[i - 1]));
            }
        }
        if (max >= 2)
        {
            max =(max+1)/2;
        }
        for(int i = 0; i < N; i++)
        {
            A[i] = 1 + max * i;
             B[i] = max * (N - 1) + 1 - i * max; 
          //  A[i] = i + 1;
           // B[i] = N - i;
        }
        bool aa =false;
        for(int i = 0; i < N; i++)
        {
            if (i != 0)
            {
                aa = P[i] - P[i - 1] > 0;
            }
            a[P[i] - 1] = true;
            for(int j = 0; j < N; j++)
            {
                
                if (!a[j])
                {
                    if (aa)
                    {
                        A[j]++;
                    }
                    else
                    {
                        B[j]++;
                    }
                }
            }
        }
        Write(A, B);
    }
    static void Write(int[] A, int[] B)
    {
        for(int i = 0; i < N-1; i++)
        {
            Console.Write(A[i]+" ");
        }
        Console.Write(A[N - 1]);
        Console.WriteLine();
        for (int i = 0; i < N - 1; i++)
        {
            Console.Write(B[i]+" ");
        }
        Console.Write(B[N - 1]);
        Console.WriteLine();
    }
}