Submission #992463


Source Code Expand

#include <cstdio>
#include <cstdlib>

int N,M;
int Xs[100008];
int cmp(const void *ka,const void *kb) {
	int a=*(int *)ka;
	int b=*(int *)kb;
	return a-b;
}
int modM_solo[100008];
int modM_pair[100008];
int getmin(int a,int b) {
	if(a>b) return b;
	return a;
}
int add(int a,int b,int c,int d) {
	int ret=getmin(b,d);
	b-=ret;
	d-=ret;
	if(b>0) {
		int temp=getmin(b,c*2);
		ret+=temp+a+(c*2-temp)/2;
	} else {
		int temp=getmin(d,a*2);
		ret+=temp+c+(a*2-temp)/2;
	}
	return ret;
}
int main() {
	scanf("%d%d",&N,&M);
	for(int i=0;i<N;i++) scanf("%d",&Xs[i]);
	qsort(Xs,N,sizeof(int),cmp);
	for(int i=0;i<N;i++) {
		if(Xs[i]==Xs[i+1]) {
			modM_pair[Xs[i]%M]++;
			i++;
		} else {
			modM_solo[Xs[i]%M]++;
		}
	}
	int sol=0;
	//case 0
	sol+=modM_pair[0]+modM_solo[0]/2;
	//case M/2
	if(M%2==0) sol+=modM_pair[M/2]+modM_solo[M/2]/2;
	for(int i=1;i<(M+1)/2;i++) sol+=add(modM_pair[i],modM_solo[i],modM_pair[M-i],modM_solo[M-i]);
	printf("%d\n",sol);
	return 0;
}

Submission Info

Submission Time
Task D - Pair Cards
User phidnight
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1011 Byte
Status AC
Exec Time 24 ms
Memory 1524 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:31: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:32:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0;i<N;i++) scanf("%d",&Xs[i]);
                                         ^

Judge Result

Set Name sample all
Score / Max Score 0 / 0 700 / 700
Status
AC × 2
AC × 32
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 AC 1 ms 128 KB
01-02.txt AC 23 ms 892 KB
01-03.txt AC 23 ms 892 KB
01-04.txt AC 23 ms 892 KB
01-05.txt AC 23 ms 892 KB
01-06.txt AC 23 ms 892 KB
01-07.txt AC 23 ms 892 KB
01-08.txt AC 23 ms 892 KB
01-09.txt AC 23 ms 892 KB
01-10.txt AC 23 ms 892 KB
01-11.txt AC 24 ms 1524 KB
01-12.txt AC 14 ms 764 KB
01-13.txt AC 14 ms 764 KB
01-14.txt AC 23 ms 892 KB
01-15.txt AC 23 ms 892 KB
01-16.txt AC 23 ms 892 KB
01-17.txt AC 23 ms 892 KB
01-18.txt AC 23 ms 892 KB
01-19.txt AC 23 ms 892 KB
01-20.txt AC 23 ms 1012 KB
01-21.txt AC 22 ms 892 KB
01-22.txt AC 22 ms 892 KB
01-23.txt AC 22 ms 892 KB
01-24.txt AC 22 ms 892 KB
01-25.txt AC 22 ms 892 KB
01-26.txt AC 23 ms 1396 KB
01-27.txt AC 12 ms 568 KB
01-28.txt AC 3 ms 764 KB
01-29.txt AC 2 ms 380 KB
01-30.txt AC 2 ms 256 KB
sample-01.txt AC 1 ms 128 KB
sample-02.txt AC 1 ms 128 KB