Fragile network

input/code.cpp: In function 'void alg(std::vector<int>&, std::vector<std::vector<std::pair<int, int> > >&)':
input/code.cpp:15:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     while (!q.empty() or assigned < team.size()) {
      |                          ~~~~~~~~~^~~~~~~~~~~~~
input/code.cpp:17:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |             while (i < team.size() and team[i] != 0)
      |                    ~~^~~~~~~~~~~~~

#include <iostream>
#include <vector>
#include <queue>

using namespace std;

void alg(vector<int> &team, vector<vector<pair<int, int>>> &adj) {

    queue<int> q;
    q.push(0);
    team[0] = 1;
    int i = 1;
    int assigned = 1;

    while (!q.empty() or assigned < team.size()) {
        if (q.empty()) {
            while (i < team.size() and team[i] != 0)
                ++i;
            q.push(i);
            team[i] = 1;
            ++assigned;
        }
        int node = q.front();
        q.pop();

        for (auto [neighbour, type] : adj[node]) {
            if (team[neighbour] == 0) {
                if (type == 1)
                    team[neighbour] = team[node];
                else 
                    team[neighbour] = 3 - team[node];
                ++assigned;
                q.push(neighbour);
            }
            else {
                if (type == 1 and team[neighbour] != team[node]) {
                    cout << "No" << endl;
                    return;
                }
                else if (type == -1 and team[neighbour] == team[node]) {
                    cout << "No" << endl;
                    return;
                }
            }                
        }
    }
    cout << "Yes" << endl;
}

int main() {
    int n, m;
    cin >> n >> m;

    vector<vector<pair<int, int>>> adj(n);
    vector<int> team(n, 0);

    for (int i = 0; i < m; ++i) {
        int a, b, c;
        cin >> a >> b >> c;
        adj[a-1].push_back({b-1, c});
        adj[b-1].push_back({a-1, c});
    }

    alg(team, adj);
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: WRONG ANSWER