# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
83485 | nikolapesic2802 | Take-out (POI13_usu) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set; ///find_by_order(),order_of_key()
int main()
{
//ios_base::sync_with_stdio(0);
//cin.tie(NULL);
int n,k;
scanf("%i %i",&n,&k);
char s[n];
scanf("%s",s);
int i=0,j=n-1;
int c=1,b=k;
set<int> index;
while(i<=j)
{
index.clear();
c=1,b=k;
while(c>0&&b>0)
{
index.insert(i);
if(s[i]=='c')
c--;
else
b--;
i++;
}
while(c!=0||b!=0)
{
index.insert(j);
if(s[i]=='c')
{
c--;
if(c<0)
{
index.erase(i);
i--;
}
}
else
{
b--;
if(b<0)
{
index.erase(i);
i--;
}
}
j--;
}
for(auto p:index)
{
printf("%i ",p);
}
printf("\n");
}
return 0;
}