Submission #1680133


Source Code Expand

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <time.h>
#include <math.h>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;

#define getmid(l,r) ((l) + ((r) - (l)) / 2)
#define MEM(a,b) memset(a,b,sizeof(a))
#define MP(a,b) make_pair(a,b)
#define PB push_back

typedef long long ll;
typedef pair<int,int> pii;
const double eps = 1e-8;
const int INF = (1 << 30) - 1;

int N,M;
int V[100010],Vb[100010];
int cnt[100010];

int main(){
	scanf("%d%d",&N,&M);
	for(int i = 1; i <= N; ++i){
		int a;
		scanf("%d",&a);
		cnt[a]++;
	}
	for(int i = 1; i <= 100000; ++i){
		if(!cnt[i]) continue;
		V[i % M] += cnt[i];
		Vb[i % M] += cnt[i] / 2;
	}
	int ans = V[0] / 2;
	if(M % 2 == 0){
		ans += V[M / 2] / 2;
	}
	for(int i = 1; i < (M + 1) / 2; ++i){
		int j = M - i;
		if(V[i] == V[j]){
			ans += V[i];
		}
		else if(V[i] > V[j]){
			ans += V[j];
			ans += min((V[i] - V[j]) / 2,Vb[i]);
		}
		else{
			ans += V[i];
			ans += min((V[j] - V[i]) / 2,Vb[j]);
		}
	}
	printf("%d\n",ans);
	return 0;
}

Submission Info

Submission Time
Task D - Pair Cards
User Natureal
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1179 Byte
Status AC
Exec Time 12 ms
Memory 1408 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:34:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a);
                 ^

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 1 ms 256 KB
01-02.txt AC 12 ms 640 KB
01-03.txt AC 11 ms 640 KB
01-04.txt AC 11 ms 640 KB
01-05.txt AC 11 ms 640 KB
01-06.txt AC 11 ms 640 KB
01-07.txt AC 11 ms 640 KB
01-08.txt AC 11 ms 640 KB
01-09.txt AC 12 ms 640 KB
01-10.txt AC 12 ms 896 KB
01-11.txt AC 12 ms 1408 KB
01-12.txt AC 10 ms 256 KB
01-13.txt AC 10 ms 256 KB
01-14.txt AC 11 ms 640 KB
01-15.txt AC 12 ms 640 KB
01-16.txt AC 12 ms 640 KB
01-17.txt AC 12 ms 640 KB
01-18.txt AC 12 ms 640 KB
01-19.txt AC 11 ms 768 KB
01-20.txt AC 12 ms 1408 KB
01-21.txt AC 11 ms 640 KB
01-22.txt AC 11 ms 640 KB
01-23.txt AC 11 ms 640 KB
01-24.txt AC 11 ms 640 KB
01-25.txt AC 11 ms 896 KB
01-26.txt AC 11 ms 1408 KB
01-27.txt AC 6 ms 896 KB
01-28.txt AC 2 ms 1408 KB
01-29.txt AC 2 ms 896 KB
01-30.txt AC 2 ms 384 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB