Submission #3017058


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;
template<class T> void assign(V<T>& v, int n, const T& a = T()) { v.assign(n, a); }
template<class T, class... U> void assign(V<T>& v, int n, const U&... u) { v.resize(n); for (auto&& i : v) assign(i, u...); }

int main() {
  cin.tie(NULL); ios::sync_with_stdio(false);
  int n; cin >> n;
  V<lint> a(n); for (int i = 0; i < n; i++) cin >> a[i];
  V<> b(n); for (int i = 0; i < n; i++) b[i] = a[i] % (n + 1) + 2 * n;
  lint res = accumulate(a.begin(), a.end(), 0LL) - accumulate(b.begin(), b.end(), 0LL);
  auto chk = [&] {
    for (auto&& i : b) if (i >= n) return false;
    return true;
  };
  while (!chk()) {
    (*max_element(b.begin(), b.end())) -= n + 1;
    for (auto&& i : b) i++;
    res++;
  }
  cout << res << '\n';
}

Submission Info

Submission Time
Task E - Decrease (Judge ver.)
User risujiroh
Language C++14 (GCC 5.4.1)
Score 0
Code Size 919 Byte
Status WA
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 600
Status
AC × 4
WA × 1
AC × 33
WA × 2
Set Name Test Cases
Sample example0, example1, example2, example3, example4
All example0, example1, example2, example3, example4, maxrand0, maxrand1, maxrand2, maxrand3, maxrand4, maxrand5, maxrand6, maxrand7, maxrand8, maxrand9, rand0, rand1, rand2, rand3, rand4, rand5, rand6, rand7, rand8, rand9, small0, small1, small2, small3, small4, small5, small6, small7, small8, small9
Case Name Status Exec Time Memory
example0 AC 1 ms 256 KB
example1 AC 1 ms 256 KB
example2 AC 1 ms 256 KB
example3 WA 1 ms 256 KB
example4 AC 1 ms 256 KB
maxrand0 AC 1 ms 256 KB
maxrand1 AC 1 ms 256 KB
maxrand2 AC 1 ms 256 KB
maxrand3 AC 1 ms 256 KB
maxrand4 AC 1 ms 256 KB
maxrand5 AC 1 ms 256 KB
maxrand6 AC 1 ms 256 KB
maxrand7 AC 1 ms 256 KB
maxrand8 AC 1 ms 256 KB
maxrand9 AC 1 ms 256 KB
rand0 AC 1 ms 256 KB
rand1 AC 1 ms 256 KB
rand2 AC 1 ms 256 KB
rand3 AC 1 ms 256 KB
rand4 AC 1 ms 256 KB
rand5 AC 1 ms 256 KB
rand6 AC 1 ms 256 KB
rand7 AC 1 ms 256 KB
rand8 AC 1 ms 256 KB
rand9 AC 1 ms 256 KB
small0 WA 1 ms 256 KB
small1 AC 1 ms 256 KB
small2 AC 1 ms 256 KB
small3 AC 1 ms 256 KB
small4 AC 1 ms 256 KB
small5 AC 1 ms 256 KB
small6 AC 1 ms 256 KB
small7 AC 1 ms 256 KB
small8 AC 1 ms 256 KB
small9 AC 2 ms 256 KB