제출 #746204

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
746204		JellyTheOctopus	새로운 문제 (POI13_usu)	C++17	100 / 100	235 ms	36268 KiB

usu

#include <bits/stdc++.h>
using namespace std;

int N, K;
string str;

int main() {
	cin >> N >> K;
	cin >> str;
	vector<bool> arr(N+1);
	for (int i = 1; i <= N; i++) {
		arr[i] = (str[i-1] == 'c');
	}
	stack<int> ind;
	vector<int> space;
	space.push_back(0);
	int c = 0;
	vector<vector<int>> ans;
	for (int i = 1; i <= N; i++) {
		ind.push(i);
		if (arr[i]) {
			c++;
			space.push_back(0);
		}
		else {
			space[c]++;
		}
		if (c && (space[c]+space[c-1]) >= K) {
			vector<int> cur;
			for (int j = 0; j < K+1; j++) {
				cur.push_back(ind.top());
				ind.pop();
			}
			reverse(cur.begin(), cur.end());
			ans.push_back(cur);
			int diff = space[c--];
			space.pop_back();
			space[c] -= K-diff;
		}
	}
	reverse(ans.begin(), ans.end());
	for (auto cur: ans) {
		for (auto v: cur) {
			cout << v << " ";
		} cout << "\n";
	}
}

• Subtask 1: 11 / 11
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 11 / 11
• Subtask 5: 11 / 11
• Subtask 6: 11 / 11
• Subtask 7: 11 / 11
• Subtask 8: 11 / 11
• Subtask 9: 12 / 12