inline void solve() {
int cnt = 1;
int k = r / (b + 1);
int res = r % (b + 1);
for (int i = 1; i <= b + 1; i++) {
for (int j = 1; j <= k; j++) {
printf("R");
}
if (res-- > 0) {
printf("R");
}
if (i <= b) {
printf("B");
}
}
printf("\n");
}
Problem - B - Codeforceshttps://codeforces.com/contest/1659/problem/B
inline void solve(){
int n,k;
memset(a,0,sizeof(a));
scanf("%d %d",&n,&k);
string s;
cin>>s;
s=" "+s;
if(k&1){
for(int i=1;i<=n;i++){
if(s[i]=='1'){
if(k>0){
a[i]++;
k--;
}else{
s[i]='0';
}
}else{
s[i]='1';
}
}
if(k>0){
a[n]+=k;
if(k&1){
if(s[n]=='1'){
s[n]='0';
}else{
s[n]='1';
}
}
}
}else{
for(int i=1;i<=n;i++){
if(s[i]=='0'){
if(k>0){
a[i]++;
k--;
s[i]='1';
}
}
}
if(k>0){
a[n]+=k;
if(k&1){
if(s[n]=='1'){
s[n]='0';
}else{
s[n]='1';
}
}
}
}
for(int i=1;i<=n;i++){
cout<<s[i];
}
printf("\n");
for(int i=1;i<=n;i++){
printf("%d ",a[i]);
}
printf("\n");
}
Problem - C - Codeforceshttps://codeforces.com/contest/1659/problem/C
inline void solve() {
ll d = 0;
scanf("%lld %lld %lld", &n, &a, &b);
for (int i = 1; i <= n; i++) {
scanf("%d", x + i);
d += x[i];
}
ll ans = b * d;
//ll last = 0;
ll t;
for (int i = 1; i < n; i++) {
d -= x[i];
//last += a * (x[i] - x[i - 1]) + b * (x[i] - x[i - 1]);
t = b * (d - (n - i) * x[i]) + x[i] * (a + b);
ans = min(ans, t);
}
printf("%lld\n", ans);
}
Problem - D - Codeforceshttps://codeforces.com/contest/1659/problem/D
#define lowbit(x) ((x)&(-x))
int tree[MAXN];
int c[MAXN];
int ans[MAXN];
int n;
inline void update(int pos, int x) {
for (; pos <= n; pos += lowbit(pos)) {
tree[pos] += x;
}
}
inline int query(int pos) {
int rec = 0;
for (; pos; pos -= lowbit(pos)) {
rec += tree[pos];
}
return rec;
}
inline void solve() {
memset(tree, 0, sizeof(tree));
memset(ans, 0, sizeof(ans));
scanf("%d", &n);
ll num = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", c + i);
num += c[i];
}
num /= n;
for (int i = n; i >= 1; i--) {
if (num == 0) {
break;
}
if (c[i] + query(i) >= i) {
ans[i]++;
}
update(i - num + 1, -1);
if (ans[i]) {
num--;
}
}
for (int i = 1; i <= n; i++) {
printf("%d ", ans[i]);
}
printf("\n");
}