Submission #521688

#TimeUsernameProblemLanguageResultExecution timeMemory
521688AmirElarbiBalloons (CEOI11_bal)C++14
30 / 100
2081 ms8816 KiB
#include <bits/stdc++.h> #define vi vector<int> #define ve vector #define ll long long #define vf vector<float> #define vll vector<pair<ll,ll>> #define ii pair<int,int> #define vvi vector<vi> #define vii vector<ii> #define gii greater<ii> #define pb push_back #define mp make_pair #define fi first #define se second #define INF 1e16 #define eps 1e-7 #define eps1 1e-25 #define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); #define MAX_A 1e5+5 #define V 450 using namespace std; const int MOD = 1e9+7; const int nax = 2e5+5; ve<pair<long double,long double>> s; long double a[nax]; int main(){ optimise; int n; cin >> n; for (int i = 0; i < n; ++i) { long double x,mr; cin >> x >> mr; s.pb({x,mr}); } for (int i = 0; i < n; ++i) { long double mx = s[i].se; for (int j = 0; j < i; ++j) { long double r = ((s[j].fi-s[i].fi)*(s[j].fi-s[i].fi))/(long double) (4*a[j]); mx = min(mx, r); } a[i] = mx; cout << mx << endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...