Submission #3592445


Source Code Expand

def inpl(): return [int(i) for i in input().split()]
import numpy as np
N = int(input())
p = inpl()

a = np.array(range(1,N+1))
b = np.array(range(1,N+1))
c = np.zeros((N,1), dtype = int)
d = np.zeros((N,1), dtype = int)
for i in range(N):
    c[p[i]-1] += i+1
    d[N-p[i]] += i+1
print(*(a+np.cumsum(c)))
print(*(b+np.cumsum(d))[::-1])

Submission Info

Submission Time
Task B - Construct Sequences
User Tallfall
Language Python (3.4.3)
Score 400
Code Size 350 Byte
Status AC
Exec Time 404 ms
Memory 15604 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 172 ms 12776 KB
001.txt AC 168 ms 12648 KB
002.txt AC 166 ms 12648 KB
003.txt AC 158 ms 12648 KB
004.txt AC 168 ms 12648 KB
005.txt AC 378 ms 15496 KB
006.txt AC 196 ms 12904 KB
007.txt AC 357 ms 15068 KB
008.txt AC 273 ms 14172 KB
009.txt AC 381 ms 15384 KB
010.txt AC 379 ms 15596 KB
011.txt AC 392 ms 15600 KB
012.txt AC 384 ms 15596 KB
013.txt AC 399 ms 15596 KB
014.txt AC 382 ms 15600 KB
015.txt AC 385 ms 15600 KB
016.txt AC 404 ms 15604 KB
017.txt AC 399 ms 15596 KB
018.txt AC 399 ms 15552 KB
example0.txt AC 154 ms 12408 KB
example1.txt AC 155 ms 12364 KB
example2.txt AC 152 ms 12408 KB