Online feud

input/code.cpp: In function 'void solve()':
input/code.cpp:56:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     for (int i = 0; i < link.size(); i++)
      |                     ~~^~~~~~~~~~~~~
input/code.cpp:58:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     for (int i = 0; i < sizes.size(); i++)
      |                     ~~^~~~~~~~~~~~~~
input/code.cpp:84:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |     for (int i = 0; i < different.size(); i++)
      |                     ~~^~~~~~~~~~~~~~~~~~

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <unordered_map>
#include <queue>
#include <climits>
#include <cmath>
 
#define int long long
using namespace std;

vector<int> link;
vector<int> sizes;

int find(int x) {
    while (x != link[x]) x = link[x];
    return x;
}

bool same(int a, int b) {
    return find(a) == find(b);
}

void unite(int a, int b) {
    a = find(a);
    b = find(b);
    if (sizes[a] < sizes[b]) swap(a,b);
    sizes[a] += sizes[b];
    link[b] = a;
}

bool checkColoring(vector<vector<int>>& adj, vector<int>& coloring, int i)
{
    bool possible = true;
    for (auto& neighbour : adj[i])
    {
        if (coloring[find(neighbour)] == 0)
        {
            coloring[find(neighbour)] = coloring[find(i)] == 1 ? 2 : 1;
            possible &= checkColoring(adj, coloring, neighbour);
        }
        else possible &= coloring[find(neighbour)] != coloring[find(i)];
    }
    return possible;
}

void solve()
{
    int n, m;
    cin >> n >> m;

    link = vector<int>(n);
    sizes = vector<int>(n);
    for (int i = 0; i < link.size(); i++)
        link[i] = i;
    for (int i = 0; i < sizes.size(); i++)
        sizes[i] = 1;

    vector<vector<int>> different(n, vector<int>());

    // Unite the same ones
    for (int i = 0; i < m; i++)
    {
        int a, b, c;
        cin >> a >> b >> c;
        a--;b--;
        if (c == -1)
        {
            different[a].push_back(b);
            different[b].push_back(a);
        }
        else
        {
            if (!same(a, b))
                unite(a, b);
        }
    }

    // Check 2 coloring on different ones
    vector<int> coloring(n, 0);
    bool doable = true;
    for (int i = 0; i < different.size(); i++)
    {
        if (coloring[find(i)] == 0)
        {
            coloring[find(i)] = 1;
            doable &= checkColoring(different, coloring, i);
        }
    }

    if (doable)
        cout << "Yes";
    else
        cout << "No";
}

signed main()
{
    int t = 1;

    //cin >> t;

    for (int i = 0; i < t; i++)
        solve();

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: WRONG ANSWER

Test 35

Verdict: WRONG ANSWER

Test 36

Verdict: ACCEPTED

Test 37

Verdict: WRONG ANSWER

Test 38

Verdict: ACCEPTED

Test 39

Verdict: WRONG ANSWER

Test 40

Verdict: ACCEPTED

Test 41

Verdict: WRONG ANSWER

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: WRONG ANSWER

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: WRONG ANSWER

Test 50

Verdict: ACCEPTED

Test 51

Verdict: WRONG ANSWER

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: WRONG ANSWER

Test 55

Verdict: WRONG ANSWER

Test 56

Verdict: ACCEPTED

Test 57

Verdict: WRONG ANSWER

Test 58

Verdict: ACCEPTED

Test 59

Verdict: WRONG ANSWER

Test 60

Verdict: ACCEPTED

Test 61

Verdict: WRONG ANSWER

Test 62

Verdict: ACCEPTED

Test 63

Verdict: ACCEPTED

Test 64

Verdict: WRONG ANSWER

Test 65

Verdict: WRONG ANSWER

Test 66

Verdict: ACCEPTED

Test 67

Verdict: WRONG ANSWER

Test 68

Verdict: ACCEPTED

Test 69

Verdict: WRONG ANSWER

Test 70

Verdict: ACCEPTED

Test 71

Verdict: WRONG ANSWER