solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
n = int(input())
val = list(input())
m = n // 2
if n & 1:
rb = list('rb' * m + 'r')
br = list('br' * m + 'b')
else:
rb = list('rb' * m)
br = list('br' * m)
def solve(text):
r, b = 0, 0
for i in range(n):
if val[i] != text[i]:
if val[i] == 'r':
r += 1
else:
b += 1
return max(r, b)
ans = min(solve(rb), solve(br))
print(ans) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
string s;
cin >> n;
cin >> s;
int r = 0, b = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == 'r') r++;
if (s[i] == 'b') b++;
}
int ans1 = 0, ans2 = 0;
int red = 0;
for (int i = 1; i < n; i += 2) {
if (s[i] == 'r') red++;
}
for (int i = 0; i < n; i += 2) {
if (s[i] == 'b') {
red = max(red - 1, 0);
ans1++;
}
}
ans1 += red;
int black = 0;
for (int i = 1; i < n; i += 2) {
if (s[i] == 'b') black++;
}
for (int i = 0; i < n; i += 2) {
if (s[i] == 'r') {
black = max(black - 1, 0);
ans2++;
}
}
ans2 += black;
cout << min(ans1, ans2) << endl;
return 0;
}
| 8 | CPP |
from collections import Counter,defaultdict,deque
#alph = 'abcdefghijklmnopqrstuvwxyz'
#from math import factorial as fact
#import math
#tt = 1#int(input())
#total=0
#n = int(input())
#n,m,k = [int(x) for x in input().split()]
#n = int(input())
#n,m = [int(x) for x in input().split()]
n = int(input())
if n==1:
print(0)
exit()
c = 0
arr = [x for x in input()]+['a','a']
v1 = 'rb'*(n//2)+'r'*(n%2)
r1,r2,b1,b2 = 0,0,0,0
for i in range(n):
if arr[i] =='r':
if v1[i] =='b':
b1+=1
else:
b2+=1
else:
if v1[i] == 'r':
r1+=1
else:
r2+=1
print(min(max(r1,b1),max(r2,b2)))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T gcd(T a, T b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
template <class T>
inline T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
inline int nxt() {
int wow;
scanf("%d", &wow);
return wow;
}
inline long long int lxt() {
long long int wow;
scanf("%lld", &wow);
return wow;
}
inline double dxt() {
double wow;
scanf("%lf", &wow);
return wow;
}
int one1[100002], two1[100002];
int main() {
int m = nxt();
string s, s1, s2;
cin >> s;
for (int i = 0; i < m; i++) {
if (i % 2 == 0)
s1.push_back('r');
else
s1.push_back('b');
if (i % 2 == 0)
s2.push_back('b');
else
s2.push_back('r');
}
for (int i = 0; i < m; i++) {
if (s[i] != s1[i]) one1[i] = 1;
if (s[i] != s2[i]) two1[i] = 1;
}
int b1 = 0, r1 = 0, b2 = 0, r2 = 0, ans1, ans2;
for (int i = 0; i < m; i++) {
if (one1[i] == 1 && s[i] == 'b') b1++;
if (one1[i] == 1 && s[i] == 'r') r1++;
if (two1[i] == 1 && s[i] == 'b') b2++;
if (two1[i] == 1 && s[i] == 'r') r2++;
}
ans1 = max(b1, r1);
ans2 = max(b2, r2);
cout << min(ans1, ans2) << endl;
return 0;
}
| 8 | CPP |
n = int(input())
s = input()
if n % 2 == 0:
a = 'rb' * (n//2)
b = 'br' * (n//2)
else:
a = 'rb' * ((n-1)//2) + 'r'
b = 'br' * ((n-1)//2) + 'b'
rr = 0
bb = 0
res = []
for i in range(n):
if a[i] == 'r' and s[i] == 'b':
rr += 1
continue
elif a[i] == 'b' and s[i] == 'r':
bb += 1
continue
res.append(max(rr,bb))
rr = 0
bb = 0
for i in range(n):
if b[i] == 'r' and s[i] == 'b':
rr += 1
continue
elif b[i] == 'b' and s[i] == 'r':
bb += 1
continue
res.append(max(rr,bb))
print(min(res)) | 8 | PYTHON3 |
n = int(input())
a = input().strip()
even = a[::2]
odd = a[1::2]
c = 'rb'
ans = n
for i in range(2):
x = len(even) - even.count(c[i])
y = len(odd) - odd.count(c[i^1])
ans = min(ans, max(x,y))
print (ans)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n;
char s[100005];
queue<int> q1, q2;
int solve(int f) {
int ans = 0, p1 = 0, p2 = 0;
if (f == 1) {
for (int i = 0; i < n; i++) {
if (i % 2 == 1 && s[i] == 'b') p1++;
if (i % 2 == 0 && s[i] == 'r') p2++;
}
return abs(p2 - p1) + min(p2, p1);
} else {
for (int i = 0; i < n; i++) {
if (i % 2 == 1 && s[i] == 'r') p1++;
if (i % 2 == 0 && s[i] == 'b') p2++;
}
return abs(p2 - p1) + min(p2, p1);
}
}
int main() {
scanf("%d", &n);
scanf("%s", s);
while (!q1.empty()) q1.pop();
while (!q2.empty()) q2.pop();
int c1, c2;
c1 = solve(1);
c2 = solve(0);
printf("%d\n", min(c1, c2));
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int inf = (int)(1e9) + 100;
const int mod = (int)(1e9) + 7;
const int N = (int)(1e5) + 100;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
string s, rb = "", br = "";
cin >> n >> s;
int r = 0, b = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0)
rb += "r", br += "b";
else if (i % 2 == 1)
rb += "b", br += "r";
r += (s[i] == 'r'), b += (s[i] == 'b');
}
if (r == n || b == n) {
cout << n / 2;
return 0;
}
if (rb == s || br == s) return cout << 0, 0;
int r1 = 0, b1 = 0, r2 = 0, b2 = 0;
for (int i = 0; i < n; i++) {
if (s[i] != rb[i]) {
r1 += (s[i] == 'r');
b1 += (s[i] == 'b');
}
if (s[i] != br[i]) {
r2 += (s[i] == 'r');
b2 += (s[i] == 'b');
}
}
cout << (min(max(r1, b1), max(r2, b2)));
return 0;
}
| 8 | CPP |
n = int(input())
c = input()
e1, o1, e2, o2 = 0, 0, 0, 0
for x in range(0, n, 2):
if c[x] != "r":
e1 += 1
for y in range(1, n, 2):
if c[y] != "b":
o1 += 1
for x in range(0, n, 2):
if c[x] != "b":
e2 += 1
for y in range(1, n, 2):
if c[y] != "r":
o2 += 1
print(min(max(e1, o1), max(e2, o2)))
| 8 | PYTHON3 |
def fbf():
bbad = 0
rbad = 0
for i in range(n):
if (i % 2 == 0 and a[i] == 'r'):
rbad += 1
if (i % 2 == 1 and a[i] == 'b'):
bbad += 1
return max(bbad, rbad)
def frf():
bbad = 0
rbad = 0
for i in range(n):
if (i % 2 == 1 and a[i] == 'r'):
rbad += 1
if (i % 2 == 0 and a[i] == 'b'):
bbad += 1
return max(bbad, rbad)
n = int(input())
a = input()
print(min(fbf(), frf())) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
double m11 = 0, m12 = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
if (s[i] == 'r') m11++;
} else {
if (s[i] == 'b') m12++;
}
}
double m21 = 0, m22 = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
if (s[i] == 'b') m21++;
} else {
if (s[i] == 'r') m22++;
}
}
cout << min(min(m11, m12) + abs(m11 - m12), min(m21, m22) + abs(m21 - m22))
<< endl;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
using int64 = int64_t;
const int64 kInfL = 1e15 + 10;
const int kInf = 1e9 + 10;
const int kMod = 1e9 + 7;
void solve() {
int n;
cin >> n;
string s;
cin >> s;
auto check = [&](const int bit) -> int {
int b = 0, r = 0;
for (int i = 0; i < n; i++) {
if (((i & 1) == bit) and s[i] == 'r')
r++;
else if (((i & 1) != bit) and s[i] == 'b')
b++;
}
return max(r, b);
};
cout << min({check(0), check(1)}) << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t = 1;
while (t--) {
solve();
}
}
| 8 | CPP |
#"from dust i have come, dust i will be"
import sys
n=int(input())
s=input()
t=""
#rbrb....
for i in range(n//2):
t+="rb"
if n%2==1:
t+="r"
r=0;b=0
for i in range(n):
if s[i]!=t[i]:
if t[i]=='r':
r+=1
else:
b+=1
f=max(r,b)
#brbr...
t=""
for i in range(n//2):
t+="br"
if n%2==1:
t+="b"
r=0;b=0
for i in range(n):
if s[i]!=t[i]:
if t[i]=='r':
r+=1
else:
b+=1
print(min(f,max(r,b)))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, a[100] = {0}, b[100] = {0}, c[3], sum1 = 0, sum2 = 0;
string s;
cin >> n;
cin >> s;
for (i = 0; i < n; ++i) {
if (i % 2) {
if (s[i] == 'b')
b[1]++;
else
b[2]++;
} else {
if (s[i] == 'b')
a[1]++;
else
a[2]++;
}
}
c[1] = a[1] + b[2];
c[2] = b[1] + a[2];
while (a[2] > 0 && b[1] > 0) {
a[2]--;
b[1]--;
sum1++;
}
sum1 += a[2] + b[1];
while (a[1] > 0 && b[2] > 0) {
a[1]--;
b[2]--;
sum2++;
}
sum2 += a[1] + b[2];
cout << min(sum1, sum2);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int imax = 1e9 + 7;
const long long lmax = 1e18;
vector<int> v;
string s;
int getv(int color) {
int i;
int x[2] = {0};
for (i = 0; i < ((int)s.size()); ++i) {
if (s[i] != color) x[color]++;
color = 1 - color;
}
return x[0] + x[1] - min(x[0], x[1]);
}
int calc() {
int i, n;
cin >> n >> s;
for (i = 0; i < ((int)s.size()); ++i)
if (s[i] == 'r')
s[i] = 0;
else
s[i] = 1;
cout << min(getv(0), getv(1));
return 0;
}
int main() {
ios_base::sync_with_stdio(0);
calc();
printf("\n");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
string s;
int main() {
int n, r_r = 0, b_r = 0, r_b = 0, b_b = 0;
cin >> n;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'r') {
if (i % 2 == 0)
r_b++;
else
r_r++;
}
if (s[i] == 'b') {
if (i % 2 == 0)
b_r++;
else
b_b++;
}
}
cout << min(max(r_b, b_b), max(r_r, b_r));
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
void swap(int &a, int &b) {
int t;
t = a;
a = b;
b = t;
}
int max(int a, int b) {
if (a > b)
return a;
else
return b;
}
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
char a[100002];
int main() {
int n;
scanf("%d\n", &n);
scanf("%s\n", a);
int r1 = 0, b1 = 0, r2 = 0, b2 = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
if (a[i] == 'r')
r2++;
else
b1++;
} else {
if (a[i] == 'r')
r1++;
else
b2++;
}
}
int ans1 = max(b1, r1);
int ans2 = max(b2, r2);
int ans = min(ans1, ans2);
printf("%d\n", ans);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
int h1(int s[100002], int c[100002]) {
int x = 0, y = 0;
for (int i = 0; i < n; i++) {
if (s[i] != c[i] && s[i] == 'r') {
x++;
} else if (s[i] != c[i] && s[i] == 'b') {
y++;
}
}
int a = min(x, y);
int b = max(x, y) - a;
return a + b;
}
int main() {
int i;
int s[100002];
int a[100002];
int b[100002];
scanf("%d", &n);
getchar();
for (i = 0; i < n; i++) {
scanf("%c", &s[i]);
if (i & 1) {
a[i] = 'b';
b[i] = 'r';
} else {
a[i] = 'r';
b[i] = 'b';
}
}
int x, y;
x = h1(s, a);
y = h1(s, b);
printf("%d\n", min(x, y));
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string a;
cin >> n >> a;
int c1 = 0, c2 = 0, c3 = 0, c4 = 0, ans = -1;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
if (a[i] == 'b')
c1++;
else if (a[i] == 'r')
c2++;
} else if (i % 2 == 1) {
if (a[i] == 'r')
c3++;
else if (a[i] = 'b')
c4++;
}
}
int ans2;
ans = max(c3, c1);
ans2 = max(c4, c2);
ans = min(ans, ans2);
cout << ans << endl;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
string str;
cin >> str;
long long r = 0, b = 0, _r = 0, _b = 0;
for (long long i = 0; i < n; i++) {
if (i % 2 == 0) {
if (str[i] == 'b') r++;
} else {
if (str[i] == 'r') b++;
}
}
for (long long i = 0; i < n; i++) {
if (i % 2 == 0) {
if (str[i] == 'r') _b++;
} else {
if (str[i] == 'b') _r++;
}
}
cout << min(max(r, b), max(_r, _b));
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double pi = 2 * acos(0);
const int mod = 1000000007;
const int N = 20007;
void solve() {
int n;
cin >> n;
string s;
cin >> s;
int c = 0, a = 0, b = 0;
for (int i = 0; i < n; i++) {
if (i & 1) {
if (s[i] == 'b')
c++;
else
b++;
} else {
if (s[i] == 'r')
c++;
else
a++;
}
}
int s1 = c + min(a, b);
c = 0, a = 0, b = 0;
for (int i = 0; i < n; i++) {
if (i & 1) {
if (s[i] == 'r')
c++;
else
a++;
} else {
if (s[i] == 'b')
c++;
else
b++;
}
}
int s2 = c + min(a, b);
int ans = n - max(s1, s2);
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int q = 1;
while (q--) {
solve();
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
char str[101010];
int main() {
int n;
while (~scanf("%d", &n)) {
scanf("%s", str);
int r = 0;
int b = 0;
for (int i = 0; i < n; i += 2) {
if (str[i] != 'r') r++;
if (i + 1 < n && str[i + 1] != 'b') b++;
}
int ans1 = max(r, b);
r = 0;
b = 0;
for (int i = 0; i < n; i += 2) {
if (str[i] != 'b') b++;
if (i + 1 < n && str[i + 1] != 'r') r++;
}
int ans2 = max(r, b);
printf("%d\n", min(ans1, ans2));
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
char s[100005];
int main() {
int i, n, cnt1, cnt2, ans1, ans2;
cnt1 = cnt2 = ans1 = ans2 = 0;
scanf("%d%s", &n, s);
for (i = 0; i < n; i++) {
if (i & 1) {
if (s[i] == 'r') cnt1++;
} else {
if (s[i] == 'b') cnt2++;
}
}
ans1 = max(cnt1, cnt2);
cnt1 = cnt2 = 0;
for (i = 0; i < n; i++) {
if (i & 1) {
if (s[i] == 'b') cnt1++;
} else {
if (s[i] == 'r') cnt2++;
}
}
ans2 = max(cnt1, cnt2);
printf("%d", min(ans1, ans2));
}
| 8 | CPP |
n = int(input())
a = input()
p1 = 0
p2 = 0
for i in range(n):
if i % 2 and a[i] != 'r':
p1 += 1
if not i % 2 and a[i] != 'b':
p2 += 1
m1 = max(p1, p2)
p1 = 0
p2 = 0
for i in range(n):
if i % 2 and a[i] != 'b':
p1 += 1
if not i % 2 and a[i] != 'r':
p2 += 1
m2 = max(p1, p2)
print(min(m1, m2)) | 8 | PYTHON3 |
n = int(input())
s = input()
m = n // 2
rem = n % 2
first = "rb" * m + "r" * rem
second = "br" * m + "b" * rem
r1, b1, r2, b2 = 0, 0, 0, 0
for i in range(n):
if s[i] != first[i]:
if s[i] == "b":
b1 += 1
else:
r1 += 1
if s[i] != second[i]:
if s[i] == "b":
b2 += 1
else:
r2 += 1
print(min(max(r1, b1), max(r2, b2))) | 8 | PYTHON3 |
#------------------------template--------------------------#
import os
import sys
from math import *
from collections import *
from fractions import *
from bisect import *
from heapq import*
from io import BytesIO, IOBase
def vsInput():
sys.stdin = open('input.txt', 'r')
sys.stdout = open('output.txt', 'w')
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
ALPHA='abcdefghijklmnopqrstuvwxyz'
MOD=1000000007
def value():return tuple(map(int,input().split()))
def array():return [int(i) for i in input().split()]
def Int():return int(input())
def Str():return input()
def arrayS():return [i for i in input().split()]
#-------------------------code---------------------------#
# vsInput()
n=Int()
s=input()
odd=[s[i] for i in range(n) if(i%2)]
even=[s[i] for i in range(n) if(not i%2)]
# print(even)
# print(odd)
#case 1 brbr
needs1=even.count('r')
needs2=odd.count('b')
ans=min(needs1,needs2)+abs(needs2-needs1)
needs1=even.count('b')
needs2=odd.count('r')
ans=min(ans,min(needs1,needs2)+abs(needs2-needs1))
print(ans)
| 8 | PYTHON3 |
import sys
import math
import bisect
def solve(A):
n = len(A)
x = 0
y = 0
for i in range(n):
if A[i] == 0 and i % 2 == 1:
x += 1
elif A[i] == 1 and i % 2 == 0:
y += 1
return max(x, y)
def main():
n = int(input())
A = []
s = input()
for c in s:
if c == 'r':
A.append(0)
elif c == 'b':
A.append(1)
val1 = solve(A.copy())
for i in range(n):
A[i] ^= 1
val2 = solve(A.copy())
print(min(val1, val2))
if __name__ == "__main__":
main()
| 8 | PYTHON3 |
def miss(st, c):
r = 0
for i in range(0, n, 2):
if st[i] != c[0]:
r += 1
b = 0
for i in range(1, n, 2):
if st[i] != c[1]:
b += 1
return max(r, b)
n = int(input())
s = input()
print(min(miss(s, 'rb'), miss(s, 'br'))) | 8 | PYTHON3 |
IL = lambda: list(map(int, input().split()))
IS = lambda: input().split()
I = lambda: int(input())
S = lambda: input()
n = I()
s = S()
rb = [s[i] == "rb"[i%2] for i in range(n)]
br = [s[i] == "br"[i%2] for i in range(n)]
ans = [0, 0]
mp0 = rb[0::2].count(False), rb[1::2].count(False)
mp1 = br[0::2].count(False), br[1::2].count(False)
print(min(max(mp0), max(mp1)))
| 8 | PYTHON3 |
from itertools import groupby
n=int(input())
s=input()
ans1=0
ans2=0
for x in range(n):
if x%2==0:
if s[x]=='b':
ans1=ans1+1
else:
if s[x]=='r':
ans2=ans2+1
ans=min(ans1,ans2)+abs(ans1-ans2)
ans1=0
ans2=0
for x in range(n):
if x%2==0:
if s[x]=='r':
ans1=ans1+1
else:
if s[x]=='b':
ans2=ans2+1
ans=min(ans,min(ans1,ans2)+abs(ans1-ans2))
print(ans)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, a, b, c, d, x, y;
char s[100050];
int main() {
scanf("%d", &n);
scanf("%s", s);
for (int i = 0; i < n; i++) {
if (i % 2 && s[i] != 'r')
a++;
else if (i % 2 == 0 && s[i] != 'b')
b++;
}
x = max(a, b);
for (int i = 0; i < n; i++) {
if (i % 2 && s[i] != 'b')
c++;
else if (i % 2 == 0 && s[i] != 'r')
d++;
}
y = max(c, d);
printf("%d\n", min(x, y));
}
| 8 | CPP |
N = int(input())
This, Ans = input(), []
for i in ['rb', 'br']:
Should = i * (N // 2) + i[:N % 2]
WasR = This.count('r')
NowR = Should.count('r')
Diff = sum(1 for i, j in zip(This, Should) if i != j)
Ans.append((Diff - abs(WasR - NowR)) // 2 + abs(WasR - NowR))
print(min(Ans))
# Hope the best for Ravens
# Never give up
| 8 | PYTHON3 |
n=int(input())
m=input()
rb={'r':0,'b':0}
br={'r':0,'b':0}
for i in range(n):
if i%2:
if m[i]=='b':
br['b']+=1
else:
rb['r']+=1
else:
if m[i]=='r':
br['r']+=1
else:
rb['b']+=1
rbs=min(rb['b'],rb['r'])+abs(rb['b']-rb['r'])
brs=min(br['b'],br['r'])+abs(br['b']-br['r'])
print(min(rbs,brs))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, count = 0, ans;
cin >> n;
string s;
cin >> s;
long long r = 0, b = 0;
for (long long i = 0; i < n; i++)
if (s[i] == 'r')
r++;
else if (s[i] == 'b')
b++;
for (long long i = 0; i < n; i++)
if (i % 2 == 0 && s[i] != 'r')
count++;
else if (i % 2 == 1 && s[i] != 'b')
count++;
long long rx = n % 2 == 1 ? 1 + (long long)(n / 2) : n / 2;
ans = abs(r - rx);
count -= ans;
ans += (count / 2);
count = 0;
for (long long i = 0; i < n; i++)
if (i % 2 == 1 && s[i] != 'r')
count++;
else if (i % 2 == 0 && s[i] != 'b')
count++;
ans = min(ans, abs(b - rx) + (count - abs(b - rx)) / 2);
cout << ans;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int break_point() {
char c;
while ((c = getchar()) != '\n')
;
return 0;
}
template <typename T>
void read_integer(T &r) {
bool sign = 0;
r = 0;
char c;
while (1) {
c = getchar();
if (c == '-') {
sign = 1;
break;
}
if (c != ' ' && c != '\n') {
r = c - '0';
break;
}
}
while (1) {
c = getchar();
if (c == ' ' || c == '\n') break;
r = r * 10 + (c - '0');
}
if (sign) r = -r;
}
long long binpowmod(long long a, long long b, long long mod) {
if (b == 0) return 1;
long long c = binpowmod(a, b >> 1, mod);
return (((c * c) % mod) * (b & 1 ? a : 1)) % mod;
}
long long binpow(long long a, long long b) {
if (b == 0) return 1;
long long c = binpow(a, b >> 1);
return c * c * (b & 1 ? a : 1);
}
inline int getbit(int x, int b) { return (x >> b) & 1; }
inline int setbit(int x, int b) { return x | (1 << b); }
inline void _setbit(int &x, int b) { x = setbit(x, b); }
inline long long setbit(long long x, int b) { return x | (1ll << b); }
inline void _setbit(long long &x, int b) { x = setbit(x, b); }
inline int unsetbit(int x, int b) { return x & (INT_MAX - (1 << b)); }
inline void _unsetbit(int &x, int b) { x = unsetbit(x, b); }
inline int countbit(int x) {
x = x - ((x >> 1) & 0x55555555);
x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
return ((x + (x >> 4) & 0xF0F0F0F) * 0x1010101) >> 24;
}
inline long long countbit(long long x) {
return countbit(int(x & INT_MAX)) + countbit(int(x >> 32) & INT_MAX);
}
inline void printbit(int x, int len) {
for (int i = len - 1; i >= 0; i--) printf("%d", getbit(x, i));
}
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
template <typename A, typename B>
ostream &operator<<(ostream &stream, const pair<A, B> &p) {
stream << "{" << p.first << "," << p.second << "}";
return stream;
}
template <typename A>
ostream &operator<<(ostream &stream, const vector<A> &v) {
stream << "[";
for (auto itr = v.begin(); itr != v.end(); itr++) stream << *itr << " ";
stream << "]";
return stream;
}
template <typename A, typename B>
ostream &operator<<(ostream &stream, const map<A, B> &v) {
stream << "[";
for (auto itr = v.begin(); itr != v.end(); itr++) stream << *itr << " ";
stream << "]";
return stream;
}
template <typename A>
ostream &operator<<(ostream &stream, const set<A> &v) {
stream << "[";
for (auto itr = v.begin(); itr != v.end(); itr++) stream << *itr << " ";
stream << "]";
return stream;
}
template <typename A>
ostream &operator<<(ostream &stream, const stack<A> &v) {
stack<A> st = v;
stream << "[";
while (!st.empty()) {
stream << st.top() << " ";
st.pop();
}
stream << "]";
return stream;
}
template <typename A>
ostream &operator<<(ostream &stream, const priority_queue<A> &v) {
priority_queue<A> q = v;
stream << "[";
while (!q.empty()) {
stream << q.top() << " ";
q.pop();
}
stream << "]";
return stream;
}
template <typename A>
ostream &operator<<(ostream &stream, const queue<A> &v) {
queue<A> q = v;
stream << "[";
while (!q.empty()) {
stream << q.front() << " ";
q.pop();
}
stream << "]";
return stream;
}
template <typename A>
ostream &operator<<(ostream &stream, const deque<A> &v) {
deque<A> q = v;
stream << "[";
while (!q.empty()) {
stream << q.front() << " ";
q.pop_front();
}
stream << "]";
return stream;
}
void run();
int main() {
srand(time(NULL));
run();
return 0;
}
const int mod = 1e9 + 7;
const int N = 100005;
char s[N];
int cnt[1000];
int calc(int color, int x, int y, int n) {
char start = color ? 'r' : 'b';
char other = start == 'r' ? 'b' : 'r';
int needx = n & 1 ? n / 2 + 1 : n / 2;
int needy = n - needx;
int x_to_y = max(0, x - needx);
int y_to_x = max(0, y - needy);
int wrong = 0;
int res = 0;
for (int i = 0; i < n; ++i) {
if (i & 1) {
if (s[i] != other) {
if (x_to_y > 0) {
--x_to_y;
++res;
} else
++wrong;
}
} else {
if (s[i] != start) {
if (y_to_x > 0) {
--y_to_x;
++res;
} else
++wrong;
}
}
}
0 ? (cout << "color"
<< " = " << (color) << ","
<< "res"
<< " = " << (res) << ","
<< "wrong"
<< " = " << (wrong) << "\n")
: cout;
return res + wrong / 2;
}
void run() {
int n;
scanf("%d", &n);
scanf("%s", s);
for (int i = 0; i < n; ++i) ++cnt[s[i] - 'a'];
printf("%d", min(calc(0, cnt['b' - 'a'], cnt['r' - 'a'], n),
calc(1, cnt['r' - 'a'], cnt['b' - 'a'], n)));
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
;
int n;
string s;
cin >> n >> s;
int ans = n;
int r = 0, b = 0;
for (int i = 0; i < n; i++) {
if ((i & 1) == 0 && s[i] == 'b') r++;
if ((i & 1) == 1 && s[i] == 'r') b++;
}
if (r < b) swap(r, b);
ans = min(ans, b + (r - b));
r = 0, b = 0;
for (int i = 0; i < n; i++) {
if ((i & 1) == 1 && s[i] == 'b') r++;
if ((i & 1) == 0 && s[i] == 'r') b++;
}
if (r < b) swap(r, b);
ans = min(ans, b + (r - b));
cout << ans << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, i, j, k, x, y, z, t, ans;
string s;
int main() {
cin >> n;
cin >> s;
k = 1;
for (i = 0; i < n; ++i) {
if (s[i] == 'r' && i % 2 == 0) x++;
if (s[i] == 'b' && i % 2 == 1) y++;
}
z = min(x, y);
ans = z + x - z + y - z;
x = 0;
y = 0;
for (i = 0; i < n; ++i) {
if (s[i] == 'r' && i % 2 == 1) x++;
if (s[i] == 'b' && i % 2 == 0) y++;
}
z = min(x, y);
ans = min(ans, z + x - z + y - z);
cout << ans;
}
| 8 | CPP |
n = int(input())
s = input()
s = list(s)
sr = ['r','b'] * (n//2)
sb = ['b','r'] * (n//2)
if n%2==1:
sr.append('r')
sb.append('b')
kb,kr = 0,0
for i in range(n):
if s[i]!=sr[i]:
if s[i] =='b':
kb+=1
else:
kr+=1
u1 = min(kb,kr) + max(kb,kr) - min(kb,kr)
kb,kr = 0,0
for i in range(n):
if s[i]!=sb[i]:
if s[i] =='b':
kb+=1
else:
kr+=1
u2 = min(kb,kr) + max(kb,kr) - min(kb,kr)
print(min(u1,u2))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int Comp(string x, int M) {
string z = "rb";
vector<vector<int> > ind(2);
for (int i = 0, j = M; i < x.size(); i++, j = !j)
if (x[i] != z[j]) ind[j].push_back(i);
int minm = min(ind[0].size(), ind[1].size());
for (int i = 0; i < min(ind[0].size(), ind[1].size()); i++)
swap(x[ind[0][i]], x[ind[1][i]]);
for (int i = 0, j = M; i < x.size(); i++, j = !j)
if (x[i] != z[j]) minm++;
return minm;
}
int main() {
int n;
string x;
cin >> n >> x;
cout << min(Comp(x, 0), Comp(x, 1)) << endl;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int dcmp(double x, double y) {
return fabs(x - y) <= 1e-9 ? 0 : x < y ? -1 : 1;
}
int n, holder1, holder2, right1, left1, right2, left2;
string s;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
cin >> n;
cin >> s;
for (int i = 0; i < n; i++) {
if (i % 2 == 0 && s[i] != 'r') {
right1++;
} else if (i % 2 == 1 && s[i] != 'b') {
left1++;
}
}
holder1 = max(right1, left1);
for (int i = 0; i < n; i++) {
if (i % 2 == 0 && s[i] != 'b') {
left2++;
} else if (i % 2 == 1 && s[i] != 'r') {
right2++;
}
}
holder2 = max(left2, right2);
cout << min(holder1, holder2) << '\n';
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using pi = pair<int, int>;
const int mod = 1e9 + 7;
const ll inf = ll(1e18);
const int mxn = 2e3, mxa = 2e3;
int n;
string second;
void solve() {
cin >> n >> second;
string s1 = second;
int r = 0, b = 0;
for (int i = 1; i < n; ++i) {
if (s1[i] == s1[i - 1]) {
if (s1[i] == 'r')
++r;
else
++b;
s1[i] = s1[i] == 'r' ? 'b' : 'r';
}
}
int ans = max(r, b);
r = b = 0;
if (second[0] == 'r') {
++r;
second[0] = 'b';
} else {
++b;
second[0] = 'r';
}
for (int i = 1; i < n; ++i) {
if (second[i] == second[i - 1]) {
if (second[i] == 'r')
++r;
else
++b;
second[i] = second[i] == 'r' ? 'b' : 'r';
}
}
cout << min(ans, max(r, b)) << '\n';
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
t = 1;
while (t--) solve();
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long double pi = 3.14159265358979323846;
const long long mod = 1e9 + 7;
const long long N = 5e5;
long long n, mn, res, cnt;
string s;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
cin >> n >> s;
for (long long i = 0; i < s.size(); ++i) {
if (s[i] == 'r' && i % 2) ++cnt;
if (s[i] == 'b' && !(i % 2)) ++res;
}
mn = max(cnt, res);
cnt = 0;
res = 0;
for (long long i = 0; i < s.size(); ++i) {
if (s[i] == 'b' && i % 2) ++cnt;
if (s[i] == 'r' && !(i % 2)) ++res;
}
mn = min(mn, max(cnt, res));
cout << mn;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
string s;
int n, b, r, q;
int main() {
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'r' && i % 2 == 0) r++;
if (s[i] == 'b' && i % 2 == 1) b++;
}
q = max(r, b);
r = b = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'r' && i % 2 == 1) r++;
if (s[i] == 'b' && i % 2 == 0) b++;
}
cout << min(q, max(r, b)) << endl;
return 0;
}
| 8 | CPP |
n=int(input())
S=input()
r=0
r1=0
b=0
b1=0
for i in range(n) :
if i%2==0 :
if S[i]!='r' :
r=r+1
else :
b1=b1+1
else :
if S[i]!='b' :
b=b+1
else :
r1=r1+1
print(min(max(r,b),max(r1,b1)))
| 8 | PYTHON3 |
n = int(input())
series = input()
series2 = 'br'*n
series3 = 'rb'*n
count1a = 0
count1b = 0
count2a = 0
count2b = 0
for x in range(n):
if series[x] == series2[x]:
continue
elif series[x] == 'r':
count1a = count1a + 1
elif series[x] == 'b':
count1b = count1b + 1
for x in range(n):
if series[x] == series3[x]:
continue
elif series[x] == 'r':
count2a = count2a + 1
elif series[x] == 'b':
count2b = count2b + 1
moves1 = min(count1a,count1b) + abs(count1a-count1b)
moves2 = min(count2a,count2b) + abs(count2a-count2b)
print(min(moves1,moves2))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const double E = exp(1.0);
const int MAXN = 1e5 + 9;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
bool scan_d(int &s_num) {
char s_in;
int s_sign;
double s_bit = 0.1;
if (s_in = getchar(), s_in == EOF) return false;
while (s_in != '-' && s_in != '.' && (s_in < '0' || s_in > '9'))
s_in = getchar();
if (s_in == '-') {
s_sign = -1;
s_num = 0;
} else {
s_sign = 1;
s_num = s_in - '0';
}
while (s_in = getchar(), s_in >= '0' && s_in <= '9')
s_num = s_num * 10 + (s_in - '0');
if (s_in == ' ' || s_in == '\n') {
s_num *= s_sign;
return true;
}
while (s_in = getchar(), s_in >= '0' && s_in <= '9') {
s_num = (s_in - '0') * s_bit;
s_bit /= 10;
}
s_num *= s_sign;
return true;
}
int n, b, r, b2, r2;
char s[100009];
void Init() {
scanf("%d", &n);
scanf("%s", s);
}
void Solve() {
for (int i = 0; i <= n - 1; i++) {
if (i % 2) {
if (s[i] == 'r')
r++;
else
b2++;
} else if (s[i] == 'b')
b++;
else
r2++;
}
printf("%d\n", min(max(b, r), max(b2, r2)));
}
int main() {
int _T = 1;
while (_T--) {
Init();
Solve();
}
return 0;
}
| 8 | CPP |
n = int(input())
string = input()
m11, m12, m21, m22 = 0, 0, 0, 0
for i in range(n):
if i % 2 == 0 and string[i] == "b":
m21 += 1
elif i % 2 != 0 and string[i] == "r":
m22 += 1
elif i % 2 == 0:
m11 += 1
else:
m12 += 1
min1 = min(m21, m22)
m21, m22 = m21 - min1, m22 - min1
r1 = max(m21, m22) + min1
min2 = min(m11, m12)
m11, m12 = m11 - min2, m12 - min2
r2 = max(m11, m12) + min2
print(min(r1, r2))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void solve();
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
solve();
return 0;
}
void solve() {
int64_t n;
cin >> n;
string a;
cin >> a;
bool flag = true;
int64_t wb = 0, wr = 0;
int64_t bw = 0, rw = 0;
for (int64_t i = 0; i < a.length(); i++) {
if (flag) {
flag = false;
if (a[i] == 'b') {
wb++;
} else {
rw++;
}
} else {
flag = true;
if (a[i] == 'r') {
wr++;
} else {
bw++;
}
}
}
int64_t ans;
int64_t temp = min(wb, wr);
wb -= temp;
wr -= temp;
temp += (wb + wr);
ans = temp;
temp = min(bw, rw);
bw -= temp;
rw -= temp;
temp += (bw + rw);
ans = min(temp, ans);
cout << ans << "\n";
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
char c[100005];
int ans(int posR) {
int wR = 0, wB = 0;
for (int i = 1; i <= n; i++) {
if (c[i] == 'r' && (i & 1) != posR) wR++;
if (c[i] == 'b' && (i & 1) == posR) wB++;
}
return min(wR, wB) + abs(wR - wB);
}
void setup() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> c[i];
cout << min(ans(0), ans(1));
}
void xuly() {}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
setup();
xuly();
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, r, b, ans;
string s;
cin >> n >> s;
r = b = 0;
for (i = 0; i < n; i++) {
if ((i % 2 == 0) && (s[i] != 'r')) b++;
if ((i % 2 == 1) && (s[i] != 'b')) r++;
}
ans = max(b, r);
r = b = 0;
for (i = 0; i < n; i++) {
if ((i % 2 == 0) && (s[i] != 'b')) r++;
if ((i % 2 == 1) && (s[i] != 'r')) b++;
}
ans = min(ans, max(b, r));
cout << ans;
return 0;
}
| 8 | CPP |
def solve(pole, nxt):
opposite = {'r': 'b', 'b': 'r'}
count_not_on_place = {'r': 0, 'b': 0}
for item in pole:
if nxt != item:
count_not_on_place[item] += 1
nxt = opposite[nxt]
return max(count_not_on_place.values())
if __name__ == '__main__':
_ = input()
a = input()
print(min(solve(a, 'r'), solve(a, 'b')))
| 8 | PYTHON3 |
n,s,a,b,c,d=int(input()),input(),0,0,0,0
for i in range(n):
a+=(i%2 and s[i]!='r');b+=(i%2==0 and s[i]!='b')
c+=(i%2==0 and s[i]!='r');d+=(i%2 and s[i]!='b')
print(min(max(a,b),max(c,d)))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int i, n, nr, nr1, nr2, nb1, nb2;
char st[100010], st1[100010], st2[100010];
int main() {
ifstream f("a.in");
cin >> n;
cin >> st;
st1[0] = 'b';
st2[0] = 'r';
for (i = 1; i < n; ++i) {
if (st1[i - 1] == 'b')
st1[i] = 'r';
else
st1[i] = 'b';
if (st2[i - 1] == 'b')
st2[i] = 'r';
else
st2[i] = 'b';
}
for (i = 0; i < n; i++)
if (st[i] != st1[i] && st[i] == 'r')
nr1++;
else if (st[i] != st1[i] && st[i] == 'b')
nb1++;
nr1 = max(nr1, nb1);
for (i = 0; i < n; i++)
if (st[i] != st2[i] && st[i] == 'r')
nr2++;
else if (st[i] != st2[i] && st[i] == 'b')
nb2++;
nr2 = max(nr2, nb2);
cout << min(nr1, nr2);
return 0;
}
| 8 | CPP |
from math import ceil
n=int(input())
col=list(input())
nr=col.count('r')
nb=col.count('b')
dif=int(abs(nr-nb)/2)
c1=0
c2=0
for i in range(len(col)):
if i%2==0:
if col[i]=='b':
c1+=1
else:
c2+=1
else:
if col[i]=='r':
c1+=1
else:
c2+=1
c=min(c1,c2)
print(int(ceil((c-dif)/2))+dif) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int case1(string str1, int n) {
char ch0 = 'r';
char ch1 = 'b';
int oddiff = 0, evendiff = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
if (str1[i] != ch0) {
evendiff++;
}
} else {
if (str1[i] != ch1) {
oddiff++;
}
}
}
return max(evendiff, oddiff);
}
int case2(string str1, int n) {
char ch0 = 'b';
char ch1 = 'r';
int oddiff = 0, evendiff = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
if (str1[i] != ch0) {
evendiff++;
}
} else {
if (str1[i] != ch1) {
oddiff++;
}
}
}
return max(evendiff, oddiff);
}
int main() {
int n;
cin >> n;
string str;
cin >> str;
int temp1, temp2;
temp1 = case1(str, n);
temp2 = case2(str, n);
int ans = min(temp1, temp2);
cout << ans;
return 0;
}
| 8 | CPP |
def dist(s, choice):
r_diff = 0
b_diff = 0
for i in range(len(s)):
if choice[i] != s[i]:
if s[i] == 'r':
r_diff += 1
else:
b_diff += 1
min_diff = min(r_diff, b_diff)
return min_diff + (r_diff - min_diff) + (b_diff - min_diff)
if __name__ == '__main__':
n = int(input())
a = list(input())
choice_one = []
choice_two = []
for i in range(len(a)):
if i % 2 == 0:
choice_one.append('r')
choice_two.append('b')
else:
choice_one.append('b')
choice_two.append('r')
print(min(dist(a, choice_one), dist(a, choice_two)))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
std::ostream &operator<<(std::ostream &out, vector<T> &v) {
for (typename vector<T>::size_type i = 0; i < v.size(); ++i)
out << v[i] << " ";
out << "\n";
return out;
}
template <typename T, typename N>
std::ostream &operator<<(std::ostream &out, vector<pair<T, N> > &v) {
for (size_t i = 0; i < v.size(); ++i)
out << "(" << v[i].first << ", " << v[i].second << ") ";
out << "\n";
return out;
}
template <typename T>
std::ostream &operator<<(std::ostream &out, vector<vector<T> > &v) {
for (size_t i = 0; i < v.size(); ++i) {
for (size_t j = 0; j < v[i].size(); ++j) {
out << v[i][j] << " ";
}
out << "\n";
}
return out;
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string cockroaches;
cin >> cockroaches;
string model1 = "", model2 = "";
if (n & 1) {
for (int i = 0; i < n / 2; ++i) {
model1 += "rb";
model2 += "br";
}
model1.push_back('r');
model2.push_back('b');
} else {
for (int i = 0; i < n / 2; ++i) {
model1 += "rb";
model2 += "br";
}
}
int misplaced_b = 0, misplaced_r = 0;
for (int i = 0; i < n; ++i) {
if (cockroaches[i] != model1[i]) {
if (cockroaches[i] == 'b') {
++misplaced_b;
} else {
++misplaced_r;
}
}
}
int ans = min(misplaced_r, misplaced_b) + abs(misplaced_b - misplaced_r);
misplaced_b = 0;
misplaced_r = 0;
for (int i = 0; i < n; ++i) {
if (cockroaches[i] != model2[i]) {
if (cockroaches[i] == 'b') {
++misplaced_b;
} else {
++misplaced_r;
}
}
}
int ans2 = min(misplaced_r, misplaced_b) + abs(misplaced_b - misplaced_r);
cout << min(ans, ans2) << "\n";
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int xr, xb, yr, yb;
xr = xb = yr = yb = 0;
int n;
char s[1000005];
scanf("%d", &n);
scanf("%s", s + 1);
for (int i = 1; i <= n; i++) {
if (i % 2) {
if (s[i] == 'r')
xr++;
else
xb++;
} else {
if (s[i] == 'r')
yr++;
else
yb++;
}
}
printf("%d", min(max(xr, yb), max(xb, yr)));
return 0;
}
| 8 | CPP |
n, cr = int(input()), [i for i in input()]
cases = [(["r", "b"]*int(n/2+1))[0:n], (["b", "r"]*int(n/2+1))[0:n]]
ans = []
for case in cases:
btor, rtob = 0, 0
for i in range(len(cr)):
if cr[i] != case[i] :
if cr[i] == "r" :
rtob += 1
else :
btor += 1
ans.append(min([rtob, btor]) + abs(rtob - btor))
print(min(ans)) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T gcd(T a, T b) {
return a ? gcd(b % a, a) : b;
}
template <typename T>
T lcm(T a, T b) {
return (a / gcd(a, b)) * b;
}
string int_to_str_easy(long long n) {
return n ? "" : int_to_str_easy(n / 10) + (char)('0' + n % 10);
}
template <typename T>
T sum(vector<T> v) {
T ans = 0;
for (T i : v) ans += i;
return ans;
}
bool is_down(char x) { return ('a' <= x && x <= 'z'); }
bool is_upper(char x) { return ('A' <= x && x <= 'Z'); }
bool is_digit(char x) { return ('0' <= x && x <= '9'); }
string follow(string s) {
for (int i = 0; i < s.length(); i++)
if (is_upper(s[i])) s[i] += 'a' - 'A';
return s;
}
const long double pi = 3.141592653589793238462643383279;
const long double log23 = 1.58496250072115618145373894394781;
const long double eps = 1e-8;
const long double zero = 0;
const long long INF = 1e18;
const int COUT = 30;
const int prost = 239;
const long long prost64 = 239;
const int two = 2;
const long long MOD = 1000000007;
const int BIG = 1e9;
const int alf = 26;
const int MAX_M = 2001;
const int MAX_N = 2 * 1e5 + 1;
const int km = (1 << 18) - 1;
const int dxo[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
const int dyo[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, 1, 0, -1};
const int bit_max = 32;
void solve() { return; }
int n;
string s;
int main() {
cin.sync_with_stdio(0);
cin >> n >> s;
string e = "";
int ans = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0)
e += 'r';
else
e += 'b';
}
int now = 0;
string w = s;
int no1 = 0;
int no2 = 0;
for (int i = 0; i < n; i++) {
if (w[i] != e[i] && (i + 1) % 2 == 0)
no1++;
else if (w[i] != e[i])
no2++;
}
now = min(no1, no2) + abs(no1 - no2);
ans = now;
now = 0;
e = "";
for (int i = 0; i < n; i++) {
if (i % 2 == 0)
e += 'b';
else
e += 'r';
}
w = s;
no1 = 0;
no2 = 0;
for (int i = 0; i < n; i++) {
if (w[i] != e[i] && (i + 1) % 2 == 0)
no1++;
else if (w[i] != e[i])
no2++;
}
now = min(no1, no2) + abs(no1 - no2);
ans = min(ans, now);
cout << ans;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int nr1 = 0, nb1 = 0, nr2 = 0, nb2 = 0;
for (int i = 0; i < s.size(); ++i) {
if (i % 2 == 0) {
if (s[i] != 'r')
++nb1;
else
++nr2;
} else {
if (s[i] != 'b')
++nr1;
else
++nb2;
}
}
cout << min(max(nb1, nr1), max(nb2, nr2)) << endl;
}
| 8 | CPP |
n=int(input())
s=input()
ab=0
ar=0
ab1=0
ar1=0
if s[0]=='b':
for i in range(n):
if (i+1)%2==1:
if s[i]!='b':
ab+=1
else:
if s[i]!='r':
ar+=1
for i in range(n):
if (i+1)%2==1:
if s[i]!='r':
ar1+=1
else:
if s[i]!='b':
ab1+=1
else:
for i in range(n):
if (i+1)%2==1:
if s[i]!='r':
ab+=1
else:
if s[i]!='b':
ar+=1
for i in range(n):
if (i+1)%2==1:
if s[i]!='b':
ab1+=1
else:
if s[i]!='r':
ar1+=1
if max(ab1,ar1)>max(ab,ar):
print(max(ab,ar))
else:
print(max(ab1,ar1)) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) { return y == 0 ? x : gcd(y, x % y); }
long long mulmod(long long a, long long b, long long c) {
long long x = 0, y = a % c;
while (b > 0) {
if (b % 2 == 1) {
x = (x + y) % c;
}
y = (y * 2) % c;
b /= 2;
}
return x % c;
}
int cmp_2(int a, int b) { return a < b; }
int i, j, x, temp;
int t;
long long ans = 0;
const int maxn = 1e5 + 5;
char s[maxn];
int main() {
int n;
cin >> n;
int b[2], r[2];
cin >> s;
b[0] = b[1] = r[0] = r[1] = 0;
for (i = 0; i < n; i++) {
if (i & 1) {
if (s[i] == 'r')
b[0]++;
else
r[1]++;
} else {
if (s[i] == 'b')
r[0]++;
else
b[1]++;
}
}
x = abs(b[0] - r[0]) + min(b[0], r[0]);
t = abs(b[1] - r[1]) + min(b[1], r[1]);
cout << min(x, t) << endl;
return 0;
}
| 8 | CPP |
n = int(input())
s = input()
a = s[::2].count('r')
b = s[1::2].count('b')
c = s[::2].count('b')
d = s[1::2].count('r')
print(min(min(a,b)+abs(a-b),min(c,d)+abs(c-d)))
| 8 | PYTHON3 |
n=int(input())
l=list(input())
x1,x2,y1,y2=0,0,0,0
for i in range(n):
if i%2==0:
if l[i]=='r': x1+=1
else: x2+=1
else:
if l[i]=='b': y1+=1
else: y2+=1
print(min(max(x1,y1),max(x2,y2))) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int cntb1 = 0, cntr1 = 0;
for (int i = 0; i < n; i++)
if (!(i % 2) && s[i] != 'b')
cntb1++;
else if (i % 2 && s[i] != 'r')
cntr1++;
cntb1 = max(cntb1, cntr1);
int cntb2 = 0, cntr2 = 0;
for (int i = 0; i < n; i++)
if (i % 2 && s[i] != 'b')
cntb2++;
else if (!(i % 2) && s[i] != 'r')
cntr2++;
cntb2 = max(cntb2, cntr2);
cout << min(cntb1, cntb2);
return 0;
}
| 8 | CPP |
n = int(input())
s = input()
r_p = 0
r_i = 0
b_p = 0
b_i = 0
for i in range(n):
if(i%2==0):
if(s[i]=='b'):
b_p+=1
else:
r_p+=1
else:
if(s[i]=='b'):
b_i+=1
else:
r_i+=1
m1 = min(r_i,b_p)
sol1 = b_p-m1+r_i-m1 + m1
m2 = min(b_i,r_p)
sol2 = b_i-m2+r_p-m2+m2
print(min(sol1,sol2))
| 8 | PYTHON3 |
n=int(input())
s=input()
s1=''
s2=''
for i in range(n):
if i%2==0:
s1+='r'
s2+='b'
else:
s1+='b'
s2+='r'
'''type1'''
red=0
blk=0
for i in range(n):
if s[i]!=s1[i] and s[i]=='b':
blk+=1
elif s[i]!=s1[i]:
red+=1
ans=max(red,blk)
#print(ans)
'''type2'''
red=0
blk=0
for i in range(n):
if s[i]!=s2[i] and s[i]=='b':
blk+=1
elif s[i]!=s2[i]:
red+=1
#print(red,blk)
ans=min(ans,max(red,blk))
print(ans) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
char s[100002];
int main() {
int n, rz = 0, rk = 0, bz = 0, bk = 0, i;
int a = 0, b = 0, m;
cin >> n;
cin >> s;
for (i = 0; i < n; i += 2)
if (s[i] == 'r')
rz++;
else
bz++;
for (i = 1; i < n; i += 2)
if (s[i] == 'r')
rk++;
else
bk++;
a = rk > bz ? rk : bz;
b = rz > bk ? rz : bk;
m = a < b ? a : b;
cout << m << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
string p = s;
string l = s;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
p[i] = 'r';
l[i] = 'b';
} else {
p[i] = 'b';
l[i] = 'r';
}
}
int p_r = 0;
int p_b = 0;
int l_r = 0;
int l_b = 0;
for (int i = 0; i < n; i++) {
if (s[i] != p[i]) {
if (p[i] == 'r') {
p_r++;
} else {
p_b++;
}
}
if (l[i] != s[i]) {
if (l[i] == 'r') {
l_r++;
} else {
l_b++;
}
}
}
int k = min(p_r, p_b);
int z = max(p_r, p_b);
int f_ans = z;
int s_ans = max(l_r, l_b);
int ans = min(f_ans, s_ans);
cout << ans << endl;
}
| 8 | CPP |
n = int(input())
s = input()
r1 = b1 = r2 = b2 = 0
for i in range(len(s)):
if i%2:
if s[i]=="r":
r1 +=1
else:
r2 +=1
else:
if s[i]=="b":
b1+=1
else:
b2+=1
#print(r1,b1)
#print(r2,b2)
print(min(abs(r1-b1)+min(r1,b1),abs(r2-b2)+min(r2,b2))) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
string a, b;
int main() {
int n;
scanf("%d", &n);
cin >> a;
int t1 = 0, t2 = 0;
int ans1 = 0, ans2 = 0;
int b = 0, r = 0;
for (int i = 0; i < n; ++i) {
if (i % 2 == 0) {
if (a[i] != 'r') {
t1++;
b++;
}
} else {
if (a[i] != 'b') {
t1++;
r++;
}
}
if (t1 >= 2 && b && r) {
--b, --r;
ans1++;
t1 -= 2;
}
}
ans1 += t1;
b = 0, r = 0;
for (int i = 0; i < n; ++i) {
if (i % 2 == 0) {
if (a[i] != 'b') {
t2++;
r++;
}
} else {
if (a[i] != 'r') {
t2++;
b++;
}
}
if (t2 >= 2 && b && r) {
--b, --r;
ans2++;
t2 -= 2;
}
}
ans2 += t2;
printf("%d\n", min(ans1, ans2));
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int gcd(int n, int m) {
if (n == 0)
return m;
else
return gcd(m % n, n);
}
int main() {
int n;
string s;
cin >> n >> s;
string s1 = "";
string s2 = "";
for (int i = 0; i < n / 2; i++) {
s1 += "rb";
s2 += "br";
}
if (n % 2 == 1) {
s1 += "r";
s2 += "b";
}
int x = 0;
int y = 0;
for (int i = 0; i < n; i++) {
if (s[i] != s1[i]) {
if (s[i] == 'r')
x++;
else
y++;
}
}
int x1 = 0;
int y1 = 0;
for (int i = 0; i < n; i++) {
if (s[i] != s2[i]) {
if (s[i] == 'r')
x1++;
else
y1++;
}
}
cout << min(max(x, y), max(x1, y1)) << endl;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<char> v = {'r', 'b'};
string str;
int a = 0, b = 0, start = 0;
;
cin >> str;
for (int i = 0; i < n; i++) {
if (str[i] != v[start % 2]) {
if (str[i] == 'r')
a++;
else
b++;
}
start++;
}
int ans = INT_MAX;
ans = min(ans, min(a, b) + b - min(a, b) + a - min(a, b));
a = b = 0;
start = 1;
for (int i = 0; i < n; i++) {
if (str[i] != v[start % 2]) {
if (str[i] == 'r')
a++;
else
b++;
}
start++;
}
ans = min(ans, min(a, b) + b - min(a, b) + a - min(a, b));
cout << ans;
return 0;
}
| 8 | CPP |
from sys import stdin, stdout
n = int(stdin.readline())
colours = stdin.readline().strip()
cntf, cnts = 0, 0
label = colours[0]
for i in range(n):
if i % 2 and label == colours[i]:
cntf += 1
elif not i % 2 and label != colours[i]:
cnts += 1
ans = max(cntf, cnts)
cntf, cnts = 0, 0
for i in range(n):
if i % 2 and label != colours[i]:
cntf += 1
elif not i % 2 and label == colours[i]:
cnts += 1
ans = min(ans, max(cntf, cnts))
stdout.write(str(ans)) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
int n;
cin >> n;
string str;
cin >> str;
char curr = 'r';
string comparer;
string comparer2;
for (int i = 0; i != n; ++i) {
comparer += curr;
(curr == 'r') ? curr = 'b' : curr = 'r';
comparer2 += curr;
}
unordered_map<string, int> count;
for (int i = 0; i != n; ++i) {
if (str[i] != comparer[i]) {
string diff;
diff += str[i];
diff += comparer[i];
count[diff]++;
}
}
int ans = min(count["rb"], count["br"]) + abs(count["rb"] - count["br"]);
count = unordered_map<string, int>();
for (int i = 0; i != n; ++i) {
if (str[i] != comparer2[i]) {
string diff;
diff += str[i];
diff += comparer2[i];
count[diff]++;
}
}
ans =
min(ans, min(count["rb"], count["br"]) + abs(count["rb"] - count["br"]));
cout << ans << endl;
}
| 8 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int N = 1e2 + 17, M = 1e3 + 5, OO = 0x3f3f3f3f;
int n, ans, pr1 = 0, pb1 = 0, pr2 = 0, pb2 = 0;
string s;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (i & 1 && s[i] != 'r')
pb1++;
else if (!(i & 1) && s[i] != 'b')
pr1++;
}
for (int i = 0; i < n; i++) {
if (i & 1 && s[i] != 'b')
pr2++;
else if (!(i & 1) && s[i] != 'r')
pb2++;
}
cout << min(abs(pr1 - pb1) + min(pr1, pb1), abs(pr2 - pb2) + min(pr2, pb2));
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
string str1, str2;
int solve(string str, int tmp) {
int ans = 0;
int num_r = 0, num_b = 0;
for (int i = 0; i < n; i++) {
if (tmp == 0) {
if (str[i] == 'r') {
} else {
num_b++;
ans++;
}
} else if (tmp == 1) {
if (str[i] == 'b') {
} else {
num_r++;
ans++;
}
}
tmp ^= 1;
}
ans -= min(num_r, num_b);
return ans;
}
int main() {
scanf("%d", &n);
cin >> str1;
str2 = str1;
int ans = 0;
ans = min(solve(str1, 1), solve(str2, 0));
printf("%d\n", ans);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c1, c2, er = 0, eb = 0, r = 0, b = 0;
string s;
cin >> n;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (i % 2 == 0) {
if (s[i] == 'r') er++;
if (s[i] == 'b') eb++;
} else {
if (s[i] == 'r') r++;
if (s[i] == 'b') b++;
}
}
c1 = max(er, b);
c2 = max(eb, r);
cout << min(c1, c2);
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
char num[N];
int ans[N];
int main() {
int n, m;
scanf("%d", &n);
scanf("%s", (num + 1));
int r = 0, b = 0;
for (int i = 1; i <= n; i++) {
if (i & 1) {
if (num[i] != 'r') {
b++;
}
} else {
if (num[i] != 'b') {
r++;
}
}
}
int all = min(r, b) + abs(r - b);
r = b = 0;
for (int i = 1; i <= n; i++) {
if (i & 1) {
if (num[i] != 'b') {
r++;
}
} else {
if (num[i] != 'r') {
b++;
}
}
}
cout << min(all, min(r, b) + abs(r - b)) << endl;
return 0;
}
| 8 | CPP |
n, cr = int(input()), [i for i in input()]
case_1 = (["r", "b"]*n)[0:n]
case_2 = (["b", "r"]*n)[0:n]
btor, rtob = 0, 0
ans = []
for i in range(len(cr)):
if (cr[i] != case_1[i]) :
if cr[i] == "r" :
rtob += 1
else :
btor += 1
ans.append(min([rtob, btor]) + abs(rtob - btor))
btor, rtob = 0, 0
for i in range(len(cr)):
if (cr[i] != case_2[i]) :
if cr[i] == "r" :
rtob += 1
else :
btor += 1
ans.append(min([rtob, btor]) + abs(rtob - btor))
print(min(ans))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n;
char s[100005];
int tinh(string t) {
int d[2] = {0};
for (int i = 0; i < n; ++i) {
if (s[i] != t[i % 2]) ++d[i % 2];
}
return max(d[0], d[1]);
}
int main() {
scanf("%d", &n);
scanf("%s", s);
printf("%d", min(tinh("br"), tinh("rb")));
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, n, r1, r2, b1, b2, len, x, y, ans;
while (cin >> n) {
string s;
cin >> s;
len = s.size();
r1 = 0, b1 = 0, r2 = 0, b2 = 0;
for (i = 0; i < len; i++) {
if (i % 2 != 0 && s[i] != 'r')
r1++;
else if (i % 2 == 0 && s[i] != 'b')
b1++;
if (i % 2 != 0 && s[i] != 'b')
b2++;
else if (i % 2 == 0 && s[i] != 'r')
r2++;
}
x = max(r1, b1);
y = max(r2, b2);
ans = min(x, y);
printf("%d\n", ans);
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline long long in() {
int32_t x;
scanf("%d", &x);
return x;
}
inline long long lin() {
long long x;
scanf("%lld", &x);
return x;
}
inline string get() {
char ch[2000010];
scanf("%s", ch);
return ch;
}
inline void read(long long *a, long long n) {
for (long long i = 0; i < n; i++) a[i] = in();
}
template <class blank>
inline void out(blank x) {
cout << x << "\n";
exit(0);
}
const long long maxn = 1e5 + 10;
const long long maxm = 1e6 + 10;
const long long maxlg = 21;
const long long base = 29;
const long long mod = 1e9 + 7;
const long long INF = 1e18 + 10;
const long long SQ = 317 + 5;
long long a[maxn];
long long res = INF;
int32_t main() {
long long n = in();
string s = get();
for (long long i = 0; i < n; i++) a[i] = s[i] == 'r';
for (long long start = 0; start <= 1; start++) {
long long a = 0, b = 0;
for (long long pt = 0; pt < n; pt++) {
if (::a[pt] != (start ^ (pt % 2))) {
if (::a[pt])
a++;
else
b++;
}
}
res = min(res, max(a, b));
}
cout << res << "\n";
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
char co[100005];
int main() {
int n, rnum, bnum, pa, rdiff, bdiff, tot;
while (cin >> n) {
rnum = 0, bnum = 0, rdiff = 0, bdiff = 0, pa = 0;
for (int i = 0; i < n; i++) {
cin >> co[i];
if (co[i] == 'r')
rnum++;
else
bnum++;
if (i & 1) {
if (co[i] == 'r') bdiff++;
if (co[i] == 'b') rdiff++;
} else {
if (co[i] == 'b') bdiff++;
if (co[i] == 'r') rdiff++;
}
}
pa = abs(rnum - bnum) / 2;
rdiff = min(rdiff, bdiff);
rdiff -= pa;
if (rdiff & 1) {
tot = rdiff / 2 + pa + 1;
} else {
tot = rdiff / 2 + pa;
}
cout << tot << endl;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, k, c = 0, d = 0, a = 0, b = 0, ans;
string str;
cin >> n;
cin >> str;
if (n == 1)
cout << 0 << endl;
else {
for (i = 0; str[i] != '\0'; i++) {
if (str[i] == 'b') {
if (i % 2 == 0)
a++;
else
b++;
}
if (str[i] == 'r') {
if (i % 2 == 0)
c++;
else
d++;
}
}
ans = min(max(a, d), max(b, c));
cout << ans << endl;
}
}
| 8 | CPP |
n = int(input())
w = input()
a_red = a_blue = b_red = 0
for i in range(n):
if i % 2:
a_red += w[i] == 'r'
else:
a_blue += w[i] == 'b'
b_red += w[i] == 'r'
print(min(max(a_red, a_blue), max(b_red, n - a_red - a_blue - b_red)))
| 8 | PYTHON3 |
n = int(input())
s = input()
rb_b_wrong = rb_r_wrong = 0
br_b_wrong = br_r_wrong = 0
for i in range(n):
if i % 2 == 0:
if s[i] == 'b':
rb_b_wrong += 1
else:
br_r_wrong += 1
if i % 2 == 1:
if s[i] == 'b':
br_b_wrong += 1
else:
rb_r_wrong += 1
print(min(max(rb_b_wrong, rb_r_wrong),max(br_b_wrong, br_r_wrong))) | 8 | PYTHON3 |
def main():
n=int(input())
s=input()
remain=[0]*2
for i,x in enumerate(s):
## print('%',i,x)
if (x=='b' and i%2==0) or (x=='r' and i%2==1):
remain[i%2]+=1
diff=[n//2+(i%2==0 and n%2==1)-remain[i] for i in range(2)]
print(min(max(diff),max([n//2+(i%2==0 and n%2==1)-diff[i] \
for i in range(2)])))
## print(diff,[n//2+(i%2==0and n%2==1)-diff[i] for i in range(2)])
main()
| 8 | PYTHON3 |
from math import *
n = int(input())
A = input()
r = 0
b = 0
if n % 2 == 0:
a1 = 'br' * (n//2)
a2 = 'rb' * (n//2)
else:
a1 = 'b' + 'rb' * ((n-1) // 2)
a2 = 'r' + 'br' * ((n-1) // 2)
ans1 = 0
ans2 = 0
for j in range(n):
if A[j] == 'b':
b+=1
else:
r +=1
if A[j] != a1[j]:
ans1 +=1
if A[j] != a2[j]:
ans2 +=1
if ans1 == 0 or ans2 == 0:
print(0)
else:
r1 = n//2
b1 = n% 2 + n//2
b2 = n//2
r2 = n% 2 + n//2
min1 = 0
min2 = 0
if r1 >r:
min1 += (r1 - r)
if b1 > b:
min1 += (b1 -b)
if r2 > r:
min2+= (r2 -r)
if b2 > b:
min2 += (b2-b)
print(min(ceil(min1 + (ans1 - min1) // 2), ceil(min2 + (ans2 - min2) // 2)))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, b[100000], r[100000], kb = 0, kr = 0;
char c;
cin >> n;
cin >> c;
if (c == 'b') {
r[1] = 1;
b[1] = 0;
++kb;
} else {
b[1] = 1;
r[1] = 0;
++kr;
}
for (int i = 2; i <= n; ++i) {
cin >> c;
if (c == 'b') {
b[i] = r[i - 1];
if (kr - kb >= i % 2) {
r[i] = b[i - 1];
} else {
r[i] = b[i - 1] + 1;
}
++kb;
} else {
r[i] = b[i - 1];
if (kb - kr >= i % 2) {
b[i] = r[i - 1];
} else {
b[i] = r[i - 1] + 1;
}
++kr;
}
}
cout << min(b[n], r[n]);
return 0;
}
| 8 | CPP |
import logging
import copy
import sys
import math
logging.basicConfig(stream=sys.stderr, level=logging.DEBUG)
#def solve(firstLine):
def solve(line):
length = len(line)
if length < 2:
return 0
diff = [0,0]
color = [line[0], 'b']
if line[0] == 'r':
color[1] = 'b'
else:
color[1] = 'r'
color2 = [color[1], color[0]]
diff2 = [0,0]
for i, c in enumerate(line):
idx = i % 2
if c != color[idx]:
diff[idx]+=1
if c != color2[idx]:
diff2[idx]+=1
return min([max(diff), max(diff2)])
def main():
firstLine = int(input())
line = input()
print(solve(line))
def log(*message):
logging.debug(message)
if __name__ == "__main__":
main()
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, v[2][2], ans;
char c;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> c, ++v[i % 2][c == 'r'];
ans = min(max(v[0][0], v[1][1]), max(v[0][1], v[1][0]));
cout << ans;
}
| 8 | CPP |
n = int(input())
s = input()
def mainW( firstB):
bf, rf = 0,0
sb_b = firstB
for c in s:
if(c == "r" and sb_b):
rf += 1
elif(c == 'b' and not sb_b):
bf += 1
sb_b = not sb_b
return min(bf,rf) + (max(bf,rf) - min(rf,bf))
print(min(mainW(True),mainW(False))) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {-1, 0, 1, 1, 1, 0, -1, -1}, dy[] = {-1, -1, -1, 0, 1, 1, 1, 0};
int cx[] = {1, 1, 2, 2, -1, -1, -2, -2}, cy[] = {2, -2, 1, -1, 2, -2, 1, -1};
int main() {
ios_base::sync_with_stdio(false);
long n, m1 = 0, m2 = 0, n1 = 0, n2 = 0;
string st;
cin >> n >> st;
for (__typeof(n) i = 0; i < (n); i++) {
if (i % 2 == 0) {
if (st[i] == 'r')
m1++;
else
n1++;
} else {
if (st[i] == 'r')
m2++;
else
n2++;
}
}
cout << ((m1 > n2 ? m1 : n2) < (m2 > n1 ? m2 : n1) ? (m1 > n2 ? m1 : n2)
: (m2 > n1 ? m2 : n1))
<< endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int ans_1 = 0;
int wr = 0, wb = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0 && s[i] != 'b') wb++;
if (i % 2 != 0 && s[i] != 'r') wr++;
}
ans_1 = max(wr, wb);
wr = 0, wb = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0 && s[i] != 'r') wr++;
if (i % 2 != 0 && s[i] != 'b') wb++;
}
int ans_2 = max(wr, wb);
cout << min(ans_1, ans_2) << "\n";
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, cntb = 0, cntr = 0;
cin >> n;
string b = "", r = "", s;
cin >> s;
for (int i = 0; i < n; i++) {
if (i % 2)
b += 'r';
else
b += 'b';
}
for (int i = 0; i < n; i++) {
if (i % 2)
r += 'b';
else
r += 'r';
}
for (int i = 0; i < n; i++) {
if (s[i] == b[i]) continue;
if (s[i] == 'b')
cntb++;
else
cntr++;
}
int ans1 = max(cntr, cntb);
cntb = 0;
cntr = 0;
for (int i = 0; i < n; i++) {
if (s[i] == r[i]) continue;
if (s[i] == 'b')
cntb++;
else
cntr++;
}
int ans2 = max(cntr, cntb);
cout << min(ans1, ans2) << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e7 + 5;
int n;
int a[2];
string str;
char f(int x) {
if (x % 2)
return 'r';
else
return 'b';
}
int main() {
a[0] = 0;
a[1] = 0;
int sum1 = 0, sum2 = 0;
scanf("%d", &n);
cin >> str;
for (int i = 0; i < n; i++) {
if (i % 2) {
if (str[i] == 'r')
continue;
else
a[i % 2]++;
} else {
if (str[i] == 'b')
continue;
else
a[i % 2]++;
}
}
if (a[0] > a[1])
sum1 += a[0];
else
sum1 += a[1];
a[0] = 0;
a[1] = 0;
for (int i = 0; i < n; i++) {
if (i % 2) {
if (str[i] == 'b')
continue;
else
a[i % 2]++;
} else {
if (str[i] == 'r')
continue;
else
a[i % 2]++;
}
}
if (a[0] > a[1])
sum2 += a[0];
else
sum2 += a[1];
cout << min(sum1, sum2) << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mod = 7 + (int)1e9;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
int evenr = 0;
int oddr = 0;
int evenb = 0;
int oddb = 0;
for (int i = 0; i < n; i++) {
char cur = s[i];
if (i % 2 == 0) {
if (cur == 'r')
evenr++;
else
evenb++;
} else {
if (cur == 'r')
oddr++;
else
oddb++;
}
}
int ans = n;
ans = min(ans, max(evenb, oddr));
ans = min(ans, max(evenr, oddb));
cout << ans;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int count[2] = {0, 0}, cnt;
cin >> n;
string s;
cin >> s;
char c = 'r';
cnt = n;
for (int i = 0; i < 2; i++) {
count[0] = 0;
count[1] = 0;
for (int j = 0; j < s.length(); j++) {
if (s[j] != c) {
if (c == 'r')
count[0]++;
else
count[1]++;
}
c = c == 'r' ? 'b' : 'r';
}
if (cnt > max(count[0], count[1])) cnt = max(count[0], count[1]);
c = 'b';
}
cout << cnt << endl;
return 0;
}
| 8 | CPP |
Subsets and Splits