Submission #1261841

---

Source Code Expand

// clang-format off

#include <bits/stdc++.h>

#define int long long int
#define main signed main()
#define bye return 0
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define each(p, v) for (auto p = (v).begin(); p != (v).end(); p++)
#define all(v) (v).begin(), (v).end()
#define prec(n) fixed << setprecision(n)
#define dump(x) cerr << "(L" << __LINE__ << ") " << #x << " = " << (x) << endl
#define clr(x, a) memset(x, a, sizeof(x))

#define sum(v) accumulate(all(v), 0)
#define stlice(from, to) substr(from, (to) - (from) + 1)
#define odd(n) ((n) % 2)
#define even(n) (!odd(n))

#define INF 1000000000
#define MOD 1000000007

#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define vi vector<int>
#define vb vector<bool>
#define vc vector<char>

using namespace std;

// clang-format on

map<pair<int, int>, int> p;

main {
  int n;
  cin >> n;
  vi a(n);
  rep(i, n) cin >> a[i];
  int s = sum(a);
  if (s % n == 0) {
    int avg = s / n;
    int c = 0;
    rep(i, n) c += (avg - a[i]) * (avg - a[i]);
    cout << c << endl;
  } else {
    int ava = s / n, avb = (s + n - 1) / n;
    int c = 0, d = 0;
    rep(i, n) {
      c += (ava - a[i]) * (ava - a[i]);
      d += (avb - a[i]) * (avb - a[i]);
    }
    cout << min(c, d) << endl;
  }
  bye;
}

Submission Info

Judge Result