제출 #1331120

#제출 시각아이디문제언어결과실행 시간메모리
1331120nguyenkhangninh99Measures (CEOI22_measures)C++17
24 / 100
630 ms5048 KiB
#include<bits/stdc++.h>
using namespace std;

#define int long long 

void solve(){
    int n, m, d; cin >> n >> m >> d;
    if(m <= 20){
        vector<int> a(n + 1);
        for(int i = 1; i <= n; i++) cin >> a[i];

        auto check = [&](int x){
            long double y = x;
            vector<long double> cur(a.size(), 0);
            cur[0] = -1e15;
            for(int i = 1; i < a.size(); i++){
                cur[i] = max(a[i] - y / 2, cur[i - 1] + d);
                if(cur[i] > a[i] + y / 2) return false;
            }
            return true;
        };
        for(int i = 1; i <= m; i++){
            int x; cin >> x;
            a.push_back(x);
            sort(a.begin() + 1, a.end());
            int l = 0, r = 1e16, ans = 1e16;
            while(l <= r){
                int mid = (l + r) / 2;
                if(check(mid)) ans = mid, r = mid - 1;
                else l = mid + 1;
            }
            cout << ans / 2;
            if(ans & 1) cout << ".5";
            cout << " ";
        }
    }
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    solve();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...