Submission #7562391
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define int long long #define rep(i,l,r) for(int i=(int)(l);i<(int)(r);i++) #define all(x) (x).begin(),(x).end() #define sz(x) ((int)x.size()) template<class T>bool chmax(T &a,T b){if(a<b){a=b;return 1;}return 0;} template<class T>bool chmin(T &a,T b){if(a>b){a=b;return 1;}return 0;} typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<vi> vvi; const int inf = 1LL<<60; const int mod = 1e9 + 7; const double eps = 1e-9; /*{ }*/ signed main(){ int n, m; cin >> n >> m; vi a(n); rep(i, 0, n) cin >> a[i]; vi cnt(100001); rep(i, 0, n){ cnt[a[i]]++; } vi cnt1(m+1), cnt2(m+1); rep(i, 0, 100001){ cnt1[i%m] += cnt[i]%2; cnt2[i%m] += cnt[i]/2; } // for(int i : cnt1) cout << i << " "; // cout << endl; // for(int i : cnt2) cout << i << " "; // cout << endl; int ans = 0; rep(i, 0, m){ int t = min(cnt1[i], cnt1[m-i]); cnt1[i] -= t; cnt1[m-i] -= t; ans += t; } rep(i, 0, m){ int t = min(cnt1[i]/2, cnt2[m-i]); cnt2[m-i] -= t; ans += 2*t; } rep(i, 0, m){ ans += cnt2[i]; } cout << ans << endl; // for(int i : cnt1) cout << i << " "; // cout << endl; // for(int i : cnt2) cout << i << " "; // cout << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Pair Cards |
User | yuto953 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1346 Byte |
Status | WA |
Exec Time | 33 ms |
Memory | 3328 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, sample-01.txt, sample-02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | WA | 4 ms | 1024 KB |
01-02.txt | WA | 31 ms | 1792 KB |
01-03.txt | WA | 31 ms | 1792 KB |
01-04.txt | WA | 31 ms | 1792 KB |
01-05.txt | WA | 31 ms | 1792 KB |
01-06.txt | WA | 31 ms | 1792 KB |
01-07.txt | WA | 31 ms | 1792 KB |
01-08.txt | WA | 31 ms | 1792 KB |
01-09.txt | WA | 31 ms | 1792 KB |
01-10.txt | AC | 32 ms | 2432 KB |
01-11.txt | WA | 33 ms | 3328 KB |
01-12.txt | AC | 32 ms | 1792 KB |
01-13.txt | AC | 32 ms | 2560 KB |
01-14.txt | WA | 31 ms | 1792 KB |
01-15.txt | WA | 31 ms | 1792 KB |
01-16.txt | WA | 31 ms | 1792 KB |
01-17.txt | WA | 31 ms | 1792 KB |
01-18.txt | WA | 31 ms | 1920 KB |
01-19.txt | WA | 31 ms | 2048 KB |
01-20.txt | WA | 33 ms | 3328 KB |
01-21.txt | WA | 31 ms | 1792 KB |
01-22.txt | WA | 31 ms | 1792 KB |
01-23.txt | WA | 31 ms | 1792 KB |
01-24.txt | AC | 31 ms | 1792 KB |
01-25.txt | AC | 32 ms | 2304 KB |
01-26.txt | AC | 32 ms | 3328 KB |
01-27.txt | WA | 18 ms | 2944 KB |
01-28.txt | AC | 6 ms | 2560 KB |
01-29.txt | AC | 4 ms | 1664 KB |
01-30.txt | AC | 5 ms | 2560 KB |
sample-01.txt | AC | 4 ms | 1024 KB |
sample-02.txt | AC | 4 ms | 1024 KB |