Submission #513211

#	Time	Username	Problem	Language	Result	Execution time	Memory
513211		PoPularPlusPlus	Take-out (POI13_usu)	C++17	22 / 100	103 ms	65536 KiB

usu

#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();
				}
			}
		}
	}
	reverse(all(v));
	/*if(v.size()!= n/(k+1) || a.size()){
		while(1){
			;
		}
		return;
	}*/
	if(n <= 20)cout << -1 << '\n';
	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;
}

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