Submission #2175079


Source Code Expand

#include <iostream>
#include <algorithm>
#include <map>
using namespace std;

int main(){
    string s;
    cin >> s;
    map<char, int> alphabets;
    for(int i = 0; i < s.size(); i++){
        alphabets[s[i]]++;
    }
    int most = 'a';
    for(char i = 'a'; i <= 'z'; i++){
        if(alphabets[most] < alphabets[i]){
            most = i;
        }
    }
    int ans = 1e9;
    for(char looking = 'a'; looking <= 'z'; looking++){
        for(int i = 0; i < s.size(); i++){
            bool if_ok = true;
            for(int j = 0; j < s.size() - i; j++){
                bool if_in_looking = false;
                for(int k = j; k <= i + j; k++){
                    if_in_looking |= (s[k] == looking);
                }
                if_ok &= if_in_looking;
            }
            if(if_ok){
                ans = min(ans, i);
            }
        }
    }
    cout << ans << endl;
}

Submission Info

Submission Time
Task A - Shrinking
User June_boy
Language C++14 (GCC 5.4.1)
Score 300
Code Size 934 Byte
Status AC
Exec Time 7 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 7 ms 256 KB
1_02.txt AC 6 ms 256 KB
1_03.txt AC 6 ms 256 KB
1_04.txt AC 6 ms 256 KB
1_05.txt AC 5 ms 256 KB
1_06.txt AC 5 ms 256 KB
1_07.txt AC 4 ms 256 KB
1_08.txt AC 7 ms 256 KB
1_09.txt AC 7 ms 256 KB