Building Teams

#include "iostream"
#include "vector"

int main() {
    int n, m;
    std::cin >> n >> m;
    std::vector<std::vector<int>> friendships(n);
    int a, b;
    for (int i = 0; i < m; i++) {
        std::cin >> a >> b;
        friendships[a - 1].push_back(b);
        friendships[b - 1].push_back(a);
    }
    std::vector<int> teams(n, 0);
    int curr = 1;
    int currTeam = 1;
    while(curr < n) {
        if (teams[curr - 1] != 0) {
            curr++;
            continue;
        }
        teams[curr - 1] = currTeam;
        for (auto& friends : friendships[curr - 1]) {
            if (teams[friends - 1] == 0) teams[friends - 1] = 1 + (currTeam==1);
            else if (teams[friends - 1] == currTeam) {
                std::cout << "IMPOSSIBLE";
                return EXIT_FAILURE;
            }
        }
        currTeam = 1 + (currTeam==1);
        curr++;
    }
    for (auto& team : teams) {
        std::cout << team << " ";
    }
}

Test 1

Verdict: RUNTIME ERROR

Test 2

Verdict: RUNTIME ERROR

Test 3

Verdict: RUNTIME ERROR

Test 4

Verdict: RUNTIME ERROR

Test 5

Verdict: RUNTIME ERROR

Test 6

Verdict: RUNTIME ERROR

Test 7

Verdict: RUNTIME ERROR

Test 8

Verdict: RUNTIME ERROR

Test 9

Verdict: RUNTIME ERROR

Test 10

Verdict: RUNTIME ERROR

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: RUNTIME ERROR