Graph painting

// NONAME-01

#include <bits/stdc++.h>


using namespace std;

int n, m;
vector< vector<int> > nxt;
vector <int> col;

void Load()
{
  cin >> n >> m;
  nxt.resize(n);
  int i;
  for (i = 0; i < n; i++) nxt.resize(0);
  for (i = 0; i < m; i++) {
	int a, b;
	cin >> a >> b;
	a--;
	b--;
	nxt[a].push_back(b);
	nxt[b].push_back(a);
  }
}

void Solve()
{
  int i, j;
  col.resize(n);
  col[0] = 0;
  int a, b;
  for (i = 1; i < n; i++) {
	  a = 0;
	  b = 0;
	  for (j = 0; j < (int)nxt[i].size();j++) {
		int k = nxt[i][j];
		if (k > i) continue;
		if (col[k] == 0) a++;
		else b++;
	  }
	  if (a > b) {
		col[i] = 1;
	  } else {
		col[i] = 0;
	  }
  }
  for (i = 0; i < n; i++) {
	if ( col[i] == 0) cout << "R ";
	else cout << "B ";
  }
  cout << "\n";
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int nt, tt;
  cin >> nt;
  for (tt = 0; tt < nt; tt++) {
	Load();
	Solve();
  }
  return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED