Submission #984057

#TimeUsernameProblemLanguageResultExecution timeMemory
984057alexddMeasures (CEOI22_measures)C++17
10 / 100
1543 ms4148 KiB
#include<iostream>
#include<algorithm>
using namespace std;
#define int long long
const int INF = 1e18;
int n,m,d;
int a[200055];
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>m>>d;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    for(int pas=1;pas<=m;pas++)
    {
        cin>>a[n+pas];
        sort(a+1,a+1+n+pas);
        int mxm=0;
        for(int i=1;i<=n+pas;i++)
        {
            int aux=-INF;
            for(int j=1;j<i;j++)
            {
                aux = max(aux, a[j]+d*(i-j));
            }
            mxm = max(mxm, aux-a[i]);
        }
        if(mxm%2==0) cout<<mxm/2<<" ";
        else cout<<mxm/2<<".5 ";
    }
    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...