Submission #1070672

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <bitset>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <queue>

#define mp make_pair
#define pb push_back


typedef long long ll;
typedef long double ld;

using namespace std;
vector<pair<ll, ll> > buf;

int opt(vector<pair<ll, ll> >& vv) {
	for (int i = 0; i < vv.size(); ++i)
		if (vv[i].second <= vv[i].first)
			return 1;
	sort(vv.begin(), vv.end());
	if (vv[0].first == 0)
		return 1;
	buf.clear();
	for (int i = 0; i < vv.size(); ++i) {
		if (!buf.empty() && buf.back().second >= vv[i].first)
			buf.back().second = max(buf.back().second, vv[i].second);
		else
			buf.push_back(vv[i]);
	}
	vv = buf;
	return 0;
}

int n;
ll a[120000];
vector<pair<ll, ll> > vv;

int main() {
	scanf("%d", &n);
	for (int i = 0; i < n; ++i)
		scanf("%lld", a + i);
	ll now = 1;
	int ans = 0;
	for (int it = 0; it <= 16; ++it, now *= 10) {
		for (int k = 9; k >= 1; --k) {
			vv.clear();
			vv.push_back(make_pair(k * now, (k + 1) * now));
			int fl = 0;
			for (int i = 0; i < n; ++i) {
				ll x = a[i] % (10 * now);
				int sz = vv.size();
				for (int j = 0; j < sz; ++j) {
					ll l = vv[j].first - x;
					ll r = vv[j].second - x;
					if (l < 0)
						l += 10 * now;
					if (r <= 0)
						r += 10 * now;
					vv.push_back(make_pair(l, r));
				}
				if (opt(vv)) {
					fl = 1;
					break;
				}
			}
			if (fl) {
				ans += k;
			//	cerr << k << "\n";
				break;
			}
		}
	}
	cout << ans << "\n";
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:48:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:50:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", a + i);
                       ^

Judge Result