Submission #681919

#	Time	Username	Problem	Language	Result	Execution time	Memory
681919		vjudge1	Mobile (BOI12_mobile)	C++17	0 / 100	684 ms	32440 KiB

mobile

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

const int MAXN = 1000000;
int n;
long long l;
pair<long long, long long> a[MAXN];

bool check(long long dist) {
    long long cur = 0;
    for (int i = 0; i < n; i++) {
        if (a[i].first - dist > cur) return false;
        cur = max(cur, a[i].first + dist);
    }
    return cur >= l;
}

int main() {
    cin >> n >> l;
    for (int i = 0; i < n; i++) {
        cin >> a[i].first >> a[i].second;
    }
    long long left = 0;
    long long right = 1e18;
    while (left < right) {
        long long mid = (left + right) / 2;
        if (check(mid)) {
            right = mid;
        } else {
            left = mid + 1;
        }
    }
    cout << left << 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