제출 #1165987

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1165987		aadisaini2012	Mobile (BOI12_mobile)	C++20	0 / 100	485 ms	16068 KiB

mobile

#include <bits/stdc++.h>
using namespace std;

int main() {
    int N;
    long long L;
    cin >> N >> L;

    vector<pair<long long, long long>> stations(N);
    for (auto& [x, y] : stations) cin >> x >> y;

    double maxDist = 0;
    
    // Check from start of highway to first station
    double distStart = hypot(stations[0].first, stations[0].second);
    maxDist = max(maxDist, distStart);

    // Check from last station to end of highway
    double distEnd = hypot(L - stations[N - 1].first, stations[N - 1].second);
    maxDist = max(maxDist, distEnd);

    // Check between stations
    for (int i = 0; i < N - 1; ++i) {
        double midX = (stations[i].first + stations[i + 1].first) / 2.0;
        double midY = (stations[i].second + stations[i + 1].second) / 2.0;
        double distMid = hypot(stations[i].first - midX, stations[i].second - midY);
        maxDist = max(maxDist, distMid);
    }

    cout << fixed << setprecision(6) << maxDist << endl;
    return 0;
}

• 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