Submission #992230
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define sz(x) ((int) (x).size()) #define forn(i,n) for (int i = 0; i < int(n); ++i) typedef long long ll; typedef long long i64; typedef long double ld; const int inf = int(1e9) + int(1e5); const ll infl = ll(2e18) + ll(1e10); const int maxn = 100100; vector<int> v[maxn]; int calc(vector<int> v) { int res = 0; forn (i, sz(v) - 1) { if (v[i] == v[i + 1]) { ++res; ++i; } } return res; } int main() { #ifdef LOCAL assert(freopen("d.in", "r", stdin)); #else #endif int n, m; cin >> n >> m; forn (i, n) { int x; cin >> x; v[x % m].push_back(x); } forn (i, m) sort(v[i].begin(), v[i].end()); int res = 0; for (int i = 0; i * 2 <= m; ++i) { if (i * 2 == m || i == 0) { res += sz(v[i]) / 2; continue; } int a = calc(v[i]); int b = calc(v[m - i]); int sa = sz(v[i]); int sb = sz(v[m - i]); int cur = min(sa, sb); sa -= cur, sb -= cur; cur += min(sa / 2, a); cur += min(sb / 2, b); res += cur; } cout << res << '\n'; }
Submission Info
Submission Time | |
---|---|
Task | D - Pair Cards |
User | zemen |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1269 Byte |
Status | AC |
Exec Time | 55 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 | 5 ms | 2560 KB |
01-02.txt | AC | 44 ms | 3196 KB |
01-03.txt | AC | 44 ms | 3196 KB |
01-04.txt | AC | 44 ms | 3200 KB |
01-05.txt | AC | 43 ms | 3200 KB |
01-06.txt | AC | 43 ms | 3200 KB |
01-07.txt | AC | 43 ms | 3072 KB |
01-08.txt | AC | 42 ms | 3200 KB |
01-09.txt | AC | 42 ms | 3200 KB |
01-10.txt | AC | 49 ms | 3840 KB |
01-11.txt | AC | 52 ms | 4608 KB |
01-12.txt | AC | 41 ms | 3448 KB |
01-13.txt | AC | 41 ms | 3448 KB |
01-14.txt | AC | 44 ms | 3092 KB |
01-15.txt | AC | 43 ms | 3200 KB |
01-16.txt | AC | 42 ms | 3328 KB |
01-17.txt | AC | 41 ms | 3072 KB |
01-18.txt | AC | 42 ms | 3456 KB |
01-19.txt | AC | 44 ms | 3328 KB |
01-20.txt | AC | 55 ms | 5760 KB |
01-21.txt | AC | 43 ms | 3200 KB |
01-22.txt | AC | 42 ms | 3072 KB |
01-23.txt | AC | 41 ms | 3200 KB |
01-24.txt | AC | 40 ms | 3200 KB |
01-25.txt | AC | 42 ms | 3328 KB |
01-26.txt | AC | 41 ms | 3328 KB |
01-27.txt | AC | 28 ms | 4096 KB |
01-28.txt | AC | 7 ms | 2688 KB |
01-29.txt | AC | 6 ms | 2560 KB |
01-30.txt | AC | 6 ms | 2560 KB |
sample-01.txt | AC | 5 ms | 2560 KB |
sample-02.txt | AC | 5 ms | 2560 KB |