제출 #718234

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
718234		MuichiroTo	Balloons (CEOI11_bal)	C++14	20 / 100	200 ms	4992 KiB

bal

#include <bits/stdc++.h> 
using namespace std;
 
typedef long long ll;
#define int ll
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pair<int, int>> vpi;
typedef vector<vector<int>> vvi;

const int mod = 1000000007;

#define FOR(i,e) for(ll i = 0; i < e; i++)
#define FORM(i,s,e) for(ll i = s; i < e; i++)
#define nl "\n"
#define printArr(arr) FOR(abcd, arr.size()){cout<<arr[abcd]<<" ";}cout<<nl;
#define dbg(x) cout<<#x<<" = "<<x<<nl
#define pb push_back
#define pob pop_back
#define fi first
#define se second
#define INF 2e18
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define FOREACH(a,b) for(auto &(a): (b))


signed main()
{
//#ifndef ONLINE_JUDGE
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
//#endif
fast_cin();

int n; cin>>n;
vector<double> x(n); vector<double> r(n);
FOR(i,n){
    cin>>x[i];
    cin>>r[i];
}

stack<int> s;
// just store the index of the balloon in stack

for(int i =0 ;i<n; i++){
    double cur = r[i];
    while(!s.empty()){
        // find the radius with this balloon
        int idx = s.top();
        cur = ((x[i] - x[idx])*(x[i] - x[idx]))/(4*r[idx]);
        cur = min(cur, r[i]);
        if(cur>=r[idx]){
            // pop it from the stack
            s.pop();
        }
        else{
            break;
        }
    }
    r[i] = cur;
    s.push(i);
}

for(int i = 0;i <n; i++){
    cout<<fixed<<setprecision(3);
    cout<<r[i]<<nl;
}


return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 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