oj.uz

Submission #946208

# Submission time Handle Problem Language Result Execution time Memory
946208 2024-03-14T12:09:16 Z Ahmed57 Measures (CEOI22_measures) C++17
10 / 100
 1500 ms 6092 KB 
#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
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<70;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<<" ";
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 348 KB Output is correct
2 Correct 30 ms 348 KB Output is correct
3 Correct 26 ms 348 KB Output is correct
4 Correct 22 ms 548 KB Output is correct
5 Correct 25 ms 348 KB Output is correct
6 Correct 27 ms 344 KB Output is correct
7 Correct 29 ms 348 KB Output is correct
8 Correct 30 ms 348 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 348 KB Output is correct
2 Correct 30 ms 348 KB Output is correct
3 Correct 26 ms 348 KB Output is correct
4 Correct 22 ms 548 KB Output is correct
5 Correct 25 ms 348 KB Output is correct
6 Correct 27 ms 344 KB Output is correct
7 Correct 29 ms 348 KB Output is correct
8 Correct 30 ms 348 KB Output is correct
9 Execution timed out 1572 ms 6092 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1550 ms 508 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 41.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1550 ms 508 KB Time limit exceeded
2 Halted 0 ms 0 KB -