Submission #1867079
Source Code Expand
#include<bits/stdc++.h> using namespace std; const int N=5e5+10; char s[N];int n; int main() { scanf("%s",s+1); n=strlen(s+1); for (int i=1;i<=n;i++) s[i]-='0'; s[n+1]=100; int ans=0; for (int p=1;p<=n;){ ans++; for (int i=p,now=0;i<=n;){ now=max(now,(int)s[i]); int j=i; while (s[j]==now) j++; if (s[j]<now){ s[i]=0; j=n; while (s[j]==9) s[j--]=0; s[j]++; break; } for (;i<j;s[i++]=0); } while (!s[p]) p++; } printf("%d\n",ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Increasing Numbers |
User | FoolMike |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 530 Byte |
Status | TLE |
Exec Time | 2103 ms |
Memory | 768 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:7:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s",s+1); ^
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 1300 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt, sample4.txt |
All | sample1.txt, sample2.txt, sample3.txt, sample4.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in3.txt, in30.txt, in31.txt, in4.txt, in5.txt, in500000.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt, sample4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 1 ms | 256 KB |
in10.txt | TLE | 2103 ms | 768 KB |
in11.txt | AC | 4 ms | 768 KB |
in12.txt | AC | 970 ms | 768 KB |
in13.txt | TLE | 2103 ms | 768 KB |
in14.txt | TLE | 2103 ms | 768 KB |
in15.txt | AC | 749 ms | 768 KB |
in16.txt | AC | 104 ms | 768 KB |
in17.txt | AC | 3 ms | 640 KB |
in18.txt | AC | 7 ms | 768 KB |
in19.txt | AC | 6 ms | 768 KB |
in2.txt | AC | 7 ms | 768 KB |
in20.txt | AC | 4 ms | 768 KB |
in21.txt | AC | 7 ms | 768 KB |
in22.txt | AC | 7 ms | 768 KB |
in23.txt | AC | 7 ms | 768 KB |
in24.txt | TLE | 2103 ms | 768 KB |
in25.txt | TLE | 2103 ms | 768 KB |
in26.txt | AC | 7 ms | 768 KB |
in27.txt | AC | 5 ms | 640 KB |
in28.txt | AC | 7 ms | 768 KB |
in29.txt | AC | 7 ms | 768 KB |
in3.txt | AC | 7 ms | 768 KB |
in30.txt | AC | 7 ms | 768 KB |
in31.txt | AC | 7 ms | 768 KB |
in4.txt | AC | 7 ms | 768 KB |
in5.txt | AC | 3 ms | 768 KB |
in500000.txt | AC | 3 ms | 768 KB |
in6.txt | AC | 7 ms | 768 KB |
in7.txt | AC | 5 ms | 640 KB |
in8.txt | AC | 3 ms | 768 KB |
in9.txt | TLE | 2103 ms | 768 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |
sample4.txt | AC | 1 ms | 256 KB |