제출 #1294753

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1294753		srittheboss	Mobile (BOI12_mobile)	C++20	0 / 100	257 ms	16092 KiB

mobile

#include "bits/stdc++.h"
#define INF 1e18
using namespace std;



int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    double n, l;
    cin >> n >> l;
    vector<pair<double, double>> stations(n);

    for (int i = 0; i < n; i++) {
        cin >> stations[i].first >> stations[i].second;
    }

    stack<pair<double, double>> s;

    s.push({0, -INF});

    for (int i = 1; i < n; i++) {


        double d = (pow(stations[i].first, 2) + pow(stations[i].second, 2) - pow(stations[s.top().first].first, 2)
            - pow(stations[s.top().first].second, 2)) / (2 * (stations[i].first - stations[s.top().first].second));

        while (d < s.top().first) {
            s.pop();
            d = (pow(stations[i].first, 2) + pow(stations[i].second, 2) - pow(stations[s.top().first].first, 2)
            - pow(stations[s.top().first].second, 2)) / (2 * (stations[i].first - stations[s.top().first].second));
        }

        s.push({i, d});

    }

    double r = INF;

    while (s.size() > 1) {
        pair<double, double> p = s.top();
        s.pop();
        r = min(r, pow(stations[p.first].first - p.second, 2) + pow(stations[p.first].second, 2));
    }

    cout << sqrt(r) << endl;


}

• 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