Submission #729833

#TimeUsernameProblemLanguageResultExecution timeMemory
729833MathandskiBalloons (CEOI11_bal)C++14
50 / 100
2074 ms2796 KiB
#define pb push_back #define mp make_pair #define mt make_tuple #define is insert #define lll long long #define f0r(i, begin, n) for (lll i = begin; i < n; i ++) #define len(x) x.size() #define vi vector<int> #define vpi vector<pair<int, int>> #include <bits/stdc++.h> using namespace std; set<string> names; vector<pair<double, double>> hist; double sizd (double a, double pa, double pb) { return ((a - pa) * (a - pa)) / (4 * pb); } int main() { lll N; cin >> N; f0r (i, 0, N) { double a, b; cin >> a >> b; double best = b; f0r (j, 0, i) { double pa = hist[j].first, pb = hist[j].second; best = min(best, sizd(a, pa, pb)); } hist.pb({a, best}); cout << fixed << setprecision(3) << best << 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...