Building Teams

#include <iostream>
#include <cstdlib>
using namespace std;
#include <stdio.h>
#include <stdlib.h>
int main() {
    int n;
    int m;
    cin >> m;
    cin >> n;
    int* pair1 = (int*)malloc(n * sizeof(int));
    int* pair2 = (int*)malloc(n * sizeof(int));
    int* team = (int*)malloc(m * sizeof(int));
    for (int i = 0; i < m; ++i) { *(team + i) = -1; }
    
    int impossible = 0;
    for (int i = 0; i < n; ++i) {
        cin >> *(pair1 + i);
        cin >> *(pair2 + i);
        int p1 = (*(pair1 + i)) - 1;
        int p2 = (*(pair2 + i)) - 1;
        int t1 = *(team + p1);
        int t2 = *(team + p2);
        if (t1 == -1) {
            if (t2 == -1) {
                *(team + p1) = 1;
                *(team + p2) = 2;
            } else {
                *(team + p1) = t2 == 1 ? 2 : 1;
            }
        }
        if (t1 != -1) {
            if (t2 == -1) {
                *(team + p2) = t1 == 1 ? 2 : 1;
            } else {
                if (t1 == t2) {
                    impossible = 1;
                    continue;
                } 
            }
        }
    }
    if (impossible) {
        cout << "IMPOSSIBLE";
    } else {
        for (int i = 0; i < m; ++i) {
            cout << *(team + i) << " ";
        }
    }
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED