1944C - MEX Game 1 - CodeForces Solution


constructive algorithms games greedy

Please click on ads to support us..

Python Code:

t = int(input())
while t > 0:
    n = int(input())
    arr = list(map(int, input().split()))
    
    x = 0
    from collections import Counter
    c = Counter(arr)
    for i in range(0, n+1):
        if c.get(i, 0) == 0:
            print(i)
            break
        if c.get(i) == 1:
            x += 1
        if x == 2:
            print(i)
            break
    t -= 1


Comments

Submit
0 Comments
More Questions

1711A - Perfect Permutation
1701B - Permutation
1692A - Marathon
1066A - Vova and Train
169B - Replacing Digits
171D - Broken checker
380C - Sereja and Brackets
1281B - Azamon Web Services
1702A - Round Down the Price
1681C - Double Sort
12A - Super Agent
1709A - Three Doors
1680C - Binary String
1684B - Z mod X = C
1003A - Polycarp's Pockets
1691B - Shoe Shuffling
1706A - Another String Minimization Problem
1695B - Circle Game
1702B - Polycarp Writes a String from Memory
1701A - Grass Field
489C - Given Length and Sum of Digits
886B - Vlad and Cafes
915A - Garden
356A - Knight Tournament
1330A - Dreamoon and Ranking Collection
1692B - All Distinct
1156C - Match Points
1675A - Food for Animals
1328C - Ternary XOR
1689A - Lex String