제출 #740557

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

usu

#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 = 0; i < N/(K+1); i++) {
        for (auto v: ans[i]) {
            cout << v << " ";
        } cout << "\n";
    }
}

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