Submission #991931
Source Code Expand
#include <iostream> #include <iomanip> #include <cstdio> #include <algorithm> #include <numeric> #include <random> #include <vector> #include <array> #include <bitset> #include <set> #include <unordered_set> #include <map> #include <unordered_map> using namespace std; using ll = long long; using ull = unsigned long long; constexpr ll TEN(int n) { return (n==0) ? 1 : 10*TEN(n-1); } int bsr(int x) { return 31 - __builtin_clz(x); } const int MN = 100100; int main() { cout << setprecision(20); int n, m; cin >> n >> m; int co[MN] = {}; int ok[MN] = {}; map<int, int> mp; for (int i = 0; i < n; i++) { int x; cin >> x; co[x % m]++; mp[x]++; } for (auto p: mp) { ok[p.second % m] += p.first/2; } int sm = 0; sm += co[0]/2; if (m % 2 == 0) sm += co[m/2]/2; for (int l = 1; l < m; l++) { int r = m-l; if (l >= r) break; sm += min(co[l], co[r]); // cout << co[l] << " " << co[r] << " d " << l << endl; if (co[l] < co[r]) { int y = (co[r]-co[l])/2; sm += min(y, ok[r]); } else { int y = (co[l]-co[r])/2; sm += min(y, ok[l]); } } cout << sm << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Pair Cards |
User | yosupo |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1325 Byte |
Status | WA |
Exec Time | 68 ms |
Memory | 5760 KB |
Judge Result
Set Name | sample | all | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 1024 KB |
01-02.txt | AC | 60 ms | 3968 KB |
01-03.txt | AC | 60 ms | 3968 KB |
01-04.txt | AC | 60 ms | 3968 KB |
01-05.txt | AC | 59 ms | 3968 KB |
01-06.txt | WA | 59 ms | 3968 KB |
01-07.txt | WA | 59 ms | 3968 KB |
01-08.txt | WA | 59 ms | 3968 KB |
01-09.txt | WA | 59 ms | 3968 KB |
01-10.txt | WA | 60 ms | 3968 KB |
01-11.txt | WA | 60 ms | 3968 KB |
01-12.txt | WA | 30 ms | 1024 KB |
01-13.txt | WA | 31 ms | 1024 KB |
01-14.txt | AC | 67 ms | 5760 KB |
01-15.txt | WA | 67 ms | 5760 KB |
01-16.txt | WA | 67 ms | 5760 KB |
01-17.txt | WA | 68 ms | 5760 KB |
01-18.txt | WA | 67 ms | 5760 KB |
01-19.txt | WA | 67 ms | 5760 KB |
01-20.txt | WA | 67 ms | 5760 KB |
01-21.txt | AC | 39 ms | 1152 KB |
01-22.txt | AC | 39 ms | 1152 KB |
01-23.txt | AC | 39 ms | 1152 KB |
01-24.txt | WA | 39 ms | 1152 KB |
01-25.txt | WA | 39 ms | 1152 KB |
01-26.txt | WA | 39 ms | 1152 KB |
01-27.txt | AC | 33 ms | 3328 KB |
01-28.txt | WA | 5 ms | 1152 KB |
01-29.txt | AC | 3 ms | 1024 KB |
01-30.txt | AC | 3 ms | 1024 KB |
sample-01.txt | AC | 3 ms | 1024 KB |
sample-02.txt | AC | 3 ms | 1024 KB |