Submission #2124703

---

Source Code Expand

#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<unordered_map>
#include<array>
#include<map>
#include<bitset>
#include<iomanip>
#include<list>
#include <numeric>
using namespace std;
typedef unsigned long long int ulint;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
#define RE return 0
//ios::sync_with_stdio(false);
//std::cin.tie(0);
//<< setprecision(20)
//const int mod=(int)1e9+7;

const llint big=(llint)(2.19e18+1);
const long double pai=3.141592653589793238462643383279502884197;
const long double ena=2.71828182845904523536;
const long double eps=1e-7;
template <class T,class U>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}
template <class T> void soun(T& ar)
{sort(ar.begin(),ar.end());ar.erase(unique(ar.begin(),ar.end()),ar.end());}
llint gcd(llint a,llint b){if(a%b==0){return b;}else{return gcd(b,a%b);}}
llint lcm(llint a,llint b){return a/gcd(a,b) *b;}
template<class T,class U> auto LB(T& ve,U in){return lower_bound(ve.begin(),ve.end(),in);}
template<class T,class U> auto UB(T& ve,U in){return upper_bound(ve.begin(),ve.end(),in);}
template<class T,class U> auto LBI(T& ve,U in){return LB(ve,in)-ve.begin();}
template<class T,class U> auto UBI(T& ve,U in){return UB(ve,in)-ve.begin();}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
#define dme cout<<"-1\n";return 0
int main(void){
	//同じ硬貨を10枚以上持つ必要はなさそう
	//桁ごとにみる!!
	llint ans=0,i,j,n;cin>>n;
	vector<llint>syo(n);
	for(i=0;i<n;i++){cin>>syo[i];}
	for(llint myo=1;myo<5e17;myo*=10){//1e18は誤差が怖い 18回見る
		//上にもしたにもmyo未満の差しかなければそのdpはいらない
		//枝刈りDP
		//定数倍こわいなあ
		//vectorのソートで行く
		vector<llint>dp={0};
		for(i=0;i<n;i++){
			llint ne=syo[i]%(myo*10);
			vector<llint>ddp=dp;
			for(auto it:dp){ddp.pub((it+ne)%(myo*10));}
			SO(ddp);
			dp.clear();
			dp.pub(0);
			llint mae=0;
			for(j=1;j+1<ddp.size();j++){
				if(ddp[j]-mae>=myo || ddp[j+1]-ddp[j]>=myo){dp.pub(ddp[j]);mae=ddp[j];}
			}
			dp.pub(ddp.back());
			if(dp.back()>=(myo*9)){break;}//せめてもの定数倍
		}
		ans+=dp.back()/myo;
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result