#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<vi> vvi; typedef vector<bool> vb; #define eb emplace_back #define pb push_back #define loop(i, a, b) for (int i = a; i < b; i++) #define rloop(i, a, b) for (int i = a; i >= b; i--) #define all(x) (x).begin(), (x).end() int main() { cin.tie(0)->sync_with_stdio(false); ll n, m, s, a, b, wyn = -3ll; vector<pair<ll, ll>> wek; cin >> n >> m >> s; loop(i, 0, m) { cin >> a >> b; wek.pb({ a,b }); } wek.pb({ s,s }); for (pair<ll, ll>& par : wek) { ll potL = par.first - 1ll, potR = par.second + 1ll; if (potR <= n) { bool ok = true; for (pair<ll, ll>& par2 : wek) { if (par2.first <= potR && par2.second >= potR) { ok = false; break; } } if (ok) if (abs(s - wyn) > abs(s - potR) || (abs(s - wyn) == abs(s - potR) && potR < wyn) || wyn==-3ll) wyn = potR; } if (potL > 0) { bool ok = true; for (pair<ll, ll>& par2 : wek) { if (par2.first <= potL && par2.second >= potL) { ok = false; break; } } if (ok) if (abs(s - wyn) > abs(s - potL) || (abs(s-wyn)==abs(s-potL) && potL<wyn) || wyn == -3ll) wyn = potL; } } cout << wyn << endl; 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 | #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<vi> vvi; typedef vector<bool> vb; #define eb emplace_back #define pb push_back #define loop(i, a, b) for (int i = a; i < b; i++) #define rloop(i, a, b) for (int i = a; i >= b; i--) #define all(x) (x).begin(), (x).end() int main() { cin.tie(0)->sync_with_stdio(false); ll n, m, s, a, b, wyn = -3ll; vector<pair<ll, ll>> wek; cin >> n >> m >> s; loop(i, 0, m) { cin >> a >> b; wek.pb({ a,b }); } wek.pb({ s,s }); for (pair<ll, ll>& par : wek) { ll potL = par.first - 1ll, potR = par.second + 1ll; if (potR <= n) { bool ok = true; for (pair<ll, ll>& par2 : wek) { if (par2.first <= potR && par2.second >= potR) { ok = false; break; } } if (ok) if (abs(s - wyn) > abs(s - potR) || (abs(s - wyn) == abs(s - potR) && potR < wyn) || wyn==-3ll) wyn = potR; } if (potL > 0) { bool ok = true; for (pair<ll, ll>& par2 : wek) { if (par2.first <= potL && par2.second >= potL) { ok = false; break; } } if (ok) if (abs(s - wyn) > abs(s - potL) || (abs(s-wyn)==abs(s-potL) && potL<wyn) || wyn == -3ll) wyn = potL; } } cout << wyn << endl; return 0; } |