Submission #1453555


Source Code Expand

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


int main(){
	string S;
	cin >> S;


	long long ans = INT_MAX;

	for(char ch = 'a'; ch <= 'z'; ch++){
		//check possible
		bool ok = false;
		for(int i = 0; i < S.size(); i++){
			if(S[i] == ch){
				ok = true;
			}
		}
		if(!ok){
			continue;
		}


		string cur = S;
		string next = "";
		long long tmp = 0;
		while(true){
			bool ok = true;
			for(int i = 0; i < cur.size(); i++){
				if(cur[i] != ch){
					ok = false;
					break;
				}
			}

			if(ok){
				break;
			}
			for(int i = 0; i < cur.size() - 1; i++){
				if(cur[i] == ch || cur[i+1] == ch){
					next += ch;
				}else{
					next += cur[i];
				}
			}


			tmp++;
			cur = next;
			next = "";
		}
		ans = min(ans, tmp);
	}
	cout << ans << endl;
}

Submission Info

Submission Time
Task A - Shrinking
User motomuman
Language C++14 (GCC 5.4.1)
Score 300
Code Size 814 Byte
Status AC
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 14
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt AC 1 ms 256 KB
1_07.txt AC 1 ms 256 KB
1_08.txt AC 2 ms 256 KB
1_09.txt AC 2 ms 256 KB