Submission #993999
Source Code Expand
#include <cstdio>
#include <cmath>
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(int i = (l) ; i < (r); i++)
#define incII(i, l, r) for(int i = (l) ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r) ; i >= (l); i--)
#define inc( i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec( i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) < (r))
template<typename T> void swap(T & x, T & y) { T t = x; x = y; y = t; return; }
template<typename T> T abs(T x) { return (0 <= x ? x : -x); }
template<typename T> T max(T a, T b) { return (b <= a ? a : b); }
template<typename T> T min(T a, T b) { return (a <= b ? a : b); }
template<typename T> bool setmin(T & a, T b) { if(a <= b) { return false; } else { a = b; return true; } }
template<typename T> bool setmax(T & a, T b) { if(b <= a) { return false; } else { a = b; return true; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
// ---- ----
int n, m, x[100000];
int num[100001], sum[100000], odd[100000];
int main() {
scanf("%d%d", &n, &m);
inc(i, n) { scanf("%d", &x[i]); }
inc(i, n) { num[ x[i] ]++; }
incII(i, 1, 100000) {
sum[i % m] += num[i];
odd[i % m] += num[i] % 2;
}
int ans = 0;
incII(i, 0, (m / 2)) {
int mi = (odd[i] < odd[(m - i) % m] ? i : (m - i) % m);
int ma = (odd[i] < odd[(m - i) % m] ? (m - i) % m : i);
if(mi == ma) { ans += sum[mi] / 2; continue; }
if(sum[mi] >= odd[ma]) { ans += (sum[mi] + sum[ma]) / 2; }
else { ans += sum[mi] + (sum[ma] - odd[ma]) / 2; }
// printf("<%d, %d>: ans = %d\n", mi, ma, ans);
}
printf("%d\n", ans);
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Pair Cards |
User |
FF256grhy |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
1956 Byte |
Status |
AC |
Exec Time |
13 ms |
Memory |
1664 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:34:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &n, &m);
^
./Main.cpp:35:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
inc(i, n) { scanf("%d", &x[i]); }
^
Judge Result
Set Name |
sample |
all |
Score / Max Score |
0 / 0 |
700 / 700 |
Status |
|
|
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 |
2 ms |
128 KB |
01-02.txt |
AC |
12 ms |
896 KB |
01-03.txt |
AC |
12 ms |
896 KB |
01-04.txt |
AC |
12 ms |
896 KB |
01-05.txt |
AC |
12 ms |
896 KB |
01-06.txt |
AC |
12 ms |
896 KB |
01-07.txt |
AC |
12 ms |
896 KB |
01-08.txt |
AC |
12 ms |
896 KB |
01-09.txt |
AC |
12 ms |
1024 KB |
01-10.txt |
AC |
12 ms |
1280 KB |
01-11.txt |
AC |
13 ms |
1664 KB |
01-12.txt |
AC |
12 ms |
512 KB |
01-13.txt |
AC |
12 ms |
896 KB |
01-14.txt |
AC |
12 ms |
896 KB |
01-15.txt |
AC |
12 ms |
896 KB |
01-16.txt |
AC |
12 ms |
896 KB |
01-17.txt |
AC |
12 ms |
896 KB |
01-18.txt |
AC |
12 ms |
1024 KB |
01-19.txt |
AC |
12 ms |
1024 KB |
01-20.txt |
AC |
13 ms |
1664 KB |
01-21.txt |
AC |
12 ms |
896 KB |
01-22.txt |
AC |
12 ms |
896 KB |
01-23.txt |
AC |
12 ms |
896 KB |
01-24.txt |
AC |
12 ms |
896 KB |
01-25.txt |
AC |
12 ms |
1152 KB |
01-26.txt |
AC |
13 ms |
1664 KB |
01-27.txt |
AC |
8 ms |
1280 KB |
01-28.txt |
AC |
4 ms |
1408 KB |
01-29.txt |
AC |
3 ms |
896 KB |
01-30.txt |
AC |
3 ms |
1024 KB |
sample-01.txt |
AC |
2 ms |
128 KB |
sample-02.txt |
AC |
2 ms |
128 KB |