#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
int N,T;cin>>N>>T;
ll ar[N];
for (int i=0;i<N;i++) {
cin>>ar[i];
ar[i]=ar[i]%T;
}
sort(ar, ar+N);
ll best = (ar[N-1]-ar[0])/2+((ar[N-1]-ar[0])%2);
for (int i=1;i<N;i++) {
ar[i] = ar[i]-T;
best = min(best, (ar[i-1]-ar[i])/2+((ar[i-1]-ar[i])%2));
ar[i]+=T;
}
cout << best;
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... |