Submission #1167101

#TimeUsernameProblemLanguageResultExecution timeMemory
116710112345678Measures (CEOI22_measures)C++20
35 / 100
31 ms3400 KiB
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=2e5+5;

ll n, m, d, ans, x, lst=1e18;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m>>d;
    d=2*d;
    for (int i=1; i<=m; i++)
    {
        cin>>x;
        x=2*x;
        if (i==1)
        {
            cout<<0<<' ';
            lst=x;
            continue;
        }
        if (x+ans>=lst+d)
        {
            lst=max(lst+d, x-ans);
        }
        else
        {
            //x+ans<lst+d
            //cout<<"here "<<lst+d<<' '<<x+ans<<'\n';
            ans+=((lst+d-(x+ans)))/2;
            lst=x+ans;
        }
        if (ans%2) cout<<ans/2<<".5 ";
        else cout<<ans/2<<' ';
        //cout<<ans/2<<' ';
        //cout<<"debug "<<x<<' '<<ans<<' '<<d<<' '<<lst<<'\n';
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...