Graph painting

#include <iostream>
#include <string>
#include <vector>
 
using namespace std;
 
class Node {
public:
	vector<Node*> neighbors;
	int name;
	char color;
	// Constructor TODO
	Node(int name_) {
		name = name_;
		color = '-';
	}
	void connect(Node* other) {
		neighbors.push_back(other);
		other->neighbors.push_back(this);
	}
};
 
int main() {
	int t;
	cin >> t;
 
	for (int i = 0; i < t; i++) {
		int n,m;
		cin >> n >> m;
		vector<Node*> nodes;
		for(int j = 0; j < n; j++)
			nodes.push_back(new Node(j));
		for(int j=0; j<m; j++) {
			int u,v;
			cin >> u >> v;
			nodes[u-1]->connect(nodes[v-1]);
		}
		for(auto node : nodes) {
			int n_red = 0;
			int n_blue = 0;
			for(auto neigh : node->neighbors) {
				if(neigh->color == 'R')
					n_red += 1;
				else if(neigh->color == 'B')
					n_blue++;
			}
			if(n_red > n_blue)
				node->color = 'B';
			else
				node->color = 'R';
			cout << node->color << " ";
		}
		cout << endl;
	}
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED