Submission #5375761


Source Code Expand

#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;

/*BigInteger
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace xxx = boost::multiprecision;
using Bint = xxx::cpp_int;
using Real = xxx::number<xxx::cpp_dec_float<1024>>;
*/

#define int long long
#define pb(x) push_back(x)
#define m0(x) memset((x), 0LL, sizeof(x))
#define mm(x) memset((x), -1LL, sizeof(x))

//container
#define ALL(x) (x).begin(), (x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
#define PERM(c) \
  sort(ALL(c)); \
  for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))

// debug
#define GET_VAR_NAME(variable) #variable
#define test(x) cout << GET_VAR_NAME(x) << " = " << x << endl;

// bit_macro
#define Bit(n) (1LL << (n))
#define Bitset(a, b) (a) |= (1LL << (b))
#define Bitunset(a, b) (a) &= ~(1LL << (b))
#define Bitcheck(a, b) ((((a) >> (b)) & 1LL) == 1LL)
#define Bitcount(a) __builtin_popcountll((a))

//typedef
typedef long long lint;
typedef unsigned long long ull;
typedef complex<long double> Complex;
typedef pair<int, int> P;
typedef tuple<int, int, int> TP;
typedef vector<int> vec;
typedef vector<vec> mat;

//constant
constexpr int INF = (int)1e18;
constexpr int MOD = (int)1e9 + 7;
constexpr double PI = (double)acos(-1);
constexpr double EPS = (double)1e-10;
constexpr int dx[] = {-1, 0, 0, 1, 0, -1, -1, 1, 1};
constexpr int dy[] = {0, -1, 1, 0, 0, 1, -1, 1, -1};

//
template <typename T>
void chmax(T &a, T b) { a = max(a, b); }
template <typename T>
void chmin(T &a, T b) { a = min(a, b); }
//
inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T>
inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}

//
struct Accelerate_Cin {
  Accelerate_Cin() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(20);
  };
} Accelerate_Cin;

signed main() {
  int N, M;
  cin >> N >> M;
  vector<int> v[101010];
  for (int i = 0; i < N; i++) {
    int x;
    cin >> x;
    v[x % M].push_back(x);
  }

  static bool vis[101010];
  m0(vis);

  int ans = v[0].size() / 2;
  vis[0] = true;
  if (M % 2 == 0) ans += v[M / 2].size() / 2, vis[M / 2] = true;

  for (int i = 0; i < M; i++) {
    if (vis[i]) continue;
    vis[i] = vis[M - i] = true;

    int a = i, b = M - i;
    if (v[a].size() > v[b].size()) swap(v[a], v[b]);
    vec x = v[a], y = v[b];

    ans += x.size();

    map<int, int> mp;
    for (auto tmp : y) mp[tmp]++;

    int sum = 0;
    for (auto tmp : mp) sum += tmp.second / 2;

    int sub = 1;
    while (x.size() < y.size() - sub && sub <= sum) {
      ans++;
      sub++;
    }
  }

  cout << ans << endl;
  return 0;
}

Submission Info

Submission Time
Task D - Pair Cards
User null_null
Language C++14 (GCC 5.4.1)
Score 0
Code Size 3114 Byte
Status WA
Exec Time 28 ms
Memory 5888 KB

Judge Result

Set Name sample all
Score / Max Score 0 / 0 0 / 700
Status
AC × 2
AC × 21
WA × 13
Set Name Test Cases
sample sample-01.txt, sample-02.txt
all sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, sample-01.txt, sample-02.txt
Case Name Status Exec Time Memory
01-01.txt AC 2 ms 2688 KB
01-02.txt AC 11 ms 3832 KB
01-03.txt AC 12 ms 3676 KB
01-04.txt WA 20 ms 5296 KB
01-05.txt WA 17 ms 4928 KB
01-06.txt WA 20 ms 4352 KB
01-07.txt WA 18 ms 3712 KB
01-08.txt WA 18 ms 3968 KB
01-09.txt WA 17 ms 3968 KB
01-10.txt WA 23 ms 4352 KB
01-11.txt WA 24 ms 4864 KB
01-12.txt AC 12 ms 4468 KB
01-13.txt AC 13 ms 4468 KB
01-14.txt AC 11 ms 3676 KB
01-15.txt AC 23 ms 5232 KB
01-16.txt AC 20 ms 4096 KB
01-17.txt AC 19 ms 3840 KB
01-18.txt AC 20 ms 4352 KB
01-19.txt AC 21 ms 3968 KB
01-20.txt AC 28 ms 5888 KB
01-21.txt AC 11 ms 3656 KB
01-22.txt WA 14 ms 3968 KB
01-23.txt WA 14 ms 3840 KB
01-24.txt WA 14 ms 3968 KB
01-25.txt WA 16 ms 4096 KB
01-26.txt WA 16 ms 4096 KB
01-27.txt AC 14 ms 4352 KB
01-28.txt AC 4 ms 2816 KB
01-29.txt AC 3 ms 2688 KB
01-30.txt AC 3 ms 2688 KB
sample-01.txt AC 2 ms 2688 KB
sample-02.txt AC 2 ms 2688 KB