제출 #424415

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
424415		winstonyin	Mobile (BOI12_mobile)	C++11	100 / 100	963 ms	35476 KiB

mobile

#include <string>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cmath>
#include <array>
#include <map>
#include <set>
#include <fstream>
#include <unordered_map>
#include <queue>
#include <iomanip>
using namespace std;
using pi = pair<int, int>;
using pd = pair<double, double>; 
#define ll long long
#define all(x) (x).begin(), (x).end()

int n_stations, l_highway;
vector<pd> locations; 
bool works(double radius) {
    double curr = 0;
    for(int i = 0; i < n_stations; i++) {
        double delta = sqrt(radius*radius - locations[i].second*locations[i].second);
        double left = locations[i].first - delta, right = locations[i].first + delta;
        if(left <= curr) {
            curr = max(curr, right);
        }
    }
    return curr >= l_highway;
}
int main() {
    ios_base::sync_with_stdio(0);
	cin.tie(0);
    cin >> n_stations >> l_highway;
    for(int i = 0; i < n_stations; i++) {
        double x,y; cin >> x >> y;
        locations.push_back({x,y});
    }
    double a = 0, b = 1.5e9;
    double ans; 
    while(b - a > 1e-3) {
        double m = (a+b)/2.0; 
        if(works(m)) {
            b = m;
            ans = m;
        }
        else {
            a = m;
        }
    }
    cout << fixed << setprecision(4) << ans;
    return 0;
}

• 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: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 5 / 5
• Subtask 19: 5 / 5
• Subtask 20: 5 / 5
• Subtask 21: 5 / 5