Submission #1499269
Source Code Expand
#!/usr/bin/env python3 n = int(input()) ps = list(map(int,input().split())) imos = [None] * n for i, p in enumerate(ps): imos[p-1] = i a = [ 0 ] b = [ 0 ] for i in range(n): a += [ a[-1] + 1 + imos[i] ] b += [ b[-1] + 1 + imos[n-i-1] ] print(*a[1:]) print(*reversed(b[1:]))
Submission Info
Submission Time | |
---|---|
Task | B - Construct Sequences |
User | kimiyuki |
Language | Python (3.4.3) |
Score | 400 |
Code Size | 301 Byte |
Status | AC |
Exec Time | 61 ms |
Memory | 7296 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 | 21 ms | 3640 KB |
001.txt | AC | 19 ms | 3500 KB |
002.txt | AC | 19 ms | 3508 KB |
003.txt | AC | 18 ms | 3316 KB |
004.txt | AC | 20 ms | 3472 KB |
005.txt | AC | 56 ms | 7048 KB |
006.txt | AC | 25 ms | 4040 KB |
007.txt | AC | 55 ms | 6652 KB |
008.txt | AC | 37 ms | 5336 KB |
009.txt | AC | 56 ms | 6936 KB |
010.txt | AC | 56 ms | 7268 KB |
011.txt | AC | 57 ms | 7268 KB |
012.txt | AC | 56 ms | 7156 KB |
013.txt | AC | 57 ms | 7264 KB |
014.txt | AC | 59 ms | 7268 KB |
015.txt | AC | 61 ms | 7132 KB |
016.txt | AC | 60 ms | 7296 KB |
017.txt | AC | 61 ms | 7260 KB |
018.txt | AC | 58 ms | 7256 KB |
example0.txt | AC | 17 ms | 3060 KB |
example1.txt | AC | 16 ms | 3060 KB |
example2.txt | AC | 16 ms | 3064 KB |