Submission #3225916

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include "bits/stdc++.h"
using namespace std;
typedef long long unsigned int ll;

#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()

int main(void){
int N,M;
cin >> N >> M;
const int NMMAX=50;
int A[NMMAX],B[NMMAX],C[NMMAX],D[NMMAX];

for(int i=0;i<N;++i){
cin >> A[i] >> B[i];
 }

 for(int j=0;j<M;++j){
 cin >> C[j] >> D[j];
 }

 for(int i=0;i<N;++i){
 int min_dist=abs(A[i]-C[0])+abs(B[i]-D[0]),checkpoint=1;

 for(int j=1;j<M;++j){
 const int cur_dist=abs(A[i]-C[j])+abs(B[i]-D[j]);
 if(min_dist>cur_dist){
 min_dist=cur_dist;
 checkpoint=j+1;
 }
 }

 cout << checkpoint << endl;
 }

 return 0;
 }

Submission Info

Judge Result