Contest Duration: ~ (local time) (180 minutes)

Submission #991983

Source Code Expand

Copy
```#include <cstdio>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cstdlib>
#include <iostream>

using namespace std;

#define MOD @
#define ADD(X,Y) ((X) = ((X) + (Y)) % MOD)
typedef long long i64; typedef vector<int> ivec; typedef vector<string> svec;

int N, M, X[101010];
vector<int> S[101010];

pair<int, int> trans(vector<int> &V)
{
sort(V.begin(), V.end());

int evepair = 0, odds = 0;

int con = 0;
for (int i = 0; i < V.size(); ++i) {
++con;
if (i == V.size() - 1 || V[i] != V[i + 1]) {
evepair += con / 2;
odds += con % 2;
con = 0;
}
}
return{ evepair, odds };
}

int solve(vector<int> &A, vector<int> &B)
{
auto p = trans(A);
auto q = trans(B);

int ret = 0;
ret += min(p.second, q.second);
p.second -= ret;
q.second -= ret;
if (p.second == 0) swap(p, q);

int oddp = min(p.second, q.first * 2);
return ret + oddp + p.first + (q.first * 2 - oddp) / 2;
}

int main()
{
scanf("%d%d", &N, &M);
for (int i = 0; i < N; ++i) {
scanf("%d", X + i);

S[X[i] % M].push_back(X[i]);
}

int ret = 0;
for (int i = 0; i < M; ++i) {
int comp = (M - i) % M;
if (i <= comp) {
if (i == comp) ret += S[i].size() / 2;
else ret += solve(S[i], S[comp]);
}
}
printf("%d\n", ret);
return 0;
}
```

Submission Info

Submission Time 2016-11-26 12:44:20+0900 D - Pair Cards semiexp C++14 (GCC 5.4.1) 700 1426 Byte AC 28 ms 6144 KB

Compile Error

```./Main.cpp: In function ‘int main()’:
./Main.cpp:58: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:60:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", X + i);
^
```

Judge Result

Set Name Score / Max Score Test Cases
sample 0 / 0 sample-01.txt, sample-02.txt
all 700 / 700 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 5 ms 2560 KB
01-02.txt 16 ms 3576 KB
01-03.txt 16 ms 3580 KB
01-04.txt 20 ms 3584 KB
01-05.txt 19 ms 3712 KB
01-06.txt 21 ms 3712 KB
01-07.txt 20 ms 3456 KB
01-08.txt 20 ms 3584 KB
01-09.txt 21 ms 3584 KB
01-10.txt 25 ms 4224 KB
01-11.txt 28 ms 5120 KB
01-12.txt 17 ms 3576 KB
01-13.txt 18 ms 3576 KB
01-14.txt 16 ms 3472 KB
01-15.txt 20 ms 3712 KB
01-16.txt 20 ms 3712 KB
01-17.txt 19 ms 3584 KB
01-18.txt 22 ms 3840 KB
01-19.txt 23 ms 3712 KB
01-20.txt 26 ms 6144 KB
01-21.txt 16 ms 3520 KB
01-22.txt 19 ms 3456 KB
01-23.txt 19 ms 3584 KB
01-24.txt 19 ms 3584 KB
01-25.txt 20 ms 3712 KB
01-26.txt 21 ms 3712 KB
01-27.txt 15 ms 4352 KB
01-28.txt 7 ms 2688 KB
01-29.txt 5 ms 2688 KB
01-30.txt 6 ms 2560 KB
sample-01.txt 5 ms 2560 KB
sample-02.txt 5 ms 2560 KB