Submission #3778070

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <stdio.h>
#include <math.h>
#include <time.h>
#include <string>
#include <tuple>
#include <vector>
#include <map>
#include <unordered_map>
#include <list>
#include <set>
#include <stack>
#include <queue>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <cassert>
using namespace std;
#define LL long long
#define MP(a, b) make_pair(a, b)
#define MMP(a, b, c) make_pair(make_pair(a, b), c)
#define MAX 1000000000
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -2147483648
#define INT_MAX 2147483647
#define LL_MIN -9223372036854775808
#define LL_MAX 9223372036854775807
#define PI 3.14159265359

int main(){
	int N,M;
	cin >> N >> M;
	int a[50],b[50],c[50],d[50];
	for(int i=0; i<N; i++) cin >> a[i] >> b[i];
	for(int i=0; i<M; i++) cin >> c[i] >> d[i];

	for(int i=0; i<N; i++){
		int ans = 0;
		int m = INT_MAX;
		for(int j=0; j<M; j++){
			if(abs(a[i]-c[j])+abs(b[i]-d[j]) < m){
				ans = j;
				m = abs(a[i]-c[j])+abs(b[i]-d[j]);
			}
		}
		cout << ans << endl;
	}
}

Submission Info

Judge Result