Submission #1695926
Source Code Expand
/*
____________ ______________ __
/ _________ /\ /_____ _____/\ / /\
/ /\ / / \\ / /\ \ \ / / \
/ / \_____/ / / \__/ / \____\/ / / /
/ / / / / / / / / / / /
/ / / / / / / / / / / /
/ / / / / / / / / / / /
/ /___/____/ / / / / / / /___/________
/____________/ / /__/ / /______________/\
\ \ / \ \ / \ \ \
\____________\/ \__\/ \______________\/
___ ___ ___ __________
/ /\ / /\ / /\ /_______ /\
/ /__\___/ / \ / / \ \ / / \
/____ ____/ / / / / \____/ / /
\ / /\ \ / / / / / / /
\_/ / \___\/ ___ / / / / / /
/ / / / /\ / / / / / /
/ / / / /__\__/ / / / /___/____
/___/ / /___________/ / /___________/\
\ \ / \ \ / \ \ \
\___\/ \___________\/ \___________\/
A FAN OF FIZZYDAVID
*/
#include<bits/stdc++.h>
#define HEAP priority_queue
#define rep(i,n) for(int i=0;i<(n);i++)
#define per(i,n) for(int i=(n)-1;i>=0;i--)
#define forn(i,l,r) for(int i=(l);i<=(r);i++)
#define nrof(i,r,l) for(int i=(r);i>=(l);i--)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define X first
#define Y second
#define eps 1e-20
#define pi 3.1415926535897932384626433832795
#define orz int
#define yjz main
#define fizzydavid return
#define ak 0
#define la ;
#define debug puts("OK");
#define SZ(x) (int)x.size()
#define ALL(x) x.begin(),x.end()
using namespace std;
typedef long long LL;
typedef double flt;
typedef vector<int> vi;
typedef pair<int,int> pii;
const int iinf=1e9+7;
const LL linf=1ll<<60;
const flt dinf=1e10;
template <typename T>
inline void scf(T &x)
{
bool f=0; x=0; char c=getchar();
while((c<'0' || c>'9') && c!='-') c=getchar();
if(c=='-') { f=1; c=getchar(); }
while(c>='0' && c<='9') { x=x*10+c-'0'; c=getchar(); }
if(f) x=-x; return;
}
template <typename T1,typename T2>
void scf(T1 &x,T2 &y) { scf(x); return scf(y); }
template <typename T1,typename T2,typename T3>
void scf(T1 &x,T2 &y,T3 &z) { scf(x); scf(y); return scf(z); }
#ifdef ONLINE_JUDGE
#else
#define DEBUG
#endif
//---------------------------head----------------------------
const int N=23333;
int n;
int a[N],b[N],p[N];
orz yjz()
{
scf(n);
forn(i,1,n) scf(p[i]);
a[1]=1; forn(i,2,n) a[i]=a[i-1]+n;
b[n]=1; nrof(i,n-1,1) b[i]=b[i+1]+n;
forn(i,2,n) a[p[i]]+=i-1;
forn(i,1,n) printf("%d%c",a[i],i==n?'\n':' ');
forn(i,1,n) printf("%d%c",b[i],i==n?'\n':' ');
fizzydavid ak la
}
Submission Info
Submission Time |
|
Task |
B - Construct Sequences |
User |
OMTWOCZWEIXVI |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
3063 Byte |
Status |
AC |
Exec Time |
7 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 |
2 ms |
256 KB |
004.txt |
AC |
2 ms |
256 KB |
005.txt |
AC |
7 ms |
896 KB |
006.txt |
AC |
2 ms |
384 KB |
007.txt |
AC |
6 ms |
768 KB |
008.txt |
AC |
4 ms |
512 KB |
009.txt |
AC |
6 ms |
896 KB |
010.txt |
AC |
7 ms |
896 KB |
011.txt |
AC |
7 ms |
896 KB |
012.txt |
AC |
7 ms |
896 KB |
013.txt |
AC |
7 ms |
896 KB |
014.txt |
AC |
7 ms |
896 KB |
015.txt |
AC |
7 ms |
896 KB |
016.txt |
AC |
6 ms |
896 KB |
017.txt |
AC |
6 ms |
896 KB |
018.txt |
AC |
7 ms |
896 KB |
example0.txt |
AC |
1 ms |
256 KB |
example1.txt |
AC |
1 ms |
256 KB |
example2.txt |
AC |
1 ms |
256 KB |