Submission #1056993

#TimeUsernameProblemLanguageResultExecution timeMemory
1056993anangoTiles (BOI24_tiles)C++17
4 / 100
0 ms604 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...