Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- const int inf = 1e9;
- const int N = 1e3 + 10;
- const int M = 1e3 + 10;
- using pi = pair <int, int>;
- pi fire[N], tiger[M];
- unordered_map <int, int> cnt;
- int dist(pi a, pi b){
- return abs(a.first - b.first) + abs(a.second - b.second);
- }
- int main(){
- int n, m;
- scanf("%d %d", &n, &m);
- for(int i = 1; i <= n; i ++)
- scanf("%d %d", &fire[i].first, &fire[i].second);
- for(int i = 1; i <= m; i ++)
- scanf("%d %d", &tiger[i].first, &tiger[i].second);
- for(int i = 1; i <= m; i ++){
- int mn = inf;
- for(int j = 1; j <= n; j ++){
- mn = min(mn, dist(fire[j], tiger[i]));
- }
- cnt[mn] ++;
- }
- int mx = 0;
- for(auto i: cnt)
- mx = max(mx, i.second);
- printf("%d", mx);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement