-
Notifications
You must be signed in to change notification settings - Fork 0
/
C.cpp
69 lines (57 loc) · 1.19 KB
/
C.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve()
{
int n, m;
cin >> n >> m;
vector<ll> a(n);
for (auto &x : a) cin >> x;
sort(a.begin(), a.end());
set<ll> s;
for (ll i = 1; i <= m; i++) s.insert(i);
map<ll, ll> mp;
ll ans = INT_MAX;
for (int i = 0, j = 0; j < n; j++) {
for (ll k = 1; k * k <= a[j]; k++) {
if (a[j] % k == 0) {
mp[k]++;
if (mp[k] == 1) s.erase(k);
if (a[j] / k != k) {
mp[a[j] / k]++;
if (mp[a[j] / k] == 1) s.erase(a[j] / k);
}
}
}
while (i <= j && s.empty()) {
ans = min(ans, a[j] - a[i]);
for (ll k = 1; k * k <= a[i]; k++) {
if (a[i] % k == 0) {
mp[k]--;
if (mp[k] == 0 && k <= m) s.insert(k);
if (a[i] / k != k) {
mp[a[i] / k]--;
if (mp[a[i] / k] == 0 && a[i] / k <= m) s.insert(a[i] / k);
}
}
}
i++;
}
}
if (ans == INT_MAX) cout << "-1\n";
else cout << ans << '\n';
}
int main()
{
#ifndef ONLINE_JUDGE
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
//freopen("Error.txt", "w", stderr);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
int t = 1;
cin >> t;
while (t--) solve();
return 0;
}