結果

問題 No.1470 Mex Sum
ユーザー ninoinuininoinui
提出日時 2021-04-09 21:29:50
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 40 ms / 2,000 ms
コード長 3,799 bytes
コンパイル時間 2,221 ms
コンパイル使用メモリ 212,612 KB
実行使用メモリ 7,424 KB
最終ジャッジ日時 2024-06-25 04:13:45
合計ジャッジ時間 4,897 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 5 ms
6,944 KB
testcase_03 AC 4 ms
6,944 KB
testcase_04 AC 5 ms
6,944 KB
testcase_05 AC 5 ms
6,944 KB
testcase_06 AC 5 ms
6,944 KB
testcase_07 AC 5 ms
6,940 KB
testcase_08 AC 5 ms
6,940 KB
testcase_09 AC 5 ms
6,940 KB
testcase_10 AC 5 ms
6,944 KB
testcase_11 AC 5 ms
6,940 KB
testcase_12 AC 36 ms
7,168 KB
testcase_13 AC 36 ms
7,168 KB
testcase_14 AC 37 ms
7,168 KB
testcase_15 AC 36 ms
7,168 KB
testcase_16 AC 36 ms
7,168 KB
testcase_17 AC 37 ms
7,168 KB
testcase_18 AC 36 ms
7,040 KB
testcase_19 AC 37 ms
7,040 KB
testcase_20 AC 35 ms
7,168 KB
testcase_21 AC 38 ms
7,296 KB
testcase_22 AC 38 ms
7,296 KB
testcase_23 AC 38 ms
7,296 KB
testcase_24 AC 38 ms
7,296 KB
testcase_25 AC 37 ms
7,296 KB
testcase_26 AC 37 ms
7,168 KB
testcase_27 AC 38 ms
7,296 KB
testcase_28 AC 38 ms
7,168 KB
testcase_29 AC 38 ms
7,296 KB
testcase_30 AC 38 ms
7,296 KB
testcase_31 AC 38 ms
7,168 KB
testcase_32 AC 37 ms
7,296 KB
testcase_33 AC 40 ms
7,296 KB
testcase_34 AC 39 ms
7,424 KB
testcase_35 AC 40 ms
7,168 KB
testcase_36 AC 39 ms
7,168 KB
testcase_37 AC 15 ms
6,940 KB
testcase_38 AC 15 ms
6,940 KB
testcase_39 AC 15 ms
6,944 KB
testcase_40 AC 17 ms
6,944 KB
testcase_41 AC 17 ms
6,944 KB
testcase_42 AC 17 ms
6,944 KB
testcase_43 AC 17 ms
6,940 KB
testcase_44 AC 18 ms
6,940 KB
testcase_45 AC 17 ms
6,944 KB
testcase_46 AC 17 ms
6,944 KB
testcase_47 AC 17 ms
6,940 KB
testcase_48 AC 17 ms
6,944 KB
testcase_49 AC 18 ms
6,944 KB
testcase_50 AC 17 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#ifndef _DEBUG
#define _DEBUG
#include __FILE__

signed main() {
  long N;
  cin >> N;
  vector<long> A(N);
  for (long i = 0; i < N; i++) cin >> A.at(i);

  map<long, long> MA;
  for (const auto& a : A) MA[a]++;

  long ans = 0;
  for (long i = 0; i < N; i++) {
    if (A.at(i) == 1) {
      long tmp = MA[2];
      ans += tmp * 3;
      ans += (N - tmp - 1) * 2;
    } else if (A.at(i) == 2) {
      long tmp = MA[1];
      ans += tmp * 3;
      ans += (N - tmp - 1);
    } else {
      long tmp = MA[1];
      ans += tmp * 2;
      ans += (N - tmp - 1);
    }
  }
  cout << ans / 2 << "\n";
}

#else
// #undef _DEBUG
#pragma GCC diagnostic warning "-Wextra"
#pragma GCC diagnostic warning "-Wshadow"
#include <bits/stdc++.h>
using namespace std;

struct io_setup {
  io_setup() { cin.tie(nullptr)->sync_with_stdio(false); }
} io_setup;

template <class A, class B> bool cmin(A& a, const B& b) {
  if (a > b) return a = b, true;
  return false;
}

template <class A, class B> bool cmax(A& a, const B& b) {
  if (a < b) return a = b, true;
  return false;
}

template <class A, class B> ostream& operator<<(ostream& os, const pair<A, B>& p);

template <class A, class B, class C> ostream& operator<<(ostream& os, const tuple<A, B, C>& t);

template <class A, class B, class C, class D> ostream& operator<<(ostream& os, const tuple<A, B, C, D>& t);

#define foreach(it, a) for (auto it = a.begin(); it != a.end(); it++)

ostream& operator<<(ostream& os, const vector<char>& vec) {
  os << "{";
  foreach (it, vec) { os << (it == vec.begin() ? "" : " ") << *it; }
  return os << "}";
}

template <class A> ostream& operator<<(ostream& os, const vector<A>& vec) {
  os << "{";
  foreach (it, vec) { os << (it == vec.begin() ? "" : ", ") << *it; }
  return os << "}";
}

template <class A> ostream& operator<<(ostream& os, const vector<vector<A> >& vec) {
  os << "{\n";
  foreach (it, vec) { os << (it == vec.begin() ? " " : "\n ") << *it; }
  return os << "\n}";
}

template <class A> ostream& operator<<(ostream& os, const vector<vector<vector<A> > >& vec) {
  os << "{\n";
  foreach (it, vec) { os << (it == vec.begin() ? "" : "\n") << it - vec.begin() << ": " << *it; }
  return os << "\n}";
}

template <class A> ostream& operator<<(ostream& os, const set<A>& se) {
  os << "{";
  foreach (it, se) { os << (it == se.begin() ? "" : ", ") << *it; }
  return os << "}";
}

template <class A> ostream& operator<<(ostream& os, const multiset<A>& ms) {
  os << "{";
  foreach (it, ms) { os << (it == ms.begin() ? "" : ", ") << *it; }
  return os << "}";
}

template <class A, class B> ostream& operator<<(ostream& os, const map<A, B>& ma) {
  os << "{";
  foreach (it, ma) { os << (it == ma.begin() ? "" : ", ") << *it; }
  return os << "}";
}

template <class A> ostream& operator<<(ostream& os, priority_queue<A> pq) {
  os << "{";
  while (!pq.empty()) {
    os << pq.top(), pq.pop();
    if (!pq.empty()) os << ", ";
  }
  return os << "}";
}

template <class A, class B> ostream& operator<<(ostream& os, const pair<A, B>& p) {
  const auto& [a, b] = p;
  return os << "(" << a << ", " << b << ")";
}

template <class A, class B, class C> ostream& operator<<(ostream& os, const tuple<A, B, C>& t) {
  const auto& [a, b, c] = t;
  return os << "(" << a << ", " << b << ", " << c << ")";
}

template <class A, class B, class C, class D> ostream& operator<<(ostream& os, const tuple<A, B, C, D>& t) {
  const auto& [a, b, c, d] = t;
  return os << "(" << a << ", " << b << ", " << c << ", " << d << ")";
}

void dump_func() {}
template <class A, class... B> void dump_func(const A& a, const B&... b) {
  cout << a << (sizeof...(b) ? ", " : "\n");
  dump_func(b...);
}

#ifdef _DEBUG
#define dump(...) cout << "[" << (#__VA_ARGS__) << "]: ", dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif
#endif
0