Submission #7562755
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]; vector<multiset<int>> cnt(m); rep(i, 0, n){ cnt[a[i]%m].insert(a[i]); } int ans = sz(cnt[0])/2; rep(i, 1, m/2+1){ // cout << i-1 << " " << ans << endl; if(m%2 == 0 and i == m/2){ ans += sz(cnt[m/2])/2; continue; } int t = sz(cnt[i]) - sz(cnt[m-i]); if(t < 0){ t = -t; swap(cnt[i], cnt[m-i]); } ans += sz(cnt[m-i]); int k = 2, prev = -1; for(int j : cnt[i]){ if(k > t) break; if(prev == j){ ans += 1; k += 2; prev = -1; }else{ prev = j; } } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Pair Cards |
User | yuto953 |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1268 Byte |
Status | AC |
Exec Time | 62 ms |
Memory | 10368 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 | 1 ms | 256 KB |
01-02.txt | AC | 60 ms | 5760 KB |
01-03.txt | AC | 59 ms | 5760 KB |
01-04.txt | AC | 59 ms | 5760 KB |
01-05.txt | AC | 59 ms | 5760 KB |
01-06.txt | AC | 59 ms | 5760 KB |
01-07.txt | AC | 58 ms | 5760 KB |
01-08.txt | AC | 54 ms | 5760 KB |
01-09.txt | AC | 57 ms | 5760 KB |
01-10.txt | AC | 45 ms | 7552 KB |
01-11.txt | AC | 43 ms | 10368 KB |
01-12.txt | AC | 54 ms | 5760 KB |
01-13.txt | AC | 56 ms | 7808 KB |
01-14.txt | AC | 60 ms | 5760 KB |
01-15.txt | AC | 59 ms | 5760 KB |
01-16.txt | AC | 57 ms | 5760 KB |
01-17.txt | AC | 54 ms | 5760 KB |
01-18.txt | AC | 50 ms | 5888 KB |
01-19.txt | AC | 46 ms | 6272 KB |
01-20.txt | AC | 41 ms | 10368 KB |
01-21.txt | AC | 62 ms | 5760 KB |
01-22.txt | AC | 62 ms | 5760 KB |
01-23.txt | AC | 62 ms | 5760 KB |
01-24.txt | AC | 56 ms | 5760 KB |
01-25.txt | AC | 55 ms | 7168 KB |
01-26.txt | AC | 55 ms | 10368 KB |
01-27.txt | AC | 21 ms | 7680 KB |
01-28.txt | AC | 4 ms | 5120 KB |
01-29.txt | AC | 2 ms | 2176 KB |
01-30.txt | AC | 3 ms | 4992 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |