# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1179569 | pythontest | Room Temperature (JOI24_ho_t1) | C++20 | 77 ms | 4540 KiB |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, t;
vector<long long> wartosci;
scanf("%d %d",&n,&t);
for(int i=0;i<n;i++){
long long v;
scanf("%lld",&v);
wartosci.push_back(v);
}
long long mini = wartosci[0];
for(int i=1;i<n;i++) mini=min(mini,wartosci[i]);
for(int i=0;i<n;i++){
long long hm = (wartosci[i]-mini)/t;
wartosci[i]-=hm*t;
}
sort(wartosci.begin(),wartosci.end(),greater<>());
long long bestresult = (wartosci[0]-mini+1)/2;
for(int i=1;i<n;i++){
bestresult=min(bestresult,(max(wartosci[0]-t,wartosci[i])-min(wartosci[i-1]-t,mini)+1)/2);
}
printf("%lld",bestresult);
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... |