Submission #994249


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define mp(a,b) make_pair(a,b)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;

#define INF INT_MAX/3

#define MAX_N 1000

int n,m;
int cnt[111111];
vector<int> mod[111111];

int main(){
	cin.sync_with_stdio(false);
	cin>>n>>m;
	rep(i,n){
		int x;
		cin>>x;
		mod[x%m].pb(x);
		cnt[x]++;
	}
	ll res=0;
	repl(i,1,m/2+1){
		res+=min(mod[i].size(),mod[m-i].size());
		rep(j,mod[i].size())cnt[mod[i][j]]--;
		if(i!=m-i)rep(j,mod[m-i].size())cnt[mod[m-i][j]]--;
	}
	rep(i,111111){
		res+=(cnt[i]/2);
	}
	cout<<res<<endl;
	return 0;
}

Submission Info

Submission Time
Task D - Pair Cards
User yamad
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1184 Byte
Status WA
Exec Time 23 ms
Memory 6400 KB

Judge Result

Set Name sample all
Score / Max Score 0 / 0 0 / 700
Status
AC × 2
AC × 5
WA × 27
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 5 ms 2816 KB
01-02.txt WA 14 ms 3964 KB
01-03.txt WA 15 ms 3836 KB
01-04.txt WA 15 ms 3964 KB
01-05.txt WA 15 ms 3840 KB
01-06.txt WA 15 ms 3968 KB
01-07.txt WA 15 ms 3712 KB
01-08.txt WA 15 ms 3840 KB
01-09.txt WA 16 ms 3840 KB
01-10.txt WA 21 ms 4480 KB
01-11.txt WA 23 ms 5248 KB
01-12.txt WA 14 ms 3452 KB
01-13.txt WA 14 ms 3580 KB
01-14.txt AC 14 ms 3732 KB
01-15.txt WA 14 ms 3968 KB
01-16.txt WA 15 ms 3968 KB
01-17.txt WA 15 ms 3840 KB
01-18.txt WA 17 ms 4096 KB
01-19.txt WA 19 ms 3968 KB
01-20.txt WA 23 ms 6400 KB
01-21.txt WA 14 ms 3840 KB
01-22.txt WA 14 ms 3712 KB
01-23.txt WA 14 ms 3840 KB
01-24.txt WA 15 ms 3840 KB
01-25.txt WA 18 ms 3968 KB
01-26.txt WA 18 ms 3968 KB
01-27.txt WA 13 ms 4608 KB
01-28.txt WA 5 ms 3328 KB
01-29.txt AC 5 ms 3328 KB
01-30.txt AC 5 ms 2944 KB
sample-01.txt AC 4 ms 2816 KB
sample-02.txt AC 4 ms 2816 KB