Submission #682003

#	Time	Username	Problem	Language	Result	Execution time	Memory
682003		vjudge1	Mobile (BOI12_mobile)	C++98	0 / 100	1090 ms	24468 KiB

mobile

#include <iostream>
#include <cmath>
using namespace std;

struct Point {
    int x, y;
};

double distance(Point p1, Point p2) {
    return sqrt((p1.x - p2.x)*(p1.x - p2.x) + (p1.y - p2.y)*(p1.y - p2.y));
}

int main() {
    int n, l;
    cin >> n >> l;
    Point stations[n];
    for (int i = 0; i < n; i++) {
        cin >> stations[i].x >> stations[i].y;
    }

    double max_distance = 0;
    int left = 0, right = 1;
    for (int i = 0; i <= l; i++) {
        Point highway_point = {i, 0};
        while (right < n && distance(stations[right], highway_point) < distance(stations[left], highway_point)) {
            left++;
            right++;
        }
        max_distance = max(max_distance, distance(stations[left], highway_point));
    }
    cout << max_distance << 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