#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const ll mod = 1000000007;
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}
void solve(){
int n , k;
cin >> n >> k;
char arr[n];
for(int i = 0; i < n; i++){
cin >> arr[i];
}
vector<vector<int>> v;
vector<int> cur[n];
stack<int> a , b;
for(int i = 0; i < n; i++){
if(arr[i] == 'c'){
if(b.size() == 0 || b.top() != 0){
b.push(1);
a.push(0);
cur[b.size()-1].pb(i + 1);
}
else {
b.pop();
b.push(1);
cur[b.size()-1].pb(i + 1);
if(a.top() == k){
v.pb(cur[b.size()-1]);
cur[b.size()-1].clear();
a.pop();
b.pop();
}
}
}
else {
if(a.size() == 0 || a.top() == k){
a.push(1);
b.push(0);
cur[b.size()-1].pb(i + 1);
}
else {
int x = a.top();
a.pop();
a.push(x + 1);
cur[b.size()-1].pb(i + 1);
if(b.top() == 1 && a.top() == k){
v.pb(cur[b.size()-1]);
cur[b.size()-1].clear();
a.pop();
b.pop();
}
}
}
}
if(a.size()){
while(1){
;
}
}
reverse(all(v));
for(auto i : v){
for(int j : i)cout << j << ' ';
cout << '\n';
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//freopen("rblock.in", "r", stdin);
//freopen("rblock.out", "w", stdout);
//int t;cin >> t;while(t--)
solve();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Execution timed out |
1077 ms |
204 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Execution timed out |
1087 ms |
204 KB |
Time limit exceeded |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Execution timed out |
1094 ms |
332 KB |
Time limit exceeded |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
588 KB |
Output is correct |
2 |
Execution timed out |
1079 ms |
588 KB |
Time limit exceeded |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
5472 KB |
Output is correct |
2 |
Correct |
13 ms |
4116 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
32 ms |
9880 KB |
Output is correct |
2 |
Correct |
32 ms |
10980 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1097 ms |
16332 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1088 ms |
22384 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
109 ms |
65536 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |