이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
#ifdef ONLINE_JUDGE
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#endif //fast IO
int n,m; cin >> n >> m;
if (n==4) {
vector<pair<int,int>> pts;
vector<int> X,Y;
X=vector<int>(n); Y=vector<int>(n);
for (int i=0; i<n; i++) {
int x,y; cin >> x >> y; pts.push_back({x,y});
X[i] = x; Y[i] = y;
}
sort(pts.begin(), pts.end());
int minx = *min_element(X.begin(), X.end());
int miny = *min_element(Y.begin(), Y.end());
int maxx = *max_element(X.begin(), X.end());
int maxy = *max_element(Y.begin(), Y.end());
if ((maxy-miny)%2==1) {
cout << 0 << endl;
}
else {
cout << maxx-(maxx-minx)%2 << endl;
}
}
}
# | 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... |