This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int maxn = 500005;
int n, t;
int a[maxn];
void read()
{
cin >> n >> t;
for (int i = 1; i <= n; ++i)
{
cin >> a[i];
}
}
void solve()
{
for (int i = 1; i <= n; ++i) a[i] = a[i] % t;
sort(a + 1, a + n + 1);
int ans = max(a[n] - (a[1] + a[n]) / 2, (a[1] + a[n]) / 2 - a[1]);
for (int i = 1; i <= n - 1; ++i)
{
int mx = a[i];
int mn = a[i + 1] - t;
ans = min(ans, max(mx - (mx + mn) / 2, (mx + mn) / 2 - mn));
}
cout << ans << "\n";
}
void fastIO()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main()
{
fastIO();
read();
solve();
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... |