oj.uz

Submission #1111208

# Submission time Handle Problem Language Result Execution time Memory
1111208 2024-11-11T17:14:53 Z squatrian Balloons (CEOI11_bal) C++17
100 / 100
 442 ms 7160 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
using std::mt19937_64;
using std::random_device;
using std::uniform_int_distribution;
#include <numeric>
#define ff              first
#define ss              second
#define int             long long
#define pb              push_back
#define mp              make_pair
#define pii             pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqb             priority_queue<int>
#define pqs             priority_queue<int,vi,greater<int> >
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define mod             1000000007
#define inf             1e18
#define ps(x,y)         fixed<<setprecision(y)<<x
#define mk(arr,n,type)  type *arr=new type[n];
#define w(x)            int x; cin>>x; while(x--)
mt19937                 rng(chrono::steady_clock::now().time_since_epoch().count());
 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
 
 
void c_p_c()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
/*#ifndef ONLINE_JUDGE
    freopen("milkvisits.in", "r", stdin);
    freopen("milkvisits.out", "w", stdout);
#endif*/
}
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int exp(int x, int n, int m) {
    if(x == 0 and n == 0) return 1;
    x %= m; 
    int res = 1;
    while (n > 0) {
        if (n % 2 == 1) { res = res * x % m; }
        x = x * x % m;
        n /= 2;
    }
    return res;
}
long double check(pair<long double,long double> &p1,int a,int b){
  long double dist= (p1.ff-a)*(p1.ff-a);
  long double rad = dist/(4*p1.ss);
  return rad;
}
signed main()
{   
   int t=1;
   c_p_c();
   // cin >> t;
   while(t--){
    int n;
    cin >> n;
    stack<pair<long double,long double>> st;
    vector<long double> ans(n);
    for(int i = 0 ; i < n; i++){
        long double a,b;
        cin >> a >> b;
        long double y = b;
        while(!st.empty()){
           long double rad= check(st.top(),a,b);
           y = min(y,rad);
           if(y >= st.top().ss){
             st.pop();
           }
           else{
            break;
           }
        }
        st.push({a,y});
        ans[i] = y;
    }
    cout<<fixed<<setprecision(3);
    for(auto &x:ans){
       cout<<x<<endl;
    }
 
   }
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 336 KB 2000 numbers

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 856 KB 20000 numbers

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 2480 KB 50000 numbers
2 Correct 133 ms 2340 KB 49912 numbers

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 241 ms 3144 KB 100000 numbers

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 264 ms 3612 KB 115362 numbers
2 Correct 270 ms 4424 KB 119971 numbers

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 339 ms 5700 KB 154271 numbers
2 Correct 418 ms 7160 KB 200000 numbers

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 442 ms 6668 KB 200000 numbers
2 Correct 415 ms 6984 KB 199945 numbers