Submission #992265
Source Code Expand
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
mt19937 mrand(random_device{} ());
int rnd(int x) {
return mrand() % x;
}
typedef long double ld;
typedef long long ll;
#ifdef DEBUG
#define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#else
#define eprintf(...) ;
#endif
#define pb push_back
#define mp make_pair
#define sz(x) ((int) (x).size())
#define TASK "text"
const int inf = (int) 1.01e9;
const ld eps = 1e-9;
const ld pi = acos((ld) -1.0);
void precalc() {
}
const int maxn = (int) 1e5 + 10;
int a[maxn];
int n, m;
int read() {
if (scanf("%d%d", &n, &m) < 2) {
return 0;
}
for (int i = 0; i < n; ++i) {
scanf("%d", a + i);
}
return 1;
}
pair<int, int> ps[maxn];
int b[maxn][2];
void solve() {
sort(a, a + n);
for (int i = 0; i < m; ++i) {
b[i][0] = b[i][1] = 0;
}
for (int i = 0; i < n;) {
int i0 = i;
while (i < n && a[i] == a[i0]) {
++i;
}
int r = a[i0] % m;
b[r][0] += (i - i0) / 2;
b[r][1] += (i - i0) % 2;
//eprintf("%d %d\n", r, i - i0);
}
int res = 0;
for (int i = 0; i <= m - i; ++i) {
if (!i || i == m - i) {
res += b[i][0] + b[i][1] / 2;
} else {
//eprintf("%d %d\n", i, m - i);
while (1) {
if ((!b[i][0] && !b[i][1]) || (!b[m - i][0] && !b[m - i][1])) {
res += b[i][0] + b[m - i][0];
break;
}
//eprintf("%d %d %d %d\n", b[i][0], b[i][1], b[m - i][0], b[m - i][1]);
for (int it = 0; it < 2; ++it) {
int x = !it ? i : (m - i);
if (b[x][1]) {
--b[x][1];
continue;
}
if (b[x][0]) {
++b[x][1];
--b[x][0];
continue;
}
assert(0);
}
++res;
}
}
}
printf("%d\n", res);
}
int main() {
precalc();
#ifdef LOCAL
freopen(TASK ".out", "w", stdout);
assert(freopen(TASK ".in", "r", stdin));
#endif
while (1) {
if (!read()) {
break;
}
solve();
#ifdef DEBUG
eprintf("Time %.2f\n", (double) clock() / CLOCKS_PER_SEC);
#endif
}
return 0;
}
Submission Info
Submission Time
2016-11-26 12:54:15+0900
Task
D - Pair Cards
User
XraY
Language
C++14 (GCC 5.4.1)
Score
700
Code Size
2267 Byte
Status
AC
Exec Time
20 ms
Memory
1408 KB
Compile Error
./Main.cpp: In function ‘int read()’:
./Main.cpp:45:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", a + 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
256 KB
01-02.txt
AC
19 ms
640 KB
01-03.txt
AC
19 ms
640 KB
01-04.txt
AC
19 ms
640 KB
01-05.txt
AC
19 ms
640 KB
01-06.txt
AC
19 ms
640 KB
01-07.txt
AC
19 ms
640 KB
01-08.txt
AC
19 ms
640 KB
01-09.txt
AC
19 ms
640 KB
01-10.txt
AC
20 ms
896 KB
01-11.txt
AC
20 ms
1408 KB
01-12.txt
AC
13 ms
640 KB
01-13.txt
AC
14 ms
1024 KB
01-14.txt
AC
19 ms
640 KB
01-15.txt
AC
19 ms
640 KB
01-16.txt
AC
19 ms
640 KB
01-17.txt
AC
19 ms
640 KB
01-18.txt
AC
19 ms
640 KB
01-19.txt
AC
19 ms
768 KB
01-20.txt
AC
19 ms
1408 KB
01-21.txt
AC
17 ms
640 KB
01-22.txt
AC
17 ms
640 KB
01-23.txt
AC
17 ms
640 KB
01-24.txt
AC
17 ms
640 KB
01-25.txt
AC
17 ms
896 KB
01-26.txt
AC
18 ms
1408 KB
01-27.txt
AC
11 ms
1280 KB
01-28.txt
AC
4 ms
1024 KB
01-29.txt
AC
3 ms
512 KB
01-30.txt
AC
3 ms
1024 KB
sample-01.txt
AC
2 ms
256 KB
sample-02.txt
AC
2 ms
256 KB