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;
#define ar array
typedef long long ll;
//~ #define int ll
void solve(){
int n, t; cin >> n >> t;
vector<int> a(n);
for(int i=0;i<n;i++){
cin >> a[i];
a[i] %= t;
}
sort(a.begin(), a.end());
int mx = a[0] + t - a[n - 1];
for(int i=1;i<n;i++){
mx = max(mx, a[i] - a[i - 1]);
}
cout<<(t - mx + 1) / 2<<"\n";
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
int t = 1;
//~ cin >> t;
while(t--){
solve();
}
}
# | 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... |