Submission #1283372

#TimeUsernameProblemLanguageResultExecution timeMemory
1283372diep38Room Temperature (JOI24_ho_t1)C++20
100 / 100
68 ms4316 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define ed "\n" #define fi first #define se second #define db double #define irs insert #define pb push_back #define mpa make_pair #define pi pair<int,int> #define MASK(i) (1LL << (i)) #define BIT(x, i) ((x>>i)&1) #define ON(x, i) ((x) MASK(i)) #define OFF(x, i) ((x) & ~MASK(i)) #define ALL(v) v.begin() , v.end() #define bp(x) __builtin_popcount(x) #define pii pair<int,pair<int,int>> #define fl(i,a,b) for(int i=a;i>=b;--i) #define fis(i,a,b) for(int i=a;i<=b;++i) #define Radian(x) (x * acos(-1.0) / 180) const double eps = 1e-9; const int mod=1e9+7; const int Mdem=998244353; const int LOG=19; const int base=31; const int maxn=5e5+5; const int bl = 320; #define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define gay(a) freopen(a".inp","r",stdin),freopen(a".out","w",stdout) template <class T> bool minimize(T &a, const T &b) { if(a > b) {a = b; return 1;} return 0; } template <class T> bool maximize(T &a, const T &b) { if(a < b) {a = b; return 1;} return 0; } template <class T> void compress(vector <T> &v) { sort(ALL(v)); v.erase(unique(ALL(v)), (v).end()); } void add(int &a, int b) { a += b; if (a >= mod) a -= mod; } void sub(int &a, int b) { a -= b; if (a < 0) a += mod; } int n, T; int a[maxn]; signed main(){ fast; cin >> n >> T; fis(i, 1, n) cin >> a[i], a[i] %= T; int Max = 0; sort(a + 1, a + n + 1); fis(i, 1, n){ if(i == n) maximize(Max, a[1] - a[i] - 1 + T); else maximize(Max, a[i + 1] - a[i] - 1); } cout << (T - Max) / 2 << ed; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...