Submission #1039538

#TimeUsernameProblemLanguageResultExecution timeMemory
1039538pccMeasures (CEOI22_measures)C++17
0 / 100
35 ms6488 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long const ll mxn = 2e5+10; int N,M,D; ll mx = -1e18; ll arr[mxn]; ll l = 0,r = 3e15; int main(){ ios::sync_with_stdio(0); cin.tie(0);cout.tie(0); cin>>N>>M>>D; assert(!N); D<<=1; for(int i = 0;i<M;i++){ cin>>arr[i]; arr[i]<<=1; r = 3e15; while(l != r){ ll mid = (l+r)>>1; if(mx<=arr[i]+mid*2-D*i)r = mid; else l = mid+1; } mx = max(mx,arr[i]-D*i); cout<<(l>>1)<<(l&1?".5 ":" "); } cout<<'\n'; 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...