#include "gift.h"
#include <bits/stdc++.h>
using namespace std;
#ifndef EVAL
#include "grader.cpp"
#endif
struct segtree
{
vector<int> tree = vector<int>(1 << 20, -1);
void lazzy(int index)
{
if (tree[index] != -1)
tree[index * 2] = tree[index * 2 + 1] = tree[index];
tree[index] = -1;
}
void iota(int index, int b, int e)
{
if (e - b == 1)
{
tree[index] = b;
return;
}
iota(index * 2, b, (b + e) / 2);
iota(index * 2 + 1, (b + e) / 2, e);
}
void updset(int index, int b, int e, int l, int r, int v)
{
if (l <= b && e <= r)
{
tree[index] = v;
return;
}
if (e <= l || r <= b)
return;
lazzy(index);
updset(index * 2, b, (b + e) / 2, l, r, v);
updset(index * 2 + 1, (b + e) / 2, e, l, r, v);
}
int query(int index, int b, int e, int p)
{
if (p < b || p >= e)
return 0;
if (e - b == 1 && b == p)
return tree[index];
lazzy(index);
return query(index * 2, b, (b + e) / 2, p) + query(index * 2 + 1, (b + e) / 2, e, p);
}
} tree;
int construct(int n, int r, std::vector<int> a, std::vector<int> b, std::vector<int> x)
{
tree.iota(1, 0, n);
vector<int> prefix(n);
iota(prefix.begin(), prefix.end(), 0);
for (int i = 0; i < a.size(); i++) //update single color
{
if (x[i] == 1)
{
//int va = tree.query(1, 0, n, a[i]);
//tree.updset(1, 0, n, a[i], b[i] + 1, va);
fill(prefix.begin() + a[i], prefix.begin() + b[i] + 1, prefix[a[i]]);
}
}
for (int i = 0; i < a.size(); i++) //check wetherpossible
{
if (x[i] == 2)
{
int va = tree.query(1, 0, n, a[i]);
int vb = tree.query(1, 0, n, b[i]);
if (vb == va)
return 0;
}
}
std::string s(n, 'R');
bool bo = true;
int last = -1;
for (int i = 0; i < n; i++)
{
//int v = tree.query(1, 0, n, i);
int v = prefix[i];
if (v != last)
{
last = v;
bo = !bo;
}
s[i] = bo ? 'R' : 'B';
}
craft(s);
return 1;
}
