A - lista 5...tentando muito

#include<bits/stdc++.h>
#define MAXN 100010

using namespace std;

typedef long long int ll;

vector<int> euler, graph[MAXN];
bitset<MAXN> vis;

struct Node {
    ll colours;

    Node() {
        this->colours = (1LL << 0);
    }
    void newNode(Node node1, Node node2) {
        this->colours = node1 | node2 | colours;
    }
    int countColours(Node node) {
        return __builtin_popcount(node.colours);
    }


};

void euler_tour(int node) {
    vis[node] = 1;
    euler.push_back(node);

    for(int i = 0; i < graph[node].size(); i++) {
        int v = graph[node][i];
        if(!vis[v]) euler_tour(v);
    }

    euler.push_back(node);
}





int main() {



    return 0;
}