#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 500009;
ll n, t, a[N], p[N];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> t;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) a[i] %= t;
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) p[i] = p[i - 1] + a[i];
ll res = 0;
a[0] = a[n], a[n + 1] = a[1];
for (int i = 1; i <= n; i++) res = max(res, (a[i + 1] - a[i] + t) % t);
cout << ((t - res) % t + 1) / 2ll;
}
# | 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... |