text
stringlengths 49
983k
|
|---|
#include<iostream>
using namespace std;
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=1e9;
int ansp=0;
for(int j=0;j<m;j++){
int x=abs(a[i]-c[j]);
int y=abs(b[i]-d[j]);
if(ans>x+y){
ans=x+y;
ansp=j+1;
}
}
cout << ansp << endl;
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> f(n,300000000);
int a[n], b[n], c[m], d[m], ans[n];
for(int i=0;i<n;i++) cin >> a[i] >> b[i];
for(int i=0;i<m;i++) cin >> c[i] >> d[i];
int dif;
for(int i=0;i<n;i++) {
for(int j=0;j<m;j++) {
dif = abs(a[i]-c[j])+abs(b[i]-d[j]);
if(dif < f[i]) {
f[i] = dif;
ans[i] = j+1;
}
}
}
for(int i=0;i<n;i++) cout << ans[i] << endl;
}
|
#include<bits/stdc++.h>
int n,m;
int ax[55],ay[55],bx[55],by[55];
int main(){
scanf("%d%d",&n,&m);
for(int i=1; i<=n; i++)
scanf("%d%d",&ax[i],&ay[i]);
for(int j=1; j<=m; j++)
scanf("%d%d",&bx[j],&by[j]);
for(int i=1; i<=n; i++){
int bes = 1000000000, id = -1;
for(int j=1; j<=m; j++){
int now = labs(bx[j]-ax[i]) + labs(by[j]-ay[i]);
if(now < bes){
bes = now;
id = j;
}
}
printf("%d\n",id);
}
return 0;
}
|
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
int main(){
int n, m;
scanf("%d %d", &n, &m);
std::vector<ll> a(n), b(n), c(m), d(m);
for(int i=0; i<n; i++) scanf("%ld %ld", &a[i], &b[i]);
for(int i=0; i<m; i++) scanf("%ld %ld", &c[i], &d[i]);
for(int i=0; i<n; i++){
int mind = 0;
for(int j=0; j<m; j++){
ll ne = abs(a[i]-c[j]) + abs(b[i]-d[j]);
if(abs(a[i]-c[mind])+abs(b[i]-d[mind]) > ne) mind = j;
}
printf("%d\n", mind+1);
}
}
|
#include<bits/stdc++.h>
using namespace std;
struct stu
{
int a,b;
}s[1000];
struct point
{
int x,y;
}w[1000];
inline int dis(stu a,point b)
{
return abs(a.a-b.x)+abs(a.b-b.y);
}
int main()
{
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++)cin>>s[i].a>>s[i].b;
for(int i=1;i<=m;i++)cin>>w[i].x>>w[i].y;
for(int i=1;i<=n;i++)
{
int num,maxn=1e9;
for(int j=1;j<=m;j++)
{
if(dis(s[i],w[j])<maxn)
{
num=j;
maxn=dis(s[i],w[j]);
}
}
cout<<num<<endl;
}
return 0;
}
|
#include<iostream>
#include<stdlib.h>
using namespace std;
int main(){
long long a[55][2];
long long b[55][2];
int n,m,i,j,k,x,y;
cin >> n >> m;
for(i=0;i<n;i++){
cin >> a[i][0] >> a[i][1];
}
for(i=0;i<m;i++){
cin >> b[i][0] >> b[i][1];
}
for(i=0;i<n;i++){
k=abs(a[i][0]-b[0][0])+abs(a[i][1]-b[0][1]);
x=k;
y=0;
for(j=1;j<m;j++){
k=abs(a[i][0]-b[j][0])+abs(a[i][1]-b[j][1]);
if(k<x){
x=k;
y=j;
}
}
cout << y+1 << endl;
}
cout << endl;
}
|
#include <bits/stdc++.h>
#include<stdio.h>
using namespace std;
int main(){
int n,m;
long long a[51],b[51],c[51],d[51];
cin>>n>>m;
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++){
long long ans=10000000000;
int an=0;
for(int j=0;j<m;j++){
if(abs(a[i]-c[j])+abs(b[i]-d[j])<ans)an=j;
ans=min(abs(a[i]-c[j])+abs(b[i]-d[j]),ans);
}
cout<<an+1<<endl;
}
}
|
#include <iostream>
#include <cstdlib>
#include <cmath>
using namespace std;
int main(){
int N,M,sum=0,s=0;
long long int a[50],b[50],c[50],d[50],ans[50],t[50];
cin>>N>>M;
for(int i=0;i<N;i++){
cin>>a[i]>>b[i];
t[i]=10000000000;
}
for(int j=0;j<M;j++){
cin>>c[j]>>d[j];
}
for(int i=0;i<N;i++){
for(int j=0;j<M;j++){
s=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(s<t[i]){
t[i]=s;
ans[i]=j+1;
}
}
cout<<ans[i]<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N , M , ans1 , ans2=1000000000 , ans;
cin>>N>>M;
vector<int> A(N) , B(N) , C(M) , D(M);
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++){
ans2=1000000000;
for(int j=0;j<M;j++){
ans1=abs(A[i]-C[j])+abs(B[i]-D[j]);
if(ans2>ans1){
ans2=ans1;
ans=j;
}
}
cout<<ans+1<<endl;
}
}
|
#include <stdio.h>
#include <stdlib.h>
int main(void)
{
int n,m,a[51],b[51],c[51],d[51],i,j,z;
long long int x,y;
scanf("%d%d",&n,&m);
for(i=0; i<n; i++){
scanf("%d%d",&a[i],&b[i]);
}
for(i=0; i<m; i++){
scanf("%d%d",&c[i],&d[i]);
}
for(i=0; i<n; i++){
y=10000000000000001;
for(j=0; j<m; j++){
x=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(y>x){
y=x;
z=j+1;
}
}
printf("%d\n",z);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main(){
int n,m,a[55],b[55],c[55],d[55];
cin>>n>>m;
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,data=1;
for(int j=0;j<m;j++){
int sma = abs(a[i]-c[j])+abs(b[i]-d[j]);
if(j == 0)
ans=sma;
else if(sma<ans){
ans=sma;
data=j+1;
}
}
cout<<data<<endl;
}
return(0);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;
cin>>n>>m;
std::vector<int> a(n),b(n),c(m),d(m);
int kkk,mmm,ans;
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++){
mmm=-1;
for(int j=0;j<m;j++){
kkk=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(mmm>kkk||mmm==-1){mmm=kkk;ans=j;}
}
cout<<ans+1<<endl;
}
}
|
#include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
int main() {
int n,m;
cin>>n>>m;
ll a[n+1],b[n+1],c[m+1],d[m+1];
for(int i=1;i<=n;i++) cin>>a[i]>>b[i];
for(int i=1;i<=m;i++) cin>>c[i]>>d[i];
for(int i=1;i<=n;i++){
int ans,temp=-1;
for(int j=1;j<=m;j++){
int dis=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(temp<0 || dis<temp){
temp=dis;
ans=j;
}
}
cout<<ans<<endl;
}
return 0;
}
|
#include<iostream>
#include<math.h>
using namespace std;
int main()
{
int n,m,a[50],b[50],c[50],d[50];
cin>>n>>m;
for(int i=0;i<n;i++) cin>>a[i]>>b[i];
for(int i=0;i<m;i++) cin>>c[i]>>d[i];
int minv,v[50];
for(int i=0;i<n;i++){
minv=abs(a[i]-c[0])+abs(b[i]-d[0]);
v[i]=1;
for(int j=1;j<m;j++){
if(minv>abs(a[i]-c[j])+abs(b[i]-d[j])){
minv=abs(a[i]-c[j])+abs(b[i]-d[j]);
v[i]=j+1;
}
}
}
for(int i=0;i<n;i++) cout<<v[i]<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int n, m, a[50], b[50], c[50], d[50];
cin >> n >> m;
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 s = 1e9, k;
for (int j = 0; j < m; j++) {
int t = abs(a[i] - c[j]) + abs(b[i] - d[j]);
if (s > t) s = t, k = j + 1;
}
cout << k << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<pair<int,int>> a(n),b(m);
for(auto& x:a)cin>>x.first>>x.second;
for(auto& x:b)cin>>x.first>>x.second;
for(auto x:a){
int idx=0;
int dist=(1<<28);
for(int i=0;i<m;++i){
int t=abs(x.first-b[i].first)+abs(x.second-b[i].second);
if(t<dist){
dist = t;
idx = i+1;
}
}
cout<<idx<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fr(i,n) for(int i=0;i++<n;)
ll INF=1e9;
int main(){
ll n,m,a[55],b[55],c[55],d[55],e[55][55],f[55];
cin>>n>>m;
fr(i,n) cin>>a[i]>>b[i];
fr(i,m) cin>>c[i]>>d[i];
fr(i,n) f[i]=INF;
fr(i,n){
fr(j,m){
e[i][j]=abs(a[i]-c[j])+abs(b[i]-d[j]);
f[i]=min(f[i],e[i][j]);
}
}
fr(i,n){
fr(j,m){
if(e[i][j]==f[i]){
cout<<j<<endl;
break;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
int main(){
ll n,m;
cin>>n>>m;
vll a(n),b(n),c(m),d(m);
for (ll i=0;i<n;i++) cin>>a[i]>>b[i];
for (ll i=0;i<m;i++) cin>>c[i]>>d[i];
ll min,index;
for (ll i=0;i<n;i++) {
min=1000000000;
for (ll j=0;j<m;j++) {
if (min>abs(a[i]-c[j])+abs(b[i]-d[j])) {
min=abs(a[i]-c[j])+abs(b[i]-d[j]);
index=j+1;
}
}
cout<<index<<endl;
}
}
|
#include <iostream>
#include <cmath>
using namespace std;
int N,M,A[51],B[51],C[51],D[51];
int main(){
cin >> N >> M;
for(int i=1;i<=N;i++){
cin >> A[i] >> B[i];
}
for(int i=1;i<=M;i++){
cin >> C[i] >> D[i];
}
for(int i=1;i<=N;i++){
int ans = -1,dist = 1e9;
for(int j=1;j<=M;j++){
if(dist>abs(A[i]-C[j])+abs(B[i]-D[j])){
ans = j;
dist = abs(A[i]-C[j])+abs(B[i]-D[j]);
}
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1000000000;
int main() {
int n,m;cin>>n>>m;
ll an[n],bn[n], cn[m],dn[m];
rep(i,n) cin>>an[i]>>bn[i];
rep(j,m) cin>>cn[j]>>dn[j];
ll d, dmin, dx;
rep(i,n) {
dmin=INF;
rep(j,m) {
d = abs(cn[j]-an[i]) + abs(dn[j]-bn[i]);
if (d < dmin) {
dmin = d;
dx = j+1;
}
}
cout << dx << endl;
}
}
|
#include<cstdio>
#include<cstdlib>
int main(){
int n,m;
int a[50],b[50],c[50],d[50];
scanf("%d %d",&n,&m);
for(int i=0;i<n;i++) scanf("%d %d",a+i,b+i);
for(int i=0;i<m;i++) scanf("%d %d",c+i,d+i);
for(int i=0;i<n;i++){
int ans,mi;
for(int j=0;j<m;j++){
int dist = abs(a[i]-c[j]) + abs(b[i]-d[j]);
if(j==0||dist<mi){
mi = dist;
ans = j + 1;
}
}
printf("%d\n",ans);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, b, c, sx[50], sy[50], cx[50], cy[50];
int main(){
cin >> n >> m;
for(int i = 0; i < n; i++) cin >> sx[i] >> sy[i];
for(int i = 0; i < m; i++) cin >> cx[i] >> cy[i];
for(int i = 0; i < n; i++){
b = INT_MAX;
for(int j = 0; j < m; j++){
if(abs(sx[i]-cx[j])+abs(sy[i]-cy[j]) < b){
b = abs(sx[i]-cx[j])+abs(sy[i]-cy[j]);
c = j+1;
}
}
cout << c << "\n";
}
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
int main(){
int n,m;cin >> n >> m;
int a[n],b[n];rep(i,n)cin >> a[i] >> b[i];
int c[m],d[m];rep(i,m)cin >> c[i] >> d[i];
for(int i=0;i<n;++i){
long long an = 100000000000;
int ans = 0;
for(int j=0;j<m;++j){
int m = abs(a[i]-c[j])+abs(b[i]-d[j]);
if(m < an){ans = j+1;an = m;}
}
cout << ans << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin>>N>>M;
int a[N],b[N];
for(int i=0;i<N;i++){
cin>>a[i]>>b[i];
}
int c[M],d[M];
for(int i=0;i<M;i++){
cin>>c[i]>>d[i];
}
int ans[N],ma[N];
for(int i=0;i<N;i++){
ma[i]=(1<<29);
for(int j=M-1;j>=0;j--){
if(ma[i]>=abs(a[i]-c[j])+abs(b[i]-d[j])){
ma[i]=abs(a[i]-c[j])+abs(b[i]-d[j]);
ans[i]=j+1;
}
}
}
for(int i=0;i<N;i++){
cout<<ans[i]<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int s[n][2], c[m][2];
for(int i = 0; i < n; i++) cin >> s[i][0] >> s[i][1];
for(int i = 0; i < m; i++) cin >> c[i][0] >> c[i][1];
for(int i = 0; i < n; i++){
int d = 1000000000;
int ans;
for(int j = 0; j < m; j++){
int k = abs(s[i][0] - c[j][0]) + abs(s[i][1] - c[j][1]);
if(k < d){
d = k;
ans = j + 1;
}
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n,m,ans,man;
int a[55],b[55],c[55],d[55];
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++)cin>>a[i]>>b[i];
for(int i=1;i<=m;i++)cin>>c[i]>>d[i];
for(int i=1;i<=n;i++){
int man=999999999;
int ans=0;
for(int j=1;j<=m;j++){
if(man>abs(a[i]-c[j])+abs(b[i]-d[j])){
man=abs(a[i]-c[j])+abs(b[i]-d[j]);
ans=j;
}
}
cout<<ans<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
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 ans,cnt1=1e9;
rep(j,m){
int cnt=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(cnt<cnt1){
cnt1=abs(a[i]-c[j])+abs(b[i]-d[j]);
ans=j+1;
}
}
cout<<ans<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
struct nod{
int x,y;
}a[100];
nod b[100];
int n,m,num[100];
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++)cin>>a[i].x>>a[i].y;
for(int i=1;i<=m;i++)cin>>b[i].x>>b[i].y;
for(int i=1;i<=n;i++){
int maxx=1<<30;
for(int j=1;j<=m;j++){
if((abs(a[i].x-b[j].x)+abs(a[i].y-b[j].y))<maxx){
maxx=abs(a[i].x-b[j].x)+abs(a[i].y-b[j].y);
num[i]=j;
}
}
cout<<num[i]<<endl;
}
cout<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, M;
cin >> N >> M;
vector<int> a(N), b(N), c(M), d(M);
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 res, dis = 1000000000;
for (int j = 0; j < M; j++) {
int t = abs(a[i] - c[j]) + abs(b[i] - d[j]);
if (t < dis) {
dis = t;
res = j + 1;
}
}
cout << res << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N,M;
long a[50],b[50],c[50],d[50];
int main()
{
cin>>N>>M;
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 p=0;
for(int j=0;j<M;++j){
if(abs(a[i]-c[j])+abs(b[i]-d[j])<abs(a[i]-c[p])+abs(b[i]-d[p])){
p=j;
}
}
cout<<p+1<<endl;
}
}
|
#include<iostream>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
int sdt[n][2],pt[m][2];
for(int i=0;i<n;++i)
cin >> sdt[i][0] >> sdt[i][1];
for(int i=0;i<m;++i)
cin >> pt[i][0] >> pt[i][1];
for(int i=0;i<n;++i){
int min=abs(sdt[i][0]-pt[0][0])+abs(sdt[i][1]-pt[0][1]),idx=1,d;
for(int j=1;j<m;++j){
d=abs(sdt[i][0]-pt[j][0])+abs(sdt[i][1]-pt[j][1]);
if(d<min){
min=d;
idx=j+1;
}
}
cout << idx << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m,i;
cin>>n>>m;
long int a[n],b[n],c[m],d[m],ans[n];
for(i=0;i<n;++i){
cin>>a[i]>>b[i];
}
for(i=0;i<m;++i){
cin>>c[i]>>d[i];
}
for(i=0;i<n;++i){
long min = 400000001;
for(int j=0;j<m;++j){
if(min>(abs(a[i]-c[j])+abs(b[i]-d[j]))){
min = (abs(a[i]-c[j])+abs(b[i]-d[j]));
ans[i] = j+1;
}
}
}
for(i=0;i<n;++i){
cout<<ans[i]<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
struct node{
int x,y;
}a[10010],b[10010];
int jl(int x1,int x2,int y1,int y2){
return abs(x1-x2)+abs(y1-y2);
}
int main(){
int n,m,i,j,mn,id;
cin>>n>>m;
for(i=1;i<=n;i++){
cin>>a[i].x>>a[i].y;
}
for(i=1;i<=m;i++){
cin>>b[i].x>>b[i].y;
}
for(i=1;i<=n;i++){
mn=2100000000;
for(j=1;j<=m;j++){
if(jl(a[i].x,b[j].x,a[i].y,b[j].y)<mn){
mn=jl(a[i].x,b[j].x,a[i].y,b[j].y);
id=j;
}
}
cout<<id<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M,i,ans=0,e,a[51],b[51],c[51],d[51];
cin>>N>>M;
for(i=0;i<N;i++){
cin>>a[i]>>b[i];
}
for(i=0;i<M;i++){
cin>>c[i]>>d[i];
}
for(int j=0;j<N;j++){
e=400000001;
ans=0;
for(i=0;i<M;i++){
if(e>abs(a[j]-c[i])+abs(b[j]-d[i])){
ans=i+1;
e=abs(a[j]-c[i])+abs(b[j]-d[i]);
}
}
cout<<ans<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
typedef long long ll;
const int inf = 1e9;
int main() {
ll N,M;
cin>>N>>M;
vector<ll> a(N),b(N),c(M),d(M),D(N),ans(N);
rep(i,N)cin>>a[i]>>b[i];
rep(i,M)cin>>c[i]>>d[i];
rep(i,N){
D[i]=inf;
rep(j,M){
ll dis = abs(a[i]-c[j])+abs(b[i]-d[j]);
if(D[i]>dis){
ans[i]=j+1;
D[i] = dis;
}
}
}
rep(i,N)
cout<<ans[i]<<endl;
}
|
#include<iostream>
#include<stdlib.h>
using namespace std;
int main(){
int a[55][2];
int b[55][2];
int n,m,i,j,k,x,y;
cin >> n >> m;
for(i=0;i<n;i++){
cin >> a[i][0] >> a[i][1];
}
for(i=0;i<m;i++){
cin >> b[i][0] >> b[i][1];
}
for(i=0;i<n;i++){
k=abs(a[i][0]-b[0][0])+abs(a[i][1]-b[0][1]);
x=k;
y=0;
for(j=1;j<m;j++){
k=abs(a[i][0]-b[j][0])+abs(a[i][1]-b[j][1]);
if(k<x){
x=k;
y=j;
}
}
cout << y+1 << endl;
}
cout << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
long long a[55],b[55],c,d,e[55],mn[55];
for(int i=0;i<n;i++){
cin>>a[i]>>b[i];
mn[i]=1000000000;
}
for(int i=0;i<m;i++){
cin>>c>>d;
for(int j=0;j<n;j++){
if(mn[j]>abs(a[j]-c)+abs(b[j]-d)){
mn[j]=abs(a[j]-c)+abs(b[j]-d);
e[j]=i+1;
}
}
}
for(int i=0;i<n;i++){
cout<<e[i]<<endl;
}
return 0;
}
|
// Chekpoints
#include <iostream>
#include <math.h>
using namespace std;
int n,m;
int a[50],b[50],c[50],d[50];
int main(){
cin>>n>>m;
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 Min=0;
for(int j=0;j<m;j++){
if(abs(a[i]-c[Min])+abs(b[i]-d[Min])>abs(a[i]-c[j])+abs(b[i]-d[j]))
Min=j;
}
cout<<Min+1<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M,p,k=INT_MAX;
cin >> N >> M;
int a[N],b[N],c[M],d[M],x[N];
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++){
for(int j=0;j<M;j++){
p=(abs(a[i]-c[j]) + abs(b[i]-d[j]));
if(p < k){
k=p;
x[i]=j+1;
}
}
k=INT_MAX;
}
for(int i=0;i<N;i++){
cout << x[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
int s[N][2];
int p[M][2];
for(int i=0;i<N;i++){cin >> s[i][0] >> s[i][1];}
for(int i=0;i<M;i++){cin >> p[i][0] >> p[i][1];}
for(int i=0;i<N;i++){
int p_min;
int d_min = pow(10,9);
for(int j=0;j<M;j++){
int d = abs(s[i][0]-p[j][0])+abs(s[i][1]-p[j][1]);
if(d<d_min){
p_min = j+1;
d_min = d;
}
}
cout << p_min << endl;
}
}
|
#include <bits/stdc++.h>
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;
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 md = 1001001001;
int ans = 0;
REP(j,m) {
int dd = abs(a[i] - c[j]) + abs(b[i] - d[j]);
if (dd < md) { ans = j+1; md = dd; }
}
cout << ans << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,m,x,nmin,ans;
int a[59],b[59],c[59],d[59];
cin>>n>>m;
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++){
nmin=1000000000;
for(int j=0;j<m;j++){
x=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(nmin>x){
ans=j+1;
nmin=x;
}
}
cout<<ans<<endl;
}
return(0);
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int N, M;
cin >> N >> M;
int a[N], b[N];
int c[M], d[M];
rep(i,N) cin >> a[i] >> b[i];
rep(i,M) cin >> c[i] >> d[i];
rep(i,N) {
int dist_min = 1e9;
int cp;
rep(j,M) {
int dist = abs(a[i]-c[j]) + abs(b[i]-d[j]);
if (dist < dist_min) {
dist_min = dist;
cp = j+1;
}
}
cout << cp << endl;
}
return 0;
}
|
#include<cstdio>
#include<algorithm>
int main(){
int n,m,a[50],b[50],c[50],d[50];
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++)scanf("%d%d",&a[i],&b[i]);
for(int i=0;i<m;i++)scanf("%d%d",&c[i],&d[i]);
for(int i=0;i<n;i++){
int k,l=1e9,ans;
for(int j=0;j<m;j++){
k=std::abs(a[i]-c[j])+std::abs(b[i]-d[j]);
if(k<l){
ans=j+1;
l=k;
}
}
printf("%d\n",ans);
}
return 0;
}
|
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N,M,x,ans,ans2;
cin>>N>>M;
int a[N],b[N],c[M],d[M];
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++){
for(int j=0;j<M;j++){
x=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(j==0){
ans=x;
ans2=j+1;
}
if(x<ans){
ans=x;
ans2=j+1;
}
}
cout<<ans2<<endl;
}
}
|
// B - Checkpoints
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m; cin>>n>>m;
vector<int> SX(n), SY(n), CX(m), CY(m);
for(int s=0; s<n; s++) cin>>SX[s]>>SY[s];
for(int c=0; c<m; c++) cin>>CX[c]>>CY[c];
for(int s=0; s<n; s++){
int mini = 1e9, ans = 0;
for(int c=0; c<m; c++){
int m = abs(SX[s]-CX[c]) + abs(SY[s]-CY[c]);
if(mini>m){ mini = m; ans = c+1; }
}
cout<< ans <<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m,i,j,a[100],b[100],c[100],d[100],mini,in;
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
scanf("%d %d",&a[i],&b[i]);
for(i=0;i<m;i++)
scanf("%d %d",&c[i],&d[i]);
for(i=0;i<n;i++)
{
in=0,mini=2e9;;
for(j=0;j<m;j++)
{
if((abs(a[i]-c[j])+abs(b[i]-d[j]))<mini)
mini=(abs(a[i]-c[j])+abs(b[i]-d[j])),in=j;
}
printf("%d\n",in+1);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int N,M;
int a[50],b[50],c[50],d[50];
int main()
{
cin>>N>>M;
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 p=0,v=1<<30;
for(int j=0;j<M;++j){
long nv=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(nv<v){
p=j;
v=nv;
}
}
cout<<p+1<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define MAXN 59
#define LL long long
int main(){
int n,m;
cin>>n>>m;
LL a[MAXN], b[MAXN], c[MAXN], d[MAXN];
for(int i=1;i<=n;i++){
cin>>a[i]>>b[i];
}
for(int i=1;i<=m;i++){
cin>>c[i]>>d[i];
}
for(int i=1;i<=n;i++){
LL dist;
LL min=abs(a[i]-c[1])+abs(b[i]-d[1]);
int ind=1;
for(int j=1;j<=m;j++){
dist=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(dist<min){
min=dist;
ind=j;
}
}
cout<<ind<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin>>N>>M;
vector<int> p(M);
vector<int> q(M);
vector<int> r(N);
vector<int> s(N);
for(int i=0;i<N;i++){
cin>>r[i]>>s[i];
}
for(int i=0;i<M;i++){
cin>>p[i]>>q[i];
}
for(int j=0;j<N;j++){
int a=r[j],b=s[j];
int Z=0,A=2001924167;
for(int i=0;i<M;i++){
if(A>abs(a-p[i])+abs(b-q[i])){
Z=i+1;
A=abs(a-p[i])+abs(b-q[i]);
}
}
cout<<Z<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
long long X[101],Y[101],A[101],B[101];
int main(){
long long n,m;
cin >> n >> m;
for(int i=0;i<n;i++){
cin >> X[i] >> Y[i];
}
for(int i=0;i<m;i++){
cin >> A[i] >> B[i];
}
for(int i=0;i<n;i++){
long long a=0,sum=0,Mn=1e9;
for(int j=0;j<m;j++){
sum=abs(X[i]-A[j])+abs(Y[i]-B[j]);
if(sum<Mn){
Mn=sum;
a=j+1;
}
}
cout << a << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<int> a(n),b(n),c(m),d(m),l(n);
int kyo;
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 kyo=400000001;
for(int j=0;j<m;j++){
if(kyo>abs(a[i]-c[j])+abs(b[i]-d[j])){
kyo=abs(a[i]-c[j])+abs(b[i]-d[j]);
l[i]=j+1;
}
}
cout << l[i] << endl;
}
}
|
#include<bits/stdc++.h>
#define rep(i,x,y) for (int i=x;i<=y;i++)
int a[100],b[100],c[100],d[100];
int dis(int i,int j)
{
return abs(a[i]-c[j])+abs(b[i]-d[j]);
}
int main()
{
int n,m;
scanf("%d%d",&n,&m);
rep(i,1,n) scanf("%d%d",&a[i],&b[i]);
rep(i,1,m) scanf("%d%d",&c[i],&d[i]);
rep(i,1,n)
{
int ans=0;
rep(j,1,m)
if (ans==0 || dis(i,j)<dis(i,ans)) ans=j;
printf("%d\n",ans);
}
}
|
// B - Checkpoints
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m; cin>>n>>m;
vector<int> SX(n), SY(n), CX(m), CY(m);
for(int s=0; s<n; s++) cin>>SX[s]>>SY[s];
for(int c=0; c<m; c++) cin>>CX[c]>>CY[c];
for(int s=0; s<n; s++){
int ans = 1;
int mini = abs(SX[s]-CX[0]) + abs(SY[s]-CY[0]);
for(int c=1; c<m; c++){
int m = abs(SX[s]-CX[c]) + abs(SY[s]-CY[c]);
if(mini>m){
mini = m;
ans = c+1;
}
}
cout<< ans <<endl;
}
}
|
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main()
{
int m,n,i,k,j,ans;
cin>>n>>m;
long long a[n][2],b[m+1][2];
for(i=0;i<n;i++)cin>>a[i][0]>>a[i][1];
for(i=1;i<=m;i++)cin>>b[i][0]>>b[i][1];
for(i=0;i<n;i++)
{
ans=1;k=abs(a[i][0]-b[1][0])+abs(a[i][1]-b[1][1]);
for(j=2;j<=m;j++)
{
if(k>abs(a[i][0]-b[j][0])+abs(a[i][1]-b[j][1]))
{
ans=j;
k=abs(a[i][0]-b[j][0])+abs(a[i][1]-b[j][1]);
}
}
cout<<ans<<endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int main()
{
long long n,m,a[55],b[55],c[55],d[55];
cin >> n >> m;
for(int i=0; i<n; i++){
cin >> a[i] >> b[i];
}
for(int i=0; i<m; i++){
cin >> c[i] >> d[i];
}
int ans;
for(int i=0; i<n; i++){
long long len = 2e9;
for(int j=0; j<m; j++){
if((abs(a[i] - c[j]) + abs(b[i] - d[j])) < len){
len = abs(a[i] - c[j]) + abs(b[i] - d[j]);
ans = j + 1;
}
}
cout << ans << endl;
}
return 0;
}
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int a[n],b[n];
for(int i=0;i<n;i++){
cin>>a[i]>>b[i];
}
int c[m],d[m];
for(int i=0;i<m;i++){
cin>>c[i]>>d[i];
}
int l=1000000000;
int ans=0;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
int ll=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(ll<l){
l=ll;
ans=(j+1);
}
}
cout<<ans<<endl;
l=1000000000;
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
int main(){
int n, m;
cin >> n >> m;
int a[60];
int b[60];
int c[60];
int d[60];
rep(i,n) cin >> a[i] >> b[i];
rep(i,m) cin >> c[i] >> d[i];
rep(i,n) {
int way = 1e20;
int ans = 0;
rep(j,m) {
int manhattan = abs(a[i] - c[j]) + abs(b[i] - d[j]);
if (manhattan < way) {
way = manhattan;
ans = j + 1;
}
}
cout << ans << endl;
}
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define int long long
using namespace std;
int a[55],b[55],c[55],d[55];
signed main(){
int n,m;cin>>n>>m;
rep(i,n)cin>>a[i]>>b[i];
rep(i,m)cin>>c[i]>>d[i];
rep(i,n){
int dis=1145141919,num=-1;
rep(j,m){
int di=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(dis>di){
dis=di;
num=j;
}
}
cout<<num+1<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int> a(n),b(n),c(m),d(m),l(n);
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 dis=400000001;
for (int j=0;j<m;j++){
if(dis>abs(a[i]-c[j])+abs(b[i]-d[j])){
dis=abs(a[i]-c[j])+abs(b[i]-d[j]);
l[i]=j+1;
}
}
cout << l[i] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
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 ans=1e9,x;
rep(j,m){
int cnt=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(cnt<ans){
ans=cnt;
x=j+1;
}
}
cout<<x<<endl;
}
}
|
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<int> a(n),b(n),c(m),d(m);
for(int i=0;i<n;++i){
cin>>a[i]>>b[i];
}
for(int i=0;i<m;++i){
cin>>c[i]>>d[i];
}
int val=0;
for(int i=0;i<n;++i){
int ans=1000000000;
for(int j=0;j<m;++j){
int dis=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(ans>dis){
val=j+1;
ans=dis;
}
}
cout<<val<<endl;
}
}
|
#include <iostream>
#include <cmath>
using namespace std;
int n, m, mn, mj, a[55], b[55], c[55], d[55];
int main() {
int i, j, x;
cin>>n>>m;
for(i=1; i<=n; i++) cin>>a[i]>>b[i];
for(j=1; j<=m; j++) cin>>c[j]>>d[j];
for(i=1; i<=n; i++) {
mn = 2e9;
for(j=1; j<=m; j++) {
x = (int)abs(a[i]-c[j]) + (int)abs(b[i]-d[j]);
if(x<mn) mn = x, mj = j;
}
cout<<mj<<endl;
}
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cmath>
#define N 50+5
using namespace std;
int n,m,a[N],b[N],c[N],d[N];
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%d%d",&a[i],&b[i]);
for(int i=1;i<=m;i++) scanf("%d%d",&c[i],&d[i]);
for(int i=1;i<=n;i++)
{
int minn=1e9,k;
for(int j=1;j<=m;j++)
{
int t = abs(c[j]-a[i])+abs(d[j]-b[i]);
if(t < minn) minn = t,k = j;
}
printf("%d\n",k);
}
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
using namespace std;
int a[100],b[100],c[100],d[100];
int n,m;
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++) cin>>a[i]>>b[i];
for(int i=1;i<=m;i++) cin>>c[i]>>d[i];
for(int i=1;i<=n;i++)
{
int mx=1e9;
int t;
for(int j=1;j<=m;j++)
{
int D=abs(c[j]-a[i])+abs(d[j]-b[i]);
if(D<mx) t=j,mx=D;
}
cout<<t<<endl;
}
return 0;
}
|
#include<iostream>
#include<cmath>
using namespace std;
int main() {
int n, m, a[55], b[55], c[55], d[55], i, j, minv = 1e9, minn;
cin >> n >> m;
for (i = 1; i <= n; i++)
cin >> a[i] >> b[i];
for (i = 1; i <= m; i++)
cin >> c[i] >> d[i];
for (i = 1; i <= n; i++) {
minv = 1e9;
for (j = 1; j <= m; j++)
if (abs(c[j] - a[i]) + abs(d[j] - b[i]) < minv) {
minv = abs(c[j] - a[i]) + abs(d[j] - b[i]);
minn = j;
}
cout << minn << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,a[55],b[55],c[55],d[55],i,j,minn,ans;
cin>>n>>m;
for(i=1;i<=n;i++)
cin>>a[i]>>b[i];
for(i=1;i<=m;i++)
cin>>c[i]>>d[i];
for(i=1;i<=n;i++){
minn=1<<30;
for(j=1;j<=m;j++)
if(abs(c[j]-a[i])+abs(d[j]-b[i])<minn){
minn=abs(c[j]-a[i])+abs(d[j]-b[i]);
ans=j;
}
cout<<ans<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll n,m;
cin >> n >> m;
vector<ll> a(n),b(n),c(m),d(m);
rep(i,n){
cin >> a.at(i) >> b.at(i);
}
rep(i,m){
cin >> c.at(i) >> d.at(i);
}
rep(i,n){
ll sum=1e9+7,ans;
rep(j,m){
ll p=abs(a.at(i)-c.at(j))+abs(b.at(i)-d.at(j));
if(sum>p){
sum=p;
ans=j+1;
}
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
int n,m,a[55],b[55],c,d;
vector<pair<int,int>>v[55];
cin>>n>>m;
for(int i=0;i<n;i++)
{
cin>>a[i]>>b[i];
}
for(int i=0;i<m;i++)
{
cin>>c>>d;
for(int j=0;j<n;j++)
{
v[j].push_back(make_pair(abs(a[j]-c)+abs(b[j]-d),i+1));
}
}
for(int i=0;i<n;i++)
{
sort(v[i].begin(),v[i].end());
cout<<v[i][0].second<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m,i,y;
cin>>n>>m;
long int a[n],b[n],c[m],d[m],ans[n];
for(i=0;i<n;++i){
cin>>a[i]>>b[i];
}
for(i=0;i<m;++i){
cin>>c[i]>>d[i];
}
for(i=0;i<n;++i){
long min = 400000001;
for(int j=0;j<m;++j){
y = (abs(a[i]-c[j])+abs(b[i]-d[j]));
if(min>y){
min = y;
ans[i] = j+1;
}
}
}
for(i=0;i<n;++i){
cout<<ans[i]<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<int> a(n),b(n),c(m),d(m);
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 ma=1000000000;
int x,y;
int ans=-1;
for(int j=0;j<m;++j){
int kyori=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(ma>kyori){
ans=j+1;
ma=kyori;
}
}
cout << ans << endl;
}
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
using namespace std;
int main(){
int N,M;
cin >>N>>M;
int a[N],b[N];
rep(i,N) cin >>a[i]>>b[i];
int c[M], d[M];
rep(i,M) cin >>c[i]>>d[i];
int ans;
rep(i,N){
int mnD = abs(a[i]-c[0]) + abs(b[i]-d[0]);
ans = 1;
rep(j,M){
int D = abs(a[i]-c[j]) + abs(b[i]-d[j]);
if(D<mnD){
ans = j+1;
mnD = D;
}
}
cout <<ans<< endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,i,j,k,x,y,l,z;
cin>>n>>m;
vector<pair<int,int>> a(n),c(m);
for(i=0;i<n;i++){
cin>>x>>y;
a.at(i)=make_pair(x,y);
}
for(i=0;i<m;i++){
cin>>x>>y;
c.at(i)=make_pair(x,y);
}
for(i=0;i<n;i++){
l=4e8;
for(j=0;j<m;j++){
z=abs(a.at(i).first-c.at(j).first)+abs(a.at(i).second-c.at(j).second);
if(z<l){
k=j+1;
l=z;
}
}
cout<<k<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int n,m,a[51],b[51],c[51],d[51],i,j,k,l,x,y;
int main(){
cin>>n>>m;
for(;n-i++;cin>>a[i]>>b[i]);
for(;m-j++;cin>>c[j]>>d[j]);
for(;n-k++;cout<<y<<endl)
for(l=0,x=1e9;m-l++;)
x>abs(a[k]-c[l])+abs(b[k]-d[l])&&(x=abs(a[k]-c[l])+abs(b[k]-d[l]),y=l);
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,a[50],b[50],c[50],d[50];
cin>>n>>m;
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;
int cnt=2100000000;
for(int j=m-1;j>=0;j--){
if(cnt>=abs(a[i]-c[j])+abs(b[i]-d[j])){
ans=j+1;
cnt=abs(a[i]-c[j])+abs(b[i]-d[j]);
}
}
cout<<ans<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int ax[n],ay[n],bx[m],by[m];
for(int i=0;i<n;i++)cin>>ax[i]>>ay[i];
for(int i=0;i<m;i++)cin>>bx[i]>>by[i];
for(int i=0;i<n;i++){
int ans=0,d=1000000000;
for(int j=0;j<m;j++){
if(abs(ax[i]-bx[j])+abs(ay[i]-by[j])<d){
ans=j,d=abs(ax[i]-bx[j])+abs(ay[i]-by[j]);
}
}
cout<<ans+1<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin>>N>>M;
vector<int> A(N),B(N);
for(int i=0;i<N;i++){
cin>>A.at(i)>>B.at(i);
}
vector<int> C(M),D(M);
for(int i=0;i<M;i++){
cin>>C.at(i)>>D.at(i);
}
for(int i=0;i<N;i++){
int small=1000000000;
int ans;
for(int j=0;j<M;j++){
int dis=abs(A.at(i)-C.at(j))+abs(B.at(i)-D.at(j));
if(dis<small){
small=dis;
ans=j;
}
}
cout<<ans+1<<endl;
}
}
|
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n, m;
vector<long long> a, b, c, d;
cin >> n >> m;
a.resize(n);
b.resize(n);
c.resize(m);
d.resize(m);
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++){
long long mi = 10000000000;
int id= 0;
for (int j=0; j < m; j++) if (abs(a[i] - c[j]) + abs(b[i] - d[j]) < mi){
mi = abs(a[i] - c[j]) + abs(b[i] - d[j]);
id = j;
}
cout << id+1<< endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using namespace std;
int main(){
int n,m;cin>>n>>m;
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];
int ans;
rep(i,n){
int mn=1e9;
rep(j,m){
int dst=abs(c[j]-a[i])+abs(d[j]-b[i]);
if(dst<mn){
mn=dst;
ans=j+1;
}
}
cout<<ans<<endl;
}
}
|
#include<stdio.h>
#include <math.h>
#include <stdlib.h>
int main (){
int n,m,a[52],b[52],c[52],d[52],i,j,e,f,g;
scanf("%d %d",&n, &m);
for(i=1;i<=n;i++){
scanf("%d %d",&a[i],&b[i]);
}
for(i=1;i<=m;i++){
scanf("%d %d",&c[i],&d[i]);
}
for(i=1;i<=n;i++){
e=500000000;
for(j=m;j>=1;j--){
f=abs(a[i]-c[j])+abs(b[i]-d[j]);
if (f<=e) {
e=f;
g=j;
}
}
printf("%d\n",g);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
vector<int> a(55),b(55),c(55),d(55);
for(int i=0;i<N;i++){cin >> a[i] >> b[i];}
for(int i=0;i<M;i++){cin >> c[i] >> d[i];}
int m,num;
for(int i=0;i<N;i++){
m=300000000;
for(int j=0;j<M;j++){
if(m>abs(a[i]-c[j])+abs(b[i]-d[j])){
m=abs(a[i]-c[j])+abs(b[i]-d[j]);
num=j+1;
}
}
cout << num << endl;
}
}
|
#include <iostream>
using namespace std;
int abs(int a){
return 0 <= a ? a : -a;
}
int main(){
int n, m;
cin >> n >> m;
int a[n], b[n], c[m], d[m];
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 dist = 1e9, ans;
for(int j = 0; j < m; j++) if(abs(a[i] - c[j]) + abs(b[i] - d[j]) < dist){
dist = abs(a[i] - c[j]) + abs(b[i] - d[j]);
ans = j + 1;
}
cout << ans << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n,m;
cin>>n>>m;
int a[n],b[n],c[m],d[m];
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;
for(int j=0;j<m;j++){
if(abs(a[i]-c[j])+abs(b[i]-d[j])<abs(a[i]-c[ans])+abs(b[i]-d[ans]))
ans=j;
}
cout<<ans+1<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
int a[51],b[51],c[51],d[51];
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 mi=1234567890;
int mn=-1;
for(int j=0;j<m;j++){
int ma=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(mi>ma){
mi=ma;
mn=j+1;
}
}
cout << mn << endl;
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
int a[50],b[50];
int c[50],d[50];
int dist(int x1,int y1,int x2,int y2) {
return abs(x1-x2)+abs(y1-y2);
}
int main() {
int N,M;
scanf("%d %d",&N,&M);
for(int i=0;i<N;i++) {
scanf("%d %d",&a[i],&b[i]);
}
for(int i=0;i<M;i++) {
scanf("%d %d",&c[i],&d[i]);
}
for(int i=0;i<N;i++) {
int idx=M-1;
for(int j=M-1;j>=0;j--) {
if(dist(a[i],b[i],c[idx],d[idx])>=dist(a[i],b[i],c[j],d[j])) idx=j;
}
printf("%d\n",idx+1);
}
}
|
#include<iostream>
#include<cmath>
#define MAX 1000000007
using namespace std;
int a[55][2];
int b[55][2];
int main(){
int n,m;
int i,j,k;
int s[2];
cin>>n>>m;
for(i=0;i<n;i++){
cin>>a[i][0]>>a[i][1];
}
for(i=0;i<m;i++){
cin>>b[i][0]>>b[i][1];
}
for(i=0;i<n;i++){
s[0]=MAX,s[1]=0;
for(j=0;j<m;j++){
k=abs(a[i][0]-b[j][0])+abs(a[i][1]-b[j][1]);
if(k<s[0])s[0]=k,s[1]=j;
}
cout<<s[1]+1<<endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int N, M, a[100], b[100], c[100], d[100], s, ans, i, j;
cin >> N >> M ;
for(i=0;i<N;i++) cin >> a[i] >> b[i];
for(j=0;j<M;j++) cin >> c[j] >> d[j];
for(i=0;i<N;i++){
s = abs(a[i]-c[0])+abs(b[i]-d[0]);
ans = 1;
for(j=1;j<M;j++){
if(s > abs(a[i]-c[j]) + abs(b[i]-d[j])){
s = abs(a[i]-c[j])+abs(b[i]-d[j]);
ans = j+1;
}
}
cout << ans << endl;
}
}
|
#include<bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int a[51],b[51],c[51],d[51];
pair<int,int> diff[51];
int main(){ _;
int n,m;cin>>n>>m;
REP(i,n) cin>>a[i]>>b[i];
REP(i,m) cin>>c[i]>>d[i];
REP(i,n){
REP(j,m){
diff[j].first=abs(a[i]-c[j])+abs(b[i]-d[j]);
diff[j].second=j+1;
}
sort(diff,diff+m);
cout<<diff[0].second<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin>>N>>M;
vector<int64_t> a(N),b(N),c(M),d(M);
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){
int64_t ch=1e15;
int res;
for(int j=0;j<M;++j){
if(ch>abs(a[i]-c[j])+abs(b[i]-d[j])){
res=j+1;
ch=abs(a[i]-c[j])+abs(b[i]-d[j]);
}
}
cout<<res<<endl;
}
}
|
#include<iostream>
#include<string>
#include<algorithm>
#include <stdio.h>
using namespace std;
int main(){
int n,m; cin >>n >>m;
long long a[60],b[60],c[60],d[60];
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 index;
long long min=1e09;
for(int j=0;j<m;j++){
if(abs(a[i]-c[j])+abs(b[i]-d[j]) < min) {min=abs(a[i]-c[j])+abs(b[i]-d[j]);index= j;}
}
cout <<index+1<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{int N, M, d, i{}, j{}; cin >> N >> M;
int A[N], B[N], C[M], D[M]; for (; i < N; ++i) cin >> A[i] >> B[i]; while (cin >> C[j] >> D[j]) ++j;
for (i = 0; i < N; ++i)
{int m(1e9), k{}; for (j = 0; j < M; ++j) if ((d = abs(A[i] - C[j]) + abs(B[i] - D[j])) < m) m = d, k = j;
cout << ++k << "\n";}}
|
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
int N, M;
cin >> N >> M;
int a[100], b[100], c[100], d[100];
rep(i, N)cin >> a[i] >> b[i];
rep(i, M)cin >> c[i] >> d[i];
rep(i, N) {
int p[100] = {};
rep(j, M) {
p[j] = abs(a[i] - c[j]) + abs(b[i] - d[j]);
}
cout << min_element(p, p + M) - p + 1 << endl;
}
}
|
#include <cstdio>
#include <cstdlib>
int n, m;
int a[50], b[50], c[50], d[50];
int main(){
scanf("%d %d", &n, &m);
for(int i=0; i<n; ++i) scanf("%d %d", &a[i], &b[i]);
for(int i=0; i<m; ++i) scanf("%d %d", &c[i], &d[i]);
for(int i=0; i<n; ++i){
int tmp = 1e9;
int ans = -1;
for(int j=0; j<m; ++j){
int dist = abs(a[i]-c[j])+abs(b[i]-d[j]);
if(dist < tmp){
tmp = dist;
ans = j+1;
}
}
printf("%d\n", ans);
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m,a[55],b[55],c[55],d[55],p;
long long count=0;
cin>>n>>m;
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++){
p=1;
count=abs(a[i]-c[0])+abs(b[i]-d[0]);
for(int j=1; j<m; j++){
if(count>abs(a[i]-c[j])+abs(b[i]-d[j])){
count=abs(a[i]-c[j])+abs(b[i]-d[j]);
p=j+1;
}
}
cout<<p<<'\n';
}
return 0;
}
|
#include <bits/stdc++.h>
int main()
{
int n, m, a[50], b[50], c[50], d[50];
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) scanf("%d%d", a + i, b + i);
for (int i = 0; i < m; i++) scanf("%d%d", c + i, d + i);
for (int i = 0; i < n; i++)
{
int min_j{};
for (int j = 1; j < m; j++)
{
if (std::abs(a[i] - c[j]) + std::abs(b[i] - d[j]) < std::abs(a[i] - c[min_j]) + std::abs(b[i] - d[min_j]))
min_j = j;
}
printf("%d\n", min_j + 1);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
int a[N], b[N], c[M], d[M];
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 x = INT_MAX, y;
for (int j = 0; j < M; j++) {
if (abs(a[i]-c[j])+abs(b[i]-d[j]) < x) {
x = abs(a[i]-c[j])+abs(b[i]-d[j]);
y = j+1;
}
}
cout << y << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,M;
int a[50],b[50],c[50],d[50];
cin>>N>>M;
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 mini=1e9;
int ans;
for(int j=0;j<M;j++){
int dist=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(mini>dist){
mini=dist;
ans=j;
}
}
cout<<ans+1<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, a[50], b[50], c[50], d[50];
int calc(int n, int m) {
return abs(a[n] - c[m]) + abs(b[n] - d[m]);
}
int main(void){
cin >> n >> m;
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;
for (int j = 1; j < m; j++) if (calc(i, ans) > calc(i, j)) ans = j;
cout << ans + 1 << endl;
}
}
|
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
int main(){
int n,m;
long long a[60],b[60],c[60],d[60];
cin >> n >> m;
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 minnum=1e9,mini=51;
for(int k=0; k<m; k++){
int tmp =abs(a[i]-c[k])+abs(b[i]-d[k]);
if(tmp<minnum){
minnum=tmp;
mini=k;
}
}
cout << mini+1 << endl;
}
}
|
#include <iostream>
#include <cmath>
using namespace std;
#define Rep(i,n) for(int i=0;i<(n);i++)
int a[50];
int b[50];
int c[50];
int d[50];
int main(void)
{
int N,M;
cin>>N>>M;
Rep(i,N)cin>>a[i]>>b[i];
Rep(i,M)cin>>c[i]>>d[i];
Rep(n,N){
int ans=1;
int mn=abs(a[n]-c[0])+abs(b[n]-d[0]);
Rep(m,M){
if(abs(a[n]-c[m])+abs(b[n]-d[m])<mn){
mn=abs(a[n]-c[m])+abs(b[n]-d[m]);
ans=m+1;
}
}
cout<<ans<<endl;
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.