제출 #1168723

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1168723		julia_08	Mobile (BOI12_mobile)	C++20	0 / 100	114 ms	20104 KiB

mobile

#include <bits/stdc++.h>
using namespace std;

using ld = long double;
using ll = long long;

struct point{
  ll x, y;
};

vector<point> p;

ld solve(int i, int j){

  ll x1 = p[i].x, y1 = p[i].y;
  ll x2 = p[j].x, y2 = p[j].y;

  return (ld) (x2 * x2 + y2 * y2 - x1 * x1 - y1 * y1) / ((x2 - x1) * 2.0);

}

int main(){
  cin.tie(0)->sync_with_stdio(0);

  int n; ll l; cin >> n >> l;

  for(int i=1; i<=n; i++){
    ll x, y; cin >> x >> y;

    if(!p.empty() && x == p.back().x){
      p.back().y = min(p.back().y, abs(y));

    } else p.push_back({x, abs(y)});

  }

  stack<int> q;

  ld last_x = 0;

  for(int i=0; i<p.size(); i++){

    while(!q.empty() && solve(q.top(), i) < last_x){
      last_x = solve(q.top(), i);
      q.pop();
    }

    q.push(i);

  }

  ld ans = 0;

  int last_i = 0;

  if(!q.empty()){
    last_i = q.top();
    q.pop();
  }

  while(!q.empty()){

    ld cur_x = solve(q.top(), last_i);

    ans = max(ans, (ld) ((p[last_i].x - cur_x) * (p[last_i].x - cur_x) + p[last_i].y * p[last_i].y));

    last_i = q.top();
    q.pop();

  }

  ld dist_1 = (ld) (p[1].x * p[1].x + p[1].y * p[1].y), dist_l = (ld) ((l - p[1].x) * (l - p[1].x) + p[1].y * p[1].y);

  for(int i=0; i<p.size(); i++){
    dist_1 = min(dist_1, (ld) (p[i].x * p[i].x + p[i].y * p[i].y));
    dist_l = min(dist_l, (ld) ((l - p[i].x) * (l - p[i].x) + p[i].y * p[i].y));
  }

  ans = max({ans, dist_1, dist_l});

  cout << fixed << setprecision(6) << sqrt(ans) << "\n";

  return 0;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 4
• Subtask 3: 0 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5
• Subtask 21: 0 / 5