oj.uz

Submission #872849

# Submission time Handle Problem Language Result Execution time Memory
872849 2023-11-14T00:07:16 Z 8pete8 Balloons (CEOI11_bal) C++14
100 / 100
 144 ms 14932 KB 
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include<bitset>
#include <iomanip>  
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<pii,pii>
#define vi vector<int>
#define pb push_back
//#define p push
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
#define int long long
#define double long double
const int mxn=1e5,inf=1e18;
double cal(int x,double r){return (double)(((x*x)*1.0)/(4*r*1.0));}
deque<int>dq;
int32_t main(){
    fastio
    int n;cin>>n;
    vector<pair<int,double>>v(n);
    vector<double>sz(n,0.000);
    for(int i=0;i<n;i++)cin>>v[i].f>>v[i].s;
    for(int i=0;i<n;i++){
        if(dq.empty()){
            sz[i]=v[i].s;
            dq.push_back(i);
            continue;
        }
        while(dq.size()>1&&(cal(v[i].f-v[dq[dq.size()-1]].f,sz[dq[dq.size()-1]])>cal(v[i].f-v[dq[dq.size()-2]].f,sz[dq[dq.size()-2]])))dq.pop_back();
        sz[i]=min(v[i].s,cal(v[i].f-v[dq.back()].f,sz[dq.back()]));
        while(!dq.empty()&&(sz[i]>=sz[dq.back()])){
            sz[i]=min(sz[i],cal(v[i].f-v[dq.back()].f,sz[dq.back()]));
            dq.pop_back();
        }
      if(!dq.empty())sz[i]=min(sz[i],cal(v[i].f-v[dq.back()].f,sz[dq.back()]));
        dq.push_back(i);
    }
    cout<<setprecision(3)<<fixed;
    for(auto i:sz)cout<<i<<'\n';
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 356 KB 10 numbers

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB 2 numbers

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB 505 numbers

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB 2000 numbers

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1524 KB 20000 numbers

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 3160 KB 50000 numbers
2 Correct 33 ms 3928 KB 49912 numbers

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 5968 KB 100000 numbers

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 6912 KB 115362 numbers
2 Correct 77 ms 9044 KB 119971 numbers

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 8936 KB 154271 numbers
2 Correct 129 ms 14812 KB 200000 numbers

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 11424 KB 200000 numbers
2 Correct 131 ms 14932 KB 199945 numbers