Submission #993670
Source Code Expand
#include <algorithm> #include <cmath> #include <cstdio> #include <cstdlib> #include <cstring> #include <iostream> #include <map> #include <queue> #include <set> #include <sstream> #include <string> #include <vector> using namespace std; using ll = long long; #define all(c) (c).begin(), (c).end() #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define pb(e) push_back(e) #define mp(a, b) make_pair(a, b) #define fr first #define sc second const ll INF = 1e9; const ll MOD = 1e9 + 7; int dx[4] = {1, 0, -1, 0}; int dy[4] = {0, 1, 0, -1}; int N, M; int X[100005]; int cnt[100005]; int mod[100005]; int pena[100005]; int main() { cin >> N >> M; rep(i, N) cin >> X[i]; rep(i, N) cnt[X[i]]++; rep(i, N) mod[X[i] % M]++; int ans = 0; rep(i, M / 2 + 1) { int a = min(mod[i], mod[M - i]); ans += a; pena[i] = pena[M - i] = a; } rep(i, 100005) { int a = cnt[i] - pena[i%M]; if (a > 0) ans += a / 2; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Pair Cards |
User | odan |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1074 Byte |
Status | WA |
Exec Time | 37 ms |
Memory | 1792 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 | WA | 3 ms | 256 KB |
01-02.txt | WA | 36 ms | 1024 KB |
01-03.txt | WA | 36 ms | 1024 KB |
01-04.txt | WA | 36 ms | 1024 KB |
01-05.txt | WA | 36 ms | 1024 KB |
01-06.txt | WA | 36 ms | 1024 KB |
01-07.txt | WA | 36 ms | 1024 KB |
01-08.txt | WA | 36 ms | 1024 KB |
01-09.txt | WA | 36 ms | 1024 KB |
01-10.txt | WA | 37 ms | 1280 KB |
01-11.txt | WA | 37 ms | 1792 KB |
01-12.txt | AC | 37 ms | 640 KB |
01-13.txt | AC | 37 ms | 768 KB |
01-14.txt | AC | 36 ms | 1024 KB |
01-15.txt | WA | 36 ms | 1024 KB |
01-16.txt | WA | 36 ms | 1024 KB |
01-17.txt | WA | 36 ms | 1024 KB |
01-18.txt | WA | 36 ms | 1024 KB |
01-19.txt | WA | 36 ms | 1152 KB |
01-20.txt | WA | 37 ms | 1792 KB |
01-21.txt | WA | 36 ms | 1024 KB |
01-22.txt | WA | 37 ms | 1024 KB |
01-23.txt | WA | 36 ms | 1024 KB |
01-24.txt | WA | 36 ms | 1024 KB |
01-25.txt | WA | 37 ms | 1280 KB |
01-26.txt | AC | 37 ms | 1792 KB |
01-27.txt | WA | 20 ms | 1280 KB |
01-28.txt | AC | 5 ms | 1408 KB |
01-29.txt | AC | 4 ms | 896 KB |
01-30.txt | AC | 4 ms | 768 KB |
sample-01.txt | AC | 3 ms | 256 KB |
sample-02.txt | AC | 3 ms | 256 KB |