Submission #7920474
Source Code Expand
#include<bits/stdc++.h>
using namespace std;using ll=long long;using vi=vector<int>;using vvi=vector<vi>;using vl=vector<ll>;using vvl=vector<vl>;using P=pair<int,int>;using PL=pair<ll,ll>;using vp=vector<P>;using vpl=vector<PL>;
template<typename T>constexpr auto inf=numeric_limits<T>::max()/2;constexpr int INF=inf<int>,MOD=1000000007;constexpr ll LINF=inf<ll>;
#define _ol3(_1,_2,_3,name,...)name
#define _rep(i,n)_repi(i,0,n)
#define _repi(i,a,b)for(int i=a,i##_l=(b);i<i##_l;++i)
#define REP(...)_ol3(__VA_ARGS__,_repi,_rep,)(__VA_ARGS__)
#define REPR(i,n)for(int i=n-1;i>=0;--i)
#define REPA(i,v)REP(i,(v).size())
#define all(v)(v).begin(),(v).end()
#define rall(v)(v).rbegin(),(v).rend()
#define bit(n)(1ll<<(n))
#define F first
#define S second
#define endl '\n'
#define cho(n,a,b)cout<<((n)?a:b)<<endl
void YES(int n){cho(n,"YES","NO");}void Yes(int n){cho(n,"Yes","No");}void Poss(int n){cho(n,"Possible","Impossible");}
void _print(ostream&){}template<class T,class...U>void _print(ostream&s,const T&t,const U&...u){s<<t<<(sizeof...(u)?' ':'\n');_print(s,u...);}
template<class...T>void print(const T&...t){_print(cout,t...);}template<class...T>void dprint(const T&...t){_print(cerr,t...);}
#ifndef LOCAL
struct osd{template<class T>osd&operator<<(const T&t){return*this;}};osd cer_;
#define dprint(...)
#define cerr cer_
#endif
template<class T>bool chmax(T&a,const T&b){bool x=a<b;x?a=b:b;return x;}template<class T>bool chmin(T&a,const T&b){bool x=a>b;x?a=b:b;return x;}
template<class T,class U>ostream&operator<<(ostream&o,const pair<T,U>&p){return o<<p.F<<' '<<p.S;}
template<class T,class U>istream&operator>>(istream&i,pair<T,U>&p){return i>>p.F>>p.S;}
template<class T>class iterable{static false_type c(string v);template<class U>static auto c(U v)->decltype(all(v),true_type());static false_type c(...);public:const static bool value=decltype(c(declval<T>()))::value;};
template<class T,typename=enable_if_t<iterable<T>::value>>ostream&operator<<(ostream&o,const T&v){for(auto&&i:v)o<<i<<' ';return o;}
template<class T>istream&operator>>(istream&i,vector<T>&v){for(T&j:v)i>>j;return i;}
template<class T>vector<T>&operator<<(vector<T>&v,const T&t){v.push_back(t);return v;}
template<class T>set<T>&operator<<(set<T>&v,const T&t){v.insert(t);return v;}
template<class T>multiset<T>&operator<<(multiset<T>&v,const T&t){v.insert(t);return v;}
int m;
map<int,int> mp;
map<int,int> mq;
ll dfs(int num){
if(num==-1){
dprint("remain:", mp);
dprint("mod :", mq);
ll ret=0;
ret+=mq[0]/2;
if(m%2==0)ret+=mq[m/2]/2;
REP(i,1,(m+1)/2){
ret+=min(mq[i], mq[m-i]);
}
return ret;
}else{
ll ret=0;
int mpnum=mp[num];
int mqnum=mq[num%m];
auto iter=next(mp.find(num));
int nxt=(iter==mp.end()?-1:iter->F);
REP(i,mpnum/2+1){
dprint(num, ":", i*2);
chmax(ret, dfs(nxt) + i);
mp[num]-=2;
mq[num%m]-=2;
}
mp[num]=mpnum;
mq[num%m]=mqnum;
return ret;
}
}
int main(){
cin.tie(0);ios::sync_with_stdio(0);
cout<<setprecision(10);
int n;
cin>>n>>m;
vi x(n);
cin>>x;
REP(i,n){
++mp[x[i]];
++mq[x[i]%m];
}
dprint(mp);
cout<<dfs(mp.begin()->F)<<endl;
}
Submission Info
Submission Time |
|
Task |
D - Pair Cards |
User |
ibuki2003 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
3413 Byte |
Status |
TLE |
Exec Time |
2104 ms |
Memory |
20992 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 |
AC |
1 ms |
256 KB |
01-02.txt |
TLE |
2104 ms |
10496 KB |
01-03.txt |
TLE |
2104 ms |
10496 KB |
01-04.txt |
TLE |
2104 ms |
10496 KB |
01-05.txt |
TLE |
2104 ms |
10496 KB |
01-06.txt |
TLE |
2104 ms |
10496 KB |
01-07.txt |
TLE |
2104 ms |
10496 KB |
01-08.txt |
TLE |
2104 ms |
10496 KB |
01-09.txt |
TLE |
2104 ms |
10624 KB |
01-10.txt |
TLE |
2104 ms |
12416 KB |
01-11.txt |
TLE |
2104 ms |
15232 KB |
01-12.txt |
AC |
22 ms |
640 KB |
01-13.txt |
TLE |
2103 ms |
2688 KB |
01-14.txt |
AC |
76 ms |
16256 KB |
01-15.txt |
AC |
79 ms |
16256 KB |
01-16.txt |
AC |
90 ms |
16256 KB |
01-17.txt |
AC |
95 ms |
16256 KB |
01-18.txt |
AC |
107 ms |
16384 KB |
01-19.txt |
AC |
114 ms |
16896 KB |
01-20.txt |
AC |
128 ms |
20992 KB |
01-21.txt |
TLE |
2103 ms |
1280 KB |
01-22.txt |
TLE |
2103 ms |
1280 KB |
01-23.txt |
TLE |
2103 ms |
1280 KB |
01-24.txt |
TLE |
2103 ms |
1280 KB |
01-25.txt |
TLE |
2103 ms |
2688 KB |
01-26.txt |
TLE |
2103 ms |
7936 KB |
01-27.txt |
AC |
77 ms |
12928 KB |
01-28.txt |
TLE |
2104 ms |
5504 KB |
01-29.txt |
AC |
8 ms |
2176 KB |
01-30.txt |
AC |
20 ms |
4992 KB |
sample-01.txt |
AC |
1 ms |
256 KB |
sample-02.txt |
AC |
1 ms |
256 KB |