Submission #995731

---

Source Code Expand

#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif

#include <bits/stdc++.h>

using namespace std;

typedef long double ld;
typedef long long ll;

#ifdef DEBUG
#define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#else
#define eprintf(...) ;
#endif

#define pb push_back
#define mp make_pair
#define sz(x) ((int) (x).size())
#define TASK "text"

const int inf = (int) 1.01e9;
const ld eps = 1e-9;
const ld pi = acos((ld) -1);

mt19937 mrand(random_device{} ()); 

int rnd(int x) {
  return mrand() % x;
}

void precalc() {
}

const int maxn = (int) 2e4 + 5, logx = 18;
int n;
long long a[maxn];

int read() {
  if (scanf("%d", &n) < 1) {
    return false;
  }
  for (int i = 0; i < n; i++) {
    scanf("%lld", &a[i]);
  }
  return true;
}

long long p10;

vector< pair<long long, long long> > shift(const vector< pair<long long, long long> > &segs, long long sh) {
  vector< pair<long long, long long> > res;
  for (int i = 0; i < sz(segs); i++) {
    long long l = segs[i].first + sh, r = segs[i].second + sh;
    if (r <= p10) {
      res.push_back(make_pair(l, r));
    } else if (l >= p10) {
      l -= p10;
      r -= p10;
      res.push_back(make_pair(l, r));
    } else {
      res.push_back(make_pair(l, p10));
      res.push_back(make_pair(0, r - p10));
    }
  }
  sort(res.begin(), res.end());
  return res;
}

vector< pair<long long, long long> > mergeSegs(const vector< pair<long long, long long> > &a,
                                               const vector< pair<long long, long long> > &b) {
  vector< pair<long long, long long> > res;
  vector< pair<long long, int> > ev;
  for (int i = 0; i < sz(a); i++) {
    ev.push_back(make_pair(a[i].first, -1));
    ev.push_back(make_pair(a[i].second, 1));
  }
  for (int i = 0; i < sz(b); i++) {
    ev.push_back(make_pair(b[i].first, -1));
    ev.push_back(make_pair(b[i].second, 1));
  }
  sort(ev.begin(), ev.end());
  long long l = -1;
  int bal = 0;
  for (int i = 0; i < sz(ev); i++) {
    if (!bal) {
      l = ev[i].first;
    }
    bal -= ev[i].second;
    if (!bal) {
      res.push_back(make_pair(l, ev[i].first));
    }
  }
  return res;
}

void solve() {
  p10 = 1;
  for (int i = 0; i < logx; i++) {
    p10 *= 10;
  }
  int res = 0;
  for (int dig = logx; dig > 0; dig--) {
    for (int i = 0; i < n; i++) {
      a[i] %= p10;
    }
    long long len = p10 / 10;
    for (int x = 9; x >= 0; x--) {
      vector< pair<long long, long long> > segs;
      segs.push_back(make_pair(x * len, (x + 1) * len));
      for (int i = 0; i < n; i++) {
        auto segs0 = shift(segs, (p10 - a[i]) % p10);
        segs = mergeSegs(segs, segs0);
      }
      if (segs[0].first == 0) {
        res += x;
        break;
      }
    }
    p10 /= 10;
  }
  printf("%d\n", res);
}

int main() {
  precalc();
#ifdef LOCAL
  assert(freopen(TASK ".in", "r", stdin));
  assert(freopen(TASK ".out", "w", stdout));
#endif
  while (true) {
    if (!read()) {
      break;
    }
    solve();
#ifdef DEBUG
    eprintf("Time %.2f\n", (double) clock() / CLOCKS_PER_SEC);
#endif
  }
  return 0;
}

Submission Info

Compile Error

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

Judge Result