#include <bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); long long n, s, result, id; int m; pair<long long, long long>* arr; cin >> n >> m >> s; arr = new pair<long long, long long>[m]; for(int i = 0; i < m; ++i){ cin >> arr[i].first >> arr[i].second; } sort(arr, arr + m); result = 1000000000000000; for(int i = 1; i < m - 1; ++i){ if(arr[i].first - 1 > arr[i - 1].second){ if(result > abs(arr[i].first - 1 - s)){ result = abs(arr[i].first - 1 - s); id = arr[i].first - 1; } } if(arr[i].second + 1 < arr[i + 1].first){ if(result > abs(arr[i].second + 1 - s)){ result = abs(arr[i].second + 1 - s); id = arr[i].second + 1; } } } if(arr[0].first > 1){ if(result > abs(arr[0].first - 1 - s)){ result = abs(arr[0].first - 1 - s); id = arr[0].first - 1; } } if(arr[0].second < n && (m == 1 || arr[1].first - 1 > arr[0].second)){ if(result > abs(arr[0].second + 1 - s)){ result = abs(arr[0].second + 1 - s); id = arr[0].second + 1; } } if(arr[m - 1].first > 1 && (m == 1 || arr[m - 2].second + 1 < arr[m - 1].first)){ if(result > abs(arr[m - 1].first - 1 - s)){ result = abs(arr[m - 1].first - 1 - s); id = arr[m - 1].first - 1; } } if(arr[m - 1].second < n){ if(result > abs(arr[m - 1].second + 1 - s)){ result = abs(arr[m - 1].second + 1 - s); id = arr[m - 1].second + 1; } } cout << id ; delete [] arr; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 | #include <bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); long long n, s, result, id; int m; pair<long long, long long>* arr; cin >> n >> m >> s; arr = new pair<long long, long long>[m]; for(int i = 0; i < m; ++i){ cin >> arr[i].first >> arr[i].second; } sort(arr, arr + m); result = 1000000000000000; for(int i = 1; i < m - 1; ++i){ if(arr[i].first - 1 > arr[i - 1].second){ if(result > abs(arr[i].first - 1 - s)){ result = abs(arr[i].first - 1 - s); id = arr[i].first - 1; } } if(arr[i].second + 1 < arr[i + 1].first){ if(result > abs(arr[i].second + 1 - s)){ result = abs(arr[i].second + 1 - s); id = arr[i].second + 1; } } } if(arr[0].first > 1){ if(result > abs(arr[0].first - 1 - s)){ result = abs(arr[0].first - 1 - s); id = arr[0].first - 1; } } if(arr[0].second < n && (m == 1 || arr[1].first - 1 > arr[0].second)){ if(result > abs(arr[0].second + 1 - s)){ result = abs(arr[0].second + 1 - s); id = arr[0].second + 1; } } if(arr[m - 1].first > 1 && (m == 1 || arr[m - 2].second + 1 < arr[m - 1].first)){ if(result > abs(arr[m - 1].first - 1 - s)){ result = abs(arr[m - 1].first - 1 - s); id = arr[m - 1].first - 1; } } if(arr[m - 1].second < n){ if(result > abs(arr[m - 1].second + 1 - s)){ result = abs(arr[m - 1].second + 1 - s); id = arr[m - 1].second + 1; } } cout << id ; delete [] arr; return 0; } |