#include <bits/stdc++.h>
#define ll long long
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define ub(c, x) distance((c).begin(),lower_bound(c.begin(),c.end(), (x)))
using namespace std;
const int inf = 1e9;
ll gcd(ll a, ll b){
if(b == 0) return 1;
return gcd(b, a % b);
}
void F(){
int n, t;
cin >> n >> t;
vector<int> v(n);
rep(i, 0, n) cin >> v[i];
rep(i, 0, n){
v[i] %= t;
}
int mx = *max_element(v.begin(), v.end());
rep(i, 0, n){
if(mx - v[i] > t + v[i] - mx){
v[i] += t;
}
}
int mn = *min_element(v.begin(), v.end());
mx = *max_element(v.begin(), v.end());
cout << (mx - mn + 1) / 2;
}
int main() {
int tc = 1;
//cin >> tc;
while(tc--) F();
}
# | 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... |