Submission #1306386
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,int> plli;
typedef pair<int,pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>=0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
const ll mod = 1e9 + 7;
const ll INF = 1<<30;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const double pi = 3.141592653589793;
vector<vector<int>> g(15);
int n;
int p[200000+5];
int a[200000+5],b[200000+5];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
rep(i,n) cin >> p[i];
int pos[n+1]={};
rep(i,n){
pos[p[i]]=i;
}
rep2(i,1,n+1){
a[i]=i*30000+pos[i];
b[i]=(n-i)*30000;
}
rep2(i,1,n+1) cout << a[i] << (i!=n ? ' ' : '\n');
rep2(i,1,n+1) cout << b[i] << (i!=n ? ' ' : '\n');
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Construct Sequences |
User |
roto_37 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1197 Byte |
Status |
WA |
Exec Time |
6 ms |
Memory |
1024 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 400 |
Status |
|
|
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 |
WA |
2 ms |
384 KB |
001.txt |
WA |
1 ms |
384 KB |
002.txt |
WA |
1 ms |
256 KB |
003.txt |
WA |
1 ms |
256 KB |
004.txt |
WA |
2 ms |
384 KB |
005.txt |
WA |
6 ms |
1024 KB |
006.txt |
WA |
2 ms |
384 KB |
007.txt |
WA |
6 ms |
896 KB |
008.txt |
WA |
4 ms |
640 KB |
009.txt |
WA |
6 ms |
896 KB |
010.txt |
WA |
6 ms |
1024 KB |
011.txt |
WA |
6 ms |
1024 KB |
012.txt |
WA |
6 ms |
1024 KB |
013.txt |
WA |
6 ms |
1024 KB |
014.txt |
WA |
6 ms |
1024 KB |
015.txt |
WA |
6 ms |
1024 KB |
016.txt |
WA |
6 ms |
1024 KB |
017.txt |
WA |
6 ms |
1024 KB |
018.txt |
WA |
6 ms |
1024 KB |
example0.txt |
WA |
1 ms |
256 KB |
example1.txt |
WA |
1 ms |
256 KB |
example2.txt |
WA |
1 ms |
256 KB |