CSES - Datatähti 2017 alku - Results
Submission details
Task:Kolikot
Sender:FSMnArmosta
Submission time:2016-10-05 17:25:51 +0300
Language:Python2
Status:READY
Result:57
Feedback
groupverdictscore
#1ACCEPTED22
#2ACCEPTED35
#30
Test results
testverdicttimegroup
#1ACCEPTED0.06 s1details
#2ACCEPTED0.06 s1details
#3ACCEPTED0.06 s1details
#4ACCEPTED0.06 s1details
#5ACCEPTED0.06 s1details
#6ACCEPTED0.06 s2details
#7ACCEPTED0.06 s2details
#8ACCEPTED0.06 s2details
#9ACCEPTED0.08 s2details
#10ACCEPTED1.07 s2details
#11--3details
#12ACCEPTED0.09 s3details
#13ACCEPTED0.13 s3details
#14--3details
#15--3details
#16--3details

Code







import itertools
import math

raw_input()
coins = sorted([int(x) for x in raw_input().split(" ")])

#def viableFor(money, coinsData):
#    result = []
#    for coin in coinsData:
#        if coin < money:
#            result.append(coin)
#        elif coin == money:
#            return [coin]
#        else:
#            return result
#    return result

def bsearch(a, b, v, orig=False):
    if coins[a] == v:
        return a
    elif coins[b] == v:
        return b
    elif coins[b] < v and orig:
        return b
    elif b - a == 1:
        if coins[a] < v and coins[b] > v:
            return a
    else:
        middle = a + (b-a)//2
        if coins[middle] > v:
            return bsearch(a, middle, v)
        elif coins[middle] < v:
            return bsearch(middle, b, v)
        else:
            return middle

def findSum(money):
    s = 0
    previousIndex = len(coins)-1
    while previousIndex > -1:
        index = bsearch(0, previousIndex, money-s, True)
        if index != None:
            s = s + coins[index]
            if s == money:
                return True
            previousIndex = index - 1
        else:
            return False

def binarize(combinations):
    x = 1
    while 2**x in combinations:
        x = x + 1
    return 2**x

if coins[0] > 1:
    print("1")
else:
    i = binarize(coins)
    #maxval = sum(coins)

    while True:
        #print(i)
        if not findSum(i):
            break
        i = i + 1

    print(i)

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
10
5 3 1 4 5 1 3 2 2 3

correct output
30

user output
30

Test 2

Group: 1

Verdict: ACCEPTED

input
10
3 5 5 4 5 4 5 5 5 3

correct output
1

user output
1

Test 3

Group: 1

Verdict: ACCEPTED

input
10
10 9 2 8 7 10 7 1 5 2

correct output
62

user output
62

Test 4

Group: 1

Verdict: ACCEPTED

input
10
7 4 6 3 9 7 4 4 7 7

correct output
1

user output
1

Test 5

Group: 1

Verdict: ACCEPTED

input
10
8 2 1 7 9 7 5 2 4 5

correct output
51

user output
51

Test 6

Group: 2

Verdict: ACCEPTED

input
100
3 3 1 4 2 1 2 1 3 1 2 5 1 5 1 ...

correct output
269

user output
269

Test 7

Group: 2

Verdict: ACCEPTED

input
100
3 3 2 3 4 5 4 4 4 4 2 2 4 4 4 ...

correct output
1

user output
1

Test 8

Group: 2

Verdict: ACCEPTED

input
100
678 999 374 759 437 390 832 54...

correct output
1

user output
1

Test 9

Group: 2

Verdict: ACCEPTED

input
100
862 537 633 807 666 248 237 5 ...

correct output
30

user output
30

Test 10

Group: 2

Verdict: ACCEPTED

input
100
874 302 384 920 76 28 762 163 ...

correct output
41765

user output
41765

Test 11

Group: 3

Verdict:

input
100000
4 2 5 3 2 3 5 2 2 2 3 4 3 3 2 ...

correct output
299640

user output
(empty)

Test 12

Group: 3

Verdict: ACCEPTED

input
100000
2 5 5 5 5 2 4 4 3 2 3 2 5 5 3 ...

correct output
1

user output
1

Test 13

Group: 3

Verdict: ACCEPTED

input
100000
98146842 766872135 84108268 28...

correct output
1

user output
1

Test 14

Group: 3

Verdict:

input
100000
932032495 1 849176169 78948957...

correct output
29970

user output
(empty)

Test 15

Group: 3

Verdict:

input
100000
35894853 796619259 699878597 4...

correct output
44965249639582

user output
(empty)

Test 16

Group: 3

Verdict:

input
100000
930494676 960662779 904422858 ...

correct output
800020001

user output
(empty)