Submission #725645

#TimeUsernameProblemLanguageResultExecution timeMemory
725645rnl42Measures (CEOI22_measures)C++14
24 / 100
1567 ms5336 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
    
int N, M, D;
vector<int> A;
int ans = 0;
    
signed main() {
    ios::sync_with_stdio(false), cout.tie(0), cin.tie(0);
    cin >> N >> M >> D;
    A.resize(N);
    for (int i = 0; i < N; i++) {
        cin >> A[i];
    }
    sort(A.begin(), A.end());
    int in;
    for (int i = 0; i < M; i++) {
        cin >> in;
        auto it = lower_bound(A.begin(), A.end(), in);
        A.insert(it, in);
        int cur = 0;
        for (int i = (int)A.size()-2; i >= 0; i--) {
            int deltamin = D+A[i]-A[i+1];
            cur = max(cur + deltamin, 0ll);
            ans = max(cur, ans);
        }
        cout << (ans>>1); if (ans & 1) cout << ".5";
        cout << (i == M-1 ? '\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...