oj.uz

Submission #485120

# Submission time Handle Problem Language Result Execution time Memory
485120 2021-11-06T08:36:06 Z hammer23 Balloons (CEOI11_bal) C++14
20 / 100
 2000 ms 3176 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 xx,yy,rr=0;
int x[maxN];
double r[maxN];
void solve(){
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>x[i]>>r[i];
    }
    for(int i=0;i<n;i++){
        for(int j=i-1;j>=0;j--){
            r[i]=min(r[i],((x[i]-x[j])*(x[i]-x[j]))/(4*r[j]));
        }
        //cout<<ans<<setprecision(3)<<endl;
        printf("%.3lf\n", r[i]);
    }
}

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

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB 2nd numbers differ - expected: '252735385.4379999936', found: '0.9330000000', error = '252735384.5049999952'

Subtask #3
10.0 / 10.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 332 KB 216th numbers differ - expected: '204.7450000000', found: '-4362157.0549999997', error = '4362361.7999999998'

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 346 ms 836 KB 203rd numbers differ - expected: '482.0130000000', found: '-2497845.7940000002', error = '2498327.8070000000'

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1956 ms 1448 KB 3rd numbers differ - expected: '15396.0000000000', found: '-8140.0230000000', error = '23536.0230000000'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2085 ms 2168 KB Time limit exceeded

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2070 ms 2284 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2074 ms 2932 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2052 ms 3176 KB Time limit exceeded
2 Halted 0 ms 0 KB -