# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1274973 | muhammad-mutahir | Room Temperature (JOI24_ho_t1) | C++20 | 1 ms | 576 KiB |
#include <bits/stdc++.h>
using namespace std;
#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second
const int M = 998244853;
int inf = 1e18;
void io(){
#ifndef ONLINE_JUDGE
freopen("input.in","r",stdin);
// freopen("outputf.in","w",stdout);
#endif
ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
cin.tie(0), cout.tie(0);
cout << fixed<<setprecision(9);
}
int n,T;
void solve(){
cin>>n>>T;
input(int,l,n);
if(n == 2){
sort(all(l));
int x1,x2;
if(l[0]%T <= l[1]%T){
x1 = l[0] + (l[1]%T-l[0]%T);
x2 = x1-T;
}
else{
x1 = l[0] + (l[1]%T-l[0]%T);
x2 = x1+T;
}
// cout<<x1<<" "<<x2<<endl;
cout<<min((abs(l[0]-x1)+1)/2,(abs(l[0]-x2)+1)/2)<<endl;;
}
}
signed main(){
// io();
int t = 1;
while(t--) solve();
}
컴파일 시 표준 에러 (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... |