Submission #992174


Source Code Expand

#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
  int N, M; scanf("%d%d", &N, &M);
  vector<vector<int>> holes(M);
  for(int i = 0; i < N; ++i) {
    int X; scanf("%d", &X);
    holes[X % M].push_back(X);
  }
  vector<int> dups(M);
  for(int i = 0; i < M; ++i) {
    sort(holes[i].begin(), holes[i].end());
    int dup = 0;
    for(int j = 1; j < (int)holes[i].size(); ++j) {
      if(holes[i][j-1] == holes[i][j]) {
        ++dup;
        ++j;
      }
    }
    dups[i] = dup;
  }
  int numpairs = 0;
  for(int i = 1; i * 2 < M; ++i) {
    int x = holes[i].size();
    int y = holes[M-i].size();
    if(x > y) {
      numpairs += y + min((x - y) / 2, dups[i]);
    } else {
      numpairs += x + min((y - x) / 2, dups[M-i]);
    }
  }
  numpairs += holes[0].size() / 2;
  if(M % 2 == 0) numpairs += holes[M/2].size() / 2;
  printf("%d\n", numpairs);
  return 0;
}

Submission Info

Submission Time
Task D - Pair Cards
User qnighy
Language C++14 (GCC 5.4.1)
Score 700
Code Size 948 Byte
Status AC
Exec Time 26 ms
Memory 6144 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:7:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   int N, M; scanf("%d%d", &N, &M);
                                  ^
./Main.cpp:10:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     int X; scanf("%d", &X);
                           ^

Judge Result

Set Name sample all
Score / Max Score 0 / 0 700 / 700
Status
AC × 2
AC × 32
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 2 ms 256 KB
01-02.txt AC 19 ms 892 KB
01-03.txt AC 19 ms 892 KB
01-04.txt AC 19 ms 896 KB
01-05.txt AC 19 ms 768 KB
01-06.txt AC 18 ms 896 KB
01-07.txt AC 18 ms 768 KB
01-08.txt AC 17 ms 896 KB
01-09.txt AC 18 ms 896 KB
01-10.txt AC 23 ms 2560 KB
01-11.txt AC 26 ms 4992 KB
01-12.txt AC 15 ms 892 KB
01-13.txt AC 16 ms 1916 KB
01-14.txt AC 19 ms 788 KB
01-15.txt AC 18 ms 896 KB
01-16.txt AC 17 ms 1024 KB
01-17.txt AC 17 ms 768 KB
01-18.txt AC 18 ms 1152 KB
01-19.txt AC 20 ms 1280 KB
01-20.txt AC 26 ms 6144 KB
01-21.txt AC 18 ms 768 KB
01-22.txt AC 17 ms 768 KB
01-23.txt AC 16 ms 896 KB
01-24.txt AC 16 ms 896 KB
01-25.txt AC 19 ms 1792 KB
01-26.txt AC 21 ms 3712 KB
01-27.txt AC 16 ms 4480 KB
01-28.txt AC 7 ms 3072 KB
01-29.txt AC 4 ms 1280 KB
01-30.txt AC 6 ms 2944 KB
sample-01.txt AC 2 ms 256 KB
sample-02.txt AC 2 ms 256 KB