Submission #1997929


Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<vector>
#define mp make_pair
#define fr first
#define sc second
using namespace std;

const int N=100005;

int n,ans,m,l,r,len,cnt,s,now,lft;
int a[N],b[N];
vector<int> lev[N];

int main(){
	int i,j;
	scanf("%d%d",&n,&m);
	for (i=1;i<=n;i++) scanf("%d",&a[i]);
	sort(a+1,a+1+n);
	for (i=1;i<=n;i++) lev[a[i]%m].push_back(a[i]);
	if (m%2==0) ans+=lev[m/2].size()/2;
	ans+=lev[0].size()/2;
	for (i=1;i<=m/2;i++){
		if (m%2==0&&i==m/2) break;
		if (lev[i].size()<lev[m-i].size()) swap(lev[i],lev[m-i]);
		ans+=lev[m-i].size();
		len=lev[i].size()-1; cnt=0;
		for (l=0;l<=len;l=r+1){
			for (r=l;r<len&&lev[i][l]==lev[i][r+1];r++);
			b[++cnt]=r-l+1;
		}
		sort(b+1,b+1+cnt); lft=len+1-lev[m-i].size(); 
		for (j=cnt;j;j--){
			if (lft<=1) break;
			now=min(lft,b[j]);
			lft-=now/2*2; ans+=now/2;
		}
	}
	printf("%d\n",ans);
	return 0;
}

Submission Info

Submission Time
Task D - Pair Cards
User wdyhy
Language C++14 (GCC 5.4.1)
Score 700
Code Size 995 Byte
Status AC
Exec Time 25 ms
Memory 6144 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:21:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
                     ^
./Main.cpp:22:38: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for (i=1;i<=n;i++) scanf("%d",&a[i]);
                                      ^

Judge Result

Set Name sample all
Score / Max Score 0 / 0 700 / 700
Status
AC × 2
AC × 34
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 2 ms 2560 KB
01-02.txt AC 19 ms 3580 KB
01-03.txt AC 19 ms 3584 KB
01-04.txt AC 19 ms 3584 KB
01-05.txt AC 19 ms 3712 KB
01-06.txt AC 19 ms 3712 KB
01-07.txt AC 20 ms 3456 KB
01-08.txt AC 20 ms 3584 KB
01-09.txt AC 21 ms 3584 KB
01-10.txt AC 24 ms 4224 KB
01-11.txt AC 25 ms 4992 KB
01-12.txt AC 14 ms 3580 KB
01-13.txt AC 14 ms 3580 KB
01-14.txt AC 19 ms 3580 KB
01-15.txt AC 19 ms 3656 KB
01-16.txt AC 19 ms 3712 KB
01-17.txt AC 19 ms 3456 KB
01-18.txt AC 20 ms 3840 KB
01-19.txt AC 21 ms 3584 KB
01-20.txt AC 24 ms 6144 KB
01-21.txt AC 18 ms 3584 KB
01-22.txt AC 18 ms 3456 KB
01-23.txt AC 18 ms 3584 KB
01-24.txt AC 18 ms 3584 KB
01-25.txt AC 19 ms 3584 KB
01-26.txt AC 20 ms 3584 KB
01-27.txt AC 13 ms 4352 KB
01-28.txt AC 3 ms 2688 KB
01-29.txt AC 3 ms 2560 KB
01-30.txt AC 3 ms 2560 KB
sample-01.txt AC 2 ms 2560 KB
sample-02.txt AC 2 ms 2560 KB