#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
double cur = rngesus(0, MASK(60) - 1);
cur /= MASK(60) - 1;
return l + cur * (r - l);
}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
pair<double, double> god_point = {1e9, 1e9};
double sqr(double x){return x * x;}
double distance(pair<double, double> a, pair<double, double> b){
return sqrt(sqr(a.first - b.first) + sqr(a.second - b.second));
}
int main(void){
ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
clock_t start = clock();
int n; cin >> n;
vector<int> x(n), radius(n);
for(int i = 0; i<n; ++i) cin >> x[i] >> radius[i];
vector<double> ans(n);
cout << fixed << setprecision(3);
vector<int> st;
for(int i = 0; i<n; ++i){
double l = 0, r = radius[i];
for(int j = 0; j < 70; ++j){
double mid = (l + r) / 2;
pair<double, double> p = {x[i], mid};
bool check = true;
for(int k: st){
pair<double, double> cur = {x[k], ans[k]};
if (distance(cur, p) < ans[k] + mid) check = false;
}
if (check) l = mid;
else r = mid;
}
ans[i] = l;
while(st.size()){
int k = st.back();
pair<double, double> p = {x[i], ans[i]};
pair<double, double> prev = {x[k], ans[k]};
if (prev.second < p.second) st.pop_back();
// if (distance(god_point, prev) - ans[k] > distance(god_point, p) - ans[i]) st.pop_back();
else break;
}
st.push_back(i);
}
printArr(ans, "\n");
cerr << "Time elapsed: " << clock() - start << " ms\n";
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
10 numbers |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
2 numbers |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
348 KB |
505 numbers |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
62 ms |
492 KB |
2000 numbers |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
940 ms |
944 KB |
20000 numbers |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2013 ms |
1272 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2053 ms |
2048 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2029 ms |
2292 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2061 ms |
2652 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2035 ms |
3412 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
