Submission #1306098

---

Source Code Expand

#include <bits/stdc++.h>
#define xx first
#define yy second
#define mp make_pair
#define pb push_back
#define fill( x, y ) memset( x, y, sizeof x )
#define copy( x, y ) memcpy( x, y, sizeof x )
using namespace std;

typedef long long LL;
typedef pair < LL, LL > pa;

inline LL read()
{
	LL sc = 0, f = 1; char ch = getchar();
	while( ch < '0' || ch > '9' ) { if( ch == '-' ) f = -1; ch = getchar(); }
	while( ch >= '0' && ch <= '9' ) sc = sc * 10 + ch - '0', ch = getchar();
	return sc * f;
}

const int MAXN = 20005;

int n, ans;
LL a[MAXN], table[20];
vector < pa > f, g;

inline vector < pa > merge(vector < pa > a, vector < pa > b)
{
	vector < pa > ret;
	for( auto x : b ) a.pb( x );
	sort( a.begin(), a.end() );
	LL l = 0, r = 0;
	for( auto t : a )
		if( r < t.xx )
		{
			if( l && r ) ret.pb( mp( l, r ) );
			l = t.xx, r = t.yy;
		}
		else r = max( r, t.yy );
	ret.pb( mp( l, r ) );
	return ret;
}

inline bool cal(int x, int y)
{
	f.clear(); g.clear();
	f.pb( mp( table[ x ] * y, table[ x ] * ( y + 1 ) ) );
	for( int i = 1 ; i <= n ; i++ )
	{
		LL c = a[ i ] % table[ x + 1 ];
		g.clear();
		for( auto t : f )
		{
			if( t.xx <= c && c < t.yy ) return true;
			LL l = ( t.xx - c + table[ x + 1 ] ) % table[ x + 1 ], r = ( t.yy - c + table[ x + 1 ] ) % table[ x + 1 ];
			if( !r ) r = table[ x + 1 ];
			g.pb( mp( l, r ) );
		}
		f = merge( f, g );
	}
	return false;
}

int main()
{
#ifdef wxh010910
	freopen( "data.in", "r", stdin );
#endif
	n = read();
	for( int i = 1 ; i <= n ; i++ ) a[ i ] = read();
	table[ 0 ] = 1;
	for( int i = 1 ; i <= 18 ; i++ ) table[ i ] = table[ i - 1 ] * 10;
	for( int i = 0 ; i < 18 ; i++ )
		for( int j = 9 ; j ; j-- )
			if( cal( i, j ) )
			{
				ans += j;
				break;
			}
	return printf( "%d\n", ans ), 0;
}

Submission Info

Judge Result