제출 #533040

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
533040		Stormersyle	Mobile (BOI12_mobile)	C++14	0 / 100	1067 ms	56924 KiB

mobile

#include <iostream>
#include <bits/stdc++.h> 
#include <array>
#include <fstream>
#include <string>
#include <algorithm>
#include <cmath>
#include <sstream>  
#include <iomanip>
using namespace std;
using ll=long long;

double N, L;
vector<pair<double, double>> c; //{x, y}

bool check(double R){ //checks to see if max distance >=R is possible; find last true
  vector<pair<double, double>> I;
  for (pair<double, double> coord: c){
    double x=coord.first, y=coord.second;
    I.push_back({x-sqrt(R*R-y*y), x+sqrt(R*R-y*y)});
  }
  sort(I.begin(), I.end());
  // for (auto p: I) cout<<"("<<p.first<<" "<<p.second<<")  ";
  // cout<<"\n";
  int s=0;
  double M=-1000000000; //M=max endpoint so far
  while (I[s].first<0) M=max(M, I[s].second), s++;
  for (int i=s; i<N; i++){ //since I.size()==N
    if (I[i].first>M) return true;
    M=max(M, I[i].second);
  }
  if (L>M) return true;
  return false;
}

int main() {
  cin>>N>>L;
  for (int i=0; i<N; i++){
    double x, y;
    cin>>x>>y;
    c.push_back({x, y});
  }

  ll lo=0, hi=1000000000000000;
	lo--;
	while (lo < hi) {
		ll mid = lo + (hi - lo + 1) / 2;
    double R=mid/1000000.0;
		if (check(R)) {
			lo = mid;
		} else {
			hi = mid - 1;
		}
	}
	cout<<setprecision(6)<<lo/1000000.0;
  // cout<<check(5);
}

• 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