제출 #1275274

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1275274		sm.22	Balloons (CEOI11_bal)	C++20	10 / 100	83 ms	6684 KiB

bal

#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
 
#define watch(x)        cerr << "\n" << (#x) << " is " << (x) << "\n";
#define int             long long 
#define ffor(i, a, b)   for(int i=a;i<b;i++)
#define rfor(i, a, b)   for(int i=a-1;i>=b;i--)
#define all(v)          v.begin(), v.end()
#define rall(v)         v.rbegin(), v.rend()
#define pb              push_back
#define fi              first
#define se              second
#define pii             pair<int, int>
#define vi              vector<int> 
#define vvi             vector<vi> 
#define show(a)         for(auto e : a) {cout<<e<<" ";} cout<<"\n"; 
#define pr(a, b, c)     ffor(i, b, c) {cout<<a[i]<<" ";} cout<<"\n";
#define cerr            if(false)cerr
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int N = 2e5 + 10; 
int Mod = 1e9 + 7, INF = 1e18, BASE = 7, Block = 555;

void solve() {

        int n; cin>>n; 
        int x[n], r[n]; 
        ffor(i, 0, n) cin>>x[i]>>r[i]; 

        stack<int> stk; stk.push(0); 
        double ans[n]; ans[0] = r[0]; 

        // elements of the stack has to be in decreasing order 

        ffor(i, 1, n) {

                while(stk.size()) {
                        int idx = stk.top(); 
                        
                        double rj = (x[idx] - x[i]) * (x[idx] - x[i]); 
                        rj /= 4 * ans[idx]; 
                        rj = min(rj, static_cast<double>(r[i])); 

                        if(rj >= ans[idx]) {
                                stk.pop(); 
                        } else {

                                ans[i] = rj; 
                                break; 
                        }
                }

                if(stk.empty()) ans[i] = r[i]; 
                stk.push(i); 
        }

        ffor(i, 0, n) cout<<ans[i]<<"\n"; 

}

signed main() { 
        ios_base::sync_with_stdio(false); 
        cin.tie(NULL); 
        int t = 1; //cin>>t; 

        cout<<fixed<<setprecision(3); 
        
        while(t--) solve();
        return 0; 
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10