Online feud

// ~/.vim/cpp_template.cpp
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <limits>

#define REP(i,a,b) for (int i = a; i < b; i++)

// Type Aliases for 1D and 2D vectors with initialization
#define vi(n, val) vector<int>(n, val) // 1D vector of ints with size n, initialized to val
#define vll(n, val) vector<long long>(n, val) // 1D vector of long longs with size n, initialized to val
#define ll long long
#define vvi(n, m, val) vector<vector<int>>(n, vector<int>(m, val)) // 2D vector of ints (n x m), initialized to val
#define vvll(n, m, val) vector<vector<long long>>(n, vector<long long>(m, val)) // 2D vector of long longs (n x m), initialized to val

#define LL_INF std::numeric_limits<long long int>::max()
#define INF std::numeric_limits<int>::max()


using namespace std;


template <typename T>
void pV(const std::vector<T>& vec, const std::string& label = "Vector") {
    std::cout << label << ": [ ";
    for (const auto& elem : vec) {
        std::cout << elem << " ";
    }
    std::cout << "]" << std::endl;
}


void dfs(int s, vector<bool> *visited, vector<int> (*adj)[]) {
    if ((*visited)[s]) return;
    (*visited)[s] = true;
    // process node s


    for (auto u: (*adj)[s]) {
        dfs(u, visited, adj);
    }
}
/*
// DEPTH-FRIRST-SEARCH
vector<int> adj[N];                                                          
vector<bool> visited(N, false);
int u, v;
for(int i = 0; i < M;i++){
    cin >> u >> v;
    u--;
    v--;
    adj[u].push_back(v);
    adj[v].push_back(u);
}
*/

vector<long long> dijkstra(int N, int x, vector<vector<pair<int,int>>> *adj){
    vector<bool> processed(N, false);
    vector<long long> distance(N, LL_INF);
    priority_queue<pair<long long,int>> q;
    //for (int i = 1; i <= n; i++) distance[i] = INF;
    distance[x] = 0;
    q.push({0,x});
    while (!q.empty()) {
        int a = q.top().second; q.pop();
        if (processed[a]) continue;
        processed[a] = true;
        for (auto u : (*adj)[a]) {
            int b = u.first, w = u.second;
            if (distance[a]+w < distance[b]) {
                distance[b] = distance[a]+w;
                q.push({-distance[b],b});
            }
        }
    }
    return distance;


}


/*
DIJKSTRA
//vector<vector<pair<int,int>>> adj(N, vector<pair<int, int>>(N));
*/



int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    // Your code starts here
    int n, m;
    cin >> n >> m;

    map<int, set<int>> like;
    map<int, set<int>> dislike;

    REP(i, 0, m){
        int a, b, c;
        cin >> a >> b >> c;
        if(c == 1){
            like[a].insert(b);
            like[b].insert(a);
        }else{
            dislike[a].insert(b);
            dislike[b].insert(a);
        }
    }

    set<int> open;

    // sol
    set<int> left, right;
    left.insert(1);
    for(auto x: like[1]){
        left.insert(x);
    }
    for(auto x: dislike[1]){
        right.insert(x);
    }
    
    REP(i, 2, n+1){
        /*
        if(left.count(i)){
            left.insert(like[i].begin(), like[i].end());
            continue;
        }
        if(right.count(i)){
            right.insert(dislike[i].begin(), dislike[i].end());
            continue;
        }
        */
        for(auto x: like[i]){
            if(left.count(x)){
                left.insert(i);
            }else if(right.count(x)){
                right.insert(i);
            }else{
                open.insert(i);
            }
            if(left.count(i) && right.count(i)){
                cout << "No" << endl;
                exit(0);
            }
        }
        for(auto x: dislike[i]){
            if(left.count(x)){
                right.insert(i);
            }else if(right.count(x)){
                left.insert(i);
            }else{
                open.insert(i);
            }
            if(left.count(i) && right.count(i)){
                cout << "No" << endl;
                exit(0);
            }
        }
    }

    for(auto i: open){
        for(auto x: like[i]){
            if(left.count(x)){
                left.insert(i);
            }else if(right.count(x)){
                right.insert(i);
            }else{
                left.insert(i);
            }
            if(left.count(i) && right.count(i)){
                cout << "No" << endl;
                exit(0);
            }
        }
        for(auto x: dislike[i]){
            if(left.count(x)){
                right.insert(i);
            }else{
                left.insert(i);
            }
            if(left.count(i) && right.count(i)){
                cout << "No" << endl;
                exit(0);
            }
        }

    }

    cout << "Yes" << endl;


    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

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: WRONG ANSWER

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

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: WRONG ANSWER

Test 46

Verdict: ACCEPTED

Test 47

Verdict: WRONG ANSWER

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: WRONG ANSWER

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: WRONG ANSWER

Test 71

Verdict: WRONG ANSWER