Submission #1190791

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
void rd(int &x){
  int k, m=0;
  x=0;
  for(;;){
    k = getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
void wt_L(int x){
  char f[10];
  int m=0, s=0;
  if(x<0){
    m=1;
     x=-x;
  }
  while(x){
    f[s++]=x%10;
     x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    putchar_unlocked('-');
  }
  while(s--){
    putchar_unlocked(f[s]+'0');
  }
}
int A[50], B[50], C[50], D[50], M, N;
int main(){
  int i, j, mn, res, tmp;
  rd(N);
  rd(M);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=0;Lj4PdHRW<N;Lj4PdHRW++){
      rd(A[Lj4PdHRW]);
      rd(B[Lj4PdHRW]);
    }
  }
  {
    int KL2GvlyY;
    for(KL2GvlyY=0;KL2GvlyY<M;KL2GvlyY++){
      rd(C[KL2GvlyY]);
      rd(D[KL2GvlyY]);
    }
  }
  for(i=0;i<N;i++){
    mn = 1073709056;
    for(j=0;j<M;j++){
      tmp = abs(A[i]-C[j]) + abs(B[i]-D[j]);
      if(mn > tmp){
        mn = tmp;
         res = j;
      }
    }
    wt_L(res+1);
    putchar_unlocked('\n');
  }
  return 0;
}
// cLay varsion 20170330-1

Submission Info

Judge Result