| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 840040 |
2023-08-31T02:34:07 Z |
tfgs |
Balloons (CEOI11_bal) |
C++17 |
|
343 ms |
7136 KB |
#include <bits/stdc++.h>
using namespace std;
using pll = pair<long long, long long>;
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define vi vector<ll>
#define vb vector<bool>
#define f0(i,a) for(ll i=0;i<(a);i++)
#define f1(i,a) for(ll i=1;i<(a);i++)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define f first
#define s second
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
// http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2016/p0200r0.html
template<class Fun> class y_combinator_result {
Fun fun_;
public:
template<class T> explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}
template<class ...Args> decltype(auto) operator()(Args &&...args) { return fun_(std::ref(*this), std::forward<Args>(args)...); }
};
template<class Fun> decltype(auto) y_combinator(Fun &&fun) { return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun)); }
#ifdef I_AM_NOOB
#define gg(...) [](const auto&...x){ char c='='; cerr<<#__VA_ARGS__; ((cerr<<exchange(c,',')<<x),...); cerr<<endl; }(__VA_ARGS__);
#else
#define gg(...) 777771449
#endif
constexpr ll INFF = 1e18;
constexpr ll P = 1e9+7;
// constexpr ll P = 998244353;
int main() {
cin.tie(0) -> ios::sync_with_stdio(0);
ll n; while (cin >> n) {
vector<pair<ll, double>> stk;
vector<double> ans(n);
auto f = [&](pair<ll, double> a, ll bx) -> double {
return pow(bx-a.f, 2) / (4.0*a.s);
};
f0(i, n) {
ll x, r; cin >> x >> r;
double mx = r;
while (!stk.empty()) {
auto last = stk.back();
mx = min(mx, f(last, x));
//if the new radius is larger, we don't care about the
//previous most limiting
if (mx >= last.s) {
stk.pop_back(); continue;
} else break;
}
stk.pb({ x, mx });
ans[i] = mx;
// ans[i] = min(1.0*r[i], f(stk.back(), i));
// if (i < n-1) {
// if (f(stk.back(), i+1) > f(i, i+1)) stk.pb(i);
// // while (f(stk.back(), i+1) > f(i, i+1)) {
// // }
// }
}
for (auto x : ans) {
cout << fixed << setprecision(3) << x << endl;
}
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
10 numbers |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
2 numbers |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
505 numbers |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
340 KB |
2000 numbers |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
34 ms |
596 KB |
20000 numbers |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
83 ms |
1360 KB |
50000 numbers |
| 2 |
Correct |
78 ms |
2000 KB |
49912 numbers |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
173 ms |
2268 KB |
100000 numbers |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
198 ms |
2412 KB |
115362 numbers |
| 2 |
Correct |
185 ms |
4300 KB |
119971 numbers |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
267 ms |
3108 KB |
154271 numbers |
| 2 |
Correct |
343 ms |
7136 KB |
200000 numbers |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
337 ms |
3448 KB |
200000 numbers |
| 2 |
Correct |
324 ms |
6968 KB |
199945 numbers |
