Submission #992648
Source Code Expand
#include <iostream> #include <iomanip> #include <algorithm> #include <string> #include <vector> #include <map> #include <set> #include <cstdio> #include <cstring> using namespace std; int main() { cin.tie(0); int n, m; cin >> n >> m; vector<int> xs(n); for (auto &x: xs) cin >> x; vector<vector<int>> bkt(m); for (auto &x: xs) { bkt[x % m].push_back(x); } for (auto &b: bkt) { sort(b.begin(), b.end()); } int ans = 0; for (int i = 0; i < m; i++) { int j = (m - i) % m; if (i > j) continue; if (i == j) { ans += bkt[i].size() / 2; continue; } int p = 0; for (int k = 0; k + 1 < bkt[i].size(); k++) { if (bkt[i][k] == bkt[i][k + 1]) { p++; k++; } } int q = 0; for (int k = 0; k + 1 < bkt[j].size(); k++) { if (bkt[j][k] == bkt[j][k + 1]) { q++; k++; } } int is = bkt[i].size(); int js = bkt[j].size(); if (is > js) { swap(is, js); swap(p, q); } int sel = min((js - is) / 2, q); ans += sel; js -= sel * 2; ans += min(is, js); } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Pair Cards |
User | tanakh |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1442 Byte |
Status | AC |
Exec Time | 42 ms |
Memory | 6144 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 | 256 KB |
01-02.txt | AC | 38 ms | 1276 KB |
01-03.txt | AC | 36 ms | 1276 KB |
01-04.txt | AC | 37 ms | 1280 KB |
01-05.txt | AC | 35 ms | 1152 KB |
01-06.txt | AC | 35 ms | 1280 KB |
01-07.txt | AC | 34 ms | 1152 KB |
01-08.txt | AC | 33 ms | 1280 KB |
01-09.txt | AC | 34 ms | 1280 KB |
01-10.txt | AC | 41 ms | 2816 KB |
01-11.txt | AC | 42 ms | 4992 KB |
01-12.txt | AC | 32 ms | 1276 KB |
01-13.txt | AC | 33 ms | 2300 KB |
01-14.txt | AC | 36 ms | 1172 KB |
01-15.txt | AC | 35 ms | 1280 KB |
01-16.txt | AC | 35 ms | 1408 KB |
01-17.txt | AC | 33 ms | 1152 KB |
01-18.txt | AC | 34 ms | 1536 KB |
01-19.txt | AC | 36 ms | 1664 KB |
01-20.txt | AC | 42 ms | 6144 KB |
01-21.txt | AC | 35 ms | 1216 KB |
01-22.txt | AC | 34 ms | 1152 KB |
01-23.txt | AC | 33 ms | 1280 KB |
01-24.txt | AC | 32 ms | 1280 KB |
01-25.txt | AC | 34 ms | 2048 KB |
01-26.txt | AC | 37 ms | 3840 KB |
01-27.txt | AC | 24 ms | 4352 KB |
01-28.txt | AC | 7 ms | 2688 KB |
01-29.txt | AC | 4 ms | 1152 KB |
01-30.txt | AC | 6 ms | 2560 KB |
sample-01.txt | AC | 3 ms | 256 KB |
sample-02.txt | AC | 3 ms | 256 KB |