solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
for w in range(int(input())):
n,k=tuple(map(int,input().split()))
s=str(input())
if(k==n):
print(1+2*(n-1))
elif(n==1 and k>0):
print(1)
elif(n==1 and k==0):
if(s[0]=='W'):
print(1)
else:
print(0)
elif(k>=s.count('L')):
print(1+2*(n-1))
else:
#if(True):
ans=0
t1=0
l=[]
for i in range(n):
if(s[i]=='W'):
if(i==0 or s[i-1]!='W'):
ans+=1
else:
ans+=2
i=0
while(i<n):
if(s[i]=='L'):
if(i==0):
while(i<n and s[i]=='L'):
t1+=1
i+=1
elif(i==n-1):
t1+=1
i+=1
else:
x=0
while(i<n and s[i]=='L'):
x+=1
i+=1
if(i!=n):
l.append(x)
else:
t1+=x
else:
i+=1
if(k==0):
print(ans)
elif(ans==0):
print(1+2*max(k-1,0))
elif(k>=sum(l)):
print(ans+2*k + len(l))
else:
l=sorted(l)
x=0
for i in range(len(l)):
x+=l[i]
if(x>k):
break
print(ans+2*k+i) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
string s;
struct A {
int num;
int l;
} ar[150000];
bool cmp(A a, A b) {
if (a.l == b.l) return a.num < b.num;
return a.l < b.l;
}
int t, i, j, n, k;
int main() {
cin >> t;
while (t--) {
for (int i = 1; i < 1000; i++)
;
cin >> n >> k;
for (int i = 1; i < 1000; i++)
;
int ans = 0;
for (int i = 1; i < 1000; i++)
;
cin >> s;
for (int i = 1; i < 1000; i++)
;
int c = 1;
for (int i = 1; i < 1000; i++)
;
for (i = 0; i < n; i++) {
if (s[i] == 'L')
c = 1;
else {
ans += c;
if (c == 1) c = 2;
}
}
for (int i = 1; i < 1000; i++)
;
int poswe = n, poswf = -1, now = 0;
for (int i = 1; i < 1000; i++)
;
for (i = n - 1; i >= 0; i--) {
if (s[i] == 'W') {
poswe = i;
break;
}
}
for (int i = 1; i < 1000; i++)
;
if (poswe == n) {
cout << (k != 0 ? 2 * k - 1 : 0) << endl;
continue;
}
for (int i = 1; i < 1000; i++)
;
for (i = 0; i < n; i++) {
if (s[i] == 'W') {
poswf = i;
break;
}
}
for (int i = 1; i < 1000; i++)
;
int me = poswf + (n - 1 - poswe);
int flag = 0, num = 0;
for (int i = 1; i < 1000; i++)
;
for (i = poswf + 1; i < poswe; i++) {
if (s[i] == 'L')
num++, flag = 0;
else {
if (flag == 0 && num > 0) {
ar[++now].num = num * 2 + 1;
ar[now].l = num;
num = 0;
} else {
continue;
}
}
}
for (int i = 1; i < 1000; i++)
;
if (num > 0) ar[++now].num = num * 2 + 1, ar[now].l = num, num = 0;
for (int i = 1; i < 1000; i++)
;
sort(ar + 1, ar + 1 + now, cmp);
for (i = 1; i <= now; i++) {
for (int i = 1; i < 1000; i++)
;
if (ar[i].l <= k) {
ans += ar[i].num;
k -= ar[i].l;
} else {
ans += k * 2;
k = 0;
break;
}
for (int i = 1; i < 1000; i++)
;
}
for (int i = 1; i < 1000; i++)
;
if (k > 0) ans += min(2 * k, me * 2);
for (int i = 1; i < 1000; i++)
;
cout << ans << endl;
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
void toUpperCase(string s) {
for (int i = 0; i < s.size(); i++) {
if (s[i] >= 'a' && s[i] <= 'z') {
s[i] = s[i] - 32;
}
}
cout << s;
}
bool isPrime(int n) {
if (n <= 1) return false;
for (int i = 2; i <= sqrt(n); i++)
if (n % i == 0) return false;
return true;
}
int main() {
int t;
cin >> t;
while (t--) {
long long kqua = 0;
long long n, k, i;
cin >> n >> k;
string s;
cin >> s;
s = ' ' + s;
int check = 0;
long long a[100001];
long long b[100001];
a[0] = 0;
for (i = 1; i <= n; i++) {
if (s[i] == 'W') {
if (s[i - 1] == 'W') {
kqua += 2;
} else
kqua += 1;
}
}
if (k == 0) {
cout << kqua << endl;
continue;
}
if (kqua == 0) {
cout << k * 2 - 1 << endl;
continue;
}
for (i = 1 + (s[1] == 'L'); i <= n - (s[n] == 'L'); i++) {
if (s[i] == 'W') {
check = check + 1;
a[check] = i;
}
}
for (i = 2; i <= check; i++) {
b[i] = a[i] - a[i - 1] - 1;
}
sort(b + 1, b + check + 1);
for (i = 1; i <= check; i++)
if (b[i])
if (k >= b[i]) {
kqua = kqua + b[i] * 2 + 1;
k = k - b[i];
if (k == 0) break;
} else {
kqua += k * 2;
k = 0;
break;
}
if (k) {
kqua = min(kqua + k * 2, n * 2 - 1);
}
kqua = min(kqua, n * 2 - 1);
cout << kqua << endl;
}
return 0;
}
| 8 | CPP |
"""
Author - Satwik Tiwari .
18th Feb , 2021 - Thursday
"""
#===============================================================================================
#importing some useful libraries.
from __future__ import division, print_function
from fractions import Fraction
import sys
import os
from io import BytesIO, IOBase
from functools import cmp_to_key
# from itertools import *
from heapq import *
from math import gcd, factorial,floor,ceil,sqrt,log2
from copy import deepcopy
from collections import deque
from bisect import bisect_left as bl
from bisect import bisect_right as br
from bisect import bisect
#==============================================================================================
#fast I/O region
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")
def print(*args, **kwargs):
"""Prints the values to a stream, or to sys.stdout by default."""
sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
at_start = True
for x in args:
if not at_start:
file.write(sep)
file.write(str(x))
at_start = False
file.write(kwargs.pop("end", "\n"))
if kwargs.pop("flush", False):
file.flush()
if sys.version_info[0] < 3:
sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
# inp = lambda: sys.stdin.readline().rstrip("\r\n")
#===============================================================================================
### START ITERATE RECURSION ###
from types import GeneratorType
def iterative(f, stack=[]):
def wrapped_func(*args, **kwargs):
if stack: return f(*args, **kwargs)
to = f(*args, **kwargs)
while True:
if type(to) is GeneratorType:
stack.append(to)
to = next(to)
continue
stack.pop()
if not stack: break
to = stack[-1].send(to)
return to
return wrapped_func
#### END ITERATE RECURSION ####
#===============================================================================================
#some shortcuts
def inp(): return sys.stdin.readline().rstrip("\r\n") #for fast input
def out(var): sys.stdout.write(str(var)) #for fast output, always take string
def lis(): return list(map(int, inp().split()))
def stringlis(): return list(map(str, inp().split()))
def sep(): return map(int, inp().split())
def strsep(): return map(str, inp().split())
# def graph(vertex): return [[] for i in range(0,vertex+1)]
def testcase(t):
for pp in range(t):
solve(pp)
def google(p):
print('Case #'+str(p)+': ',end='')
def lcm(a,b): return (a*b)//gcd(a,b)
def power(x, y, p) :
y%=(p-1) #not so sure about this. used when y>p-1. if p is prime.
res = 1 # Initialize result
x = x % p # Update x if it is more , than or equal to p
if (x == 0) :
return 0
while (y > 0) :
if ((y & 1) == 1) : # If y is odd, multiply, x with result
res = (res * x) % p
y = y >> 1 # y = y/2
x = (x * x) % p
return res
def ncr(n,r): return factorial(n) // (factorial(r) * factorial(max(n - r, 1)))
def isPrime(n) :
if (n <= 1) : return False
if (n <= 3) : return True
if (n % 2 == 0 or n % 3 == 0) : return False
i = 5
while(i * i <= n) :
if (n % i == 0 or n % (i + 2) == 0) :
return False
i = i + 6
return True
inf = pow(10,20)
mod = 10**9+7
#===============================================================================================
# code here ;))
def solve(case):
n,k = sep()
s = list(inp())
have = []
cnt = 0
i = 0
while(i < n):
if(s[i] == 'W'):
cnt = 0
j = i+1
while(j < n and s[j] == 'L'):
j += 1
cnt += 1
if(cnt > 0 and j < n): have.append(cnt)
i = j
else:
i += 1
tot = s.count('L')
if(k >= tot):
print(2*(n-1) + 1)
return
if(s.count('W') == 0):
print(max(0,2*(k-1) + 1))
return
ans = 0
for i in range(n):
if(s[i] == 'W'):
if(i-1 >= 0 and s[i-1] == 'W'): ans += 2
else: ans += 1
have.sort()
i = 0
while(k > 0 and i < len(have)):
if(have[i] > k):
ans += 2*k
else:
ans += 2*have[i] + 1
k -= have[i]
i += 1
# print(ans,k,i)
if(k > 0): ans += 2*k
print(ans)
# testcase(1)
testcase(int(inp()))
| 8 | PYTHON3 |
for _ in range(int(input())):
n, k = map(int, input().split())
a = input()
b = []
b1 = []
c = []
t = 0
count = 0
ans = 0
m = n - 1
if a[0] == 'L':
while t < n and a[t] == 'L':
count += 1
t += 1
b1.append(count)
count = 0
if a[-1] == 'L':
while m >= 0 and a[m] == 'L':
count += 1
m -= 1
b1.append(count)
count = 0
while t <= m:
if a[t] == 'W':
while t <= m and a[t] == 'W':
count += 1
t += 1
c.append(count)
count = 0
else:
while t <= m and a[t] == 'L':
count += 1
t += 1
b.append(count)
count = 0
for i in c:
ans += 2 * i - 1
b.sort()
if b1 and b1[-1] == n:
ans += max(min(n, k) * 2 - 1, 0)
else:
for i in b:
if i <= k:
ans += 2 * i + 1
k -= i
else:
ans += k * 2
k = 0
if not k:
break
if k and b1:
ans += min(sum(b1), k) * 2
print(ans)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bool comp(pair<int, int> a, pair<int, int> b) {
return a.second - a.first + 1 < b.second - b.first + 1;
}
int main() {
int t;
cin >> t;
while (t--) {
int n, c, f = 0;
cin >> n >> c;
string s;
cin >> s;
vector<pair<int, int>> v;
int st = -1, ed = -1;
for (int i = 0; i < n - 1; i++) {
if (s[i] == 'W' && s[i + 1] != 'W' && st == -1) st = i + 1;
if (s[i] != 'W' && s[i + 1] == 'W' && st != -1) {
ed = i;
v.push_back({st, ed});
st = -1;
ed = -1;
}
if (s[i] == 'W') f = 1;
}
sort(v.begin(), v.end(), comp);
for (int i = 0; i < v.size(); i++) {
for (int k = v[i].first; k <= v[i].second && c > 0; k++) {
s[k] = 'W';
c--;
}
if (c == 0) break;
}
if (c > 0) {
for (int i = 1; i < n && c > 0; i++) {
if (s[i] != 'W' && s[i - 1] == 'W') {
s[i] = 'W';
c--;
}
}
}
for (int i = n - 1; i > 0 && c > 0; i--) {
if (s[i] == 'W' && s[i - 1] != 'W') {
s[i - 1] = 'W';
c--;
}
}
if (c > 0 && f != 0)
s[0] = 'W';
else if (f == 0) {
for (int i = 0; i < n && c > 0; i++) {
s[i] = 'W';
c--;
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'W' && i == 0)
ans++;
else if (s[i] == 'W' && s[i - 1] == 'W')
ans += 2;
else if (s[i] == 'W' && s[i - 1] != 'W')
ans++;
}
cout << ans << endl;
}
}
| 8 | CPP |
import math
t = int(input())
for q in range(t):
n, k = [int(i) for i in input().split()]
s = input()
C = []
b = False
p = 0
rest = 0
for i in s:
if i == 'W' and not b:
b = True
elif i == 'L' and b:
p += 1
elif i == 'W' and b and p:
if p:
C.append(p)
p = 0
elif i == 'L' and not b:
rest += 1
C.sort()
prof = 0
rest += p
for i in C:
if k >= i:
prof += 2 * i + 1
k -= i
else:
prof += k * 2
k = 0
break
if k:
if k >= rest:
prof += rest * 2
k -= rest
else:
prof += k * 2
k = 0
#print(k, end = ' ')
if rest == len(s) and prof:
prof -= 1
res = 0
b = False
for i in s:
if i == 'W' and b:
res += 2
elif i == 'W' and not b:
res += 1
b = True
else:
b = False
print(prof + res)
| 8 | PYTHON3 |
# only gravity will pull me down
from collections import *
from math import *
M = 10**9+7
for _ in range(int(input())) :
n,k = map(int, input().split())
s = input()
s=list(s)
mp=[]
cntL=0
res=0
for ch in s :
if ch=='L':
cntL+=1
if cntL <= k:
res = 1+(n-1)*2
else :
cnt=0
f=0
for i in range(n) :
if s[i]=='L':
cnt+=1
else :
if cnt and f:
mp.append([cnt,i-cnt])
f=1
cnt=0
mp.sort()
#print(mp)
for p in mp:
for i in range(p[0]+p[1]-1,p[1]-1,-1) :
if not k:
break
s[i]='W'
k-=1
if k:
f=0
for i in range(n) :
if s[i]=='L' and f:
s[i]='W'
k-=1
elif s[i]=='W':
f=1
if not k:
break;
if k:
for i in range(n-1,0,-1) :
if s[i]=='L':
s[i]='W'
k-=1
if not k:
break
if s[0]=='W':
res+=1
for i in range(1,n) :
if s[i]=='W':
if s[i-1]=='W':
res+=2
else:
res+=1
print(res) | 8 | PYTHON3 |
import sys
t=int(input())
for i in range(t):
n,k=map(int,input().split())
s=sys.stdin.readline().strip()
s=list(s)
q=0
p=[]
for j in range(n):
if s[j]=='W':
if q>0:
p.append([q,j-1])
q=0
else:
q=q+1
if q>0:
if p==[] and s[0]!='W':
p.append([q,n-1])
else:
p.append([q,n-q])
q=0
if p:
e1=[]
e2=[]
if s[0]=='L':
e1.append(p[0])
del p[0]
if p:
if s[-1]=='L':
e2.append(p[-1])
del p[-1]
p.sort()
p=p+e1
j=0
l=len(p)
while k>0 and j<l:
v=p[j][1]
while v>=0 and s[v]=='L' and k>0:
s[v]='W'
v=v-1
k=k-1
j=j+1
if k>0 and e2:
j=e2[0][1]
while k>0 and j<n:
s[j]='W'
k=k-1
j=j+1
w=0
for j in range(1,n):
if s[j]==s[j-1] and s[j]=='W':
w=w+2
elif s[j]=='W':
w=w+1
if s[0]=='W':
w=w+1
print(w) | 8 | PYTHON3 |
for _ in range(int(input())):
n, k = map(int, input().split())
data = input()
start = data.find('W')
result = 0
prev = False
for x in data:
if x == 'W':
if prev:
result += 2
else:
result += 1
prev = True
else:
prev = False
# none exist
if start == -1:
if k == 0:
print(0)
else:
print(k * 2 - 1)
continue
gap_list = []
end = start + 1
if k > n - data.count('W'): # remained
k = n - data.count('W')
cnt = 0
for i in range(start + 1, n):
if data[i] == 'L':
cnt += 1
if data[i - 1] == 'L' and data[i] == 'W':
gap_list.append(cnt)
cnt = 0
gap_list.sort()
for x in gap_list:
if k >= x:
result += 3 + 2 * (x - 1)
k -= x
else:
break
print(result + (2 * k)) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long expo_pow(long long x, long long y) {
if (y == 0) return 1;
y = y % (mod - 1);
x %= mod;
if (y == 0) y = mod - 1;
long long res = 1;
while (y) {
if (y & 1) res = (res * x) % mod;
x = (x * x) % mod;
y >>= 1;
}
return res;
}
long long add() { return 0; }
template <typename T, typename... Types>
T add(T var1, Types... var2) {
return (((((long long)(var1)) % mod + (long long)(add(var2...))) % mod) +
mod) %
mod;
}
long long mul() { return 1; }
template <typename T, typename... Types>
T mul(T var1, Types... var2) {
return (((long long)(var1)) % mod * (long long)(mul(var2...))) % mod;
}
void solve() {
long long n, k;
cin >> n >> k;
string second;
cin >> second;
long long cnt = 0;
for (auto u : second) cnt += (u == 'W');
if (cnt == 0) {
long long ans = 2 * k - 1;
cout << max(0LL, ans) << "\n";
return;
}
vector<long long> idx;
long long i = 0;
while (i < n and second[i] == 'L') i++;
while (i < n) {
long long j = i;
while (j < n and second[j] == 'W') j++;
long long tmp = j;
while (j < n and second[j] == 'L') j++;
if (j < n) idx.push_back(j - tmp);
i = j;
}
if (cnt + k >= n) {
cout << 2 * n - 1 << "\n";
return;
}
long long ans = cnt;
for (long long i = 1; i < n; ++i) {
if (second[i] == 'W' and second[i - 1] == 'W') ans++;
}
sort(idx.begin(), idx.end());
for (auto u : idx) {
if (k >= u) {
ans += 2 * u;
ans++;
k -= u;
} else if (k != 0) {
ans += 2 * k;
k = 0;
}
}
if (k) ans += 2 * k;
cout << ans << "\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long test = 1;
cin >> test;
long long i = 1;
while (test--) {
solve();
}
}
| 8 | CPP |
import sys
input = sys.stdin.readline
I = lambda : list(map(int,input().split()))
t,=I()
for _ in range(t):
n,k=I()
s=list(input().strip())
if s.count('W')==0:
print(max(0,1+(2*(k-1))))
continue
i=0
le=[]
for i in range(n):
if s[i]=='W':
le.append(i)
ne=[]
for i in range(len(le)-1):
ne.append([le[i],le[i+1],le[i+1]-le[i]-1])
ne.sort(key=lambda x:x[2])
for i in ne:
now=i[0]+1
while now<i[1] and k:
s[now]='W'
now+=1
k-=1
if not k:
break
temp=[]
if s[0]!='W':
temp.append([-1,le[0],le[0]-(-1)-1])
if s[-1]!='W':
temp.append([le[-1],n,n-le[-1]-1])
temp.sort(key=lambda x:x[2])
for i in temp:
if i[0]==-1:
now=i[1]-1
while now>=0 and k:
k-=1
s[now]='W'
now-=1
else:
now=i[0]+1
while now<i[1] and k:
s[now]='W'
k-=1
now+=1
if not k:
break
ans=1 if s[0]=='W' else 0
for i in range(1,n):
if s[i-1]=='W' and s[i]=='W':
ans+=2
elif s[i]=='W':
ans+=1
print(ans)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, k, n_w = -1, s1 = 0;
cin >> n >> k;
string s;
cin >> s;
vector<int> a;
for (int i = 0; i < n; i++) {
if (s[i] == 'W') {
s1++;
if (i > 0 && s[i - 1] == 'W') s1++;
}
}
if (s1 == 0) {
if (k == 0)
cout << 0 << endl;
else
cout << k * 2 - 1 << endl;
return;
}
for (int i = 0; i < n; i++)
if (s[i] == 'W') {
n_w = i;
break;
}
int l_w = n_w;
for (int i = n_w + 1; i < n; i++) {
if (s[i] == 'W') {
if (i - l_w - 1 > 0) a.push_back(i - l_w - 1);
l_w = i;
}
}
sort(a.begin(), a.end());
int ss = 0;
for (int i = 0; i < a.size(); i++) {
if (a[i] <= k) {
k -= a[i];
ss += a[i] * 2 + 1;
} else {
ss += k * 2;
k = 0;
}
}
if (k > 0) {
ss += min(n_w, k) * 2;
k -= min(n_w, k);
}
if (k > 0) {
ss += min(n - l_w - 1, k) * 2;
k -= min(n - l_w - 1, k);
}
cout << ss + s1 << endl;
}
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
solve();
}
}
| 8 | CPP |
import io
import os
def solve():
n, k = map(int, input().split())
A = input()
segs = []
s, t = 0, 0
while s < n and A[s] == 'L':
s += 1
head = (0, s)
nn = n
while nn >= 1 and A[nn - 1] == 'L':
nn -= 1
tail = (nn, n)
while s < nn:
if A[s] == 'W':
s += 1
continue
t = s
while t < nn and A[t] == 'L':
t += 1
segs.append((s, t))
s = t
segs.sort(key=lambda x: x[1] - x[0])
B = list(A)
for (s, t) in segs:
if k <= 0:
break
w = min(t - s, k)
# print(s, w)
B[s:s+w] = 'W' * w
k -= w
if k > 0 and tail[0] != n:
s, t = tail
w = min(t - s, k)
B[s:s+w] = 'W' * w
k -= w
if k > 0 and head[1] > 0:
s, t = head
w = min(t - s, k)
B[t - w: t] = 'W' * w
k -= w
score = 0
for i in range(n):
if i >= 1 and B[i - 1] == 'W' and B[i] == 'W':
score += 2
continue
if B[i] == 'W':
score += 1
continue
return score
TC = int(input())
for _ in range(TC):
print(solve())
| 8 | PYTHON3 |
I=input
for _ in[0]*int(I()):
n,k=map(int,I().split());a=sorted(map(len,I().strip('L').split('W')));m=len(a)+k
while a and a[0]<=k:k-=a.pop(0)
print((2*min(n,m-1)-len(a)or 1)-1) | 8 | PYTHON3 |
import heapq
import collections
from math import log2
import itertools
from functools import lru_cache
from sys import setrecursionlimit as srl
srl(2*10**6)
N = 200001
def amin(a,b):
if b < a:
a = b
return a
def solve(n,k,a):
w = 0
W = 0
ans = 0
v = []
cur = 0
for i in range(n):
if a[i] == 'W':
if cur:
v.append(cur)
cur = 0
w +=1
ans+=1
if W:
ans+=1
W = 1
else:
W = 0
if w:
cur +=1
if not w:
return max(2*k-1 ,0)
if k > n-w:
k = n-w
ans += 2*k
v.sort()
for x in v:
if x <= k:
ans +=1
k-=x
return ans
t = int(input())
for i in range(1,t+1):
n,k = map(int,input().split())
a = input()
print(solve(n,k,a)) | 8 | PYTHON3 |
from math import inf
def put(): return map(int, input().split())
t = int(input())
for _ in range(t):
n,k = put()
l = [1 if i=='W' else 0 for i in list(input())]
s = sum(l)
if s+k>=n:
print((2*n)-1)
continue
elif s==1:
print((2*min(n-1, k))+1)
continue
elif s==0:
print(max(2*k-1,0))
continue
ind = []
prev = -inf
for i in range(n):
if l[i]==1:
ind.append(i-prev-1)
prev = i
if ind:
ind.sort()
#print(ind)
for d in ind:
if d<=k:
s+= 2*d+1
k-= d
if k>0:
s+= 2*k
print(s)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long int mod1 = 1000000007;
long long int mod2 = 67280421310721;
long long int mod3 = 998244353;
long long int INF = 1e18;
long long int pow1(long long int a, long long int b) {
long long int res = 1;
while (b > 0) {
if (b & 1) res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
void sieve() {
long long int n;
bool prime[n + 1];
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (int i = p * p; i <= n; i += p) prime[i] = false;
}
}
}
long long int pow2(long long int a, long long int b, long long int m) {
a %= m;
long long int res = 1;
while (b > 0) {
if (b & 1) res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
long long int setbit(long long int n) { return __builtin_popcount(n); }
void solve() {
long long int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> v;
int win = 0;
int W = 0;
int loss = 0;
int ans = 0;
for (char a : s) {
if (a == 'W') {
if (loss) {
v.push_back(loss);
loss = 0;
}
ans++;
if (W) ans++;
W = 1;
win++;
} else {
W = 0;
if (win) loss++;
}
}
if (win == 0) {
cout << max(2 * k - 1, 0LL) << endl;
} else if (win + k >= n)
cout << 2 * n - 1 << endl;
else {
sort(v.begin(), v.end());
ans += 2 * k;
for (auto x : v) {
if (x <= k) ans++;
k -= x;
}
cout << ans << endl;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cout << x; }
void __print(long x) { cout << x; }
void __print(long long x) { cout << x; }
void __print(unsigned x) { cout << x; }
void __print(unsigned long x) { cout << x; }
void __print(unsigned long long x) { cout << x; }
void __print(float x) { cout << x; }
void __print(double x) { cout << x; }
void __print(long double x) { cout << x; }
void __print(char x) { cout << '\'' << x << '\''; }
void __print(const char *x) { cout << '\"' << x << '\"'; }
void __print(const string &x) { cout << '\"' << x << '\"'; }
void __print(bool x) { cout << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
cout << '{';
__print(x.first);
cout << ',';
__print(x.second);
cout << '}';
}
template <typename T>
void __print(const T &x) {
int f = 0;
cout << '{';
for (auto &i : x) cout << (f++ ? "," : ""), __print(i);
cout << "}";
}
void _print() { cout << "]" << endl; }
template <typename T, typename... V>
void _print(T t, V... v) {
__print(t);
if (sizeof...(v)) cout << ", ";
_print(v...);
}
template <typename T, typename T1>
T amax(T &a, T1 b) {
if (b > a) a = b;
return a;
}
template <typename T, typename T1>
T amin(T &a, T1 b) {
if (b < a) a = b;
return a;
}
const int mod = 1e9 + 7;
const int N = 3e5 + 1;
void solve() {
int n, k;
string s;
cin >> n >> k >> s;
int x = 1;
bool found = 0;
vector<string> L;
string lose = "";
int cnt = 0, numL = 0;
for (int i = 0; i < n; i++) {
cnt += s[i] == 'W';
numL += s[i] == 'L';
if (s[i] == 'W' && found && s[i - 1] == 'L') {
L.push_back(lose);
lose = "";
} else if (s[i] == 'W') {
found = 1;
} else if (found) {
lose += 'L';
}
}
int cmp = (L.size() + 1) * found + (!found) * (k > 0);
sort(L.begin(), L.end());
for (int i = 0; i < L.size(); i++) {
string curr = L[i];
if (curr.size() <= k)
cnt += curr.size(), cmp--, k -= curr.size(), numL -= curr.size();
else
cnt += k, numL -= k, k = 0;
if (!k) break;
}
cnt += min(k, numL);
cout << cnt * 2 - cmp << "\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
cin >> t;
while (t--) solve();
return 0;
}
| 8 | CPP |
import sys
t = int(sys.stdin.readline().strip())
for _ in range(t):
arr = []
n, k = map(int, sys.stdin.readline().strip().split())
s = input()
ind = 0
while ind != n and s[ind] == 'L':
ind += 1
if ind == n:
if k >= n:
print(2*n - 1)
else:
print(max(2*k - 1, 0))
continue
count = -1
current = 0
for i in range(ind, n):
if s[i] == 'W':
if count > 0:
current += 1
arr += [count]
elif count < 0:
current += 1
else:
current += 2
count = 0
else:
count += 1
change = 0
arr.sort()
# print(arr)
delta = 0
for i in range(len(arr)):
if change + arr[i] <= k:
change += arr[i]
delta += arr[i]*2 + 1
# print(delta, change, k)
# print(current, delta)
print(min(current + delta + 2*(k-change), 2*n - 1))
| 8 | PYTHON3 |
def solve(n, k, s):
gaps = []
first_w_index = -1
last_w_index = -1
score = 0
win_streak = 0
for i in range(n):
if s[i] == 'W':
win_streak += 1
if first_w_index == -1:
first_w_index = i
elif i - last_w_index - 1 > 0:
gaps.append(i-last_w_index-1)
last_w_index = i
else:
if win_streak > 0:
score += 2 * win_streak - 1
win_streak = 0
if win_streak > 0:
score += 2*win_streak-1
gaps.sort()
rem = []
for g in gaps:
if g <= k:
score += 2*g+1
k -= g
else:
rem.append(g)
if k > 0:
if len(rem) > 0:
score += 2*k
else: # all in-between gaps are filled
# last_w_index >= first_w_index
if first_w_index == -1: # no win
score += 2*k-1
else:
score += 2 * min(k, first_w_index + n-last_w_index-1)
return score
T = int(input())
for _ in range(T):
n, k = map(int, input().split())
s = input()
print(solve(n, k, s))
| 8 | PYTHON3 |
from sys import stdin, stdout
input = stdin.readline
print = lambda x:stdout.write(str(x)+'\n')
for _ in range(int(input())):
n, k = map(int, input().split())
s = input().strip()
Ws = 0
prev = 0
for i in s:
if i=='W':
if prev:
Ws += 2
else:
Ws += 1
prev = 1
elif prev:
prev = 0
if not Ws:
if not k:
print(0)
continue
ans = min(k, n)*2-1
print(ans)
continue
start = 0
mid = []
end = 0
w = 0
curr = 0
for g in s:
if g=='L':
curr += 1
else:
if w:
if curr:
mid.append(curr)
else:
start += curr
w = 1
curr = 0
end = curr
#print(start, mid, end, Ws)
mid.sort()
i = 0
c = 0
score = 0
while c < k and i < len(mid):
if c + mid[i] <= k:
score += mid[i]*2 + 1
else:
score += (k - c) * 2
c += mid[i]
i += 1
if k-c>0:
if c + start <= k:
score += start * 2
else:
score += (k - c) * 2
c += start
if k-c>0:
if c + end <= k:
score += end * 2
else:
score += (k - c) * 2
c += end
print(score + Ws) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
multimap<int, string> MM;
const int M = 1e9 + 7;
long long mod(long long x) { return ((x % M + M) % M); }
long long add(long long a, long long b) { return mod(mod(a) + mod(b)); }
long long mul(long long a, long long b) { return mod(mod(a) * mod(b)); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--) {
int n, k, i;
cin >> n >> k;
string s;
cin >> s;
int w = 0;
for (i = 0; i < s.length(); i++)
if (s[i] == 'W') w++;
if (w == 0) {
cout << max((2 * k) - 1, 0) << "\n";
continue;
}
w = w + k;
if (w >= n) {
cout << (2 * n) - 1 << "\n";
continue;
}
int l = 0;
vector<int> v;
for (i = 0; i < n; i++) {
if (s[i] == 'L')
l++;
else {
v.push_back(l);
l = 0;
}
}
if (l != 0) v.push_back(l);
if (s[0] == 'L') v.erase(v.begin());
if (s[n - 1] == 'L') v.erase(v.begin() + v.size() - 1);
sort(v.begin(), v.end());
l = 0;
for (i = 0; i < v.size(); i++) {
if (l + v[i] > k) break;
l = l + v[i];
}
l = v.size() - i;
cout << (2 * w) - l - 1 << "\n";
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
constexpr long double PI = 3.14159265358979323846264338327950288L;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
class BChessCheater {
public:
void solve(istream& cin, ostream& cout) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int ret = 0;
int cntL = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'W') {
if (i > 0 && s[i - 1] == 'W') {
ret += 2;
} else {
ret++;
}
} else {
cntL++;
}
}
if (cntL == n && k == 0) {
cout << 0 << '\n';
continue;
}
if (cntL == n) {
cout << 2 * k - 1 << '\n';
continue;
}
char before = 'x';
vector<pair<char, int>> vec;
for (int i = 0; i < n; i++) {
if (s[i] != before) {
vec.emplace_back(s[i], 1);
} else {
vec.back() = {vec.back().first, vec.back().second + 1};
}
before = s[i];
}
vector<int> v;
for (int i = 1; i < vec.size() - 1; i++) {
if (vec[i].first == 'L') {
v.push_back(vec[i].second);
}
}
sort(v.begin(), v.end());
int kk = k;
for (int i = 0; i < v.size(); i++) {
if (v[i] <= kk) {
kk -= v[i];
ret += 1;
} else {
break;
}
}
int used = min(k, cntL);
ret += 2 * used;
cout << ret << '\n';
}
}
};
signed main() {
BChessCheater solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
| 8 | CPP |
for _ in range(int(input())):
n,k=map(int,input().split())
s=input()
s1=list(s)
l=[len(i) for i in s.split('W')]
w=0
#print(s,k)
#print(l)
if sum(l)<=k:
print(2*n-1)
else:
prev=s[0]
if prev=='W':
w+=1
for i in s[1:]:
if prev==i and i=='W':
w+=2
elif i=='W':
w+=1
prev=i
#print(w)
m=sorted(l[1:-1],reverse=True)
cm=len(m)
while(k!=0 and cm!=0):
t=m[cm-1]
if t!=0:
if k>=t:
w+=t*2+1
k-=t
else:
w+=k*2
k=0
cm-=1
#print(k,w)
if len(l)==1:
g=l[0]
if k!=0:
w+=k*2-1
elif len(l)==2:
g=l[0]+l[-1]
if k!=0:
if g==n:
w+=k*2-1
else:
w+=k*2
else:
g=l[0]+l[-1]
if k!=0:
w+=k*2
print(w)
| 8 | PYTHON3 |
for _ in range(int(input())):
n, k = list(map(int, input().split()))
s = input()
i = 0
first = 0
last = 0
res = 0
while i < n and s[i] != 'W':
i += 1
first += 1
intervals = []
while i < n:
start = i
while i < n and s[i] == 'W':
if i > start:
res += 2
else:
res += 1
i += 1
if i == n:
break
intervals.append(0)
while i < n and s[i] != 'W':
intervals[-1] += 1
i += 1
if i == n:
last = intervals.pop()
intervals.sort()
if len(intervals) == 0 and first == n:
print(max(0, min(n, k) * 2 - 1))
else:
i = 0
while k > 0 and i < len(intervals):
if intervals[i] <= k:
res += intervals[i] * 2 + 1
k -= intervals[i]
else:
res += 2 * k
k = 0
i += 1
if k > 0:
res += min(last + first, k) * 2
print(res)
| 8 | PYTHON3 |
t=int(input())
for _ in range(t):
l=list(map(int,input().split()))
n,k=l[0],l[1]
s=str(input())
score=0
key=1
for i in range(n):
if(s[i]=="L"):
key=1
else:
score+=key
key=2
l=[]
count,count2=0,0
ind=0
for i in range(n):
if(s[i]=="L" and ind==0):
count2+=1
elif(s[i]=="L" and ind==1):
count+=1
elif(s[i]=="W" and ind==0):
ind=1
else:
if(count>0):
l.append(count)
count=0
count3=0
if(count>0):
count3=count
countf=count2+count3
l.sort()
#print(l,count2,count3)
p=len(l)
x=k
inc=0
for i in range(p):
if(x>=l[i]):
x=x-l[i]
#print((2*l[i])+1,"now")
inc+=((2*l[i])+1)
else:
inc+=(2*x)
x=0
#print("j")
if(x==0):
break
#print(x,inc,"here")
if(x>0):
inc+=(2*min(x,count3))
x-=min(x,count3)
#print(x,"here")
if(x>0):
if("W" in s):
inc+=(2*min(x,count2))
x-=min(x,count2)
else:
inc+=(2*min(x,count2)-1)
x-=min(x,count2)
print(score+inc)
| 8 | PYTHON3 |
for _ in range(int(input())):
n,k=[*map(int,input().split())]
s=input()
c=s.count('W')
z=[0]*(c+1)
x=0
kk=k
ans=0
if c==0 and k>0:
ans-=1
for i in range(n):
if i==0:
if s[i]=='W':
ans+=1
if i!=0:
if s[i]=='W':
if s[i-1]=='W':
ans+=2
else:
ans+=1
if s[i]=='W':
x+=1
if s[i]=='L':
z[x]+=1
a=z[0]+z[-1]
z=z[1:c]
z.sort()
for i in z:
if i==0:
continue
else:
if k-i>=0:
ans+=1
k-=i
else:
k=0
break
if k>0:
if k>=a:
k-=a
ans+=(kk-k)*2
else:
ans+=kk*2
else:
ans+=kk*2
print(ans) | 8 | PYTHON3 |
import sys
input = sys.stdin.readline
import math
############ ---- Input Functions ---- ############
# single int
def inp():
return (int(input()))
# int arr
def inlt():
return (list(map(int, input().split())))
# string converted to char
def insr():
s = input()
return (list(s[:len(s) - 1]))
T = inp()
t = 0
while t < T:
t += 1
n,k = inlt()
x = insr()
res = 0
arr = []
gap = -1
flag = False
for c in x:
if c=='L' and gap!=-1:
gap+=1
elif c=='W':
flag=True
if gap==-1:
gap=0
continue
if gap!=0:
arr.append(gap)
gap=0
if not flag and k>0:
print(min(k,len(x))*2-1)
continue
#17+11+11+4+
arr.sort()
# print(arr)
for gap in arr:
if k>=gap:
res += gap*2+1
k -= gap
else:
# print(k,gap)
res += k*2
k=0
break
if k>0:
# print('nooo')
start=0
while start<len(x) and x[start]=='L':
start+=1
end = 0
while end<len(x) and len(x)-end-1>start and x[len(x)-end-1]=='L':
end+=1
if start>0 or end>0:
if k>start+end:
res+= (start+end)*2
else:
res+= k*2
# print(arr)
prior = 0
if x[0]=='W':
prior+=1
for i in range(1,len(x)):
if x[i]=='W':
if x[i-1]=='W':
prior+=2
else:
prior+=1
# print(res,prior)
res+=prior
print(res) | 8 | PYTHON3 |
def getsum(result) :
answer = 0
box = []
count = 0
for i in result :
if i == "W" :
count += 1
else :
box.append(count)
count = 0
box.append(count)
for i in box :
if i != 0 :
answer += (2 * i) - 1
return answer
t = int(input())
for _ in range(t) :
n, k = map(int, input().split())
result = input()
wcount = result.count("W")
if wcount == 0 :
if k != 0 :
print((2*k) -1)
else :
print(0)
else :
score = getsum(result)
betL = []
nobetL = []
start = -1
end = -1
tempw = 0
count = 0
for i in range(len(result)) :
if result[i] == "L" :
count += 1
else :
tempw += 1
if start == -1 and end == -1 :
if count != 0 :
nobetL.append(count)
count = 0
start = i
elif start != -1 and end == -1 and tempw != wcount:
if count != 0 :
betL.append(count)
count = 0
elif start != -1 and end == -1 and tempw == wcount :
if count != 0 :
betL.append(count)
count = 0
end = i
if count != 0 :
nobetL.append(count)
betL = sorted(betL)
nobetL = sorted(nobetL)
tempsum = 0
if sum(betL) >= k :
for i in betL :
if k >= i :
tempsum += (2*i) + 1
k -= i
else :
tempsum += (2*k)
break
print(score + tempsum)
else :
for i in betL :
if k >= i :
tempsum += (2*i) + 1
k -= i
else :
tempsum += (2*k)
break
for i in nobetL :
if k >= i :
tempsum += (2*i)
k -= i
else :
tempsum += (2*k)
break
print(score + tempsum) | 8 | PYTHON3 |
'''input
1
3 0
LWW
'''
from collections import deque, defaultdict
def solve():
n, k = map(int, input().split())
s = input()
clss = []
cl = fl = ls = 0
for i in range(n):
if s[i] == 'L':
cl+=1
ls+=1
elif fl:
clss.append(cl)
cl = 0
else:
fl = 1
cl = 0
s = i = 0
clss.sort()
while i<len(clss):
s+=clss[i]
if s>k:
break
i+=1
cons = len(clss)-i+1
w = n-ls
if ls == n and k ==0:
print(0)
elif k>=ls:
print(2*n-1)
else:
print(2*(w+k)-cons)
def main():
t = 1
t = int(input())
for _ in range(t):
solve()
main() | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
const int MAXN = 1e5 + 5;
int N, K;
multiset<int> loseLen;
bool W[MAXN];
void solve() {
cin >> N >> K;
loseLen.clear();
string S;
cin >> S;
int numW = 0;
for (int i = (0); i < (N); i++) {
W[i] = S[i] == 'W';
if (W[i]) numW++;
}
K = min(N - numW, K);
int li = -1;
for (int i = (0); i < (N); i++) {
if (W[i]) {
if (li != -1 && li != i - 1) {
loseLen.insert(i - li - 1);
}
li = i;
}
}
int ans = numW + K;
for (int i = (1); i < (N); i++)
if (W[i] && W[i - 1]) ans++;
while (!loseLen.empty()) {
int x = *loseLen.begin();
loseLen.erase(loseLen.begin());
if (K >= x) {
K -= x;
ans += x + 1;
} else
break;
}
if (numW != 0)
ans += K;
else
ans += max(K - 1, 0);
cout << ans << '\n';
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int T;
cin >> T;
for (int i = (0); i < (T); i++) solve();
return 0;
}
| 8 | CPP |
import sys
input = lambda: sys.stdin.readline().rstrip()
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
s = input()
li = []
cnt = 0
ans = 0
lose = 0
first = True
for i in range(n):
if s[i]=='W':
if not first and cnt>0:
li.append(cnt)
cnt = 0
if i>0 and s[i-1]=='W':
ans += 2
else:
ans += 1
first = False
else:
lose += 1
cnt += 1
li.sort()
k = min(lose, k)
for i in li:
if k<i:
break
ans += 2*i+1
k -= i
ans += k*2
if lose==n and k>0:
ans -= 1
print(ans) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct tri {
int a, b, c;
};
const int inf = 0x3f3f3f3f;
const long long linf = 0x3f3f3f3f3f3f3f3f;
const int N = 1e5 + 10;
const long long mod = 1e9 + 7;
const double PI = acos(0) * 2;
int solve() {
int n, k, ret = 0;
cin >> n >> k;
string s;
cin >> s;
vector<int> v;
int left = 0;
int st = 0;
while (st < n && s[st] == 'L') st++;
if (st == n) {
k = min(k, n);
if (k == 0) return 0;
return k * 2 - 1;
}
int cnt = 0;
for (int i = st; i < n; i++) {
if (s[i] == 'L')
cnt++;
else {
if (cnt) v.push_back(cnt);
cnt = 0;
if (i && s[i - 1] == 'W')
ret += 2;
else
ret++;
}
}
st += cnt;
sort(v.begin(), v.end());
for (int i : v) {
if (i <= k) {
ret += i * 2 + 1;
k -= i;
} else {
ret += k * 2;
return ret;
}
}
k = min(k, st);
ret += k * 2;
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int _;
cin >> _;
while (_--) {
cout << solve() << endl;
}
return 0;
}
| 8 | CPP |
def solve():
n,k=map(int,input().split())
s=list(input())
if n==1:
print(1 if (s[0]=='W' or k>0) else 0)
return
if not 'W' in s:
print(min(k,n)*2-1 if k>0 else 0)
return
ans=0
arr=[]
arr2=0
i=0
for i in range(n):
if s[i]=='W':
if i>0 and s[i-1]=='W':
ans+=2
else:
ans+=1
i=0
while(i<n):
if s[i]=='W':
i+=1
continue
j=i
while(j<n and s[j]==s[i]):
j+=1
if j==n or i==0:
arr2+=j-i
else:
arr.append(j-i)
i=j
arr.sort()
for c in arr:
if c>k:
arr2+=c
continue
ans+=c*2+1
k-=c
ans+=min(k*2,arr2*2)
print(ans)
t=int(input())
for _ in range(t):
solve() | 8 | PYTHON3 |
for _ in range(int(input())):
n, k = map(int, input().split())
s = input()
score = 0
tmp = s.count('L')
for i in range(1, n):
if s[i] == "W" and s[i - 1] == "W":
score += 2
elif s[i] == "W":
score += 1
if s[0] == 'W':
score += 1
if k == 0:
print(score)
continue
res = []
idx = s.find('W')
count = 0
for i in range(idx + 1, n):
if s[i] == 'L':
count += 1
else:
res.append(count)
count = 0
res = list(filter(lambda x: x != 0, res))
res.sort()
i = 0
while k > 0 and i < len(res):
if res[i] <= k:
k -= res[i]
score += 2 * res[i]
score += 1
else:
score += 2 * k
k = 0
i += 1
if 'W' in s:
score += 2 * min(k, (tmp - sum(res)))
else:
if k<=n:
score += 2 * k - 1
else:
score += 2 * n - 1
print(score) | 8 | PYTHON3 |
gans = []
for _ in range(int(input())):
n, k = map(int, input().split())
a = list(input())
cnt = 1
u = []
ok = False
ans = 0
for i in range(1, n):
if a[i] != a[i - 1]:
if a[i - 1] == 'L':
u.append([cnt, 0])
if not ok:
u[0][1] = 1
else:
ans += cnt * 2 - 1
cnt = 1
ok = True
else:
cnt += 1
if a[-1] == 'L':
u.append([cnt, 1])
else:
ans += cnt * 2 - 1
u.sort(key=lambda x: (x[1], x[0]))
if ans == 0:
ans = 2 * k - min(1, k)
gans.append(ans)
continue
for i in range(len(u)):
if u[i][0] > k:
ans += k * 2
break
k -= u[i][0]
ans += u[i][0] * 2 + 1 - u[i][1]
gans.append(ans)
print('\n'.join(map(str, gans)))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int strToInt(string& a) {
stringstream x(a);
int b;
x >> b;
return b;
}
void readI(int& a) { cin >> a; }
void readI(int& a, int& b) { cin >> a >> b; }
void readI(int& a, int& b, int& c) { cin >> a >> b >> c; }
vector<int> readVI(int n) {
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
return a;
}
vector<vector<int> > readVVI(int n, int m) {
vector<vector<int> > a(n, vector<int>(m));
for (int i = 0; i < n; i++) a[i] = readVI(m);
return a;
}
vector<long long> readVLL(long long n) {
vector<long long> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
return a;
}
vector<vector<long long> > readVVLL(long long n, long long m) {
vector<vector<long long> > a(n, vector<long long>(m));
for (int i = 0; i < n; i++) a[i] = readVLL(m);
return a;
}
void print(vector<int>& a) {
for (auto el : a) {
cout << el << ' ';
}
cout << '\n';
}
void print(vector<int>& a, int n) {
int cnt = 0;
for (auto el : a) {
if (cnt++ == n) break;
cout << el << ' ';
}
cout << '\n';
}
const int MOD = 1e9 + 7;
const int INF = INT_MAX;
const long long INFF = INT64_MAX;
const double EPS = 1e-9;
const double PI = acos(-1.0);
const int moveX[] = {-1, 0, 1, 0};
const int moveY[] = {0, 1, 0, -1};
void go() {
int n, m;
string s;
cin >> n >> m >> s;
int a = n, cnt = 0, gege = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'W' && a == n) a = i;
if (s[i] == 'W') cnt++;
if (i < n && s[i] == 'W' && s[i + 1] == 'W') {
gege++;
}
}
if (a == n) {
cout << max(0, m * 2 - 1) << '\n';
} else {
if (m + cnt >= n) {
cout << max(0, n * 2 - 1) << '\n';
return;
}
vector<int> tmp;
int curCnt = 0;
for (int i = a; i < n; i++) {
if (s[i] == 'L')
curCnt++;
else {
if (curCnt > 0) tmp.push_back(curCnt);
curCnt = 0;
}
}
int last = curCnt;
sort(tmp.begin(), tmp.end());
for (int i = 0; i < tmp.size(); i++) {
if (m >= tmp[i]) {
cnt += tmp[i] * 2 + 1;
m -= tmp[i];
}
}
cnt += 2 * m;
cout << cnt + gege << '\n';
}
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int T = 1;
cin >> T;
while (T--) go();
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void ran() { srand(chrono::steady_clock::now().time_since_epoch().count()); }
long long get_rand() {
long long a = rand();
long long b = rand();
return a * (RAND_MAX + 1ll) + b;
}
void usaco() {
freopen("problem.in", "r", stdin);
freopen("problem.out", "w", stdout);
}
int score(string k) {
int x = 0;
for (int i = 0; i < k.size(); i++) {
if (k[i] == 'W') {
x++;
if (i > 0 && k[i - 1] == 'W') x++;
}
}
return x;
}
void solve() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
bool ol = true;
int l = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'W')
ol = false;
else
l++;
}
if (ol) {
cout << max(0, 2 * min(n, k) - 1) << endl;
return;
}
vector<int> gaps;
int ls = -1;
for (int i = 0; i < n; i++) {
if (s[i] == 'W') {
if (ls != -1) {
if (ls != i - 1) {
gaps.push_back(i - ls - 1);
}
}
ls = i;
}
}
sort(gaps.begin(), gaps.end());
int ex = 0, sm = 0;
for (int i = 0; i < gaps.size(); i++) {
sm += gaps[i];
if (sm <= k) {
ex = i + 1;
}
}
k = min(k, l);
cout << score(s) + 2 * k + ex << endl;
}
signed main() {
ran();
fast();
int t = 1;
cin >> t;
while (t--) solve();
}
| 8 | CPP |
for _ in range(int(input())):
n, k = list(map(int, input().split()))
a = list(input())
yes = 0
if a[0] == 'W':
ans = 1
yes = 1
c = 0
else:
ans = 0
c = 1
r = []
first = 0
for i in range(1, n):
if a[i] == 'W' and a[i - 1] == 'W':
ans += 2
elif a[i] == 'W' and a[i - 1] == 'L' and yes != 0:
r.append(c)
c = 0
ans += 1
elif a[i] == 'W' and a[i - 1] == 'L':
first = c
yes = 1
ans += 1
c = 0
else:
c += 1
last = c
if ans == 0:
print(min(max(k * 2 - 1, 0), n * 2 - 1))
else:
r.sort()
s = 0
i = 0
j = len(r)
while i < j and s + r[i] <= k:
s += r[i]
ans += r[i] * 2 + 1
i += 1
k -= s
if i < j:
ans += k * 2
else:
ans += min(last * 2 + first * 2, k * 2)
print(ans) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int todx[] = {-2, -2, -1, -1, 1, 1, 2, 2};
const int tody[] = {-1, 1, -2, 2, -2, 2, -1, 1};
bool sortbysec(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return (a.second < b.second);
}
void func(void) {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
int main() {
long long T;
cin >> T;
for (long long t = 0; t < T; t++) {
long long n;
long long k;
cin >> n >> k;
string s;
cin >> s;
long long last1 = 0;
vector<long long> zer(n, 0);
vector<long long> sg;
long long cnt = 0;
if (s[0] == 'W') cnt = 1;
for (int i = 1; i < n; i++) {
if (s[i] == 'W') {
if (s[i - 1] == 'W')
cnt += 2;
else
cnt += 1;
}
}
if (s[0] == 'L') zer[0] = 1;
if (n == 1) sg.push_back(zer[0]);
for (int i = 1; i < n; i++) {
if (s[i] == 'L') {
zer[i] = 1;
zer[i] += zer[i - 1];
} else {
if (s[i - 1] == 'L') {
sg.push_back(zer[i - 1]);
}
}
if (i == n - 1) {
if (s[i] == 'L') {
sg.push_back(zer[i]);
last1 = zer[i];
}
}
}
long long max1 = 0;
for (int i = 0; i < n; i++) {
if (zer[i] >= 1) {
max1 = max(max1, zer[i]);
} else {
break;
}
}
int flag1 = 0;
int flag2 = 0;
sort(sg.begin(), sg.end());
if (cnt == 0) cnt = -1;
for (auto x : sg) {
if (x <= k) {
if (flag1 == 0 && x == max1) {
flag1 = 1;
continue;
} else if (flag2 == 0 && x == last1) {
flag2 = 1;
continue;
} else {
cnt += 2 * x + 1;
k -= x;
}
} else {
cnt += 2 * min(x, k);
k = 0;
break;
}
}
if (flag1 == 1) {
if (n != 1) {
cnt += 2 * min(k, max1);
} else
cnt = 1;
k = k - min(k, max1);
}
if (flag2 == 1) {
if (n != 1) {
cnt += 2 * min(k, last1);
} else
cnt = 1;
k = k - min(k, last1);
}
if (cnt == -1) cnt = 0;
cout << cnt << endl;
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<ll, ll>;
void INIT() {
ios::sync_with_stdio(false);
cin.tie(0);
}
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll fpow(ll b, ll p) {
ll ans = 1, now = b;
while (p) {
if (p & 1) ans = ans * now % (ll)(1e9 + 7);
p /= 2;
now = now * now % (ll)(1e9 + 7);
}
return ans;
}
int32_t main() {
INIT();
ll N;
cin >> N;
while (N--) {
ll n, k;
cin >> n >> k;
string s;
cin >> s;
vector<ll> v;
{
ll i;
ll now = 0;
for (i = 0; i < n && s[i] == 'L'; i++)
;
for (; i < n && s[i] == 'W'; i++)
;
for (; i < n; i++) {
if (s[i] == 'W' && s[i - 1] == 'L') {
v.emplace_back(now);
now = 0;
} else if (s[i] == 'L') {
now++;
}
}
}
sort(v.begin(), v.end());
ll ans = 0;
ll al = 0;
for (ll i = 0; i <= n - 1; i++) {
if (s[i] == 'L') al++;
if (i > 0 && s[i] == 'W' && s[i - 1] == 'W')
ans += 2;
else if (s[i] == 'W')
ans++;
}
if (k == 0) {
cout << ans << "\n";
} else if (al != n) {
k = min(k, al);
for (auto &i : v) {
if (i > k) break;
k -= i;
ans += i * 2 + 1;
}
cout << (ans + k * 2) << "\n";
} else {
k = min(k, al);
cout << (k * 2 - 1) << "\n";
}
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = double;
using pii = pair<int, int>;
using vi = vector<int>;
using qi = queue<int>;
using pqi = priority_queue<int>;
using si = set<int>;
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1.0);
int _w, _t;
FILE* _f;
const int N = 1e5 + 5;
int n, k, cnt, len[N], ans, cl;
char s[N];
void solve() {
cnt = ans = cl = 0;
_w = scanf("%d%d%s", &n, &k, s + 1);
for (int i = 1, ls = 1; i <= n; i++) {
if (s[i] == 'W') {
if (s[i - 1] == s[i]) {
ans += 2;
} else {
ans += 1;
}
} else {
++cl;
}
if (s[i] ^ s[ls]) {
if (s[ls] == 'L' && ls != 1) {
len[++cnt] = i - ls;
}
ls = i;
}
}
if (cl == n && k) {
--ans;
}
sort(len + 1, len + cnt + 1);
ans += ((min(cl, k)) << 1);
for (int i = 1; i <= cnt; i++) {
if (k < len[i]) {
break;
}
++ans;
k -= len[i];
}
printf("%d\n", ans);
}
int main() {
_w = scanf("%d", &_t);
while (_t--) solve();
return 0;
}
| 8 | CPP |
t = int(input())
for case in range(t):
n,k = map(int,input().split())
s = input().split()[0]
prev = "L"
score = 0
curr = 0
l = []
foundW = False
for i in range(n):
if s[i] == "W":
foundW = True
if curr != 0:
l.append(curr)
curr = 0
if prev == "L":
score += 1
else:
score += 2
else:
curr += 1
prev = s[i]
if curr != 0:
l.append(curr)
if len(l) == 0:
print(score)
continue
beg, end = False, False
if s[0] == "L":
beg = True
if s[n-1] == "L":
end = True
if foundW == False:
score = max(2*k-1,0)
print(score)
continue
bonus = sum(l)
bonusPts = 2*sum(l)+len(l)
reg = 0
regPts = 0
if beg:
bonus -= l[0]
reg += l[0]
bonusPts -= 2*l[0]+1
regPts += 2*l[0]
if end:
bonus -= l[len(l)-1]
reg += l[len(l)-1]
bonusPts -= 2*l[len(l)-1]+1
regPts += 2*l[len(l)-1]
if k > bonus:
score += bonusPts
k -= bonus
score += 2*min(reg, k)
else:
if beg:
del l[0]
if end:
del l[-1]
l.sort()
for i in range(len(l)):
if k >= l[i]:
score += 2*l[i]+1
k -= l[i]
else:
score += 2*k
break
print(score)
| 8 | PYTHON3 |
import sys
def minp():
return sys.stdin.readline().strip()
def mint():
return int(minp())
def mints():
return map(int, minp().split())
def solve():
n, k = mints()
i = 0
p = None
pos = []
a = list(minp())
for i in range(n):
if a[i] == 'W':
if p is not None:
pos.append((i-p-1,p+1))
else:
first = i
p = i
#print(pos)
pos.sort()
for l, f in pos:
if k == 0:
break
for i in range(f, f+l):
if k > 0:
k -= 1
a[i] = 'W'
else:
break
if p is not None:
for i in range(p-1,-1,-1):
if a[i] != 'W':
if k > 0:
a[i] = 'W'
k -= 1
else:
break
for i in range(n):
if a[i] != 'W':
if k > 0:
a[i] = 'W'
k -= 1
else:
break
ans = 0
cnt = 0
#print(''.join(a))
for i in range(n):
if a[i] == 'W':
cnt = min(cnt + 1, 2)
ans += cnt
else:
cnt = 0
print(ans)
for i in range(mint()):
solve()
| 8 | PYTHON3 |
for _ in " "*int(input()):
n,k=map(int,input().split())
s=list(input())
if "W" not in s:
print(max((min(k,n)*2)-1,0))
elif k >= s.count("L"):
print((n*2)-1)
else:
cnt=[]
sm=s.count("W")
ind=s.index("W")
for i in range(ind+1,n):
if s[i] == "W":
cnt.append(i-ind-1)
ind=i
cnt.sort()
for i in cnt:
if k >= i:
sm+=(2*i)+1
k-=i
if k>0:
sm+=(2*k)
print(sm) | 8 | PYTHON3 |
for _ in range(int(input())):
n,k = map(int,input().split())
S = input()
K=k
s = []
for i in S:
s.append(i)
a = []
if s[0]=='L':
ans = 0
else:
ans = 1
for i in range(1,n):
if s[i]=='W':
ans+=1
if s[i-1]=='W':
ans+=1
cnt = 0
for i in range(n):
if s[i]=='L':
cnt+=1
else:
if cnt!=0:
a.append(cnt)
cnt = 0
if cnt!=0:
a.append(cnt)
if len(a)!=0 and s[0]=='L':
a.remove(a[0])
if len(a)!=0 and s[-1]=='L':
a.remove(a[-1])
mx = a.count(0)
a.sort()
for i in a:
if i<=k:
k-=i
ans+=(1+2*i)
else:
ans+=2*k
k=0
break
cnt=0
for i in range(n-1,-1,-1):
if s[i]=='L':
cnt+=1
else:
break
mn = min(k,cnt)
k-=mn
ans+=2*mn
cnt = 0
for i in range(n):
if s[i]=='L':
cnt+=1
else:
break
mn = min(k,cnt)
ans+=2*mn
if s.count("W")==0:
mn = min(K,n)
if mn>=1:
ans = 1+2*(mn-1)
print(ans) | 8 | PYTHON3 |
t = int(input())
for i in range(t):
n, m = map(int, input().split())
s = input()
scoreinitial = 0
if s[0] == 'W':
scoreinitial += 1
for i in range(1, len(s)):
if s[i] == 'W' and s[i-1] == 'W':
scoreinitial += 2
elif s[i] == 'W':
scoreinitial += 1
paq = []
cuts = s.split('W')
extr = [len(x) for x in cuts]
nbL = sum(extr)
stock = min(m, nbL)
if stock == 0:
print(scoreinitial)
elif nbL < n:
paq = sorted(extr[1:-1])
#print(paq)
rep = 0
for i in paq:
if i <= stock and i > 0:
rep += i*2 + 1
stock -= i
rep += 2*stock
print(rep+scoreinitial)
else:
print(stock*2-1)
| 8 | PYTHON3 |
for _ in range(int(input())):
n, k = [int(i) for i in input().split()]
s = input()
if k + s.count("W") >= n:
print(2*n-1)
elif k == 0 and s.count("W")==0:
print(0)
else:
chains = []
chain = 0
streak = False
for char in s.strip("L"):
if char == "W" and chain != 0:
chains.append(chain)
chain = 0
elif char == "L":
chain += 1
chains.sort()
i = 0
total = 0
while chains and total+chains[i] <= k:
total += chains[i]
i += 1
if i >= len(chains):
break
print(2*(k+s.count("W"))-len(chains)-1+i) | 8 | PYTHON3 |
from sys import stdin, stdout
import math,sys,heapq
from itertools import permutations, combinations
from collections import defaultdict,deque,OrderedDict
from os import path
import random
import bisect as bi
def yes():print('YES')
def no():print('NO')
if (path.exists('input.txt')):
#------------------Sublime--------------------------------------#
sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');
def I():return (int(input()))
def In():return(map(int,input().split()))
else:
#------------------PYPY FAst I/o--------------------------------#
def I():return (int(stdin.readline()))
def In():return(map(int,stdin.readline().split()))
#sys.setrecursionlimit(1500)
def dict(a):
d={}
for x in a:
if d.get(x,-1)!=-1:
d[x]+=1
else:
d[x]=1
return d
def find_gt(a, x):
'Find leftmost value greater than x'
i = bi.bisect_left(a, x)
if i != len(a):
return i
else:
return -1
def main():
try:
t=[]
n,k=In()
s=input()
totalL=s.count('L')
if totalL<=k:
print(2*n - 1)
return
if n==totalL:
print(max(2*k - 1,0 ))
return
no0=0
now=0
ans=0
for i in range(n):
if s[i]=='W':
now+=1
if no0:
t.append(no0)
no0=0
else:
no0+=1
if now:
ans+=(now*2 -1)
now=0
t1,t2=0,0
if s[0]=='L':
t1=t.pop(0)
if s[-1]=='L':
t2=no0
if now:
ans+=(now*2 -1)
t.sort()
for x in t:
if k>=x:
k-=x
ans+=2*x
ans+=1
else:
ans+=2*k
k=0
break
if k:
if t1<t2:
ans+=(max(min(k,t1)*2 ,0))
k-=(min(k,t1))
if k:
ans+=max(min(k,t2)*2 ,0)
else:
ans+=max(min(k,t2)*2,0)
k-=(min(k,t2))
if k:
ans+=max(min(k,t1)*2,0)
print(ans)
except:
pass
M = 998244353
P = 1000000007
if __name__ == '__main__':
for _ in range(I()):main()
#for _ in range(1):main() | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 100100;
struct obj {
int val;
int x, y;
} v[NMAX];
int T, N, K, S;
char s[NMAX];
bool cmp(obj a, obj b) { return a.val < b.val; }
int main() {
cin >> T;
for (int l = 1; l <= T; l++) {
cin >> N >> K;
cin >> s + 1;
bool okW = false;
s[0] = 'L';
s[N + 1] = 'L';
S = 0;
int st = 0;
for (int i = 1; i <= N; i++) {
if (s[i] == 'W') {
if (st) v[++S] = {i - st - 1, st, i};
st = i;
}
}
sort(v + 1, v + S + 1, cmp);
for (int i = 1; i <= S; i++) {
if (K >= v[i].val) {
for (int j = v[i].x + 1; j < v[i].y; j++) s[j] = 'W';
K -= v[i].val;
}
}
for (int i = 1; i <= N; i++)
if (K > 0 && s[i] == 'L' && s[i - 1] == 'W') {
s[i] = 'W';
K--;
}
for (int i = N; i > 0; i--)
if (K > 0 && s[i] == 'L' && s[i + 1] == 'W') {
s[i] = 'W';
K--;
}
for (int i = 1; i <= N; i++)
if (K > 0 && s[i] == 'L') {
s[i] = 'W';
K--;
}
int ans = 0;
for (int i = 1; i <= N; i++) {
if (s[i] == 'W') {
ans++;
if (s[i - 1] == 'W') ans++;
}
}
cout << ans << '\n';
}
return 0;
}
| 8 | CPP |
t = int(input())
def binsearch(nums, target):
left = 0
right = len(nums) - 1
while left <= right:
mid = (left + right) // 2
if nums[mid] == target:
return mid
elif nums[mid] > target:
right = mid - 1
elif nums[mid] < target:
left = mid + 1
return left
for tc in range(t):
n, k = map(int, input().split())
s = input()
if n == 1:
print(min(1, k + s.count('W')))
continue
wins = s.count("W")
if k >= n - wins:
print(2*n - 1)
continue
if wins == 0:
print(max(0, 2*k - 1))
continue
gaps = []
last = '0'
winstreaks = 1
c = 0; fl = 0
for i in range(n):
if s[i] == 'L' and not fl:
continue
if s[i] == 'W' and not fl:
fl = 1
elif s[i] == 'W' and s[i-1] == 'L' and fl:
winstreaks += 1
gaps.append(c)
c = 0
elif s[i] == 'L':
c += 1
# if s[i] != last:
# if s[i] == 'W':
# winstreaks += 1
# if c:
# gaps.append(c)
# c = 1
# else:
# c = 1
# last = s[i]
# else:
# c += 1
# last = s[i]
# i += 1
# if s[-1] == 'L':
# if c:
# gaps.append(c)
gaps1 = sorted(gaps)
r = 0; rc = 0
while r < len(gaps1):
if rc + gaps1[r] <= k:
rc += gaps1[r]
winstreaks -= 1
r += 1
else:
break
res = (2 * (k + wins)) - winstreaks
print(res)
# twoadj, oneadj, noadj = [], [], []
#
# for i in range(1, n-1):
# if s[i] == 'L' and s[i-1] == 'W' and s[i+1] == 'W':
# twoadj.append(i)
#
# for i in range(1, n-1):
# if s[i] == 'L' and s[i+1] == 'W' and s[i-1] == 'L':
# oneadj.append(i)
#
# for i in range(1, n-1):
# if s[i] == 'L' and s[i-1] == 'W' and s[i+1] == 'L':
# oneadj.append(i)
#
# if n == 2:
# if k + s.count('W') >= 2:
# print(3)
# elif k + s.count('W') == 1:
# print(1)
# else:
# print(0)
# continue
#
# if n > 2:
# if s[0] == 'L' and s[1] == 'L':
# noadj.append(0)
# elif s[0] == 'L' and s[1] == 'W':
# oneadj.append(0)
#
# if s[-1] == 'L' and s[-2] == 'L':
# noadj.append(n-1)
# elif s[-1] == 'L' and s[-2] == 'W':
# oneadj.append(n-1)
#
# for i in range(1, n-1):
# if s[i] == 'L' and s[i-1] == 'L' and s[i+1] == 'L':
# noadj.append(i)
#
# precnt = 0
# if s[0] == 'W':
# precnt += 1
#
# for i in range(1, n):
# if s[i] == 'W' and s[i - 1] == 'W':
# precnt += 2
# elif s[i] == 'W' and s[i - 1] == 'L':
# precnt += 1
#
# settwoadj = set()
# setoneadj = set()
# setnoadj = set()
#
# for i in twoadj:
# settwoadj.add(i)
# for i in oneadj:
# setoneadj.add(i)
# for i in noadj:
# setnoadj.add(i)
#
# full = twoadj + oneadj + noadj
#
# fin = full[:min(k, n)]
#
# setfin = set()
# for i in fin:
# setfin.add(i)
#
# res = []
# for i in range(n):
# if i in setfin:
# res.append('W')
# else:
# res.append(s[i])
#
# #print(res, full)
#
# fincnt = 0
# if res[0] == 'W':
# fincnt += 1
# for i in range(1, n):
# if res[i] == 'W' and res[i-1] == 'W':
# fincnt += 2
# elif res[i] == 'W' and res[i-1] == 'L':
# fincnt += 1
#
# # if k < twoadj:
# # added += 3*k
# # k = 0
# # else:
# # added += 3*twoadj
# # k -= twoadj
# #
# # if k < oneadj:
# # added += 2*k
# # k = 0
# # else:
# # added += 2*oneadj
# # k -= oneadj
# #
# # if k < noadj:
# # added += 1*k
# # k = 0
# # else:
# # added += 1*noadj
# # k -= noadj
#
#
#
# print(fincnt)
| 8 | PYTHON3 |
import sys, os
import heapq, functools, collections
import math, random
from collections import Counter, defaultdict
# available on Google, not available on Codeforces
# import numpy as np
# import scipy
def solve_(lst, k):
# your solution here
length = len(lst)
lst = lst
if sum(lst) + k >= length:
# console(lst, sum(lst), k, length)
# console("skip")
return 2*length - 1
if sum(lst) == 0:
return max(0, k*2 - 1)
lst = "".join(str(x) for x in lst)
lst = lst.strip("0")
lst = [int(x) for x in lst]
console(lst)
spaces = []
prev = 0
curspace = 0
for a in lst:
if prev == 0 and a == 1:
spaces.append(curspace)
curspace = 0
if a == 0:
curspace += 1
prev = a
spaces = spaces[1:]
spaces = sorted(spaces)
console("spaces", spaces, k)
res = 2*sum(lst) - len(spaces) - 1
console("initial", res)
for a in spaces:
if a <= k:
k -= a
res += a*2 + 1
console("filled", res)
console("remainder", k)
res += k*2
return res
def console(*args):
# print on terminal in different color
print('\033[36m', *args, '\033[0m', file=sys.stderr)
pass
# if Codeforces environment
if os.path.exists('input.txt'):
sys.stdin = open("input.txt","r")
sys.stdout = open("output.txt","w")
def console(*args):
pass
def solve(*args):
# screen input
# console("----- solving ------")
# console(*args)
# console("----- ------- ------")
return solve_(*args)
if True:
# if memory is not a constraint
inp = iter(sys.stdin.buffer.readlines())
input = lambda: next(inp)
else:
# if memory is a constraint
input = sys.stdin.buffer.readline
cout = []
for case_num in range(int(input())):
_, k = list(map(int,input().split()))
# read line as a string
lst = input().strip()
# lst = str(lst)
# read line as an integer
# k = int(input())
# read one line and parse each word as a string
# lst = input().split()
# read one line and parse each word as an integer
# lst = list(map(int,input().split()))
# read matrix and parse as integers (after reading read nrows)
# lst = list(map(int,input().split()))
# nrows = lst[0] # index containing information, please change
# grid = []
# for _ in range(nrows):
# grid.append(list(map(int,input().split())))
# console(lst)
lst = [0 if x == 76 else 1 for x in lst]
res = solve(lst, k) # please change
# post processing methods
# res = [str(x) for x in res]
# res = " ".join(res)
# print result
# Google - case number required
# print("Case #{}: {}".format(case_num+1, res))
# Codeforces - no case number required
cout.append(str(res))
print("\n".join(cout)) | 8 | PYTHON3 |
def cal(s, n):
#print(s, n)
pits = []
wins = []
pit = 0
win = 0
for c in s:
if c == 'W':
win+=1
if pit > 0:
pits.append(pit)
pit = 0
else:
pit += 1
if win > 0:
wins.append(win)
win = 0
if win > 0:
wins.append(win)
if s[0]=='L' and len(pits)>0:
pit += pits[0]
pits = pits[1:]
pits = sorted(pits)
fliped = 0
adt = 0
for p in pits:
if fliped + p <= n:
fliped += p
adt += 1
else:
pit += p
if n>= fliped+pit:
return len(s)*2-1
if len(wins) == 0:
return max(min(n,len(s))*2-1,0)
#print('pits',pits,pit,wins,pit,adt,fliped,n-fliped)
return sum(wins)*2-len(wins)+fliped*2+adt + min(n-fliped, pit)*2
#9*2-3=15 15+3*2+1+2*2=
def web():
T = int(input())
for t in range(1, T + 1):
arr = [int(s) for s in input().split(" ")]
c = arr[1]
s = input()
ans = cal(s, c)
print(ans)
def file():
x = open('p2_in.txt')
T = int(x.readline())
for t in range(1, T + 1):
arr = [int(s) for s in x.readline().split(" ")]
c = arr[1]
s = x.readline()[:-1]
ans = cal(s, c)
print(ans)
#file()
web()
'''
cd Desktop\Desktpop\coding contest\CodeJamQualify
python it_run.py python p4_runner.py 1 -- python p4.py
'''
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int w = 0, l = 0;
int cWins = 0;
vector<int> closs;
for (int i = 0; i < n; i++) {
if (s[i] == 'W') {
w++;
if (i == 0 || s[i - 1] == 'L') cWins++;
}
if (s[i] == 'L') {
l++;
if (i == 0 || s[i - 1] == 'W') closs.push_back(0);
closs.back()++;
}
}
if (k >= l) {
cout << 2 * n - 1 << "\n";
continue;
} else if (w == 0) {
if (k == 0)
cout << 0 << "\n";
else
cout << 2 * k - 1 << "\n";
continue;
}
if (s[0] == 'L') closs[0] = 1e8;
if (s[n - 1] == 'L') closs.back() = 1e8;
sort(closs.begin(), closs.end());
w += k;
for (int x : closs) {
if (x > k) break;
k -= x;
cWins--;
}
cout << 2 * w - cWins << "\n";
}
return 0;
}
| 8 | CPP |
from sys import stdin
input=stdin.readline
def A():
t=int(input())
for _ in range(t):
n=int(input())
a=list(map(int,input().split()))
if sum(a) == 0:
print("NO")
elif sum(a) > 0:
a.sort(reverse=True)
print("YES")
print(*a)
else:
a.sort()
print("YES")
print(*a)
def B():
from collections import deque
t=int(input())
for _ in range(t):
n,k=map(int,input().split())
s=[bool(ord(x) - ord('L')) for x in input().rstrip()]
lastGame = False
score = 0
for i in range(n):
if s[i]:
if lastGame:
score += 2
else:
score += 1
lastGame=True
else:
lastGame=False
startW=0
endW=n-1
while startW < n and not s[startW]:
startW += 1
while endW >= 0 and not s[endW]:
endW -= 1
streak=0
wlws=deque()
for i in range(startW+1, endW+1):
if s[i] and streak > 0:
wlws.append(streak)
streak=0
elif not s[i]:
streak += 1
wlws=sorted(list(wlws))
j = 0
while j < len(wlws) and k >= wlws[j]:
score += (2 * wlws[j] + 1)
k -= wlws[j]
j += 1
if k > 0:
remainingLs = startW + (n - 1 - endW)
if startW == n:
remainingLs = n
score -= 1
if j < len(wlws):
remainingLs = wlws[j]
score += min(remainingLs, k) * 2
print(score)
def C():
t=int(input())
for _ in range(t):
print(t)
def D():
t=int(input())
for _ in range(t):
print(t)
B()
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 1e5;
int t, n, k;
string s;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
while (cin >> t) {
while (t--) {
cin >> n >> k;
cin >> s;
int wins = 0, losses = 0, wins_streaks = 0;
vector<int> losing_streaks;
for (int i = 0; i <= n - 1; i++) {
if (s[i] == 'W') {
if (i == 0 || s[i - 1] == 'L') {
wins_streaks++;
}
wins++;
} else {
losses++;
if (i == 0 || s[i - 1] == 'W') {
losing_streaks.push_back(0);
}
losing_streaks.back()++;
}
}
if (k >= losses) {
cout << 2 * n - 1 << endl;
continue;
}
if (wins == 0) {
if (k == 0) {
cout << 0 << endl;
} else {
cout << 2 * k - 1 << endl;
}
continue;
}
if (s[0] == 'L') {
losing_streaks[0] = inf;
}
if (s[n - 1] == 'L') {
losing_streaks.back() = inf;
}
sort(losing_streaks.begin(), losing_streaks.end());
int len = losing_streaks.size();
wins += k;
for (int i = 0; i <= len - 1; i++) {
if (losing_streaks[i] > k) {
break;
} else {
wins_streaks--;
k -= losing_streaks[i];
}
}
cout << 2 * wins - wins_streaks << endl;
}
}
return 0;
}
| 8 | CPP |
def f(n,k,s):
score = 0
arr = []
sm = 0
if "W" not in s:
return max(min(n,k)*2-1,0)
arr = s.split("W")[1:-1]
arr = list(filter(None,arr))
arr = [len(i) for i in arr]
arr.sort()
sm = s.count('W')
ncut = len(arr)+1
for i in range(len(arr)):
if k >= arr[i]:
sm += arr[i]
k -= arr[i]
ncut-=1
return max(0,min(2*n-1,(sm+k)*2-ncut))
t = int(input())
for x in range(t):
n,k = list(map(int,input().split()))
s = input()
h = f(n,k,s)
print(h) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1E5 + 100;
int bet[MAXN];
int n, k, indx, wcnt;
string s;
void input();
void solve();
void makeBet();
void make0();
int main() {
int T;
cin >> T;
while (T--) {
input();
make0();
makeBet();
solve();
}
}
void make0() {
for (int i = 0; i < n; i++) bet[i] = 0;
}
void solve() {
if (wcnt + k >= n) {
cout << 2 * n - 1 << endl;
return;
}
if (k == 0) {
cout << wcnt * 2 - indx << endl;
return;
}
if (wcnt == 0) {
cout << 2 * k - 1 << endl;
return;
}
wcnt += k;
sort(bet + 1, bet + indx);
int component = indx;
for (int i = 1; i < indx; i++) {
if (k >= bet[i]) {
k -= bet[i];
component--;
} else
break;
}
cout << 1ll * wcnt * 2 - component << endl;
}
void makeBet() {
int cntl = 0;
s = "L" + s;
indx = 0, wcnt = 0;
for (int i = 1; i <= n; i++) {
if (s[i] == 'W') wcnt++;
if (s[i] == 'W' && s[i - 1] != 'W') indx++;
if (s[i] == 'L') bet[indx]++;
}
}
void input() {
cin >> n >> k;
cin >> s;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long get_score(string s) {
long long score = 0;
bool streak = false;
for (auto c : s) {
if (c == 'L')
streak = false;
else {
if (streak)
score += 2;
else {
score++;
streak = true;
}
}
}
return score;
}
bool cmp(pair<long long, long long> x, pair<long long, long long> y) {
return (x.second - x.first) < (y.second - y.first);
}
int main() {
long long t;
cin >> t;
while (t--) {
long long n, k, init = -1;
cin >> n >> k;
string s;
cin >> s;
vector<pair<long long, long long>> pos;
for (long long i = 0; i < n; i++) {
if (s[i] == 'L') {
if (init == -1) init = i;
} else {
if (init != -1) {
pos.push_back({init, i - 1});
init = -1;
}
}
}
pair<long long, long long> start = {-1, -1}, end = {-1, -1};
if (pos.size() > 0) start = pos[0];
if (init != -1) end = {init, n - 1};
sort(pos.begin(), pos.end(), cmp);
for (auto x : pos) {
if (x.first != 0)
for (long long i = x.first; i <= x.second && k > 0; i++, k--)
s[i] = 'W';
}
if (k && start.first == 0) {
for (long long i = start.second; i >= start.first && k > 0; i--, k--)
s[i] = 'W';
}
if (k && end.first != -1) {
for (long long i = end.first; i <= end.second && k > 0; i++, k--)
s[i] = 'W';
}
cout << get_score(s) << endl;
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void tk_input(vector<T> &arr) {
for (T &i : arr) cin >> i;
}
void solve() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
priority_queue<pair<int, int>, vector<pair<int, int> >,
greater<pair<int, int> > >
pq;
int sc = 0, ls = 0, ls_i = 0, f_i = n, l_i = -1;
for (int i = 0; i <= n - 1; i++) {
if (s[i] == 'W') {
if ((ls > 0) && (f_i != n)) pq.push(pair<int, int>(ls, ls_i));
f_i = min(f_i, i);
l_i = max(l_i, i);
ls_i = i + 1;
ls = 0;
} else {
ls++;
}
}
while ((!pq.empty()) && (k > 0)) {
auto tp = pq.top();
pq.pop();
for (int i = tp.second; i <= tp.first + tp.second - 1; i++) {
if (k == 0) break;
s[i] = 'W';
k--;
}
}
for (int i = f_i - 1; i >= 0; i--) {
if (k == 0) break;
s[i] = 'W';
k--;
}
if (l_i != -1) {
for (int i = l_i + 1; i <= n - 1; i++) {
if (k == 0) break;
s[i] = 'W';
k--;
}
}
sc += (s[0] == 'W');
for (int i = 1; i <= n - 1; i++) {
sc += ((s[i] == 'W') * (1 + (s[i - 1] == 'W')));
}
cout << sc << '\n';
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int _t;
cin >> _t;
while (_t--) solve();
}
| 8 | CPP |
import sys
read = lambda: sys.stdin.readline().strip()
readi = lambda: map(int, read().split())
from collections import *
from math import *
for _ in range(int(read())):
n, k = readi()
s = read()
gaps = list()
temp = 0
sc = s.strip("L")
if len(sc) == 0:
print(max(min(n, k) * 2 - 1, 0))
continue
for c in sc:
if c == "L":
temp += 1
else:
if temp > 0:
gaps.append(temp)
temp = 0
if temp > 0: gaps.append(temp)
gaps.sort()
increment = 0
for gap in gaps:
if gap <= k:
increment += gap * 2 + 1
k -= gap
else:
increment += k * 2
k = 0
break
increment += min(k, len(s) - len(sc)) * 2
baseAns = 0
temp = 0
for c in s:
if c == "W":
if temp > 0:baseAns += 2
else: baseAns += 1
temp += 1
else:
temp = 0
print(increment+baseAns) | 8 | PYTHON3 |
def solve():
n, k = map(int, input().split())
s = input()
ans = 0
prev = False
c = []
cc = 0
for i in range(n):
if s[i] == 'W':
if cc:
if cc != i:
c.append(cc)
cc = 0
if prev:
ans += 2
else:
ans += 1
prev = True
else:
prev = False
cc += 1
c.sort()
for i in range(len(c)):
if c[i] <= k:
k -= c[i]
ans += c[i] * 2 + 1
if 'W' in s:
ans += k * 2
else:
ans += max(k * 2 - 1, 0)
ans = min(ans, n * 2 - 1)
print(ans)
t = int(input())
for _ in range(t):
solve()
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, j, k, l, m, n, p, t, a, b, c;
cin >> t;
while (t--) {
cin >> n >> k;
string s;
cin >> s;
p = 0;
vector<long long int> freq;
m = 0;
for (i = 0; i < n; i++) {
if (s[i] != 'L') {
break;
} else {
m++;
}
}
a = i;
for (i = a; i < n;) {
l = 0;
b = 1;
for (j = i + 1; j < n; j++) {
if (s[j] == 'W')
b += 2;
else
break;
}
i = j;
p += b;
for (c = j; c < n; c++) {
if (s[c] == 'L') {
l++;
m++;
} else
break;
}
i = c;
if (i != n) freq.push_back(l);
}
sort(freq.begin(), freq.end());
i = 0;
while (k > 0 && i < freq.size()) {
if (k >= freq[i]) {
p += (1 + freq[i] * 2);
k = k - freq[i];
m = m - freq[i];
} else
break;
i++;
}
if (k > 0) {
if (p == 0) {
p--;
}
p += (min(m, k) * 2);
}
cout << p << "\n";
}
}
| 8 | CPP |
for _ in range(int(input())):
n, k = map(int, input().split())
s = input()
ar = []
i = 0
single = []
while i < n and s[i] == 'L':
i += 1
if i == n:
if k > 0:
print(k * 2 - 1)
else:
print(0)
continue
if i != 0:
single.append(i)
double = []
f = False
cnt = 0
ans = 0
while i < n:
if s[i] == 'L':
if not f:
f = True
cnt += 1
else:
if f:
double.append(cnt)
f = False
cnt = 0
ans += 1
else:
add = 0
if i > 0 and s[i - 1] == 'W':
add = 1
ans += 1 + add
i += 1
if cnt:
single.append(cnt)
double.sort()
single.sort()
i = 0
while k > 0 and i < len(double):
if double[i] <= k:
k -= double[i]
ans += double[i] * 2 + 1
else:
ans += k * 2
k =0
i += 1
i = 0
while k > 0 and i < len(single):
if single[i] <= k:
k -= single[i]
ans += single[i] * 2
else:
ans += k * 2
k =0
i += 1
print(ans)
| 8 | PYTHON3 |
t = int(input())
for case in range(t):
n, k = [int(x) for x in input().split(' ')]
s = input()
score = int(s[0] == 'W')
for i in range(1, n):
if s[i-1:i+1] == 'WW':
score += 2
elif s[i-1:i+1] == 'LW':
score += 1
losses = s.count('L')
if 'W' in s:
s_losses = s.index('W')
e_losses = n - 1 - s.rindex('W')
m_losses = [len(x) for x in s[s_losses:s.rindex('W') + 1].split('W') if x]
m_dict = {}
for streak in m_losses:
if streak in m_dict.keys():
m_dict[streak] += 1
else:
m_dict[streak] = 1
while m_dict and k > 0:
y = min(m_dict.keys())
if k < y:
score += k * 2
k = 0
else:
score += 2 * y + 1
m_dict[y] -= 1
if m_dict[y] == 0:
del m_dict[y]
k -= y
ends = [x for x in sorted([s_losses, e_losses]) if x]
for y in ends:
if k < y:
score += k * 2
k = 0
else:
score += 2 * y
k -= y
else:
score = max(2 * k - 1, 0)
print(score)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int t;
cin >> t;
while (t--) {
long long int n, k, i, count = 0, ptr = 0, flag = 0, j;
cin >> n >> k;
string s;
cin >> s;
vector<pair<long long int, pair<long long int, long long int> > > vi;
for (i = 0; i < n; i++) {
if (s[i] == 'W' && flag == 0) {
ptr = i;
flag = 1;
} else {
if (flag == 1 && s[i] == 'W' && (i - ptr - 1) > 0) {
vi.push_back({i - ptr - 1, {ptr + 1, i - 1}});
}
if (s[i] == 'W') {
ptr = i;
}
}
}
sort(vi.begin(), vi.end());
for (auto x : vi) {
for (j = x.second.first; j <= x.second.second; j++) {
if (k > 0) {
s[j] = 'W';
k--;
}
}
}
for (i = 0; i < n - 1; i++) {
if (s[i] == 'W' && s[i + 1] == 'L' && k > 0) {
s[i + 1] = 'W';
k--;
}
}
for (i = n - 1; i > 0; i--) {
if (s[i] == 'W' && s[i - 1] == 'L' && k > 0) {
s[i - 1] = 'W';
k--;
}
}
for (i = 0; i < n; i++) {
if (s[i] == 'L' && k > 0) {
s[i] = 'W';
k--;
}
}
for (i = 0; i < n; i++) {
if (i == 0) {
if (s[i] == 'W') {
count++;
}
} else {
if (s[i] == 'W') {
if (s[i - 1] == 'W') {
count += 2;
} else {
count++;
}
}
}
}
cout << count << '\n';
}
}
| 8 | CPP |
t = int (input ())
tests = []
for i in range (t):
n, k = map (int, input().split())
s = input ()
tests.append ([n,k,s])
for test in tests:
n, k, s = test
result = 0
w = s.count('W')
if w == 0:
if k == 0:
print (0)
else:
print (min(n,k)*2-1)
continue
#prev = 'L'
results = []
for x in s:
# if x == 'W':
# if prev == 'W':
# result += 2
# else:
# result += 1
# prev = x
if results and results[-1][0] == x:
results[-1][1] +=1
else:
results.append ([x,1])
first_loses = 0
if results[0][0] == 'L':
first_loses = results[0][1]
results.pop(0)
last_loses = 0
if results[-1][0] == 'L':
last_loses = results[-1][1]
results.pop ()
loses = []
for x,y in results:
if x =='W':
result += 2*y-1
else:
loses.append ([x,y])
loses.sort ()
for x,y in loses:
if x == 'L':
if k >= y:
result += 2*y+1
k -= y
else:
result += 2*k
k = 0
break
if last_loses > 0:
if k >= last_loses:
result += 2*last_loses
k -= last_loses
else:
result += 2 * k
k = 0
if first_loses > 0:
if k >= first_loses:
result += 2 * first_loses
else:
result += 2 * k
print (result) | 8 | PYTHON3 |
I=input
for _ in[0]*int(I()):
n,k=map(int,I().split());s=I();a=sorted(map(len,filter(None,s.strip('L').split('W'))));r=0
while a and r+a[0]<=k:r+=a.pop(0)
print((2*min(n,s.count('W')+k)-len(a)or 1)-1) | 8 | PYTHON3 |
t = int(input())
def answer(n,k,s):
win = []
for i in range(n):
if s[i] == 'W':
win.append(i)
l = len(win)
if l <= 1:
print(min(max(2*(k+l)-1 , 0),2*n-1))
elif win[-1] - l + 1 <= k:
ans = min(2*(k+l) - 1 , 2*n - 1)
print(ans)
else:
ans = 1
for i in range(l - 1):
if win[i+1] - win[i] == 1:
ans += 2
else:
ans += 1
delta = [win[i+1] - win[i] - 1 for i in range(l-1)]
delta.sort()
flag = k
j = 0
while flag > 0 and j < l - 1:
d = delta[j]
if d != 0:
if flag >= d:
flag -=d
ans += 2*d + 1
else:
ans += 2*flag
flag = -1
j +=1
if flag > 0:
ans += 2*flag
print(ans)
for i in range(t):
n , k = map(int,input().split())
s = list(str(input()))
answer(n,k,s)
| 8 | PYTHON3 |
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
#from bisect import bisect_left as bl #c++ lowerbound bl(array,element)
#from bisect import bisect_right as br #c++ upperbound br(array,element)
from functools import cmp_to_key
def main():
for _ in range(int(input())):
n,k=map(int,input().split(" "))
a=list(input())
start=-1
end=-1
temp=[]
for x in range(n):
if a[x]=='L':
end+=1
else:
if start!=end:
temp.append([end-start,[start+1,end]])
start=x
end=x
if start!=end:
temp.append([end-start,[start+1,end]])
def boss(a,b):
if a[1][0]==0 or a[1][1]==n-1:
if b[1][0]==0 or b[1][1]==n-1:
if a[0]>b[0]:
return 1
else:
return -1
else:
return 1
elif b[1][0]==0 or b[1][1]==n-1:
if a[1][0]==0 or a[1][1]==n-1:
if a[0]>b[0]:
return 1
else:
return -1
else:
return -1
elif a[0]>b[0]:
return 1
else:
return -1
temp.sort(key=cmp_to_key(boss))
#print(temp)
for x in temp:
if k<=0:
break
if x[1][1]==n-1:
for z in range(x[1][0],x[1][1]+1):
a[z]='W'
k-=1
if k<=0:
break
else:
#print(x[1][1],x[1][0])
for z in range(x[1][1],x[1][0]-1,-1):
a[z]='W'
k-=1
if k<=0:
break
if k<=0:
break
ans=0
chk=-1
for x in range(n):
if a[x]=='W':
if chk==-1:
ans+=1
chk=0
else:
ans+=2
else:
chk=-1
print(ans)
#-----------------------------BOSS-------------------------------------!
# region fastio
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")
# endregion
if __name__ == "__main__":
main() | 8 | PYTHON3 |
for _ in range(int(input())):
n, k = map(int, input().split())
x = 1
X = []
ans = 0
y = 0
for s in input():
if s == 'W':
y = 1
if x:
X += [x]
ans += 1
x = 0
else:
ans += 2
else:
x += 1
if y == 0:
print(max(min(k, n) * 2 - 1, 0))
continue
if x:
X += [x + 10 ** 8]
X[0] += 99999999
X.sort()
X.reverse()
while k > 0 and X:
x = X.pop()
if x >= 10 ** 7:
x -= 10 ** 8
ans += 2 * min(x, k)
k -= min(x, k)
elif x > k:
ans += 2 * k
break
else:
ans += 2 * x + 1
k -= x
print(ans)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, k;
cin >> n >> k;
string s;
cin >> s;
int w(0), l(0);
for (char c : s) {
if (c == 'W') w++;
}
if (k + w >= n) {
cout << 2 * n - 1 << '\n';
continue;
}
vector<int> gaps;
for (int i = 0; i < n; ++i) {
bool good = (i > 0);
if (s[i] == 'W') {
continue;
}
int len = 1;
while (i + 1 < n && s[i + 1] == 'L') {
len++;
i++;
}
if (good && i != n - 1) {
gaps.push_back(len);
}
}
sort(gaps.begin(), gaps.end());
int ans(0), rem(0);
for (int i = 0; i < n; ++i) {
if (s[i] == 'W')
ans++;
else
rem++;
if (s[i] == 'W' && i > 0 && s[i - 1] == 'W') ans++;
}
if (rem == n && k > 0) ans--;
for (int x : gaps) {
if (k >= x) {
k -= x;
ans += 2 * x + 1;
rem -= x;
} else {
break;
}
}
ans += 2 * min(k, rem);
cout << ans << '\n';
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using dl = double;
using ull = unsigned long long;
const int N = 2e5 + 10;
ll aarray[N];
ll magic[505][505];
vector<ll> primes;
bool ok[1000001];
map<ll, ll> mp;
void solve() {
ll i, n, k, ans = 0, w = 0, j;
string str;
cin >> n >> k;
cin >> str;
for (i = 0; i < str.length(); i++) {
if (str[i] == 'W') w++;
}
if (w + k >= n) {
cout << 2 * n - 1 << "\n";
return;
}
ll pre[100000 + 10];
memset(pre, 0, sizeof(pre));
for (i = 1; i < str.length() - 1; i++) {
if (str[i] == 'L' && str[i - 1] == 'W' && str[i + 1] == 'W' && k)
str[i] = 'W', k--;
}
for (i = str.length() - 1; i >= 0; i--) {
if (str[i] == 'W') {
pre[i] = i;
} else {
if (i == str.length() - 1) {
pre[i] = INT_MAX;
} else
pre[i] = pre[i + 1];
}
}
vector<ll> v;
for (i = 0; i < str.length() - 1; i++) {
if (str[i] == 'W' && str[i + 1] == 'L') {
ll a = pre[i];
ll b = pre[i + 1];
b--;
b = b - a;
v.push_back(b);
}
}
sort(v.begin(), v.end());
ll sum = 0;
for (i = 0; i < v.size(); i++) {
if (sum + v[i] <= k) {
sum += v[i];
mp[v[i]]++;
} else
break;
}
k -= sum;
for (i = 0; i < str.length() - 1; i++) {
if (str[i] == 'W' && str[i + 1] == 'L') {
ll a = pre[i];
ll b = pre[i + 1];
b--;
b = b - a;
if (mp[b]) {
mp[b]--;
for (j = pre[i]; j <= pre[i + 1]; j++) {
str[j] = 'W';
}
}
}
}
for (i = 0; i < str.length(); i++) {
if (str[i] == 'W') {
if (i == 0 || str[i - 1] != 'W')
ans++;
else if (str[i - 1] == 'W')
ans += 2;
else
ans++;
}
}
if (k) {
if (ans == 0)
ans += 2 * k - 1;
else
ans += 2 * k;
}
cout << ans << "\n";
mp.clear();
return;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string str;
ll i, j, n, m, k, t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
| 8 | CPP |
for _ in range(int(input())):
n,k = map(int, input().split())
string = input()
string = "LL"+string
wcount = 0
lcount = 0
wlw = []
pre1 = "L"
pre2 = "L"
# if pre2 == "L" and pre1==three=="W":
# wlw+= 1
wstart = -100000000000
for j, i in enumerate(string[2:]):
if i == "W":
wcount+= 1
wstart = j-wstart
if wstart>1:
wlw.append(wstart-1)
else:
wcount += 1
wstart = j
else:
lcount += 1
wlw = wlw[1:]
wlw.sort()
result = -1
if k<=0:
result = wcount
elif lcount<=k:
result = (n*2)-1
else:
kcopy = k
val = 0
for i in wlw:
if i<=kcopy:
val+= (i*2)+1
kcopy -= i
else:
break
val += kcopy*2
result = wcount+val
if wcount == 0:
result -= 1
print(result) | 8 | PYTHON3 |
import math
t = int(input())
for _ in range(t):
nk = input().split()
n = int(nk[0])
k = int(nk[1])
s = input()
n_winning_steaks = 0
n_wins = 0
n_losses = 0
losing_streaks = []
for i in range(n):
if s[i] == "W":
n_wins += 1
if i == 0 or s[i-1] == "L":
n_winning_steaks += 1
if s[i] == "L":
n_losses += 1
if i == 0 or s[i-1] == "W":
losing_streaks.append(0)
losing_streaks[-1] += 1
# print(f"{n_wins} - {n_losses} - {n_winning_steaks}")
# print(f"losing_streaks: {losing_streaks}")
if k >= n_losses:
print(2*n-1)
continue
if n_wins == 0:
if k == 0:
print(0)
else:
print(2*k-1)
continue
if s[0] == "L":
losing_streaks[0] = math.inf
if s[-1] == "L":
losing_streaks[-1] = math.inf
losing_streaks.sort()
# print(f"losing_streaks: {losing_streaks}")
n_wins += k
for i in range(len(losing_streaks)):
ls = losing_streaks[i]
if ls > k:
break
k -= ls
n_winning_steaks -= 1
print(f"{2*n_wins - n_winning_steaks}") | 8 | PYTHON3 |
'''Author- Akshit Monga'''
t = int(input())
for _ in range(t):
n,k=map(int,input().split())
s=input()
ans=0
prev='L'
for i in s:
if i=='W' and prev=='W':
ans+=2
elif i=='W':
ans+=1
prev=i
temp=[]
a=0
b=0
x=0
y=0
for i in s:
if i=='W':
break
else:
x+=1
else:
if k>=n:
ans=1+2*(n-1)
else:
ans=1+2*(k-1)
print(max(ans,0))
continue
for i in s:
if i=='W':
b=1
if a!=0:
temp.append(a)
a=0
elif b==0:
continue
else:
a+=1
if a!=0:
y=a
temp=sorted(temp)
for i in temp:
if i<=k:
ans+=2*i+1
k-=i
else:
ans+=2*k
k=0
if k>0:
if (x+y)>=k:
ans+=2*k
else:
ans+=2*(x+y)
print(ans)
| 8 | PYTHON3 |
import sys
input=sys.stdin.readline #FOR READING STRING/TEXT INPUTS. note that this will also append '\n' to the back of the input.
t=int(input())
for _ in range(t):
n,k=[int(x) for x in input().split()]
s=list(input()[:-1])
startGroup=[]
endGroup=[]
LGroups=[]
currLGroup=[]
isStart=False
isEnd=False
for i in range(n):
if i==0:
isStart=True
if s[i]=='W':
if len(currLGroup)>0:
if isStart:
startGroup=currLGroup
else:
LGroups.append(currLGroup)
isStart=False
currLGroup=[]
else:
currLGroup.append(i)
if len(currLGroup)>0:
endGroup=currLGroup
finalLCount=max(s.count('L')-k,0)
# print('finalLCount:{}'.format(finalLCount))##
# print('startG:{} endG:{}'.format(startGroup,endGroup))
s2=['W']*n
if finalLCount>0:
for i in startGroup:
s2[i]='L'
finalLCount-=1
if finalLCount==0:
break
if finalLCount>0:
for j in range(len(endGroup)-1,-1,-1):
s2[endGroup[j]]='L'
finalLCount-=1
if finalLCount==0:
break
if finalLCount>0:
LGroups.sort(key=lambda x:len(x),reverse=True)
for g in LGroups:
for i in g:
s2[i]='L'
finalLCount-=1
if finalLCount==0:
break
if finalLCount==0:
break
# print(s2) ####
ans=0
for i in range(n):
if s2[i]=='W':
ans+=1
if i>0 and s2[i-1]=='W':
ans+=1
print(ans) | 8 | PYTHON3 |
for t in range(int(input())):
n,k = list(map(int, input().split(" ")))
s = input()
point = j = 0
flag = True
cnt=0
c = []
j=0
while j<n and s[j]=='L' :
j+=1
st = j
if st==n and k>0:
print((min(st,k)*2)-1)
continue
while(j<n):
if flag and s[j] == "W":
if cnt > 0:
c.append(cnt)
point+=1
flag = False
cnt=0
elif s[j]=="W":
point+=2
else:
flag = True
cnt+=1
j+=1
c.sort()
lst = cnt
for i in c:
if k>0 and k-i>=0:
point +=((2*i)+1)
k-=i
elif k>0 and k-i<0:
point += k*2
k=0
break
else:
k=0
break
if k>0 and lst>=k:
point+=(k*2)
k=0
elif k>0 and lst<k:
point+=(lst*2)
k -= lst
if k > 0 and st >= k:
point += (k * 2)
k = 0
elif k > 0 and st < k:
point += (st * 2)
k -= st
print(point) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int T;
cin >> T;
while (T--) {
long long int n, k, i;
cin >> n >> k;
string s;
cin >> s;
long long int flag1 = 0;
long long int cnt1 = 0;
long long int cnt3 = 0;
multiset<long long int> s1;
long long int cnt2 = 0;
for (i = 0; i < n; i++)
if (s[i] == 'W') cnt2++;
if ((cnt2 == 0) && (k > 0)) {
s[0] = 'W';
k--;
}
for (i = 0; i < n; i++) {
if ((flag1 == 0) && (s[i] == 'L')) cnt3++;
if (s[i] == 'W') {
flag1 = 1;
if (cnt1 != 0) s1.insert(cnt1);
cnt1 = 0;
}
if ((flag1 == 1) && (s[i] == 'L')) cnt1++;
}
long long int cost = 0;
for (i = 0; i < n; i++) {
if ((s[i] == 'W') && (s[i - 1] == 'W'))
cost += 2;
else if (s[i] == 'W')
cost += 1;
}
multiset<long long int>::iterator it;
for (it = s1.begin(); it != s1.end(); it++) {
if ((*it) > k) {
cost += (2 * k);
k = 0;
break;
} else {
cost += 3 + (2 * (*it - 1));
k -= (*it);
}
}
if (k != 0) {
cost += 2 * (min(k, cnt1 + cnt3));
}
cout << cost << endl;
}
return 0;
}
| 8 | CPP |
# ref: https://www.bbsmax.com/A/WpdKEVpmJV/
for _ in range(int(input())):
N,K = map(int, input().split())
S = input()
winning_steaks_cnt = wins = losses = 0
losing_steaks = []
for i in range(N):
if S[i] == 'W':
wins += 1
if i==0 or S[i-1]=='L':
winning_steaks_cnt += 1
if S[i]=='L':
losses += 1
if i==0 or S[i-1]=='W':
losing_steaks.append(0)
losing_steaks[-1] = losing_steaks[-1] + 1
if K >= losses:
print(2*N-1)
continue
if wins == 0:
if K == 0:
print(0)
else:
print(2*K-1)
continue
if S[0]=='L':
losing_steaks[0] = 1e8
if S[-1]=='L':
losing_steaks[-1] = 1e8
losing_steaks.sort()
wins += K
for ls in losing_steaks:
if ls > K:
break
K -= ls
winning_steaks_cnt -= 1
print(2*wins - winning_steaks_cnt) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, k, ans = 0, cnt = 0;
cin >> n >> k;
string s;
cin >> s;
vector<long long> a;
long long lc = 0;
for (long long i = 0; i < n; i++) lc += (s[i] == 'L');
for (long long i = 0; i < n; i++) {
if (s[i] == 'W')
cnt++;
else if (cnt != 0)
a.push_back(cnt), cnt = 0;
}
if (cnt != 0) a.push_back(cnt);
for (auto i : a) ans += i * 2 - 1;
if (k == 0) {
cout << ans << endl;
return;
}
a.clear();
cnt = 0;
long long st = 0;
while (s[st] == 'L' && st < n) st++;
for (long long i = st; i < n; i++) {
if (s[i] == 'L')
cnt++;
else if (cnt != 0)
a.push_back(cnt), cnt = 0;
}
long long en = cnt;
if (k >= lc) {
cout << (2 * n) - 1 << endl;
} else {
if (k <= lc - st - en) {
sort(a.begin(), a.end());
long long i = 0;
while (k >= a[i]) {
k -= a[i];
ans += 2 * a[i] + 1;
i++;
}
ans += 2 * k;
cout << ans << endl;
} else {
long long nd = n - st - en - 1;
long long kd = lc - st - en;
ans = (2 * nd) + 1 + 2 * (k - kd);
cout << ans << endl;
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t = 1;
cin >> t;
while (t--) solve();
return 0;
}
| 8 | CPP |
from bisect import *
from math import *
from collections import Counter,defaultdict
I =lambda:int(input())
M =lambda:map(int,input().split())
LI=lambda:list(map(int,input().split()))
def split(s,c):
b=[]
ch=""
for i in range(len(s)):
if s[i]==c:
ch+=c
else:
if ch!="":
b+=[ch]
ch=""
if ch!="":
b+=[ch]
return b
def solve():
n,k=M()
s=input()
ans=0
a=split(s,"W")
for i in range(len(a)):
if a[i]!='':
ans+=((len(a[i])-1)*2)
ans+=1
ind1=-1;ind2=-1
for i in range(n):
if s[i]=="W":
ind1=i;break
for i in range(n-1,-1,-1):
if s[i]=="W":
ind2=i;break
a=split(s[ind1:ind2],"L")
b=sorted(a)
for i in range(len(b)):
c=len(b[i])
if c<=k:
ans+=((c*2)+1)
else:
ans+=(k*2)
k-=min(k,c)
if k==0:
break
c=ind1
if ind1!=-1:
c+=(n-ind2)
c-=1
ans+=(min(c,k))*2
elif k!=0:
ans+=((min(len(s),k)-1)*2)
ans+=1
ans=max(0,ans)
print(min(ans,((len(s)*2)-1)))
for _ in range(I()):
solve()
| 8 | PYTHON3 |
a = int(input())
for k in range(a):
b, n = [int(k) for k in input().split()]
r = input()
len_r = len(r)
p_W = []
for x in range(len_r):
if r[x] == 'W':
p_W.append(x)
len_p_W = len(p_W)
l_d = []
for y in range(len(p_W)-1):
d = p_W[y+1] - p_W[y]
l_d.append(d)
len_l_d = len(l_d)
if n ==0:
if p_W == []:
ans = 0
else:
ans = 1
for x in l_d:
if x > 1:
ans += 1
else:
ans += 2
elif p_W == [] or l_d.count(1) == len_l_d or sum(l_d) - len_l_d <= n:
ans = min(n, 1) + 2*min(len_p_W + n - 1, len_r - 1)
else:
ans = 1
for x in l_d:
if x > 1:
ans += 1
else:
ans += 2
l_d = list(filter(lambda a: a > 1, l_d))
l_d.sort()
for x in l_d:
if x - 1 <= n:
ans += 2*(x - 1) + 1
n -= x - 1
else:
ans += 2*n
break
print(ans) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
void solve() {
long long int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<long long int> gap;
long long int front = 0;
long long int i = 0;
while (i < n && s[i] == 'L') {
front++;
i++;
}
if (i == n) {
cout << max(0LL, 2 * min(n, k) - 1) << "\n";
return;
}
long long int cnt = 0;
long long int ans = 0;
long long int loss = 0;
long long int win = 0;
for (; i < n; i++) {
if (s[i] == 'L') {
loss++;
win = 0;
} else {
if (win == 0) {
ans += 1;
} else {
ans += 2;
}
if (loss > 0) {
gap.push_back(loss);
loss = 0;
}
win++;
}
}
sort(gap.begin(), gap.end());
for (long long int i = 0; i < gap.size(); i++) {
if (k < gap[i]) {
ans += 2 * k;
k = 0;
} else {
ans += (2 * gap[i] + 1);
k -= gap[i];
}
if (k == 0) {
break;
}
}
if (k > 0) {
ans = min(2 * n - 1, ans + (k * 2));
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T, class T1>
int chkmin(T &x, const T1 &y) {
return x > y ? x = y, 1 : 0;
}
template <class T, class T1>
int chkmax(T &x, const T1 &y) {
return x < y ? x = y, 1 : 0;
}
const int MAXN = (1 << 20);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long T = 1;
cin >> T;
for (long long t = 0; t < T; t++) {
string s;
long long n, k, p = 0, ans = 0, c = 0, countera = 0, counterb = 0;
cin >> n >> k >> s;
long long j = 0;
long long wc = count(s.begin(), s.end(), 'W');
if (wc == 0) {
ans = min(n, k) * 2 - 1;
if (ans < 0) ans = 0;
} else {
vector<long long> b;
long long i = 0;
while (s[i] == 'L' && i < n) {
i++;
countera++;
}
for (; i < n; i++) {
if (s[i] == 'L') {
c++;
} else {
if (c) b.push_back(c);
c = 0;
}
}
long long j = n - 1;
while (s[j] == 'L') {
j--;
counterb++;
}
for (long long i = 0; i < n; i++) {
if (s[i] == 'W') {
p++;
} else {
if (p) ans = ans + p * 2 - 1;
p = 0;
}
}
if (p) ans = ans + p * 2 - 1;
sort(b.begin(), b.end());
for (auto x : b) {
if (x <= k) {
ans = ans + x * 2 + 1;
k = k - x;
} else {
ans = ans + k * 2;
k = 0;
}
if (k == 0) break;
}
if (k && counterb) {
if (counterb <= k)
ans = ans + counterb * 2;
else
ans = ans + k * 2;
k = k - min(k, counterb);
}
if (k && countera) {
if (k >= countera)
ans = ans + (countera)*2;
else
ans = ans + k * 2;
}
}
cout << ans << '\n';
}
return 0;
}
| 8 | CPP |
import sys
import math
def II():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
def MI():
return map(int, sys.stdin.readline().split())
def SI():
return sys.stdin.readline().strip()
t = II()
for q in range(t):
n,k = MI()
s = list(SI())
cur = 0
a = 0
b = 0
d = []
temp = 0
if len(set(s)) == 1 and "L" in s and k>0:
k-=1
s[0] = "W"
for i in range(n):
if s[i] == "W":
if temp!=0:
d.append(temp)
temp = 0
if i>0 and s[i-1] == "W":
cur+=2
else:
cur+=1
else:
temp+=1
if temp!=0:
d.append(temp)
if "L" not in s or k == 0:
print(cur)
else:
if s[0] == "L":
a = d[0]
d = d[1:]
if s[-1] == "L":
a += d[-1]
d = d[:-1]
d.sort()
for i in range(len(d)):
if k>=d[i]:
cur+=d[i]*2+1
k-=d[i]
else:
cur+=k*2
k = 0
if k == 0:
break
if k!=0:
m = min(k,a)
if m>0:
k-=m
cur+=m*2
print(cur)
| 8 | PYTHON3 |
import sys
input = lambda : sys.stdin.readline().strip()
# n,x,y = map(int,input().split())
for i in range(int(input())):
n,k = map(int,input().split())
a = list(input())
ans = [0]
lol = [0]
lk = 0
if len(a)==1:
if a[0]=="W":
print(1)
else:
if k:
print(1)
else:
print(0)
continue
for i in range(n):
if a[i]=="W":
if lol[-1]!=0:
lol.append(0)
lk = 1
if ans[-1]==0:
ans.append(1)
else:
ans.append(2)
else:
ans.append(0)
lol[-1]+=1
if lol[-1]==0:
del lol[-1]
answ = sum(ans)
# print(answ)
lox = []
if len(lol)>1:
lox = lol[1:-1]
popa = 0
if len(lol)==0:
print(answ)
continue
if a[0]=="W" and lk:
lox.append(lol[0])
else:
popa =lol[0]
if len(lol)==1:
pass
elif a[-1]=="W" and lk:
lox.append(lol[-1])
else:
popa+=lol[-1]
lox.sort()
# print(lox)
l = len(lox)
for i in range(len(lox)):
if k>=lox[i]:
k-= lox[i]
answ+=2*lox[i]+1
else:
answ+=2*k
k = 0
k = min(k,popa)
if "W" in a:
answ+=2*k
print(answ)
else:
answ+=max(0,2*k-1)
print(answ) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
int count, count2, count3;
int n, k, j = 0;
cin >> n >> k;
vector<int> m;
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'W') {
count = 0;
while (s[i] == 'W' && i < n) {
i++;
count++;
j++;
}
ans += 1 + (count - 1) * 2;
count2 = 0;
count3 = 0;
while (s[i] == 'L' && i < n) {
i++;
count2++;
}
if (s[i] == 'W') m.push_back(count2);
i--;
}
}
sort(m.begin(), m.end());
int i = 0;
int k2 = k;
while (i < m.size() && k >= m[i]) {
k -= m[i];
i++;
}
ans += i;
int max_ans = 1 + (n - 1) * 2;
if (ans > 0) {
if (ans + k2 * 2 >= max_ans)
ans = max_ans;
else
ans += k2 * 2;
} else if (ans == 0)
ans = max(1 + (k2 - 1) * 2, 0);
cout << ans << endl;
}
}
| 8 | CPP |
t = int(input())
for i in range(t):
n, k = map(int, input().split())
s = input()
s = "L" + s + "W"
a = []
p = 0
c = 0
koL = 0
sum = 0
for i in range(1, n + 2):
if s[i] == 'W' and p == 0:
p = 1
if i!= 1:
a.append(c)
c = 0
if i != n + 1:
sum += 1
elif s[i] == 'W' and p == 1 and i != n + 1:
sum += 2
if s[i] == 'L':
p = 0
c += 1
koL += 1
if s[n] == 'L':
a.pop()
if s[1] == 'L' and len(a) != 0:
a.pop(0)
if koL <= k:
print(2 * n - 1)
else:
a.sort()
cum = 0
p = 0
for i in range(len(a)):
if cum + a[i] <= k:
cum += a[i]
p += 1
else:
break
if sum == 0 and k != 0:
print(2 * k - 1)
else:
print(sum + 2 * k + p)
| 8 | PYTHON3 |
import sys
import math
from decimal import *
def I(): return int(sys.stdin.readline())
def IL(): return list(map(int,sys.stdin.readline().strip().split()))
def ILS(): return list(map(str,sys.stdin.readline().strip().split()))
def solve():
tt = I()
for ii in range(tt):
n,k = IL()
ss = input()
s = [x for x in ss]
w=0;l=0;
for i in range(n):
if(s[i]=='W') : w+=1;
else : l+=1;
if(k>=l):
print((2*n - 1));
continue;
ans=0;
if(s[0]=='W') :
ans+=1;
for i in range(1,n):
if(s[i]=='W'):
ans+=1;
if(s[i-1]=='W'):
ans+=1;
if(k==0):
print(ans);
continue;
loss = [];
c=0;idx=n;
for i in range(n):
if(s[i]=='W'):
idx=i;
break;
if(idx==n):
print((k*2)-1);
continue;
for i in range(idx,n):
if(s[i]=='W' and c>0):
loss.append(c);
c=0;
elif(s[i]=='L') : c+=1;
loss.sort()
m=len(loss)
for i in range(m):
if(k<=0): break;
if(loss[i]>k):
ans+=(k*2);
k=0;
else:
ans+=((loss[i]*2)+1);
k-=loss[i];
if(k>0):
ans+=(k*2);
print(ans);
solve() | 8 | PYTHON3 |
#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
const long long int inf = 1e9 + 7;
const long long int mod = 998244353;
map<long long int, long long int>::iterator it;
long long int read() {
long long int x;
scanf("%lld", &x);
return x;
}
string c2s(char c) {
string re = "0";
re[0] = c;
return re;
}
long long int printv(vector<long long int> V) {
cout << V.size() << ": ";
for (long long int i = 0; i < V.size(); i++) cout << V[i] << " ";
puts("");
}
long long int gcd(long long int x, long long int y) {
while (x % y) {
long long int t = x % y;
x = y;
y = t;
}
return y;
}
long long int readv(vector<long long int>& V) {
for (long long int i = 0; i < ((long long int)V.size()); i++) V[i] = read();
}
bool isprime(long long int x) {
for (long long int i = 2; i * i <= x; i++)
if (x % i == 0) return false;
return true;
}
void yn(bool x) {
if (x)
puts("YES");
else
puts("NO");
}
long long int fpow(long long int a, long long int n) {
long long int re = 1;
while (n) {
if (n & 1) re = re * a % mod;
a = a * a % mod;
n /= 2;
}
return re;
}
const long long int dir[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
const long long int dir2[8][2] = {{1, 1}, {1, 0}, {1, -1}, {0, 1},
{0, -1}, {-1, 1}, {-1, 0}, {-1, -1}};
long long int fff(long long int x) {
if (x > 0)
return (x + 1) / 2;
else
return ((-1) * x) / 2 * (-1);
}
int main() {
long long int ca = read();
for (long long int ci = 0; ci < ca; ci++) {
long long int n = read(), k = read();
string t;
cin >> t;
long long int lcnt = 0, wcnt = 0;
long long int winpos = -1;
vector<long long int> A;
for (long long int i = 0; i < ((long long int)t.size()); i++) {
if (t[i] == 'L')
lcnt++;
else {
wcnt++;
if (winpos != -1 && winpos + 1 != i) A.push_back(i - winpos - 1);
winpos = i;
}
}
sort(A.begin(), A.end());
if (lcnt <= k)
cout << 2 * n - 1 << endl;
else if (wcnt == 0 && k)
cout << 2 * k - 1 << endl;
else {
long long int presco = 0;
long long int pre = 0;
for (long long int i = 0; i < n; i++) {
if (t[i] == 'W' && pre) presco += 2;
if (t[i] == 'W' && pre == 0) presco++;
if (t[i] == 'W') pre = 1;
if (t[i] == 'L') pre = 0;
}
long long int ans = presco + 2 * k;
if (k) {
long long int i = 0;
while (i + 1 <= A.size() && k >= A[i]) {
k -= A[i++];
ans++;
}
}
cout << ans << endl;
}
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
template <typename T>
bool mmax(T &m, const T q) {
if (m < q) {
m = q;
return true;
} else
return false;
}
template <typename T>
bool mmin(T &m, const T q) {
if (m > q) {
m = q;
return true;
} else
return false;
}
void __print(long long first) { cerr << first; }
void __print(long first) { cerr << first; }
void __print(unsigned first) { cerr << first; }
void __print(unsigned long first) { cerr << first; }
void __print(unsigned long long first) { cerr << first; }
void __print(float first) { cerr << first; }
void __print(double first) { cerr << first; }
void __print(long double first) { cerr << first; }
void __print(char first) { cerr << '\'' << first << '\''; }
void __print(const char *first) { cerr << '\"' << first << '\"'; }
void __print(const string &first) { cerr << '\"' << first << '\"'; }
void __print(bool first) { cerr << (first ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &first) {
cerr << '{';
__print(first.first);
cerr << ',';
__print(first.second);
cerr << '}';
}
template <typename T>
void __print(const T &first) {
long long f = 0;
cerr << '{';
for (auto &i : first) cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
__print(t);
if (sizeof...(v)) cerr << ", ";
_print(v...);
}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const long long N = 1 << 20;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(12);
long long T;
cin >> T;
while (T--) {
long long n, k;
cin >> n >> k;
string s;
cin >> s;
long long f = 0, ans = 0, c = 0, pre = 0, suf = 0;
;
vector<long long> v;
for (long long i = 0; i < n; i++) {
if (s[i] == 'L') {
c++;
} else {
if (f) {
if (c) v.push_back(c);
} else
pre = c;
c = 0;
f = 1;
if (i - 1 >= 0 and s[i - 1] == 'W')
ans += 2;
else
ans++;
}
}
suf = c;
if (k == 0) {
cout << ans << "\n";
continue;
}
if (suf == n) {
mmin(k, suf);
ans += (k - 1) * 2;
ans++;
cout << ans << "\n";
continue;
}
sort((v).begin(), (v).end());
for (auto i : v) {
if (i <= k) {
ans += 2 * i;
ans++;
k -= i;
} else {
ans += 2 * k;
k = 0;
break;
}
}
long long d = min(k, pre);
ans += d * 2;
k -= d;
ans += min(k, suf) * 2;
cout << ans << "\n";
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
bool comp(pair<int, int> a, pair<int, int> b) {
if (a.second == b.second) return (a.first < b.first);
return (a.second < b.second);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long mi = 1e12, ma = -1e12;
long long a, b, c, d, n, ex, m, k, sum = 0, no = 0, s = 0, tt, mod = 1e9 + 7,
x, y, w = 0;
char ch;
string C;
vector<long long> A, B, T;
set<long long> St;
cin >> ex;
while (ex--) {
s = 0;
w = 0;
no = 0;
cin >> n >> k >> C;
for (int i = 0; i < n; i++) {
if (C[i] == 'W') {
w++;
no = 1;
}
if (C[i] == 'L' && no) {
s++;
} else {
if (s) A.push_back(s);
s = 0;
}
}
w += min(k, n - w);
if (w == 0 && k == 0)
cout << 0;
else {
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
for (int i = A.size() - 1; i >= 0; i--) {
if (A[i] <= k) {
k -= A[i];
A.pop_back();
}
}
cout << 2 * w - (A.size() + 1);
}
cout << '\n';
;
A.clear();
}
}
| 8 | CPP |
# -*- coding: utf-8 -*-
"""
Created on Tue Nov 17 20:10:01 2020
@author: 章斯岚
"""
t=input
for i in range(int(t())):
n,k=map(int,t().split())
a=sorted(map(len,t().strip('L').split('W')))
m=len(a)+k
while a and k>=a[0]:
k-=a.pop(0)
print((2*min(n,m-1)-len(a) or 1)-1) | 8 | PYTHON3 |
def solve():
n,k=map(int,input().split())
#print(n,k)
l=sorted(map(len,input().strip('L').split('W')))
z=len(l)+k
while l and l[0]<=k:
k-=l.pop(0)
ans=2*min(n,z-1)-len(l)
if ans<=0:
ans=1
print(ans-1)
t=int(input())
for _ in range(0,t):
solve()
| 8 | PYTHON3 |
t = int(input())
for _ in range(t):
n,k = list(map(int,input().split()))
s = list(input())
ans = 0
for i in range(1,n):
if s[i]=='W':
if s[i-1]=='W':
ans+=2
else:
ans+=1
if s[0]=='W':
ans+=1
k = min(k,s.count('L'))
diff = []
if s.count('L')==n:
print(max(2*k-1,0))
continue
start = 0
pre = s.index('W')
start = pre
for i in range(pre+1,n):
if s[i]=='W':
if ((i-pre-1)!=0):
diff.append(i-pre-1)
pre = i
#print(diff)
diff.sort()
for i in diff:
if i<=k:
ans+=(2*i+1)
k-=i
else:
ans+=2*k
k = 0
break
if k>0:
ans+=2*k
print(ans)
| 8 | PYTHON3 |
#!/usr/bin/python3
ns = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
"B. Chess Cheater"
for _ in range(ni()):
n,k=nm()
s=ns()
w=[]
l=[]
i=count=1
f=s[0]
ll=[]
while i<n:
if s[i]=="W" and f!="W":
l.append(count)
ll.append(count)
w.append(0)
f="W"
count=1
elif s[i]=="L" and f!="L":
w.append(count)
l.append(0)
f="L"
count=1
else:
count+=1
i+=1
if s[-1]=="W":
w.append(count)
l.append(0)
else:
l.append(count)
ll.append(count)
w.append(0)
# print(w)
# print(l)
# print(ll)
if n<3:
ans=min(sum(w)+k,n)
if ans!=0:
ans=(2*ans)-1
print(ans)
continue
z=[]
if k>=sum(ll):
print((2*n)-1)
continue
if l[0]!=0 and len(ll)>0:
t=ll.pop(0)
z.append(t)
if l[-1]!=0 and len(ll)>0:
t=ll.pop(-1)
z.append(t)
ll.sort()
su=0
ind=0
# print(ll,z)
if k==0:
ans=sum(w)
if ans!=0:
ans=(2*ans)-1-(len(ll))
print(ans)
continue
while ind<len(ll):
su+=ll[ind]
if su==k:
ind+=1
break
elif su>k:
su-=ll[ind]
break
ind+=1
if ind==len(l):
ans=min(n,sum(w)+k)
ans=(2*ans)-1
else:
ans=min(n,sum(w)+k)
ans=(2*ans)-1-(len(ll)-ind)
print(ans)
| 8 | PYTHON3 |
for _ in range(int(input())):
n, k = map(int, input().split())
s = input()
ans,t,b,f =0,0,0,0
l = []
for i in range(n):
if s[i]=='W':
ans += f + 1
f = 1
if b:l.append(b)
b = 0
else:f = 0;b += 1
if b:l.append(b)
m,v = 0,0
if s[0]=='L':m = l.pop(0)
if s[-1]=='L':
if ans:
v = l.pop()
l.sort()
while k and l:
t = l.pop(0)
if k >= t:
ans += t*2 + 1;k -= t
else:ans += 2*k;k = 0
if k:
ans = ans+2*min(k,m+v) if ans else ans + 2*min(k,m)-1
print(ans) | 8 | PYTHON3 |
# Legends Always Come Up with Solution
# Author: Manvir Singh
import os
from io import BytesIO, IOBase
import sys
from collections import defaultdict,deque,Counter
from bisect import *
from math import sqrt,pi,ceil,log,inf
from itertools import permutations
from copy import deepcopy
from sys import setrecursionlimit
def main():
for _ in range(int(input())):
n,k=map(int,input().split())
a=list(input().rstrip())
b=[]
i=0
while i<n:
if a[i]=="L":
j=i+1
while j<n and a[j]=="L":
j+=1
b.append([i,j-1])
i=j
i+=1
b.sort(key=lambda x:(x[1]-x[0])+(0 if (x[0]!=0 and x[1]!=n-1) else 10**5))
for i in range(len(b)):
if b[i][0]!=0:
for j in range(b[i][0],b[i][1]+1):
if k==0:
break
a[j]="W"
k-=1
if k==0:
break
else:
for j in range(b[i][1],b[i][0]-1,-1):
if k==0:
break
a[j]="W"
k-=1
if k==0:
break
ans=int(a[0]=="W")
for i in range(1,n):
if a[i-1]=="W" and a[i]=="W":
ans+=2
elif a[i]=="W":
ans+=1
print(ans)
# region fastio
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")
if __name__ == "__main__":
main() | 8 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.