#include <bits/stdc++.h>
#define int long long
using namespace std;
const long long N = 2e5 + 5;
int a[N];
int b[N];
void solve()
{
int n, t;
cin >> n >> t;
for (int i = 0; i < n; i++)
{
cin >> a[i];
b[i] = a[i] % t;
}
set<int> s;
for (int i = 0; i < n; i++)
{
s.insert(b[i]);
}
int mn, mx;
int ans = 1e18;
for (int i = 0; i < n + 1; i++)
{
mn = *s.begin();
mx = *s.rbegin();
ans = min(ans, mx - mn);
s.extract(mn);
s.insert(mn + t);
}
cout << (ans + 1) / 2;
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin >> t;
while (t--)
{
solve();
cout << endl;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |