Building Teams

n, m = map(int, input().split())

friendships = [[] for _ in range(n)]
groups = [0 for _ in range(n)]

# def findandlabel(x, team):
#     for friendship in friendships[x]:
#         if groups[friendship] == groups[x]: 
#             print("IMPOSSIBLE")
#             return False
#         if groups[friendship] == 0:
#             groups[friendship] = 2 if groups[x] == 1 else 1
#             team = not team
#             bool = findandlabel(friendship, team)
#             if not bool: return False
#     return True


for i in range(m):
    a, b = [int(x) for x in input().split()]
    friendships[a-1].append(b-1)

# print(friendships)

for i in range(len(friendships)):
    if groups[i] == 0:
        groups[i] = 1
        queue = [i]
        impos = False
        while len(queue) != 0:
            for friend in friendships[queue[-1]]:
                if groups[friend] == groups[queue[-1]]:
                    print("IMPOSSIBLE")
                    impos = True
                    break
                if groups[friend] == 0: groups[friend] = 2 if groups[queue[-1]] == 1 else 1
                queue.append(friend)
            if impos: break
            queue.pop(-1)



# for i in range(len(friendships)):
#     team = True # True is two, false is one
#     if groups[i] == 0: groups[i] = 1
#     # print(groups)
#     bool = findandlabel(i, team)        

if not impos: print(" ".join(map(str, groups)))

Test 1

Verdict: TIME LIMIT EXCEEDED

Test 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: ACCEPTED