Submission #5374844
Source Code Expand
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
/*BigInteger
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace xxx = boost::multiprecision;
using Bint = xxx::cpp_int;
using Real = xxx::number<xxx::cpp_dec_float<1024>>;
*/
#define int long long
#define pb(x) push_back(x)
#define m0(x) memset((x), 0LL, sizeof(x))
#define mm(x) memset((x), -1LL, sizeof(x))
//container
#define ALL(x) (x).begin(), (x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
#define PERM(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
// debug
#define GET_VAR_NAME(variable) #variable
#define test(x) cout << GET_VAR_NAME(x) << " = " << x << endl;
// bit_macro
#define Bit(n) (1LL << (n))
#define Bitset(a, b) (a) |= (1LL << (b))
#define Bitunset(a, b) (a) &= ~(1LL << (b))
#define Bitcheck(a, b) ((((a) >> (b)) & 1LL) == 1LL)
#define Bitcount(a) __builtin_popcountll((a))
//typedef
typedef long long lint;
typedef unsigned long long ull;
typedef complex<long double> Complex;
typedef pair<int, int> P;
typedef tuple<int, int, int> TP;
typedef vector<int> vec;
typedef vector<vec> mat;
//constant
constexpr int INF = (int)1e18;
constexpr int MOD = (int)1e9 + 7;
constexpr double PI = (double)acos(-1);
constexpr double EPS = (double)1e-10;
constexpr int dx[] = {-1, 0, 0, 1, 0, -1, -1, 1, 1};
constexpr int dy[] = {0, -1, 1, 0, 0, 1, -1, 1, -1};
//
template <typename T>
void chmax(T &a, T b) { a = max(a, b); }
template <typename T>
void chmin(T &a, T b) { a = min(a, b); }
//
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T>
inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
//
struct Accelerate_Cin {
Accelerate_Cin() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} Accelerate_Cin;
int N, M;
vector<int> x;
signed main() {
cin >> N >> M;
x.resize(N);
map<int, int> numx;
map<int, int> m2;
for (int i = 0; i < N; i++) {
cin >> x[i];
numx[x[i]]++;
if (numx[x[i]] % 2 == 0) m2[x[i] % M] += 2;
}
sort(ALL(x));
map<int, int> m;
for (int i = 0; i < N; i++) m[x[i] % M]++;
int ans = 0;
for (int i = 0; i < x.size(); i++) {
if ((x[i] % M != M - x[i] % M) && m[x[i] % M] >= 1 && m[M - x[i] % M] >= 1) {
ans++;
m[M - x[i] % M]--;
m[x[i] % M]--;
while (m2[x[i]] > m[x[i]]) m2[x[i]] -= 2;
while (m2[M - x[i] % M] > m[M - x[i] % M]) m2[M - x[i] % M] -= 2;
} else if (x[i] % M == 0 && m[0] >= 2) {
ans++;
m[x[i] % M] -= 2;
while (m2[x[i]] > m[x[i]]) m2[x[i]] -= 2;
}
}
for (int i = 0; i < M; i++) {
ans += m2[i] / 2;
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Pair Cards |
User |
null_null |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
3190 Byte |
Status |
WA |
Exec Time |
213 ms |
Memory |
19840 KB |
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, sample-01.txt, sample-02.txt |
Case Name |
Status |
Exec Time |
Memory |
01-01.txt |
AC |
1 ms |
256 KB |
01-02.txt |
WA |
95 ms |
8960 KB |
01-03.txt |
WA |
73 ms |
6912 KB |
01-04.txt |
WA |
103 ms |
8960 KB |
01-05.txt |
WA |
91 ms |
7936 KB |
01-06.txt |
WA |
111 ms |
8960 KB |
01-07.txt |
WA |
111 ms |
8832 KB |
01-08.txt |
WA |
121 ms |
8832 KB |
01-09.txt |
WA |
116 ms |
8704 KB |
01-10.txt |
WA |
138 ms |
10496 KB |
01-11.txt |
WA |
170 ms |
16640 KB |
01-12.txt |
AC |
16 ms |
1024 KB |
01-13.txt |
AC |
28 ms |
3840 KB |
01-14.txt |
WA |
82 ms |
10368 KB |
01-15.txt |
AC |
122 ms |
13568 KB |
01-16.txt |
WA |
125 ms |
13440 KB |
01-17.txt |
AC |
133 ms |
13568 KB |
01-18.txt |
AC |
131 ms |
13568 KB |
01-19.txt |
AC |
139 ms |
13440 KB |
01-20.txt |
AC |
213 ms |
19840 KB |
01-21.txt |
WA |
38 ms |
1408 KB |
01-22.txt |
WA |
49 ms |
1536 KB |
01-23.txt |
WA |
51 ms |
1536 KB |
01-24.txt |
WA |
51 ms |
1664 KB |
01-25.txt |
WA |
54 ms |
3584 KB |
01-26.txt |
AC |
69 ms |
7936 KB |
01-27.txt |
AC |
109 ms |
16256 KB |
01-28.txt |
AC |
20 ms |
7168 KB |
01-29.txt |
AC |
10 ms |
2816 KB |
01-30.txt |
AC |
36 ms |
6528 KB |
sample-01.txt |
AC |
1 ms |
256 KB |
sample-02.txt |
AC |
1 ms |
256 KB |