Submission #1054133

#	Time	Username	Problem	Language	Result	Execution time	Memory
1054133		Nonoze	Room Temperature (JOI24_ho_t1)	C++17	35 / 100	1 ms	604 KiB

Main

/*
*	Author: Nonoze
*	Created: Monday 12/08/2024
*/
#include <bits/stdc++.h>
using namespace std;

#ifndef _IN_LOCAL
	#define dbg(...)
#endif

#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)

template<typename T> void read(T& x) { cin >> x;}
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second);}
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }

#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)

#define int long long
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=25;



void solve();

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	// cin >> tt;
	while(tt--) solve();
	return 0;
}




int n, k, m, q;
vector<int> a;
string s;

int calc(int x) {
	int ans=0;
	for (int i=0; i<n; i++) {
		int act=abs(a[i]-x)%k;
		cmin(act, k-act);
		cmax(ans, act);
	}
	return ans;
}
// 0, 6, 5, 1, 5, 1
// 24 22 21 25 29 17

void solve() {
	read(n, k);
	a.clear(), a.resize(n); read(a);
	for (auto &u: a) u%=k;
	multiset<int> st;
	for (int i=0; i<n; i++) {
		if (k-a[i]<a[i]) a[i]=k-a[i];
		st.insert(a[i]);
	}
	int ans=k, cnt=0;
	while (sz(st)>1 && cnt++<n) {
		int x=*st.begin(), y=*st.rbegin();
		cmin(ans, (y-x+1)/2);
		st.erase(st.begin());
		st.insert(x+k);
	}
	quit(ans);
}

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