제출 #101315

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
101315		MohamedAhmed0	새로운 문제 (POI13_usu)	C++14	0 / 100	103 ms	13264 KiB

usu

#include <bits/stdc++.h>
 
using namespace std ;
 
const int MAX = 1000000 ;
int arr[MAX] ;
 
int main()
{
	int n , k ;
	cin>>n>>k ;
	string s ;
	cin>>s ;
	int cnt = 0 ;
	vector<int>v ;
	vector< vector<int> >ans ;
	for(int i = 0 ; i < n ; ++i)
	{
		v.push_back(i) ;
		if(s[i] == 'b')
			arr[cnt]++ ;
		else if(s[i] == 'c')
			cnt++ ;
		if(cnt == 0)
			continue ;
		if(arr[cnt] + arr[cnt-1] == k)
		{
			int s = v.size()-k-1 ;
			vector<int>tmp ;
			for(int j = s ; j <= s+k ; ++j)
				tmp.push_back(v[j]) ;
			for(int j = 0 ; j < k+1 ; ++j)
				v.pop_back() ;
			ans.push_back(tmp) ;
			arr[cnt] = 0 ;
			--cnt ;
			arr[cnt] = 0 ;
		}
	}
	reverse(ans.begin() , ans.end()) ;
	cout<<ans.size()<<"\n";
	for(int i = 0 ; i < n / (k+1) ; ++i)
	{
		for(int j = 0 ; j < k+1 ; ++j)
			cout<<ans[i][j]+1<<" ";
		cout<<"\n";
	}
	return 0 ;
}

• 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