#include <bits/stdc++.h>
using namespace std;
int N, K;
int main() {
cin >> N >> K;
vector<bool> arr(N+1); // White is False, Black is True
string s;
cin >> s;
for (int i = 0; i < N; i++) {
arr[i+1] = (s[i] == 'c');
}
stack<int> white, black;
vector<vector<int>> ans;
for (int i = 1; i <= N; i++) {
if (arr[i]) {
black.push(i);
}
else {
white.push(i);
}
if (((int)white.size() >= K) && (!black.empty())) {
vector<int> cur;
cur.push_back(black.top());
black.pop();
for (int j = 1; j <= K; j++) {
cur.push_back(white.top());
white.pop();
}
sort(cur.begin(), cur.end());
ans.push_back(cur);
}
}
for (int i = N/(K+1)-1; i >= 0; i--) {
for (auto v: ans[i]) {
cout << v << " ";
} cout << "\n";
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Incorrect |
0 ms |
300 KB |
Ruch numer 3 nie jest poprawny. |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
300 KB |
Output is correct |
2 |
Incorrect |
0 ms |
304 KB |
Ruch numer 14 nie jest poprawny. |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Ruch numer 200 nie jest poprawny. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
340 KB |
Output is correct |
2 |
Incorrect |
2 ms |
340 KB |
Ruch numer 98 nie jest poprawny. |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
22 ms |
2352 KB |
Output is correct |
2 |
Correct |
14 ms |
1932 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
37 ms |
3480 KB |
Ruch numer 10004 nie jest poprawny. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
67 ms |
7144 KB |
Ruch numer 2501 nie jest poprawny. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
98 ms |
10260 KB |
Ruch numer 8000 nie jest poprawny. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
227 ms |
37284 KB |
Output is correct |
2 |
Correct |
131 ms |
18348 KB |
Output is correct |
3 |
Correct |
136 ms |
13660 KB |
Output is correct |
4 |
Correct |
128 ms |
14032 KB |
Output is correct |