Submission #1575686
Source Code Expand
#include <bits/stdc++.h> using namespace std; const int INF = 1 << 30; int main() { string S; cin >> S; int ret = INF; for(char c = 'a'; c <= 'z'; c++) { if(S.find(c) == string::npos) continue; int res = 0; auto curr = S; while(count(begin(curr), end(curr), c) != curr.size()) { string next; for(int j = 0; j + 1 < curr.size(); j++) { if(curr[j] == c || curr[j + 1] == c) next += c; else next += curr[j]; } curr.swap(next); ++res; } ret = min(ret, res); } cout << ret << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Shrinking |
User | ei13333 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 596 Byte |
Status | AC |
Exec Time | 2 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 | 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 |