# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1004944 | emptypringlescan | Tiles (BOI24_tiles) | C++17 | 0 ms | 0 KiB |
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>
using namespace std;
int32_t main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n,m;
cin >> n >> m;
pair<int,int> arr[n];
for(int i=0; i<n; i++) cin >> arr[i].first >> arr[i].second;
int dx=abs(arr[2].first-arr[0].first),dy=abs(arr[2].second-arr[0].second);
if(dy%2){
cout << 0;
return 0;
}
if(dx%2) dx--;
cout << dx
}