# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1056991 |
2024-08-13T12:52:49 Z |
anango |
Tiles (BOI24_tiles) |
C++17 |
|
1 ms |
600 KB |
#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});
}
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 |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
600 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |