Submission #1451303
Source Code Expand
#include <cstdio> #include <iostream> #include <algorithm> #include <string> #include <cstring> #include <vector> #include <queue> #include <set> #include <map> #include <cmath> #include <iomanip> using namespace std; typedef pair<int, int> P; #define rep(i, n) for (int i=0; i<(n); i++) #define all(c) (c).begin(), (c).end() #define uniq(c) c.erase(unique(all(c)), (c).end()) #define _1 first #define _2 second #define pb push_back #define INF 1145141919 #define MOD 1000000007 int N, M; int C[100001]; int T[100000]; int G[100000]; signed main() { ios::sync_with_stdio(false); cin.tie(0); cin >> N >> M; rep(i, N) { int x; cin >> x; C[x]++; T[x%M]++; } rep(x, 100001) { G[x%M] += C[x]/2; } int sum = 0; // 0, M/2 rep(x, M) { if ((x+x)%M != 0) continue; sum += T[x]/2; T[x] %= 2; } // x, y rep(x, M) { int y = (M-x)%M; if (x == y) continue; int s = min(T[x], T[y]); T[x] -= s; T[y] -= s; sum += s; } rep(x, M) { sum += min(T[x]/2, G[x]); } cout << sum << "\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Pair Cards |
User | funcsr |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1137 Byte |
Status | AC |
Exec Time | 11 ms |
Memory | 1408 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, sample-01.txt, sample-02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 2 ms | 256 KB |
01-02.txt | AC | 10 ms | 640 KB |
01-03.txt | AC | 10 ms | 640 KB |
01-04.txt | AC | 10 ms | 640 KB |
01-05.txt | AC | 10 ms | 640 KB |
01-06.txt | AC | 10 ms | 640 KB |
01-07.txt | AC | 10 ms | 640 KB |
01-08.txt | AC | 10 ms | 640 KB |
01-09.txt | AC | 10 ms | 640 KB |
01-10.txt | AC | 10 ms | 1024 KB |
01-11.txt | AC | 11 ms | 1408 KB |
01-12.txt | AC | 10 ms | 256 KB |
01-13.txt | AC | 10 ms | 640 KB |
01-14.txt | AC | 10 ms | 640 KB |
01-15.txt | AC | 10 ms | 640 KB |
01-16.txt | AC | 10 ms | 640 KB |
01-17.txt | AC | 10 ms | 640 KB |
01-18.txt | AC | 10 ms | 640 KB |
01-19.txt | AC | 10 ms | 768 KB |
01-20.txt | AC | 11 ms | 1408 KB |
01-21.txt | AC | 10 ms | 640 KB |
01-22.txt | AC | 10 ms | 640 KB |
01-23.txt | AC | 9 ms | 640 KB |
01-24.txt | AC | 10 ms | 640 KB |
01-25.txt | AC | 10 ms | 896 KB |
01-26.txt | AC | 11 ms | 1408 KB |
01-27.txt | AC | 7 ms | 1280 KB |
01-28.txt | AC | 3 ms | 1408 KB |
01-29.txt | AC | 2 ms | 1024 KB |
01-30.txt | AC | 3 ms | 1024 KB |
sample-01.txt | AC | 2 ms | 256 KB |
sample-02.txt | AC | 2 ms | 256 KB |