제출 #417580

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
417580		jackkkk	Mobile (BOI12_mobile)	C++11	50 / 100	1097 ms	48160 KiB

mobile

#include <stdio.h>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <array>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <algorithm>
#include <stdlib.h>
#include <math.h>
#include <list>
#include <float.h>
#include <climits>
using namespace std;

void quit(){
    cout.flush();
    exit(0);
}

int n, l;
vector <pair<double, double>> towers;
bool good(double dist){
    vector <pair<double ,double>> intervals;
    //get_intervals
    for(const auto &tower : towers){
        if(abs(tower.second)>dist){
            continue;
        }
        double range = sqrt((dist*dist)-(tower.second*tower.second));
        intervals.emplace_back(tower.first-range, tower.first+range);
    }
    sort(intervals.begin(), intervals.end());
	if(intervals.size()==0){
		return false;
	}
    double s = intervals[0].first, f = intervals[0].second;
	intervals.emplace_back(1e50,1e50); //so that it iterates the last one
    for(size_t i = 1; i < intervals.size(); i++){
        if(f<intervals[i].first){
            if(s<=0 && f>=l){
				return true;
			}
			s=intervals[i].first;
			f=intervals[i].second;
        }
		else{
        	f=max(f, intervals[i].second);
		}
    }
    return false;
}
int main() {
	//freopen("qwer.in", "r", stdin);
	//freopen("qwer.out", "w", stdout);
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n >> l;
	towers.resize(n);
	for(int i = 0; i < n; i++){
	    cin >> towers[i].first >> towers[i].second;
	}
	
	double s = 0, e = 1e10, mid;
    while(e-s>0.001){
        mid = (s+e)/2;
        if(good(mid)){
            e=mid;
        }
        else{
            s=mid;
        }
    }
    cout << fixed << setprecision(10) <<e << "\n";
	
	
	quit();
}

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 4 / 4
• Subtask 4: 4 / 4
• Subtask 5: 4 / 4
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 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