This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
//#define int long long
#define ll long long
#define y1 YONE
typedef unsigned long long ull;
using namespace std;
const int N=2e5+5;
int n,x[N],y[N],m,inp;
int32_t main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
cin>>inp>>m;
for (int i=1;i<=inp;i++){
int xx,yy;
cin>>xx>>yy;
if (i<=2){
x[++n]=xx;
y[n]=yy;
continue;
}
if (xx==x[n] && xx==x[n-1]){
x[n]=xx;
y[n]=yy;
continue;
}
if (yy==y[n] && yy==y[n-1]){
x[n]=xx;
y[n]=yy;
continue;
}
x[++n]=xx;
y[n]=yy;
}
if (n==2){
cout<<m<<endl;
return 0;
}
if (n==4){
sort(x+1,x+1+n);
sort(y+1,y+1+n);
if (y[1]==y[n]){
cout<<m<<endl;
return 0;
}
if ((y[n]-y[1])&1){
cout<<x[1]<<endl;
return 0;
}
cout<<x[n]-bool((x[n]-x[1])&1)<<endl;
return 0;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |