Submission #3455671


Source Code Expand

import bisect
N = int(input())
src = list(map(int,input().split()))
order = [(i-a)*N - a for i,a in enumerate(src)]

lis = [order[0]]
for a in order[1:]:
    i = bisect.bisect(lis,a)
    if i == len(lis):
        lis.append(a)
    else:
        lis[i] = a
print(len(lis))

Submission Info

Submission Time
Task B - リス
User prd_xxx
Language Python (3.4.3)
Score 0
Code Size 283 Byte
Status WA
Exec Time 333 ms
Memory 37724 KB

Judge Result

Set Name sample all
Score / Max Score 0 / 0 0 / 1
Status
AC × 3
AC × 10
WA × 14
Set Name Test Cases
sample sample-01.txt, sample-02.txt, sample-03.txt
all sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
01-01.txt AC 18 ms 3060 KB
01-02.txt AC 17 ms 3060 KB
01-03.txt WA 17 ms 3064 KB
01-04.txt WA 17 ms 3060 KB
01-05.txt WA 17 ms 3060 KB
01-06.txt WA 18 ms 3060 KB
01-07.txt WA 19 ms 3188 KB
01-08.txt WA 20 ms 3316 KB
01-09.txt WA 36 ms 5140 KB
01-10.txt WA 329 ms 35540 KB
01-11.txt WA 331 ms 35540 KB
01-12.txt WA 324 ms 35544 KB
01-13.txt WA 320 ms 35476 KB
01-14.txt WA 314 ms 35476 KB
01-15.txt WA 319 ms 35612 KB
01-16.txt WA 333 ms 35608 KB
01-17.txt AC 327 ms 22432 KB
01-18.txt AC 238 ms 37724 KB
sample-01.txt AC 17 ms 3060 KB
sample-02.txt AC 17 ms 3060 KB
sample-03.txt AC 17 ms 3060 KB