oj.uz

답안 #485131

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
485131 2021-11-06T10:14:34 Z hammer23 Balloons (CEOI11_bal) C++17
0 / 100
 147 ms 9072 KB 
#include <bits/stdc++.h>
using namespace std;

/*******  All Required define Pre-Processors and typedef Constants *******/
typedef pair<int,int> pii;
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define sz(x) (int)(x).size()
#define all(x) x.begin(),x.end()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pb push_back
#define eb emplace_back
#define pf push_front
#define ll long long
#define numBit(x) __builtin_popcount(x)
#define lb lower_bound
#define ub upper_bound
#define ar array
#define endl '\n'
#define fi first
#define se second

const int inf = 1e9+1;
const int maxN = 2e5 + 1;
const int MOD = 1e9 + 7;

using namespace std;
 ll powmod(ll a, ll b, ll p){
    a %= p;
    if (a == 0) return 0;
    ll product = 1;
    while(b > 0){
        if (b&1){
            product *= a;
            product %= p;
            --b;
        }
        a *= a;
        a %= p;
        b /= 2;
    }
    return product;
}
 ll inv(ll a, ll p){
    return powmod(a, p-2, p);
}

 ll DIVMOD(ll a, ll b, ll p){
    // A*(B^(MOD-2))%MOD
    return a*inv(b,p)%p;
}
void file(const string FILE = "bongbong") {
    //freopen((FILE + ".INP").c_str(), "r", stdin);
    //freopen((FILE + ".OUT").c_str(), "w", stdout);
}

int n;
int x[maxN];
long double r[maxN],pck[maxN];
void solve(){
    stack<int> st;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>x[i]>>r[i];
    }

    for(int i=0;i<n;i++){
        pck[i]=r[i];
        while(!st.empty()){
            int j=st.top();
            pck[i]=min(pck[i],min(r[i],((x[i]-x[j])*(x[i]-x[j]))/(4.0*r[j])));
            if(r[i]>=r[j]) st.pop();
            else break;
        }
        st.push(i);
        //cout<<ans<<setprecision(3)<<endl;
        printf("%.3Lf \n", pck[i]);
    }
}

int main()
{
    //file();
    fastIO;
    int t=1;
    //cin>>t;
    while(t--)
        solve();
    return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB 5th numbers differ - expected: '17.1630000000', found: '4.3710000000', error = '12.7920000000'

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 332 KB 2nd numbers differ - expected: '252735385.4379999936', found: '0.9330000000', error = '252735384.5049999952'

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB 5th numbers differ - expected: '0.1170000000', found: '0.0830000000', error = '0.0340000000'

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 332 KB 3rd numbers differ - expected: '121.0000000000', found: '120.0180000000', error = '0.9820000000'

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 1100 KB 3rd numbers differ - expected: '211.0000000000', found: '210.0110000000', error = '0.9890000000'

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 38 ms 2448 KB 3rd numbers differ - expected: '15396.0000000000', found: '9489.3930000000', error = '5906.6070000000'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 75 ms 4752 KB 3rd numbers differ - expected: '7936.0000000000', found: '6084.6240000000', error = '1851.3760000000'

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 93 ms 5544 KB 6th numbers differ - expected: '5053.0000000000', found: '5052.0000000000', error = '1.0000000000'
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 120 ms 7248 KB 3rd numbers differ - expected: '1872.0000000000', found: '1871.0010000000', error = '0.9990000000'
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 147 ms 9072 KB 3rd numbers differ - expected: '2960.0000000000', found: '2959.0010000000', error = '0.9990000000'
2 Halted 0 ms 0 KB -