122 lines
2.5 KiB
C++
122 lines
2.5 KiB
C++
/* Problem URL: https://codeforces.com/contest/1883/problem/C */
|
|
|
|
#include <bits/stdc++.h>
|
|
|
|
using namespace std;
|
|
|
|
#define V vector
|
|
|
|
#define rmin(a, b) a = min(a, b)
|
|
#define rmax(a, b) a = max(a, b)
|
|
|
|
#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
|
|
#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
|
|
|
|
#define repv(i, v) for (auto &i : (v))
|
|
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
|
|
#define sortv(v) sort(v.begin(), v.end())
|
|
#define all(v) (v).begin(), (v).end()
|
|
|
|
using vi = vector<int>;
|
|
using vvi = vector<vi>;
|
|
using vvvi = vector<vvi>;
|
|
using vvvvi = vector<vvvi>;
|
|
|
|
using ll = long long;
|
|
|
|
using vl = vector<ll>;
|
|
using vvl = vector<vl>;
|
|
using vvvl = vector<vvl>;
|
|
using vvvvl = vector<vvvl>;
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
|
|
os << vec[0];
|
|
for (size_t i = 1; i < vec.size(); i++) {
|
|
os << ' ' << vec[i];
|
|
}
|
|
os << '\n';
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<v> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
is >> i;
|
|
}
|
|
return is;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
|
|
for (auto &i : vec) {
|
|
os << i[0];
|
|
for (size_t j = 1; j < i.size(); j++) {
|
|
os << ' ' << i[j];
|
|
}
|
|
os << '\n';
|
|
}
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
for (auto &j : i) {
|
|
is >> j;
|
|
}
|
|
}
|
|
return is;
|
|
}
|
|
|
|
int main()
|
|
{
|
|
ios::sync_with_stdio(false);
|
|
cin.tie(nullptr);
|
|
|
|
int t;
|
|
cin >> t;
|
|
while (t--) {
|
|
int n, k;
|
|
cin >> n >> k;
|
|
|
|
vi exists(20);
|
|
int odds = 0;
|
|
int evens = 0;
|
|
while (n--) {
|
|
int a;
|
|
cin >> a;
|
|
if (a & 1) {
|
|
odds++;
|
|
} else {
|
|
evens++;
|
|
}
|
|
exists[a]++;
|
|
}
|
|
|
|
int minimal = INT32_MAX;
|
|
int prev = 0;
|
|
|
|
rep(i, 20) {
|
|
if (exists[i]) {
|
|
prev = i;
|
|
}
|
|
if (i % k == 0 && prev > 0) {
|
|
rmin(minimal, (int)i - prev);
|
|
}
|
|
}
|
|
|
|
if (k == 4) {
|
|
if (evens >= 2) {
|
|
minimal = 0;
|
|
} else if (evens >= 1 && odds >= 1) {
|
|
rmin(minimal, 1);
|
|
} else if (odds >= 2) {
|
|
rmin(minimal, 2);
|
|
}
|
|
}
|
|
|
|
cout << minimal << '\n';
|
|
}
|
|
}
|