Submission #993742
Source Code Expand
#include <string> #include <queue> #include <stack> #include <vector> #include <sstream> #include <algorithm> #include <deque> #include <set> #include <map> #include <unordered_set> #include <unordered_map> #include <list> #include <cstdio> #include <iostream> #include <cmath> #include <climits> #include <bitset> #include <functional> #include <numeric> #include <ctime> #include <cassert> #include <cstring> #include <fstream> #define FOR(i, a, b) for(int (i)=(a); (i)<(b); (i)++) #define IFOR(i, a, b) for(int (i)=(a);(i)<=(b);(i)++) #define RFOR(i, a, b) for(int (i)=(a);(i)>=(b);(i)--) using namespace std; int main() { int n, m; cin >> n >> m; map<int, int> num; FOR(i, 0, n) { int tmp; cin >> tmp; num[tmp]++; } vector<int> mod(m, 0); vector<int> odd(m, 0); for (auto t : num) { mod[t.first%m] += t.second; if (t.second % 2) { odd[t.first%m]++; } } int cnt = 0; FOR(i, 0, m) { if (i == 0 || i * 2 == m) continue; int toadd = min(mod[i], mod[(m - i) % m]); cnt += toadd; odd[i] -= toadd, odd[(m - i) % m] -= toadd; mod[i] -= toadd, mod[(m - i) % m] -= toadd; } FOR(i, 0, m) { if (i == 0 || i * 2 == m) { cnt += mod[i] / 2; } else { if (odd[i] <= 0) { cnt += mod[i] / 2; } else { cnt += (mod[i] - odd[i]) / 2; } } } cout << cnt << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Pair Cards |
User | peradfn1126 |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1411 Byte |
Status | AC |
Exec Time | 70 ms |
Memory | 5760 KB |
Judge Result
Set Name | sample | all | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 700 | ||||
Status |
|
|
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 | 384 KB |
01-02.txt | AC | 60 ms | 3200 KB |
01-03.txt | AC | 61 ms | 3200 KB |
01-04.txt | AC | 60 ms | 3200 KB |
01-05.txt | AC | 61 ms | 3200 KB |
01-06.txt | AC | 60 ms | 3200 KB |
01-07.txt | AC | 61 ms | 3200 KB |
01-08.txt | AC | 60 ms | 3200 KB |
01-09.txt | AC | 60 ms | 3200 KB |
01-10.txt | AC | 61 ms | 3584 KB |
01-11.txt | AC | 62 ms | 3968 KB |
01-12.txt | AC | 31 ms | 256 KB |
01-13.txt | AC | 31 ms | 640 KB |
01-14.txt | AC | 68 ms | 4992 KB |
01-15.txt | AC | 68 ms | 4992 KB |
01-16.txt | AC | 69 ms | 4992 KB |
01-17.txt | AC | 68 ms | 4992 KB |
01-18.txt | AC | 68 ms | 4992 KB |
01-19.txt | AC | 68 ms | 4992 KB |
01-20.txt | AC | 70 ms | 5760 KB |
01-21.txt | AC | 39 ms | 384 KB |
01-22.txt | AC | 39 ms | 384 KB |
01-23.txt | AC | 39 ms | 384 KB |
01-24.txt | AC | 39 ms | 384 KB |
01-25.txt | AC | 40 ms | 640 KB |
01-26.txt | AC | 41 ms | 1152 KB |
01-27.txt | AC | 35 ms | 3456 KB |
01-28.txt | AC | 6 ms | 1152 KB |
01-29.txt | AC | 4 ms | 640 KB |
01-30.txt | AC | 5 ms | 1024 KB |
sample-01.txt | AC | 3 ms | 256 KB |
sample-02.txt | AC | 3 ms | 256 KB |