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>
#define ll long long
#define pll pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int n,t;cin>>n>>t;
int a[n+1];for(int i=1;i<=n;i++)cin>>a[i],a[i]%=t;
sort(a+1,a+n+1);int ans=(a[n]-a[1]+1)/2;
for(int i=1;i<=n-1;i++){
ans = min(ans,(a[i]-a[i+1]+t+1)/2);
}cout<<ans;
}
# | 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... |