Submission #680258

#TimeUsernameProblemLanguageResultExecution timeMemory
680258peijarBalloons (CEOI11_bal)C++17
100 / 100
203 ms12620 KiB
#include <bits/stdc++.h> #define int long long using namespace std; namespace std { template <typename T> ostream &operator<<(ostream &out, const vector<T> &vec) { out << "["; for (int i = 0; i < (int)vec.size(); ++i) { out << vec[i]; if (i + 1 < (int)vec.size()) out << ", "; } return out << "]"; } } // namespace std void dbg_out() { cout << endl; } template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); } #ifdef DEBUG #define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__) #else #define dbg(...) #endif double sq(int x) { return x * x; } signed main(void) { ios_base::sync_with_stdio(false); cin.tie(0); int N; cin >> N; vector<int> x(N); vector<double> r(N); for (int i = 0; i < N; ++i) { cin >> x[i] >> r[i]; } stack<pair<int, double>> stk; for (int i = 0; i < N; ++i) { while (!stk.empty()) { auto [X, R] = stk.top(); r[i] = min(r[i], sq(X - x[i]) / (4 * R)); if (r[i] > R) stk.pop(); else break; } stk.emplace(x[i], r[i]); } for (int i = 0; i < N; ++i) { cout << setprecision(15) << fixed << r[i] << '\n'; } }
#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...