#include <bits/stdc++.h> using namespace std; const int M = 1003; pair<long long, long long> tab[M]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); long long n, m, s; cin >> n >> m >> s; for(int i = 0; i < m; i++) { cin >> tab[i].first >> tab[i].second; } sort(tab, tab + m); int a = 0, b = m; int mid; while(a < b) { mid = (a + b) / 2; if(s < tab[mid].first) { b = mid; } else if(tab[mid].second < s) { a = mid + 1; } else break; } int i = mid; while(i > 0 && tab[i-1].second == tab[i].first - 1) i--; long long left_free = tab[i].first - 1; i = mid; while(i < m-1 && tab[i].second + 1 == tab[i+1].first) i++; long long right_free = tab[i].second + 1; if(left_free == 0) cout << right_free << "\n"; else if(right_free == n+1) cout << left_free << "\n"; else { if(s - left_free > right_free - s) cout << right_free << "\n"; else cout << left_free << "\n"; } 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 | #include <bits/stdc++.h> using namespace std; const int M = 1003; pair<long long, long long> tab[M]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); long long n, m, s; cin >> n >> m >> s; for(int i = 0; i < m; i++) { cin >> tab[i].first >> tab[i].second; } sort(tab, tab + m); int a = 0, b = m; int mid; while(a < b) { mid = (a + b) / 2; if(s < tab[mid].first) { b = mid; } else if(tab[mid].second < s) { a = mid + 1; } else break; } int i = mid; while(i > 0 && tab[i-1].second == tab[i].first - 1) i--; long long left_free = tab[i].first - 1; i = mid; while(i < m-1 && tab[i].second + 1 == tab[i+1].first) i++; long long right_free = tab[i].second + 1; if(left_free == 0) cout << right_free << "\n"; else if(right_free == n+1) cout << left_free << "\n"; else { if(s - left_free > right_free - s) cout << right_free << "\n"; else cout << left_free << "\n"; } return 0; } |