#include <bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define pb push_back
#define pf push_front
#define in insert
#define f first
#define s second
#define pii pair<int, int>
#define pib pair<int, bool>
#define cint const int
#define mn2 262144
#define nw '\n'
#define sp " "
#define mn 8009
#define inf 400009
#define int long long
using namespace std;
ll n, wyn, pref=-1, pres=-1, sz, bes=LLONG_MAX;
int m;
vector<pair<ll, ll>> v;
// void check(int x, int y){
// if(x>y){
// int tmp=abs(sz-x);
// //cout<<y<<" "<<tmp<<" \n";
// if(tmp<bes){
// wyn=x;
// bes=tmp;
// }
// else if(tmp==bes) wyn=min(wyn, x);
// }
// }
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin>>n>>m>>sz;
int a, b;
for(int i=1; i<=m; ++i){
cin>>a>>b;
v.pb({a, b});
}
sort(v.begin(), v.end());
int nxt, tmp;
//cout<<nw;
for(int i=0; i<m; ++i){
pii it=v[i];
//cout<<it.f<<" "<<it.s<<"\n";
if(i>0) nxt=v[i-1].s;
else nxt=0;
if(it.f-1>nxt){
tmp=abs(sz-(it.f-1));
//cout<<nxt<<" "<<tmp<<" \n";
if(tmp<bes){
wyn=it.f-1;
bes=tmp;
}
else if(tmp==bes) wyn=min(wyn, it.f-1);
}
if(i+1<m) nxt=v[i+1].f;
else nxt=n+1;
if(it.s+1<nxt){
tmp=abs(sz-(it.s+1));
//cout<<nxt<<" "<<tmp<<" \n";
if(tmp<bes){
wyn=it.s+1;
bes=tmp;
}
else if(tmp==bes) wyn=min(wyn, it.s+1);
}
if(it.s<sz && sz<nxt){
if(sz-1>it.s){
tmp=abs(sz-1);
cout<<nxt<<" "<<tmp<<" \n";
if(tmp<bes){
wyn=sz-1;
bes=tmp;
}
else if(tmp==bes) wyn=min(wyn, sz-1);
}
else if(sz+1<nxt){
tmp=abs(sz+1);
cout<<nxt<<" "<<tmp<<" \n";
if(tmp<bes){
wyn=sz+1;
bes=tmp;
}
else if(tmp==bes) wyn=min(wyn, sz+1);
}
}
pref=it.f; pres=it.s;
//cout<<nw<<nw;
}
cout<<wyn;
}
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 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 | #include <bits/stdc++.h> #define ull unsigned long long #define ll long long #define pb push_back #define pf push_front #define in insert #define f first #define s second #define pii pair<int, int> #define pib pair<int, bool> #define cint const int #define mn2 262144 #define nw '\n' #define sp " " #define mn 8009 #define inf 400009 #define int long long using namespace std; ll n, wyn, pref=-1, pres=-1, sz, bes=LLONG_MAX; int m; vector<pair<ll, ll>> v; // void check(int x, int y){ // if(x>y){ // int tmp=abs(sz-x); // //cout<<y<<" "<<tmp<<" \n"; // if(tmp<bes){ // wyn=x; // bes=tmp; // } // else if(tmp==bes) wyn=min(wyn, x); // } // } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin>>n>>m>>sz; int a, b; for(int i=1; i<=m; ++i){ cin>>a>>b; v.pb({a, b}); } sort(v.begin(), v.end()); int nxt, tmp; //cout<<nw; for(int i=0; i<m; ++i){ pii it=v[i]; //cout<<it.f<<" "<<it.s<<"\n"; if(i>0) nxt=v[i-1].s; else nxt=0; if(it.f-1>nxt){ tmp=abs(sz-(it.f-1)); //cout<<nxt<<" "<<tmp<<" \n"; if(tmp<bes){ wyn=it.f-1; bes=tmp; } else if(tmp==bes) wyn=min(wyn, it.f-1); } if(i+1<m) nxt=v[i+1].f; else nxt=n+1; if(it.s+1<nxt){ tmp=abs(sz-(it.s+1)); //cout<<nxt<<" "<<tmp<<" \n"; if(tmp<bes){ wyn=it.s+1; bes=tmp; } else if(tmp==bes) wyn=min(wyn, it.s+1); } if(it.s<sz && sz<nxt){ if(sz-1>it.s){ tmp=abs(sz-1); cout<<nxt<<" "<<tmp<<" \n"; if(tmp<bes){ wyn=sz-1; bes=tmp; } else if(tmp==bes) wyn=min(wyn, sz-1); } else if(sz+1<nxt){ tmp=abs(sz+1); cout<<nxt<<" "<<tmp<<" \n"; if(tmp<bes){ wyn=sz+1; bes=tmp; } else if(tmp==bes) wyn=min(wyn, sz+1); } } pref=it.f; pres=it.s; //cout<<nw<<nw; } cout<<wyn; } |
English