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

Submission #992708

Source Code Expand

Copy
```#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;

#define int int64_t

#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,x,...) x
#define REP1(i, s, cond, cal) for (signed i = signed(s); i cond; i cal)
#define REP2(i, s, n) REP1(i, s, < signed(n), ++)
#define REP3(i, n) REP2(i, 0, n)
#define rep(...) CHOOSE((__VA_ARGS__,REP1,REP2,REP3))(__VA_ARGS__)
#define rrep(i, s) rep(i, s, >= 0, --)

#define all(c) begin(c), end(c)
#define maxup(ans, x) (ans = (ans < x ? x : ans))
#define minup(ans, x) (ans = (ans > x ? x : ans))

#define breakif(cond) if(cond) break; else

using VV = vector<vector<int>>;
using V = vector<int>;
using P = pair<int, int>;
using IP = pair<int, P>;

template<typename T>
inline void input(vector<T>& v) { for (auto& x : v) cin >> x; }

signed main() {
int n, m; cin >> n >> m;

if (m == 1) {
vector<int> wei(2);
cout << wei[114514] << endl;
return 1;
}

VV mods(m);
rep(i, n) {
int x; cin >> x;
mods[x % m].push_back(x);
}
rep(i, m) sort(all(mods[i]));

int ans = mods[0].size() / 2;
if (m != 1 && m % 2 == 0) ans += mods[m / 2].size() / 2;
rep(i, 1, (m + 1) / 2) {
auto& a = mods[i];
auto& b = mods[m - i];
if (a.size() > b.size()) swap(a, b);
int rem = b.size() - a.size();
ans += a.size();
rep(j, (signed)b.size() - 1) breakif(rem <= 1) if(b[j] == b[j + 1]) {
ans++;
rem -= 2;
}
}
cout << ans << endl;

system("pause");
}```

Submission Info

Submission Time 2016-11-26 13:13:45+0900 D - Pair Cards tosaka2 C++14 (GCC 5.4.1) 0 1488 Byte WA 112 ms 5888 KB

Compile Error

```./Main.cpp: In function ‘int main()’:
./Main.cpp:60:17: warning: ignoring return value of ‘int system(const char*)’, declared with attribute warn_unused_result [-Wunused-result]
system("pause");
^
```

Judge Result

Set Name sample all
Score / Max Score 0 / 0 0 / 700
Status
 AC × 2
 AC × 27 WA × 3 RE × 2
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 110 ms 256 KB
01-02.txt 112 ms 256 KB
01-03.txt 40 ms 1364 KB
01-04.txt 41 ms 1460 KB
01-05.txt 43 ms 1344 KB
01-06.txt 40 ms 1784 KB
01-07.txt 38 ms 1400 KB
01-08.txt 38 ms 1784 KB
01-09.txt 39 ms 1664 KB
01-10.txt 45 ms 3072 KB
01-11.txt 49 ms 4984 KB
01-12.txt 36 ms 1400 KB
01-13.txt 38 ms 2424 KB
01-14.txt 40 ms 1364 KB
01-15.txt 40 ms 1384 KB
01-16.txt 39 ms 1784 KB
01-17.txt 38 ms 1528 KB
01-18.txt 40 ms 2168 KB
01-19.txt 41 ms 2040 KB
01-20.txt 48 ms 5888 KB
01-21.txt 40 ms 1352 KB
01-22.txt 38 ms 1496 KB
01-23.txt 37 ms 1656 KB
01-24.txt 37 ms 1664 KB
01-25.txt 40 ms 2552 KB
01-26.txt 42 ms 4216 KB
01-27.txt 27 ms 4344 KB
01-28.txt 9 ms 2936 KB
01-29.txt 6 ms 1400 KB
01-30.txt 7 ms 2808 KB
sample-01.txt 4 ms 504 KB
sample-02.txt 4 ms 500 KB