Submission #5621666


Source Code Expand

#include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define LLINF ((long long) 1e18)//1234567890987654321
#define INF 1234567890ll
#define pb emplace_back
#define ins insert
#define f first
#define s second	
#define db 0
#define EPS (1e-7)    //0.0000001 the value
#define PI (acos(-1))
#define MAXN (300006)
#define MAXK 26
#define MAXX 15000006
#define ll long long int 
#define ld long double
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
#define FOR(ii, ss, ee) for(ll ii = ss; ii < ee; ++ii)
#define space " "
#define cbr cerr << "hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ((ll)x.size())
#define ph emplace
#define btinpct(x) __builtin_popcountll(x)
#define p2(x) (1LL<<(x))
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
typedef pair <ll, ll> pi;
typedef pair <ll, pi> spi;
typedef pair <pi, pi> dpi;
inline ll rand(ll x, ll y) { ++y; return (rng() % (y-x)) + x; } //inclusivesss
ll n,p[20006];
ll magic=20001;
int main()
{
	FAST
	cin>>n;
	FOR(i,0,n){
		ll a; cin>>a;
		p[a-1]=i;
	}
	FOR(i,0,n){
		cout<<(i+1)*magic<<' ';
	}
	cout<<'\n';
	FOR(i,0,n){
		cout<<(n-i)*magic+(p[i]+1)<<' ';
	}
	cout<<'\n';
}

Submission Info

Submission Time
Task B - Construct Sequences
User rscodes
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1396 Byte
Status AC
Exec Time 6 ms
Memory 768 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 22
Set Name Test Cases
Sample example0.txt, example1.txt, example2.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, example0.txt, example1.txt, example2.txt
Case Name Status Exec Time Memory
000.txt AC 2 ms 256 KB
001.txt AC 2 ms 256 KB
002.txt AC 1 ms 256 KB
003.txt AC 1 ms 256 KB
004.txt AC 2 ms 256 KB
005.txt AC 6 ms 768 KB
006.txt AC 2 ms 384 KB
007.txt AC 5 ms 768 KB
008.txt AC 4 ms 512 KB
009.txt AC 6 ms 768 KB
010.txt AC 6 ms 768 KB
011.txt AC 6 ms 768 KB
012.txt AC 6 ms 768 KB
013.txt AC 6 ms 768 KB
014.txt AC 6 ms 768 KB
015.txt AC 6 ms 768 KB
016.txt AC 6 ms 768 KB
017.txt AC 6 ms 768 KB
018.txt AC 6 ms 768 KB
example0.txt AC 1 ms 256 KB
example1.txt AC 1 ms 256 KB
example2.txt AC 1 ms 256 KB