CODE FESTIVAL 2016 Final

Submission #6780527

Source codeソースコード

# 2019/08/09
from itertools import accumulate
from bisect import bisect_left

n=int(input())
a=[0]+list(accumulate(list(range(1,n+1))))


def bsct(a,key):
    l=0
    r=len(a)
    mid=(l+r)//2
    while l<=r:
        if a[mid]==key:
            return mid
        elif a[mid]>key:
            r=mid-1
        else:
            l=mid+1
        mid=(l+r)//2
    return 0

res=bsct(a,n)
if res:
    print(res)
    exit()

idx=bisect_left(a,n)
rem=a[idx]-n

ans=list(range(1,idx+1))
del ans[rem]
print(*ans,sep='\n')

Submission

Task問題 B - Exactly N points
User nameユーザ名 calei
Created time投稿日時
Language言語 Python3 (3.4.3)
Status状態 WA
Score得点 0
Source lengthソースコード長 544 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Test case

Set

Set name Score得点 / Max score Cases
sample - sample-01.txt,sample-02.txt,sample-03.txt
dataset1 0 / 200 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
dataset2 0 / 100 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,02-01.txt,02-02.txt,02-03.txt,02-04.txt,02-05.txt,02-06.txt,02-07.txt,02-08.txt,sample-01.txt,sample-02.txt,sample-03.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
01-01.txt WA
01-02.txt WA
01-03.txt WA
01-04.txt WA
01-05.txt WA
01-06.txt WA
01-07.txt WA
01-08.txt WA
01-09.txt WA
01-10.txt WA
02-01.txt MLE
02-02.txt MLE
02-03.txt MLE
02-04.txt MLE
02-05.txt MLE
02-06.txt WA
02-07.txt WA
02-08.txt MLE
sample-01.txt WA
sample-02.txt WA
sample-03.txt AC 17 ms 3064 KB