Submission #993286


Source Code Expand

#include <cstdio>
#include <climits>
#include <iostream>
#include <string>
#include <algorithm>
#include <numeric>
#include <functional>
#include <tuple>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <vector>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)

using namespace std;
typedef long long ll;
typedef pair<int,int> PI;
typedef pair<ll,ll> PL;
typedef vector<int> VI;
typedef vector<ll> VL;

int main() {
  int N, M;
  cin >> N >> M;
  VI vx(N);
  VI mod(M,0);
  VI pr(M,0);
  for(auto &x : vx) {
    cin >> x;
  }
  sort(vx.begin(), vx.end());
  int prvx = -1;
  for(auto &x : vx) {
    mod[x % M]++;
    if(prvx == x) {
      pr[x % M]++;
      prvx = -1;
    } else {
      prvx = x;
    }
  }
  ll ans = 0;
  ans += mod[0] / 2;
  if(M % 2 == 0) {
    ans += mod[M/2] / 2;
  }
  REP(i,1,(M-1)/2) {
    while(true) {
      if(mod[i] > mod[M-i] + 1) {
        if(pr[i]) {
          mod[i] -= 2;
          pr[i]--;
          ans++;
        }
      } else if (mod[M-i] > mod[i] + 1) {
        if(pr[M-i]) {
          mod[M-i] -= 2;
          pr[M-i]--;
          ans++;
        }
      } else {
        ans += min(mod[i], mod[M-i]);
        break;
      }
    }
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Submission Time
Task D - Pair Cards
User minus3theta
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1331 Byte
Status WA
Exec Time 2102 ms
Memory 1408 KB

Judge Result

Set Name sample all
Score / Max Score 0 / 0 0 / 700
Status
AC × 1
WA × 1
AC × 12
WA × 16
TLE × 4
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
Case Name Status Exec Time Memory
01-01.txt AC 3 ms 256 KB
01-02.txt AC 37 ms 640 KB
01-03.txt AC 37 ms 640 KB
01-04.txt WA 37 ms 640 KB
01-05.txt WA 37 ms 640 KB
01-06.txt WA 37 ms 640 KB
01-07.txt WA 37 ms 640 KB
01-08.txt WA 37 ms 640 KB
01-09.txt WA 37 ms 640 KB
01-10.txt TLE 2102 ms 896 KB
01-11.txt WA 39 ms 1408 KB
01-12.txt AC 32 ms 640 KB
01-13.txt AC 33 ms 1024 KB
01-14.txt AC 37 ms 640 KB
01-15.txt WA 36 ms 640 KB
01-16.txt WA 36 ms 640 KB
01-17.txt WA 37 ms 640 KB
01-18.txt WA 36 ms 640 KB
01-19.txt WA 37 ms 768 KB
01-20.txt WA 37 ms 1408 KB
01-21.txt AC 36 ms 640 KB
01-22.txt WA 35 ms 640 KB
01-23.txt WA 36 ms 640 KB
01-24.txt TLE 2102 ms 640 KB
01-25.txt TLE 2102 ms 896 KB
01-26.txt AC 37 ms 1408 KB
01-27.txt AC 20 ms 1280 KB
01-28.txt AC 5 ms 1024 KB
01-29.txt TLE 2102 ms 512 KB
01-30.txt AC 4 ms 1024 KB
sample-01.txt WA 3 ms 256 KB
sample-02.txt AC 3 ms 256 KB