Submission #946216

# Submission time Handle Problem Language Result Execution time Memory
946216 2024-03-14T12:16:26 Z Ahmed57 Measures (CEOI22_measures) C++17
10 / 100
1500 ms 6356 KB
#include "bits/stdc++.h"
using namespace std;
 
signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);
    int n,m;
    long double d;
    cin>>n>>m>>d;
    std::vector<long double> v;
    for(int i = 0;i<n;i++){
        double x;cin>>x;
        v.push_back(x);
    }
    for(int i = 0;i<m;i++){
        double x;cin>>x;
        v.push_back(x);
        sort(v.begin(),v.end());
        if(v.size()==1){
            cout<<0<<" ";
            continue;
        }
        long double l = 0.0 , r = 10000000000000.0;
        long double ans = 0;
        for(int j = 0;j<100;j++){
            long double mid = (l+r)/2;
            long double la = -10000000000000.0;
            long double ss = 1;
            for(auto e:v){
                long double cur = max(la+d,e-mid);
                if(abs(cur-e)>mid){
                    ss = 0;
                    break;
                }
                la = cur;
            }
            if(ss){
                ans = mid;
                r = mid;
            }else l = mid;
        }
        long long lol = 1;
        long long nah = ans;
        cout<<nah;
        string s = ".";
        while(lol--){
            ans*=10;
            long long a3 = ans;
            s+=char(a3%10+'0');
            if(a3%10){
                cout<<s;
                s = "";
            }
        }
        if(i<m-1)cout<<" ";
    }
}
# Verdict Execution time Memory Grader output
1 Correct 7 ms 348 KB Output is correct
2 Correct 12 ms 524 KB Output is correct
3 Correct 10 ms 348 KB Output is correct
4 Correct 9 ms 600 KB Output is correct
5 Correct 8 ms 528 KB Output is correct
6 Correct 12 ms 348 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 12 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 348 KB Output is correct
2 Correct 12 ms 524 KB Output is correct
3 Correct 10 ms 348 KB Output is correct
4 Correct 9 ms 600 KB Output is correct
5 Correct 8 ms 528 KB Output is correct
6 Correct 12 ms 348 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 12 ms 348 KB Output is correct
9 Correct 813 ms 5576 KB Output is correct
10 Correct 1471 ms 5588 KB Output is correct
11 Correct 1252 ms 6356 KB Output is correct
12 Correct 1483 ms 4820 KB Output is correct
13 Correct 740 ms 4816 KB Output is correct
14 Correct 791 ms 5844 KB Output is correct
15 Correct 929 ms 6344 KB Output is correct
16 Incorrect 228 ms 5576 KB Output isn't correct
17 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1532 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1532 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -