Submission #979576
Source Code Expand
N = input() P = map(lambda x:int(x)-1, raw_input().split()) MAX = 10**9 A = [MAX/(N-1)*i for i in xrange(N)] A[0] += 1 B = A[::-1] t = 0 for p in P: if A[p] + B[p] > t: t = A[p] + B[p] elif p == N-1: B[p] += t+1-A[p]-B[p] t += 1 else: A[p] += t+1-A[p]-B[p] t += 1 print ' '.join(map(str, A)) print ' '.join(map(str, B))
Submission Info
Submission Time | |
---|---|
Task | B - Construct Sequences |
User | nebukuro09 |
Language | Python (2.7.6) |
Score | 400 |
Code Size | 394 Byte |
Status | AC |
Exec Time | 51 ms |
Memory | 5964 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 | 19 ms | 2916 KB |
001.txt | AC | 18 ms | 2820 KB |
002.txt | AC | 18 ms | 2820 KB |
003.txt | AC | 17 ms | 2692 KB |
004.txt | AC | 19 ms | 2820 KB |
005.txt | AC | 50 ms | 5868 KB |
006.txt | AC | 23 ms | 3236 KB |
007.txt | AC | 46 ms | 5588 KB |
008.txt | AC | 34 ms | 4372 KB |
009.txt | AC | 47 ms | 5828 KB |
010.txt | AC | 49 ms | 5964 KB |
011.txt | AC | 50 ms | 5964 KB |
012.txt | AC | 50 ms | 5964 KB |
013.txt | AC | 51 ms | 5964 KB |
014.txt | AC | 51 ms | 5964 KB |
015.txt | AC | 49 ms | 5964 KB |
016.txt | AC | 49 ms | 5964 KB |
017.txt | AC | 49 ms | 5964 KB |
018.txt | AC | 48 ms | 5964 KB |
example0.txt | AC | 16 ms | 2692 KB |
example1.txt | AC | 16 ms | 2692 KB |
example2.txt | AC | 16 ms | 2692 KB |