Submission #6402604

---

Source Code Expand

#include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<utility>
#include<tuple>
#include<algorithm>
#include<cmath>
using namespace std;

#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;

int main() {
  int N, M;
  cin >> N >> M;
  vector<int> a(N), b(N), c(M), d(M);
  rep(i, N) cin >> a[i] >> b[i];
  rep(i, M) cin >> c[i] >> d[i];
  rep(i, N) {
    int mn=1e9, num;
    rep(j, M) {
      int dist = abs(a[i]-c[j])+abs(b[i]-d[j]);
      if(dist < mn) {
        mn = dist;
        num = j+1;
      }
    }
    cout << num << endl;
  }
  return 0;
}

Submission Info

Judge Result