Submission #1679816


Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstring>

namespace dytjml
{
	const int N=500100;
	int s[N],t[N];
	int n;
	void initialize()
	{
		static char tmp[N];
		scanf("%s",tmp+1);
		n=strlen(tmp+1);
		for(int i=1;i<=n;i++)s[i]=tmp[i]^48;
	}
	int tag;
	void work()
	{
		tag=0;
		for(int i=n-1,p;i;s[i]-=tag,i--)
		{
			if(s[i]<=s[i+1]+tag)continue;
			s[i]--;
			for(p=n;p>i+1 && s[p]-s[p-1]>=10;p--)s[p]-=9;
			s[p]++,tag+=9;
		}


		for(int i=1,p;i<n-1;t[i]=s[i]+tag,i++)
		{
			if(s[i]+10==s[i+1])
			{
				for(p=n;p>i+1 && s[p]==s[p-1];p--)s[p]+=9;
				s[i]+=10,tag-=9,s[p]--;
				
				if(i>1)
				{
					s[i-1]=t[i-1]-tag;
					s[i-2]=t[i-2]-tag;
					i-=2;
				}
			}
		}

		s[n]+=tag;
	}
	void solve()
	{
		initialize();
		work();

		printf("%d\n",(s[n]/9)+(s[n]%9!=0));
	}
}

int main()
{
	dytjml::solve();
	return 0;
}

Submission Info

Submission Time
Task E - Increasing Numbers
User Demerzel_IV
Language C++14 (GCC 5.4.1)
Score 0
Code Size 892 Byte
Status WA
Exec Time 2103 ms
Memory 4608 KB

Compile Error

./Main.cpp: In function ‘void dytjml::initialize()’:
./Main.cpp:13:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s",tmp+1);
                    ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1300
Status
AC × 4
AC × 38
WA × 1
TLE × 1
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 2 ms 2432 KB
in10.txt WA 90 ms 4608 KB
in11.txt TLE 2103 ms 4608 KB
in12.txt AC 9 ms 4608 KB
in13.txt AC 7 ms 4608 KB
in14.txt AC 7 ms 4608 KB
in15.txt AC 7 ms 4608 KB
in16.txt AC 7 ms 4608 KB
in17.txt AC 6 ms 4480 KB
in18.txt AC 8 ms 4608 KB
in19.txt AC 7 ms 4608 KB
in2.txt AC 8 ms 4608 KB
in20.txt AC 7 ms 4608 KB
in21.txt AC 8 ms 4608 KB
in22.txt AC 8 ms 4608 KB
in23.txt AC 8 ms 4608 KB
in24.txt AC 7 ms 4608 KB
in25.txt AC 7 ms 4608 KB
in26.txt AC 8 ms 4608 KB
in27.txt AC 6 ms 3968 KB
in28.txt AC 8 ms 4608 KB
in29.txt AC 8 ms 4608 KB
in3.txt AC 8 ms 4608 KB
in30.txt AC 8 ms 4608 KB
in31.txt AC 8 ms 4608 KB
in4.txt AC 8 ms 4608 KB
in5.txt AC 6 ms 4608 KB
in500000.txt AC 6 ms 4608 KB
in6.txt AC 8 ms 4608 KB
in7.txt AC 6 ms 4096 KB
in8.txt AC 6 ms 4608 KB
in9.txt AC 7 ms 4608 KB
sample1.txt AC 2 ms 2304 KB
sample2.txt AC 2 ms 2304 KB
sample3.txt AC 2 ms 2304 KB
sample4.txt AC 2 ms 2304 KB