Submission #5017373


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxN = 100010;
int a[maxN];
int b[maxN];
int c[maxN];
ll ans = 0;

int main()
{
	int n, m;
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n; i++)
	{
		int tmp;
		scanf("%d", &tmp);
		a[tmp]++;
	}
	for (int i = 1; i <= 100000; i++)
	{
		if (a[i] % 2 != 0)
		{
			b[i % m]++;
			a[i]--;
		}
		a[i] /= 2;
		c[i % m] += a[i];
	}
	for (int i = 1; i <= 100000; i++)
		ans += a[i];
	for (int i = 1; i < m; i++)
	{
		if (i + i == m) continue;
		int tmp1 = min(b[i], b[m - i]);
		ans += tmp1;
		b[i] -= tmp1;
		b[m - i] -= tmp1;
		int tmp2 = min(b[i], c[m - i] * 2);
		tmp2 /= 2;
		ans += tmp2;
		b[i] -= 2 * tmp2;
		c[m - i] -= tmp2;
	}
	ans += b[0] / 2;
	if (m % 2 == 0) ans += b[m/2]/2;
	cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task D - Pair Cards
User vjudge2
Language C++14 (GCC 5.4.1)
Score 700
Code Size 793 Byte
Status AC
Exec Time 13 ms
Memory 1408 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:13:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
                        ^
./Main.cpp:17:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &tmp);
                    ^

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 640 KB
01-02.txt AC 12 ms 640 KB
01-03.txt AC 12 ms 640 KB
01-04.txt AC 12 ms 640 KB
01-05.txt AC 12 ms 640 KB
01-06.txt AC 12 ms 640 KB
01-07.txt AC 12 ms 640 KB
01-08.txt AC 12 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 11 ms 640 KB
01-13.txt AC 12 ms 1024 KB
01-14.txt AC 11 ms 640 KB
01-15.txt AC 11 ms 640 KB
01-16.txt AC 11 ms 640 KB
01-17.txt AC 11 ms 640 KB
01-18.txt AC 11 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 13 ms 640 KB
01-24.txt AC 12 ms 640 KB
01-25.txt AC 11 ms 896 KB
01-26.txt AC 12 ms 1408 KB
01-27.txt AC 7 ms 1408 KB
01-28.txt AC 3 ms 1408 KB
01-29.txt AC 2 ms 896 KB
01-30.txt AC 3 ms 1408 KB
sample-01.txt AC 2 ms 640 KB
sample-02.txt AC 2 ms 640 KB