Submission #18866537


Source Code Expand

Copy
#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

int main() {
  int n;
  cin >> n;
  vector<int64> a(n);
  for (int i = 0; i < n; ++i) cin >> a[i];
  sort(a.begin(), a.end());
  int64 ret = 0;
  vector<int64> pre(n + 1);
  for (int i = 0; i < n; ++i) pre[i + 1] = pre[i] + a[i];
  for (int i = 0; i < n; ++i) {
    ret += a[i] * i - pre[i];
    ret += pre[n] - pre[i + 1] - a[i] * (n - i - 1);
  }
  ret /= 2;
  cout << ret << '\n';
  return 0;
}

Submission Info

Submission Time
Task D - Sum of difference
User cuiaoxiang
Language C++ (Clang 10.0.0)
Score 400
Code Size 2950 Byte
Status AC
Exec Time 155 ms
Memory 5992 KB

Compile Error

./Main.cpp:78:42: warning: unused variable 'inf' [-Wunused-const-variable]
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
                                         ^
./Main.cpp:79:11: warning: unused variable 'MOD' [-Wunused-const-variable]
const int MOD = 1e9 + 7;
          ^
2 warnings generated.

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 25
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All hand_01.txt, max_01.txt, max_02.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_16.txt, random_17.txt, random_18.txt, random_19.txt, random_20.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
hand_01.txt AC 6 ms 3152 KB
max_01.txt AC 129 ms 5988 KB
max_02.txt AC 112 ms 5812 KB
random_01.txt AC 155 ms 5772 KB
random_02.txt AC 153 ms 5952 KB
random_03.txt AC 151 ms 5916 KB
random_04.txt AC 153 ms 5816 KB
random_05.txt AC 154 ms 5884 KB
random_06.txt AC 151 ms 5912 KB
random_07.txt AC 152 ms 5920 KB
random_08.txt AC 153 ms 5888 KB
random_09.txt AC 154 ms 5948 KB
random_10.txt AC 153 ms 5952 KB
random_11.txt AC 150 ms 5932 KB
random_12.txt AC 153 ms 5928 KB
random_13.txt AC 150 ms 5940 KB
random_14.txt AC 151 ms 5932 KB
random_15.txt AC 152 ms 5992 KB
random_16.txt AC 154 ms 5936 KB
random_17.txt AC 150 ms 5820 KB
random_18.txt AC 152 ms 5768 KB
random_19.txt AC 153 ms 5880 KB
random_20.txt AC 150 ms 5932 KB
sample_01.txt AC 2 ms 3016 KB
sample_02.txt AC 2 ms 3164 KB