Submission #1013912

#TimeUsernameProblemLanguageResultExecution timeMemory
1013912BaytoroRoom Temperature (JOI24_ho_t1)C++17
100 / 100
390 ms32848 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fr first
#define sc second
#define int ll
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
const int N=2e5+5;
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(rall(a));
    int ans=1e9;
    multiset<int> st;
    for(int i=0;i<n;i++) st.insert(a[i]);
    for(int i=-1;i<n;i++) {
        if(i>=0) {
            st.erase(st.find(a[i]));
            a[i]-=t;
            st.insert(a[i]);
        }
        int l=*st.begin(),r=*st.rbegin();
        int md=(l+r)/2;
        int res=max(abs(l-md),abs(r-md));
        ans=min(ans,res);
        /*vector<int> b;
        for(int j=0;j<n;j++) {
            b.pb(a[j]);
        }
        sort(all(b));
        int md=(b[b.size()-1]+b[0])/2;
        int res=0;
        for(int j=0;j<n;j++) res=max(abs(a[j]-md),res);
        ans=min(ans,res);*/
    }
    cout<<ans<<endl;
}
signed main(){
    int t=1;//cin>>t;
    while(t--){
        solve();
    }
}
//#endif
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...