Submission #723395

#TimeUsernameProblemLanguageResultExecution timeMemory
723395rnl42Measures (CEOI22_measures)C++14
0 / 100
1568 ms720 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];
    }
    int in;
    for (int i = 0; i < M; i++) {
        cin >> in;
        A.push_back(in);
        sort(A.begin(), A.end());
        int truc = 0;
        int cur = 0;
        int mini = 0;
        for (int i = (int)A.size()-2; i >= 0; i--) {
            int deltamin = D+A[i]-A[i+1];
            if (deltamin >= 0) {
                cur = cur - deltamin;
            } else {
                cur = -deltamin+truc;
            }
            mini = min(cur, mini);
        }
        int ans = abs(mini);
        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...