제출 #633259

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
633259		afatpotato	Mobile (BOI12_mobile)	C++14	0 / 100	1096 ms	56804 KiB

mobile

#include <bits/stdc++.h>

using namespace std;

bool solve(double x);

vector<pair<double, double> > tower;
long long n, l;

int main() {
    cin >> n >> l;
    tower.resize(n);
    for (int i = 0; i < n; i++) {
        cin >> tower[i].first >> tower[i].second;
    }
    double low = 0;
    double high = 4e9;
    double ans = 0;

    while (high - low > 1e-4) {
        double mid = (low + high) / 2;
        if (solve(mid)) {
            ans = mid;
            high = mid;
        } else {
            low = mid;
        }
    }
    cout << fixed;
    cout << setprecision(9);
    cout << ans << endl;
}

bool solve(double x) {
    vector<pair<double, double> > v;
    for (int i = 0; i < n; i++) {


        if (tower[i].second > x) {
            continue;
        }

        double d = sqrt(x * x - tower[i].second * tower[i].second);
        if (tower[i].first + d < 0) {
            continue;
        }

        v.push_back(make_pair(max(tower[i].first - d, (double) 0), max(tower[i].first + d, (double) 0)));
    }

    sort(v.begin(), v.end());
    if (v[0].first > 0) {
        return false;
    }
    double r = v[0].second;
    for (int i = 1; i < v.size(); i++) {
        if (r < v[i].first) {
            return false;
        } else {
            r = max(r, v[i].second);
        }
    }
    if (r < l) {
        return false;
    }
    return true;
}

컴파일 시 표준 에러 (stderr) 메시지

mobile.cpp: In function 'bool solve(double)':
mobile.cpp:56:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<double, double> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     for (int i = 1; i < v.size(); i++) {
      |                     ~~^~~~~~~~~~

• 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