Submission #10351125
Source Code Expand
#include <bits/stdc++.h> // clang-format off
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define each(x,v) for(auto& x : v)
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
#ifdef ONLINE_JUDGE
#define rep(i,N) for(int i = 0; i < (int)(N); i++)
#define repr(i,N) for(int i = (int)(N) - 1; i >= 0; i--)
#define rep1(i,N) for(int i = 1; i <= (int)(N) ; i++)
#define repr1(i,N) for(int i = (N) ; (int)(i) > 0 ; i--)
#else
#define rep(i,N) for(long long i = 0; i < (long long)(N); i++)
#define repr(i,N) for(long long i = (long long)(N) - 1; i >= 0; i--)
#define rep1(i,N) for(long long i = 1; i <= (long long)(N) ; i++)
#define repr1(i,N) for(long long i = (N) ; (long long)(i) > 0 ; i--)
#endif
using namespace std; void solve();
using ll = long long; template<class T = ll> using V = vector<T>;
using vi = V<int>; using vl = V<>; using vvi = V< V<int> >;
constexpr int inf = 1001001001; constexpr ll infLL = (1LL << 61) - 1;
struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya;
template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; }
template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); for(int i=0;i<s;i++) os << (i ? " " : "") << v[i]; return os; }
template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; }
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
template<typename T>void die(T x){out(x); exit(0);}
#ifdef NyaanDebug
#include "NyaanDebug.h"
#define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0)
#define trca(v,N) do { cerr << #v << " = "; array_out(v , N);} while(0)
#define trcc(v) do { cerr << "name : " << #v << "\n"; int cnt = 0; each(x , v){cerr << (cnt++) << " : "; trc(x); } } while(0)
#else
#define trc(...)
#define trca(...)
#define trcc(...)
int main(){solve();}
#endif
#define inc(...) char __VA_ARGS__; in(__VA_ARGS__)
#define in2(s,t) rep(i,sz(s)){in(s[i] , t[i]);}
#define in3(s,t,u) rep(i,sz(s)){in(s[i] , t[i] , u[i]);}
using vd = V<double>; using vs = V<string>; using vvl = V< V<> >;
template<typename T,typename U>ll ceil(T a,U b){return (a + b - 1) / b;}
using P = pair<int,int>; using vp = V<P>;
constexpr int MOD = /**/ 1000000007; //*/ 998244353;
// clang-format on
///////////////////////////////////////////////////////////
void solve(){
ini(N , M);
vi A(N); in(A);
vi cnt(100001);
each(x , A) cnt[x]++;
rep1(i,10)trc(cnt[i]);
map<int , vi> m;
rep1(i , 100000){
if(cnt[i] == 0){}
else if(cnt[i] == 1 || cnt[i] % 2 == 0)
m[i % M].pb(cnt[i]);
else{
m[i % M].pb(1);
m[i % M].pb(cnt[i] - 1);
}
}
each(x , m) sort(all(x.second));
trcc(m);
int ans = 0;
// 0 と M / 2は特殊
auto f = [&](vi& v) -> int{
int ret = 0;
each(x , v) ret += x , x = 0;
return ret / 2;
};
if(m.find(0) != m.end()) ans += f(m.find(0)->second);
trc(ans);
if(M % 2 == 0 && m.find(M / 2) != m.end()) ans += f(m.find(M / 2)->second);
trc(ans);
// rem = 1以上 M/2未満
for(int rem = 1 ; rem * 2 < M ; rem++){
auto it = m.find(rem);
if(it == m.end()) continue;
auto jt = m.find(M - rem);
if(jt == m.end()) continue;
// 前からやる
auto kt = it->second.begin();
auto lt = jt->second.begin();
while(kt != it->second.end() && lt != jt->second.end()){
int val = min(*kt , *lt);
*kt -= val , *lt -= val , ans += val;
if(*kt == 0)kt++;
if(*lt == 0)lt++;
}
trc(rem , ans);
}
trcc(m);
each(p , m){
each(x , p.second) ans += x / 2;
}
out(ans);
}
Submission Info
Submission Time |
|
Task |
D - Pair Cards |
User |
Nyaan |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
4650 Byte |
Status |
AC |
Exec Time |
57 ms |
Memory |
12032 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 |
640 KB |
01-02.txt |
AC |
12 ms |
1660 KB |
01-03.txt |
AC |
12 ms |
1536 KB |
01-04.txt |
AC |
13 ms |
1536 KB |
01-05.txt |
AC |
13 ms |
1536 KB |
01-06.txt |
AC |
13 ms |
1408 KB |
01-07.txt |
AC |
13 ms |
1408 KB |
01-08.txt |
AC |
16 ms |
1536 KB |
01-09.txt |
AC |
17 ms |
1792 KB |
01-10.txt |
AC |
28 ms |
4992 KB |
01-11.txt |
AC |
37 ms |
7936 KB |
01-12.txt |
AC |
9 ms |
1024 KB |
01-13.txt |
AC |
9 ms |
1024 KB |
01-14.txt |
AC |
13 ms |
1660 KB |
01-15.txt |
AC |
13 ms |
1736 KB |
01-16.txt |
AC |
13 ms |
1792 KB |
01-17.txt |
AC |
15 ms |
1536 KB |
01-18.txt |
AC |
18 ms |
2176 KB |
01-19.txt |
AC |
22 ms |
3072 KB |
01-20.txt |
AC |
57 ms |
12032 KB |
01-21.txt |
AC |
10 ms |
1152 KB |
01-22.txt |
AC |
10 ms |
1024 KB |
01-23.txt |
AC |
10 ms |
1024 KB |
01-24.txt |
AC |
11 ms |
1152 KB |
01-25.txt |
AC |
11 ms |
1408 KB |
01-26.txt |
AC |
11 ms |
1408 KB |
01-27.txt |
AC |
34 ms |
6272 KB |
01-28.txt |
AC |
3 ms |
1024 KB |
01-29.txt |
AC |
2 ms |
768 KB |
01-30.txt |
AC |
2 ms |
640 KB |
sample-01.txt |
AC |
1 ms |
640 KB |
sample-02.txt |
AC |
1 ms |
640 KB |