Submission #992653
Source Code Expand
#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(10000000);
cout << wei[0] << endl;
return 1;
}
if (m % 2 == 0) {
vector<int> ww(1);
cout << ww[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:11:17+0900
Task
D - Pair Cards
User
tosaka2
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
1582 Byte
Status
WA
Exec Time
647 ms
Memory
78336 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:66: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
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
RE
88 ms
78336 KB
01-02.txt
RE
89 ms
78336 KB
01-03.txt
RE
647 ms
256 KB
01-04.txt
AC
41 ms
1460 KB
01-05.txt
RE
112 ms
256 KB
01-06.txt
AC
40 ms
1784 KB
01-07.txt
RE
112 ms
256 KB
01-08.txt
AC
39 ms
1784 KB
01-09.txt
RE
111 ms
256 KB
01-10.txt
RE
114 ms
256 KB
01-11.txt
RE
113 ms
256 KB
01-12.txt
RE
113 ms
256 KB
01-13.txt
RE
112 ms
256 KB
01-14.txt
RE
112 ms
256 KB
01-15.txt
AC
40 ms
1512 KB
01-16.txt
RE
113 ms
256 KB
01-17.txt
AC
38 ms
1528 KB
01-18.txt
AC
41 ms
2168 KB
01-19.txt
AC
42 ms
2040 KB
01-20.txt
RE
115 ms
256 KB
01-21.txt
RE
113 ms
256 KB
01-22.txt
AC
39 ms
1496 KB
01-23.txt
RE
113 ms
256 KB
01-24.txt
WA
38 ms
1664 KB
01-25.txt
RE
111 ms
256 KB
01-26.txt
AC
43 ms
4216 KB
01-27.txt
RE
112 ms
256 KB
01-28.txt
RE
112 ms
256 KB
01-29.txt
RE
112 ms
256 KB
01-30.txt
RE
111 ms
256 KB
sample-01.txt
AC
4 ms
504 KB
sample-02.txt
RE
113 ms
256 KB