Submission #1226430

#	Time	Username	Problem	Language	Result	Execution time	Memory
1226430		tgirolami09	Let's Win the Election (JOI22_ho_t3)	Pypy 3	11 / 100	2596 ms	51492 KiB

Main

#My brute-force for stress test
from itertools import permutations

nbStates = int(input())
nbVotesNeeded = int(input())

states = []

for i in range(nbStates):
    vote,help = map(int,input().split())

    states.append((vote,help))

#Three cases but in a case where we don't take a value there is another where that value is at the end and we cannot take it
#So only two
bestTime = 10**10
#We basically take the votes of all the states present
#But we do or don't take a helper
for perm in permutations(states,nbVotesNeeded):
    #Bitmask
    for mask in range(2**nbVotesNeeded+1):
        currHelpers = 1
        currTime = 0
        for i in range(nbVotesNeeded):
            #Set will go to the helper
            if (mask & (1<<i) and perm[i][1]!=-1):
                currTime += (perm[i][1]/currHelpers)
                currHelpers+=1

            #unset will go to the vote
            else:
                currTime += (perm[i][0]/currHelpers)
        

        if currTime<bestTime:
            bestTime = currTime
            # print(f"Best permutation is : {perm}, with mask {mask} (score {currTime})")

print(bestTime)

Compilation message (stdout)

Compiling 'Main.py'...

=======
  adding: __main__.pyc (deflated 27%)

=======

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 11 / 11
• Subtask 4: 0 / 12
• Subtask 5: 0 / 33
• Subtask 6: 0 / 11
• Subtask 7: 0 / 23