제출 #1186250

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1186250		asli_bg	Room Temperature (JOI24_ho_t1)	C++20	100 / 100	82 ms	12616 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

#define int long long

typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<bool> vb;

typedef tree<pii,null_type,less<pii>,rb_tree_tag,
tree_order_statistics_node_update> oset;

#define fi first
#define se second
#define pb push_back
#define pf push_front

#define mid (l+r)/2
#define all(x) x.begin(),x.end()
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)

#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;
#define sp <<" "<<

#define DEBUG(x) cout<<(#x) sp x<<endl
#define carp(a,b) (((a%MOD)*(b%MOD))%MOD)
#define topla(a,b) (((a%MOD)+(b%MOD))%MOD)

const int INF=1e18;
const int MAXN=2e5+5;
const int MOD=998244353;

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int n,t;
    cin>>n>>t;
    deque<pii> a(n);
    vi b(n);
    FOR(i,n){
        cin>>a[i].fi;
        b[i]=a[i].fi;
        a[i].fi%=t;
        a[i].se=i;
    }

    sort(all(a));

    int ans=INF;
    FOR(i,n){

        int fark=a.back().fi-a.front().fi+1;

        ans=min(ans,fark/2);
        
        auto el=a.front();
        
        a.pb({el.fi+t,el.se});
        a.pop_front();
    }

    cout<<ans<<endl;
}

• Subtask 1: 15 / 15
• Subtask 2: 5 / 5
• Subtask 3: 30 / 30
• Subtask 4: 35 / 35
• Subtask 5: 15 / 15