제출 #681919

#제출 시각아이디문제언어결과실행 시간메모리
681919vjudge1Mobile (BOI12_mobile)C++17
0 / 100
684 ms32440 KiB
#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; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...