# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1082016 | quangminh412 | Room Temperature (JOI24_ho_t1) | C++14 | 1 ms | 500 KiB |
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;
/*
John Watson
https://codeforces.com/profile/quangminh98
Mua Code nhu mua Florentino !!
*/
#define faster() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
const int maxn = 5e5 + 9;
const int oo = 1e9;
int n, t;
int arr[maxn];
signed main()
{
if (fopen("test.inp", "r"))
{
freopen("test.inp", "r", stdin);
freopen("test.out", "w", stdout);
}
faster();
cin >> n >> t;
for (int i = 1; i <= n; i++) cin >> arr[i];
sort(arr + 1, arr + n + 1);
int mn = oo, mx = -oo;
for (int i = 1; i <= n; i++)
{
int k = (arr[i] - arr[1]) / t;
if (abs(arr[1] - (arr[i] - k * t)) < abs(arr[1] - (arr[i] - (k + 1) * t)))
arr[i] = arr[i] - k * t;
else
arr[i] = arr[i] - (k + 1) * t;
mx = max(mx, arr[i]);
mn = min(mn, arr[i]);
}
int mid = mx + mn >> 1;
cout << max(mx - mid, mid - mn) << '\n';
return 0;
}
Compilation message (stderr)
# | 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... |