Submission #2176156


Source Code Expand

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

string str, T, ans;
map<int, int> mp;
int n;
int judge(int p, int k){
	if(k < 0)return 0;
	if(p == n)return 1;
	map<int,int> tmp = mp;
	int res = 0;
	for(int i = p;i < n;i++){
		int c = str[i]-'a';
		if(tmp[c] <= 0)res++;
		else tmp[c]--;
	}
	return res <= k;
}

int main(){
	int k, cnt = 0;
	scanf("%d%d", &n, &k);
	cin >> str;
	T = str;
	sort(T.begin(), T.end());
	
	for(int i = 0;i < n;i++)mp[T[i]-'a']++;
	for(int i = 0;i < n;i++){
		if(T[i] != str[cnt])k--;
		mp[T[i]-'a']--;
		if(judge(i+1, k)){
			cnt++;
			ans.push_back(T[i]);
		}else{
			ans.push_back(str[i]);
			k++;
			mp[T[i]-'a']++;
		}
	}
	
	/*queue<int> q;
	for(int i = 0;i < n;i++)q.push(T[i]-'a');
	for(int i = ans.size();i < n;i++){
		int c = str[i]-'a';
		if(mp[c] > 0){ans.push_back(str[i]);mp[c]--;}
		else ans.push_back('.');
	}
	
	for(int i = 0;i < n;i++){
		if(ans[i] != '.')continue;
		while(1){
			int c = q.front();
			if(mp[c] <= 0)q.pop();
			else{
				ans[i] = 'a'+c;
				mp[c]--;
				break;
			}
		}
	}*/
	cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task C - 辞書式順序ふたたび
User Ryoga_0212
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1131 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:22:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &k);
                       ^

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 16
WA × 42
Set Name Test Cases
All hand_1_0.txt, hand_1_1.txt, hand_1_2.txt, hand_1_3.txt, hand_1_4.txt, hand_1_5.txt, hand_1_6.txt, hand_1_7.txt, hand_1_8.txt, hand_2_0.txt, hand_2_1.txt, hand_2_10.txt, hand_2_2.txt, hand_2_3.txt, hand_2_4.txt, hand_2_5.txt, hand_2_6.txt, hand_2_7.txt, hand_2_8.txt, hand_2_9.txt, hand_3_2.txt, hand_3_3.txt, hand_3_4.txt, hand_3_5.txt, hand_3_6.txt, hand_4_2.txt, hand_4_3.txt, hand_4_4.txt, hand_4_5.txt, hand_4_6.txt, random_1.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_2.txt, random_3.txt, random_4.txt, random_5.txt, random_6.txt, random_7.txt, random_8.txt, random_9.txt, sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt, small_1.txt, small_2.txt, small_3.txt, small_4.txt, small_5.txt, small_6.txt, small_7.txt, small_8.txt, small_9.txt
Case Name Status Exec Time Memory
hand_1_0.txt WA 1 ms 256 KB
hand_1_1.txt WA 1 ms 256 KB
hand_1_2.txt WA 1 ms 256 KB
hand_1_3.txt WA 1 ms 256 KB
hand_1_4.txt AC 1 ms 256 KB
hand_1_5.txt WA 1 ms 256 KB
hand_1_6.txt WA 1 ms 256 KB
hand_1_7.txt AC 1 ms 256 KB
hand_1_8.txt AC 1 ms 256 KB
hand_2_0.txt WA 1 ms 256 KB
hand_2_1.txt WA 1 ms 256 KB
hand_2_10.txt AC 1 ms 256 KB
hand_2_2.txt WA 1 ms 256 KB
hand_2_3.txt WA 1 ms 256 KB
hand_2_4.txt WA 1 ms 256 KB
hand_2_5.txt WA 1 ms 256 KB
hand_2_6.txt WA 1 ms 256 KB
hand_2_7.txt WA 1 ms 256 KB
hand_2_8.txt AC 1 ms 256 KB
hand_2_9.txt AC 1 ms 256 KB
hand_3_2.txt WA 1 ms 256 KB
hand_3_3.txt WA 1 ms 256 KB
hand_3_4.txt WA 1 ms 256 KB
hand_3_5.txt WA 1 ms 256 KB
hand_3_6.txt WA 1 ms 256 KB
hand_4_2.txt WA 1 ms 256 KB
hand_4_3.txt WA 1 ms 256 KB
hand_4_4.txt WA 1 ms 256 KB
hand_4_5.txt WA 1 ms 256 KB
hand_4_6.txt WA 1 ms 256 KB
random_1.txt WA 1 ms 256 KB
random_10.txt WA 1 ms 256 KB
random_11.txt WA 1 ms 256 KB
random_12.txt WA 1 ms 256 KB
random_13.txt WA 1 ms 256 KB
random_14.txt WA 1 ms 256 KB
random_15.txt AC 1 ms 256 KB
random_2.txt WA 1 ms 256 KB
random_3.txt WA 1 ms 256 KB
random_4.txt WA 1 ms 256 KB
random_5.txt AC 1 ms 256 KB
random_6.txt WA 1 ms 256 KB
random_7.txt WA 1 ms 256 KB
random_8.txt WA 1 ms 256 KB
random_9.txt WA 1 ms 256 KB
sample_1.txt AC 1 ms 256 KB
sample_2.txt WA 1 ms 256 KB
sample_3.txt AC 1 ms 256 KB
sample_4.txt WA 1 ms 256 KB
small_1.txt AC 1 ms 256 KB
small_2.txt AC 1 ms 256 KB
small_3.txt WA 1 ms 256 KB
small_4.txt WA 1 ms 256 KB
small_5.txt AC 1 ms 256 KB
small_6.txt WA 1 ms 256 KB
small_7.txt AC 1 ms 256 KB
small_8.txt AC 1 ms 256 KB
small_9.txt AC 1 ms 256 KB