Submission #1310455

#	Time	Username	Problem	Language	Result	Execution time	Memory
1310455		artoria_hermes	Mobile (BOI12_mobile)	C++20	0 / 100	230 ms	8260 KiB

mobile

// Tonight Gehrman Sparrow joins the hunt
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define Monarch_of_Decay ios_base::sync_with_stdio(false);
#define Son_of_Chaos cin.tie(nullptr);
#define Mother_Goddess_of_Depravity cout.tie(nullptr);
#define Inextinguishable_Ravings freopen("template.inp", "r", stdin);
#define Lord_of_The_Mysteries freopen("template.out", "w", stdout);
#define Circle_of_Inevitability ONLINE_JUDGE
#define Primordial signed
#define God_Almighty main()
#define getbit(x,y) ((x>>y)&1)

// The Fool That Does Not Belong To This Era 
// The Mysterious Ruler Above The Grey Fog 
// The King Of Black And Yellow Who Wields Good Luck 

// MIND THE MINOR DETAILS

int n,l;
pair<int,int> a[1000005];
const double eps = 1e-7;

bool check(double mx)
{
  double lim=0.0;
  double lt = 1e18, rt=-1e18;
  for (int i=1; i<=n; i++)
  {
    double lower_pos = double(a[i].first) - sqrt(mx*mx - double(a[i].second)*double(a[i].second));
    double upper_pos = double(a[i].first) + sqrt(mx*mx - double(a[i].second)*double(a[i].second));
    lower_pos = max(0.0, lower_pos);
    upper_pos = min(double(l), upper_pos);

    lt = min(lt, lower_pos);
    rt = max(rt, upper_pos);
    if (i==n || a[i+1].first != a[i].first)
    {
      if (lt > lim) return false;
      lim = rt;
      lt = 1e18, rt=-1e18;
    }
  }
  return (lim >= l);
}

Primordial God_Almighty
{
	Monarch_of_Decay 
  Son_of_Chaos
  Mother_Goddess_of_Depravity
	cin >> n >> l;
  for (int i=1; i<=n; i++) cin >> a[i].first >> a[i].second;
  double l=0, r=4*1e9, ans=0;
  while (r-l>eps)
  {
    double mid = (l+r)/2;
    if (check(mid))
    {
      ans=mid;
      r=mid;
    } else l=mid;
  }
  cout << fixed << setprecision(6) << ans;
	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