Submission #992668
Source Code Expand
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL<<29;
const ll mod = 1e9+7;
#define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i))
#define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d))
#define all(v) (v).begin(), (v).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset((m),(v),sizeof(m))
#define chmin(X,Y) ((X)>(Y)?X=(Y),true:false)
#define chmax(X,Y) ((X)<(Y)?X=(Y),true:false)
#define fst first
#define snd second
#define UNIQUE(x) (x).erase(unique(all(x)),(x).end())
template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;}
#define N 300000
#define M 100000
int n, m;
int x[N], x2[N];
int y[N];
int z[N];
int w[N], w2[N];
int main(){
cin>>n>>m;
rep(i, n) cin>>x[i];
rep(i, n) x2[x[i]]++;
rep(i, n) w[i%m] += x2[i]/2;
rep(i, n) y[x[i]%m]++;
int res = 0;
rep(i, m/2+1){
if(i*2%m==0){
z[i] = y[i]/2;
res += z[i];
z[i] *= 2;
} else {
z[i] = z[m-i] = min(y[i], y[m-i]);
res += z[i];
}
//cerr<<i<<" "<<m-i<<" "<<z[i]<<endl;
}
//cerr<<res<<endl;
rep(i, m){
int t = min(w[i], (y[i]-z[i])/2);
res += t;
//cerr<<i<<" "<<t<<endl;
}
cout<<res-1<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Pair Cards |
User |
Lepton |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1766 Byte |
Status |
WA |
Exec Time |
38 ms |
Memory |
2176 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 |
Case Name |
Status |
Exec Time |
Memory |
01-01.txt |
WA |
3 ms |
256 KB |
01-02.txt |
WA |
36 ms |
1024 KB |
01-03.txt |
WA |
36 ms |
1024 KB |
01-04.txt |
WA |
36 ms |
1024 KB |
01-05.txt |
WA |
36 ms |
1024 KB |
01-06.txt |
WA |
36 ms |
1024 KB |
01-07.txt |
WA |
36 ms |
1024 KB |
01-08.txt |
WA |
36 ms |
1024 KB |
01-09.txt |
WA |
36 ms |
1024 KB |
01-10.txt |
WA |
37 ms |
1536 KB |
01-11.txt |
WA |
38 ms |
2176 KB |
01-12.txt |
WA |
36 ms |
640 KB |
01-13.txt |
WA |
37 ms |
1024 KB |
01-14.txt |
WA |
36 ms |
1024 KB |
01-15.txt |
WA |
36 ms |
1024 KB |
01-16.txt |
WA |
36 ms |
1024 KB |
01-17.txt |
WA |
36 ms |
1024 KB |
01-18.txt |
WA |
36 ms |
1024 KB |
01-19.txt |
WA |
36 ms |
1152 KB |
01-20.txt |
WA |
38 ms |
2176 KB |
01-21.txt |
WA |
36 ms |
1024 KB |
01-22.txt |
WA |
36 ms |
1024 KB |
01-23.txt |
WA |
36 ms |
1024 KB |
01-24.txt |
WA |
36 ms |
1024 KB |
01-25.txt |
WA |
36 ms |
1408 KB |
01-26.txt |
WA |
37 ms |
2176 KB |
01-27.txt |
WA |
20 ms |
1408 KB |
01-28.txt |
WA |
5 ms |
1408 KB |
01-29.txt |
WA |
4 ms |
896 KB |
01-30.txt |
WA |
4 ms |
768 KB |
sample-01.txt |
WA |
3 ms |
256 KB |
sample-02.txt |
WA |
3 ms |
256 KB |