Submission #1990332
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define rep(i,n) FOR(i,0,n) #define pb emplace_back #define mp make_pair typedef long long ll; typedef pair<int,int> pint; int c[26]; set<char> st; int main(){ string s; cin>>s; rep(i,s.size()){ ++c[s[i]-'a']; } int n=s.size(); int mn=1000100010; rep(cur,26){ if(c[cur]==0) continue; string ts=s; rep(i,n){ st.clear(); rep(j,ts.size()) st.insert(ts[j]); if(st.size()==1){ mn=min(mn,i); break; } string t; rep(j,ts.size()-1){ if(ts[j]-'a'==cur||ts[j+1]-'a'==cur) t+=('a'+cur); else t+=ts[j]; } swap(ts,t); } } cout<<mn<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Shrinking |
User | ts_ |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 853 Byte |
Status | AC |
Exec Time | 4 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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 | 2 ms | 256 KB |
1_07.txt | AC | 2 ms | 256 KB |
1_08.txt | AC | 3 ms | 256 KB |
1_09.txt | AC | 4 ms | 256 KB |