Submission #1359631
Source Code Expand
#include <cstdio> #include <cstring> #include <algorithm> using namespace std; char str[110],f[110][110]; int n; int solve(int maxx) { for(int i=1;i<=n;i++)f[1][i]=str[i]; int size=n; for(int i=1;i<=n;i++) { bool flag=true; for(int j=2;j<=size;j++) { if(f[i][j]!=f[i][j-1])flag=false; } if(flag) { return i-1; } for(int j=1;j<size;j++) { if(f[i][j]==maxx||f[i][j+1]==maxx)f[i+1][j]=maxx; else f[i+1][j]=f[i][j]; } size--; } } int main() { scanf("%s",str+1); n=strlen(str+1); int ans=1e9; for(int i='a';i<='z';i++)ans=min(ans,solve(i)); printf("%d\n",ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Shrinking |
User | crofie |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 659 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:36:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s",str+1); ^
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 | 128 KB |
0_01.txt | AC | 0 ms | 128 KB |
0_02.txt | AC | 0 ms | 128 KB |
0_03.txt | AC | 1 ms | 128 KB |
1_00.txt | AC | 0 ms | 128 KB |
1_01.txt | AC | 1 ms | 128 KB |
1_02.txt | AC | 0 ms | 128 KB |
1_03.txt | AC | 1 ms | 128 KB |
1_04.txt | AC | 1 ms | 128 KB |
1_05.txt | AC | 1 ms | 128 KB |
1_06.txt | AC | 1 ms | 128 KB |
1_07.txt | AC | 1 ms | 128 KB |
1_08.txt | AC | 1 ms | 128 KB |
1_09.txt | AC | 1 ms | 128 KB |