Submission #1608592


Source Code Expand

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int INF = 1e9;
int MOD = 1e9+7;
bool judge(string s,char t){
    for(char c:s)if(c != t)return false;
    return true;
}
main(){
    string S;
    cin >> S;
    int minc = INF;
    for(char c = 'a';c <= 'z';c++){
        if(S.find(string(1,c)) == -1)continue;
        string str = S;
        for(int j = 0;j <= 100;j++){
            if(judge(str,c)){
                minc = min(minc,j);
                break;
            }
            string sub;
            for(int i = 0;i < str.length()-1;i++){
                if(str[i] == c || str[i+1] == c) sub += c;
                else sub += str[i];
            }
            str = sub;
        }
    }
    cout << minc << endl;
}   

Submission Info

Submission Time
Task A - Shrinking
User Bantako
Language C++14 (GCC 5.4.1)
Score 300
Code Size 774 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 2 ms 256 KB
1_08.txt AC 2 ms 256 KB
1_09.txt AC 2 ms 256 KB