Submission #1004639

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int N;
	while(~scanf("%d", &N)) {
		vector<long long> As(N);
		for(int i = 0; i < N; ++ i)
			scanf("%lld", &As[i]);
		ll P = 1;
		int ans = 0;
		rep(p, 17) {
			vector<pair<ll, int>> intervals, events;
			rep(d, 10)
				intervals.emplace_back(P * d, d);
			intervals.emplace_back(P * 10, -1);
			const ll M = P * 10;
			for(ll A : As) {
				events.clear();
				ll a = (M - A % M) % M;
				rep(i, intervals.size() - 1) {
					ll L = intervals[i].first, R = intervals[i + 1].first;
					int d = intervals[i].second;
					events.emplace_back(L, d * 2 + 0);
					events.emplace_back(R, d * 2 + 1);
					ll nL = L + a, nR = R + a;
					if(nL + M <= nR) {
						events.emplace_back(0, d * 2 + 0);
						events.emplace_back(M, d * 2 + 1);
					} else if(nL % M <= nR % M) {
						events.emplace_back(nL % M, d * 2 + 0);
						events.emplace_back(nR % M, d * 2 + 1);
					} else {
						events.emplace_back(nL % M, d * 2 + 0);
						events.emplace_back(M, d * 2 + 1);
						events.emplace_back(0, d * 2 + 0);
						events.emplace_back(nR % M, d * 2 + 1);
					}
				}
				events.emplace_back(M, 2);
				sort(events.begin(), events.end());
				intervals.clear();
				int count[10] = {};
				int currentMask = 0;
				ll curL = 0;
				int curVal = -1;
				rep(ix, events.size() - 1) {
					int d = events[ix].second / 2;
					if(events[ix].second % 2 == 0) {
						if(count[d] ++ == 0)
							currentMask |= 1 << d;
					} else {
						if(-- count[d] == 0)
							currentMask &= ~(1 << d);
					}
					ll L = events[ix].first, R = events[ix + 1].first;
					if(L < R) {
						assert(currentMask != 0);
						int maxD = 9;
						while(~currentMask >> maxD & 1) -- maxD;
						if(curVal != maxD) {
							if(curVal != -1)
								intervals.emplace_back(curL, curVal);
							curL = L;
							curVal = maxD;
						}
					}
				}
				intervals.emplace_back(curL, curVal);
				intervals.emplace_back(M, -1);
			}
			int d = intervals[0].second;
			ans += d;
			P *= 10;
		}
		printf("%d\n", ans);
	}
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:16:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%lld", &As[i]);
                         ^

Judge Result