Submission #1696746
Source Code Expand
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
#define INF_LL (ll)1e18
#define INF (int)1e9
#define REP(i, n) for(int i = 0;i < (n);i++)
#define FOR(i, a, b) for(int i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
using ll = long long;
using PII = pair<int, int>;
const double eps = 1e-10;
template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}
class RMQ{
private:
int n;
vector<ll> node, lazy;
vector<bool> lazyFlag;
public:
RMQ(vector<ll> v){
int sz = v.size();
n = 1; while(n < sz) n *= 2;
node.resize(2*n-1, INF_LL);
lazy.resize(2*n-1, 0);
lazyFlag.resize(2*n-1, false);
REP(i, sz) node[i+n-1] = v[i];
for(int i = n-2;i >= 0;i--) node[i] = min(node[2*i+1], node[2*i+2]);
}
void eval(int k, int l, int r){
if(lazyFlag[k]){
node[k] = lazy[k];
if(r-l > 1){
lazy[2*k+1] = lazy[k];
lazy[2*k+2] = lazy[k];
lazyFlag[2*k+1] = lazyFlag[2*k+2] = true;
}
lazy[k] = 0;
lazyFlag[k] = false;
}
}
void update(int a, int b, ll x, int k=0, int l=0, int r=-1){
if(r < 0) r = n;
eval(k, l, r);
if(b <= l || r <= a) return;
if(a <= l && r <= b){
lazy[k] = x;
lazyFlag[k] = true;
eval(k, l, r);
}else{
update(a, b, x, k*2+1, l, (l+r)/2);
update(a, b, x, k*2+2, (l+r)/2, r);
node[k] = min(node[k*2+1], node[k*2+2]);
}
}
ll query(int a, int b, int k=0, int l=0, int r=-1){
if(r < 0) r = n;
eval(k, l, r);
if(b <= l || r <= a) return INF_LL;
if(a <= l && r <= b) return node[k];
return min(query(a, b, k*2+1, l, (l+r)/2), query(a, b, k*2+2, (l+r)/2, r));
}
};
class RMQ_MAX{
private:
int n;
vector<ll> node, lazy;
vector<bool> lazyFlag;
public:
RMQ_MAX(vector<ll> v){
int sz = v.size();
n = 1; while(n < sz) n *= 2;
node.resize(2*n-1, INF_LL);
lazy.resize(2*n-1, 0);
lazyFlag.resize(2*n-1, false);
REP(i, sz) node[i+n-1] = v[i];
for(int i = n-2;i >= 0;i--) node[i] = max(node[2*i+1], node[2*i+2]);
}
void eval(int k, int l, int r){
if(lazyFlag[k]){
node[k] = lazy[k];
if(r-l > 1){
lazy[2*k+1] = lazy[k];
lazy[2*k+2] = lazy[k];
lazyFlag[2*k+1] = lazyFlag[2*k+2] = true;
}
lazy[k] = 0;
lazyFlag[k] = false;
}
}
void update(int a, int b, ll x, int k=0, int l=0, int r=-1){
if(r < 0) r = n;
eval(k, l, r);
if(b <= l || r <= a) return;
if(a <= l && r <= b){
lazy[k] = x;
lazyFlag[k] = true;
eval(k, l, r);
}else{
update(a, b, x, k*2+1, l, (l+r)/2);
update(a, b, x, k*2+2, (l+r)/2, r);
node[k] = max(node[k*2+1], node[k*2+2]);
}
}
ll query(int a, int b, int k=0, int l=0, int r=-1){
if(r < 0) r = n;
eval(k, l, r);
if(b <= l || r <= a) return -1;
if(a <= l && r <= b) return node[k];
return max(query(a, b, k*2+1, l, (l+r)/2), query(a, b, k*2+2, (l+r)/2, r));
}
};
int main(void){
int N;
int p[20020];
int a[20020], b[20020];
cin >> N;
REP(i, N){
cin >> p[i]; p[i]--;
a[i] = b[N-i-1] = i*20010+1;
}
REP(i, N){
a[p[i]] += i;
}
REP(i, N)
cout << a[i] << " ";
cout << endl;
REP(i, N)
cout << b[i] << " ";
cout << endl;
}
Submission Info
Submission Time |
|
Task |
B - Construct Sequences |
User |
maze1230 |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
3517 Byte |
Status |
AC |
Exec Time |
12 ms |
Memory |
896 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
400 / 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 |
AC |
2 ms |
256 KB |
001.txt |
AC |
2 ms |
256 KB |
002.txt |
AC |
2 ms |
256 KB |
003.txt |
AC |
1 ms |
256 KB |
004.txt |
AC |
2 ms |
256 KB |
005.txt |
AC |
11 ms |
896 KB |
006.txt |
AC |
3 ms |
384 KB |
007.txt |
AC |
10 ms |
768 KB |
008.txt |
AC |
6 ms |
512 KB |
009.txt |
AC |
11 ms |
896 KB |
010.txt |
AC |
12 ms |
896 KB |
011.txt |
AC |
12 ms |
896 KB |
012.txt |
AC |
12 ms |
896 KB |
013.txt |
AC |
12 ms |
896 KB |
014.txt |
AC |
12 ms |
896 KB |
015.txt |
AC |
12 ms |
896 KB |
016.txt |
AC |
12 ms |
896 KB |
017.txt |
AC |
12 ms |
896 KB |
018.txt |
AC |
12 ms |
896 KB |
example0.txt |
AC |
1 ms |
256 KB |
example1.txt |
AC |
1 ms |
256 KB |
example2.txt |
AC |
1 ms |
256 KB |