text
stringlengths 49
983k
|
|---|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
//template
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>(b);i--)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll; typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename A,size_t N,typename T>void Fill(A(&array)[N],const T &val){fill((T*)array, (T*)(array+N), val);}
const int inf = INT_MAX / 2; const ll INF = LLONG_MAX / 2;
//template end
int main(){
int x,k; scanf("%d%d",&x,&k);
vector<P> que;
rep(i,0,k){
int r; scanf("%d",&r);
que.push_back({r,-1});
}
int q; scanf("%d",&q);
rep(i,0,q){
int t,a; scanf("%d%d",&t,&a);
que.push_back({t,a});
}
sort(ALL(que)); vector<int> ans;
int pre=0,minn=0,maxx=x,drc=-1,diff=0;
rep(i,0,que.size()){
int dy=que[i].first-pre; diff+=drc*dy;
minn=min(max(minn,-diff),x-diff);
maxx=min(max(maxx,-diff),x-diff);
if(que[i].second==-1)drc*=-1;
else{
int val=que[i].second;
ans.push_back(min(max(val,minn),maxx)+diff);
} pre=que[i].first;
}
rep(i,0,q)printf("%d\n",ans[i]);
return 0;
}
|
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <memory.h>
#include <math.h>
using namespace std;
typedef long long LL;
const int maxn = 100005;
int o[maxn],X,n,Q,t[maxn],a[maxn];
int l[maxn],fl[maxn],r[maxn];
int main()
{
#ifdef Amberframe
freopen("arc082f.in","r",stdin);
freopen("arc082f.out","w",stdout);
#endif
scanf("%d %d",&X,&n);r[0]=X;
for (int i=1;i<=n;i++) scanf("%d",&o[i]);
for (int i=1;i<=n;i++)
if (i&1) {
int d=o[i]-o[i-1];
if (l[i-1]==r[i-1])
l[i]=r[i]=l[i-1],fl[i]=max(0,fl[i-1]-d);
else if (fl[i-1]>=d)
l[i]=l[i-1],r[i]=r[i-1],fl[i]=fl[i-1]-d;
else if (l[i-1]+d-fl[i-1]>=r[i-1])
l[i]=r[i]=0,fl[i]=0;
else
l[i]=l[i-1]+d-fl[i-1],r[i]=r[i-1],fl[i]=0;
}
else {
int d=o[i]-o[i-1];
if (l[i-1]==r[i-1])
l[i]=r[i]=l[i-1],fl[i]=min(X,fl[i-1]+d);
else if (fl[i-1]+r[i-1]-l[i-1]+d<=X)
l[i]=l[i-1],r[i]=r[i-1],fl[i]=fl[i-1]+d;
else if (fl[i-1]+d>=X)
l[i]=r[i]=0,fl[i]=X;
else
l[i]=l[i-1],r[i]=r[i-1]-(fl[i-1]+r[i-1]-l[i-1]+d-X),fl[i]=fl[i-1]+d;
}
scanf("%d",&Q);
for (int i=1;i<=Q;i++)
scanf("%d %d",&t[i],&a[i]);
for (int pos=0,i=1;i<=Q;i++)
{
while (pos<n&&o[pos+1]<=t[i]) ++pos;
int cur=(a[i]<=l[pos]?fl[pos]:fl[pos]+min(r[pos],a[i])-l[pos]);
int d=t[i]-o[pos];pos&1?cur=min(cur+d,X):cur=max(cur-d,0);
printf("%d\n",cur);
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll T;
int K,Q;
int main(){
cin>>T;
cin>>K;
set<P> events;
rep(i,K){
int t;
cin>>t;
events.insert(P(t,-1)); //reverse query
}
cin>>Q;
rep(i,Q){
ll t,f;
cin>>t>>f;
events.insert(P(t,f));
}
bool inc = 0;
ll pt = 0;
ll a = 0, b = T, c = 0;
for(P e:events){
ll t = e.fs;
ll x = e.sc;
if(inc){
ll d = t-pt;
c += d;
if(b+c>T) b = T-c;
if(a>b) a = b;
}else{
ll d = t-pt;
c -= d;
if(a+c<0) a = -c;
if(a>b) b = a;
}
if(x==-1){ //reverse
inc = !inc;
}else{ //answer
cout<<max(a,min(b,x))+c<<endl;
}
pt = t;
}
}
|
/* --- author: dxm --- */
#include<bits/stdc++.h>
using namespace std;
#define INF 1e9
#define Inf 1e18
#define rep(i,n) for(int (i)=0;(i)<n;i++)
#define REP(i,n) for(int (i)=1;(i)<=n;i++)
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define fst first
#define snd second
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef unsigned int uint;
typedef unsigned long long ull;
#define DEBUG
const int maxn=100005;
int x,k,q;
int a[maxn],b[maxn],c[maxn],r[maxn];
int main(){
#ifndef DEBUG
freopen("my.in","r",stdin);
freopen("my.out","w",stdout);
#endif
scanf("%d%d",&x,&k);
REP(i,k)scanf("%d",&r[i]);
b[0]=x;
REP(i,k){
a[i]=a[i-1];b[i]=b[i-1];
if(i&1){
a[i]=max(a[i],min(r[i]-r[i-1]-c[i-1],b[i]));
c[i]=max(a[i-1]+c[i-1]-r[i]+r[i-1],0)-a[i];
}
else{
b[i]=min(b[i],max(x-(r[i]-r[i-1])-c[i-1],a[i]));
c[i]=min(b[i-1]+c[i-1]+r[i]-r[i-1],x)-b[i];
}
// cout<<a[i]<<" "<<b[i]<<" "<<c[i]<<endl;
}
scanf("%d",&q);
while(q--){
int t,ini;
scanf("%d%d",&t,&ini);
int pos=upper_bound(r+1,r+1+k,t)-r-1,ans=c[pos];
if(ini<=a[pos])ans+=a[pos];
else if(ini>=b[pos])ans+=b[pos];
else ans+=ini;
if(pos&1)ans=min(x,ans+(t-r[pos]));
else ans=max(0,ans-(t-r[pos]));
printf("%d\n",ans);
}
return 0;
}
/*
Input:
-----------------
Output:
*/
|
#include<iostream>
#define m(a) min(X,max(0,a))
using namespace std;int r[200000],X,K,Q,T,A,s,l,k,t,x,d,f=-1;int main(){for(cin>>X>>K;l<K;)cin>>r[l++];l=X;for(cin>>Q;Q--;cout<<m(min(l,max(s,A+x))+f*(T-t))<<endl)for(cin>>T>>A;k<K&T>=r[k];f*=-1)x+=d=f*(r[k]-t),s=m(s+d),l=m(l+d),t=r[k++];return 0;}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
long long i,j,n,m;
cin >> n >> m;
long long a[n],b[n],c[m],d[m];
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 long ret = 3e8;
long long ans = -1;
for(j=0;j<m;j++){
if(ret>(abs(a[i]-c[j])+abs(b[i]-d[j]))){
ret = abs(a[i]-c[j])+abs(b[i]-d[j]);
ans = j+1;
}
}
cout << ans << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int a[55],b[55],c[55],d[55],n,m,i,j,num,s,mins=0x7fffffff;
int main(){
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++){
for(j=1;j<=m;j++){
s=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(s<mins) mins=s,num=j;
}
printf("%d\n",num);
mins=0x7fffffff;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[55], b[55], c[55], d[55];
int main() {
int n, m; 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 e = 1;
for (int j = 2; j <= m; j++)
if (abs(c[j] - a[i]) + abs(d[j] - b[i]) <
abs(c[e] - a[i]) + abs(d[e] - b[i]))
e = j;
cout << e << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a[50],b[50],c[50],d[50];
int n,m;
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 ans=0,min=1e9;
for(int j=0;j<m;++j){
if(abs(a[i]-c[j])+abs(b[i]-d[j])<min){
ans=j+1;
min=abs(a[i]-c[j])+abs(b[i]-d[j]);
}
}
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],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 min=1000000000;
int minp=0;
for(int j=0;j<M;j++){
int dis=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(dis<min){
min=dis;
minp=j+1;
}
}
cout << minp << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int N,M;
int a[55],b[55],c[55],d[55];
int ans[55];
const int INF=1000000007;
int main(){
cin>>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=INF; int p;
for(int j=0; j<M; j++){
int mh=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(mh<Min){
Min=mh; p=j+1;
}
}
ans[i]=p;
}
for(int i=0; i<N; i++) printf("%d\n",ans[i]);
return 0;
}
|
#include<iostream>
#include<cmath>
using namespace std;
int main(){
long long n, m, a[50], b[50], c[50], d[50], p[50], min;
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++){
min=10000000000000000;
for(int j=0;j<m;j++){
if(llabs(a[i]-c[j])+llabs(b[i]-d[j])<min){
min=llabs(a[i]-c[j])+llabs(b[i]-d[j]);
p[i]=j;
}
}
}
for(int i=0;i<n;i++) cout<<p[i]+1<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,a,n) for (int i = a; i < (int)(n); i++)
using namespace std;
int main() {
int N,M; cin >> N >> M; int a[N],b[N],c[M],d[M];
rep(i,0,N) cin >> a[i] >> b[i];
rep(i,0,M) cin >> c[i] >> d[i];
rep(i,0,N) {
int ans = abs(a[i]-c[0])+abs(b[i]-d[0]), point =1;
rep(j,0,M) {
int tmp = abs(a[i]-c[j])+abs(b[i]-d[j]);
if (ans > tmp) {
ans = tmp; point = j+1;
}
}
cout << point << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int a[55],b[55],c[55],d[55];
int main()
{
int n,m;
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 dmin=1234567890,minp;
for(int j=1;j<=m;j++)
if(dmin>abs(a[i]-c[j])+abs(b[i]-d[j]))
dmin=abs(a[i]-c[j])+abs(b[i]-d[j]),minp=j;
cout<<minp<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define r(i,n) for(int i = 0; i<n; i++)
typedef long long ll;
using namespace std;
int main(){
int n,m;
cin >> n >> m;
int a[n],b[n],c[m],d[m],ans[n],ans2[n];
r(i,n){
cin >> a[i] >> b[i];
ans[i]=1000000000;
}
r(i,m){
cin >> c[i]>>d[i];
r(j,n){
if(ans[j]>abs(a[j]-c[i])+abs(b[j]-d[i])){
ans[j]=min(ans[j],abs(a[j]-c[i])+abs(b[j]-d[i]));
ans2[j]=i+1;
}
}
}
r(i,n)cout << ans2[i]<<endl;
}
|
// luogu-judger-enable-o2
#include<bits/stdc++.h>
using namespace std;
int n,m,minn,ans;
int a[10000000],b[10000000],c[10000000],d[10000000];
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++)
{
minn=1e9;
for(int 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;
int main() {
long n,m,i,j,cur,res;
cin >> n >> m;
vector<long> a(n),b(n),c(m),d(m);
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++){
cur=0; res=1000000000;
for(j=0; j<m; j++){
if(res>abs(a[i]-c[j])+abs(b[i]-d[j])){
cur=j;
res=abs(a[i]-c[j])+abs(b[i]-d[j]);
}
}
cout << cur+1 << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int a[60],b[60],c[60],d[60];
int main(){
int n,m;
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 maxx=1000000000;
int k;
for(int j=0;j<m;j++){
int t=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(t<maxx){
maxx=t;
k=j+1;
}
}
cout<<k<<endl;
}
return 0;
}
|
#include <iostream>
#include <cmath>
#define INF 1e+9
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 mi = INF,mii;
for(int j = 0;j < m;j++){
int e = abs(a[i] - c[j]) + abs(b[i] - d[j]);
if(mi > e){
mi = e;
mii = j + 1;
}
}
cout << mii << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<long long int> a(n),b(n);
for(int i=0;i<n;i++) cin>>a[i]>>b[i];
vector<long long int> c(m),d(m);
for(int i=0;i<m;i++) cin>>c[i]>>d[i];
for(int i=0;i<n;i++){
long long int min_dis=1e15;
int res=-1;
for(int j=0;j<m;j++){
if(abs(a[i]-c[j])+abs(b[i]-d[j])<min_dis){
min_dis=abs(a[i]-c[j])+abs(b[i]-d[j]);
res=j;
}
}
cout<<res+1<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N,M,a[59],b[59],c[59],d[59];
int main(){
cin>>N>>M;
for(int i=1;i<=N;i++) cin>>a[i]>>b[i];
for(int j=1;j<=M;j++) cin>>c[j]>>d[j];
for(int i=1;i<=N;i++){
int minx=1000000000,maxid=0;
for(int j=1;j<=M;j++){
int sum=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(minx>sum){minx=sum;maxid=j;}
}
cout<<maxid<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<pair<int, int>> v;
vector<pair<int, int>> c;
int n, m;
cin>>n>>m;
while(n--){
int x,y;
cin>>x>>y;
v.emplace_back(x,y);
}
while(m--){
int x,y;
cin>>x>>y;
c.emplace_back(x,y);
}
for(auto& u:v){
int min=1000000000;
int count=0,t;
for(auto& p:c){
count++;
int x=abs(u.first-p.first)+abs(u.second-p.second);
if(x<min){
min=x;
t=count;
}
}
cout<<t<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<pair<int, int>> S(N), C(M);
for (auto &p : S) {
cin >> p.first >> p.second;
}
for (auto &p : C) {
cin >> p.first >> p.second;
}
for (auto s : S) {
int d = 1e9, ans;
for (int i = 0; i < M; ++i) {
int dd = abs(s.first-C[i].first) + abs(s.second-C[i].second);
if (dd < d) {
d = dd;
ans = i;
}
}
cout << ans+1 << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100], b[100], c[100], d[100];
int n, m;
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 ans = 0, mn = 1000000000;
for(int j = 0; j < m; j++){
int dt = abs(a[i] - c[j]) + abs(b[i] - d[j]);
if(dt < mn){
mn = dt;
ans = j;
}
}
printf("%d\n", ans+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++){
long long mn=1000000000000;
int cou;
for(int j=0;j<m;j++){
if(mn>abs(a[i]-c[j])+abs(b[i]-d[j])){
mn=abs(a[i]-c[j])+abs(b[i]-d[j]);
cou=j+1;
}
}
cout<<cou<<endl;
}
}
|
#include<cstdio>
#include<cmath>
using namespace std;
int main(){
int n,m,a[50],b[50],c[50],d[50],ans,mina;
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++){
ans=1;
mina=abs(a[i]-c[0])+abs(b[i]-d[0]);
for(int j=1;j<m;j++){
if(mina>abs(a[i]-c[j])+abs(b[i]-d[j])){
ans=j+1;
mina=abs(a[i]-c[j])+abs(b[i]-d[j]);
}
}printf("%d\n",ans);
}
}
|
#include<bits/stdc++.h>
using namespace std;
const int ms = 58;
int s[ms][2], c[ms][2];
int main(){
int maxi = 0;
int n,m;
cin >> n >> m;
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++){
maxi = 0x3f3f3f3f;
int id=0;
for(int j =0 ;j<m;j++){
int val = abs(s[i][0]-c[j][0]) + abs(s[i][1]-c[j][1]);
if(val <maxi){
maxi = val;
id = j+1;
}
}
cout<<id<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m,x;
cin>>n>>m;
int a[n][2],b[n],c[m][2],d[n];
for(int i=0;i<n;i++){
for(int j=0;j<2;j++){
cin>>a[i][j];
}
}
for(int i=0;i<m;i++){
for(int j=0;j<2;j++){
cin>>c[i][j];
}
}
for(int k=0;k<n;k++){;
for(int l=0;l<m;l++){
x=abs(a[k][0]-c[l][0])+abs(a[k][1]-c[l][1]);
if(b[k]>x||l==0) {b[k]=x; d[k]=l+1;}
}
}
for(int y=0;y<n;y++){
cout<<d[y]<<endl;
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<string>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define REP(i,n) for (int i=0;i<(n);i++)
typedef long long ll;
int main(){
int N,M;
cin>>N>>M;
ll a[N],b[N];
ll c[M],d[M];
REP(i,N)cin>>a[i]>>b[i];
REP(i,M)cin>>c[i]>>d[i];
REP(i,N){
ll dist = 1e9;
int id = -1;
REP(j,M){
if(dist>abs(a[i]-c[j])+abs(b[i]-d[j])){
dist = abs(a[i]-c[j])+abs(b[i]-d[j]);
id = j;
}
}
cout<<id+1<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int N,M,AB[55][2],CD[55][2];
int main(){
cin>>N>>M;
for(int i=0;i<N;i++)cin>>AB[i][0]>>AB[i][1];
for(int i=0;i<M;i++)cin>>CD[i][0]>>CD[i][1];
for(int i=0;i<N;i++){
int x=AB[i][0],y=AB[i][1],z=1e9,w=-1;
for(int j=0;j<M;j++){
int zz=abs(x-CD[j][0])+abs(y-CD[j][1]);
if(zz<z){
z=zz;
w=j;
}
}
cout<<w+1<<endl;
}
}
|
#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 mi=1000000000,e;
for(int j=0;j<m;j++){
if(mi>abs(a[i]-c[j])+abs(b[i]-d[j])){
mi=abs(a[i]-c[j])+abs(b[i]-d[j]);
e=j+1;
}
}
cout<<e<<endl;
}
}
|
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int i,j,n,m,no,len,Min;
cin>>n>>m;
int a[n+5],b[n+5];
for(i=1;i<=n;i++)cin>>a[i]>>b[i];
int c[m+5],d[m+5];
for(i=1;i<=m;i++)cin>>c[i]>>d[i];
for(i=1;i<=n;i++){
no=1;
Min=abs(a[i]-c[1])+abs(b[i]-d[1]);
for(j=2;j<=m;j++){
len=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(len<Min){
Min=len;
no=j;
}
}
cout<<no<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long int
#define INF 1000000007
// cin.eof() 入力個数の問題
int main(){
int n,m;
cin>>n>>m;
ll 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){
ll point=INF;
int ans=0;
rep(k,m){
ll A=abs(a[i]-c[k])+abs(b[i]-d[k]);
if(point>A){
point=A;
ans=k+1;
}
}
cout<<ans<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int a[60],b[60],c[60],d[60];
int main(){
int n,m;
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=1000000000;
int k;
for(int j=1;j<=m;j++){
int t=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(t<ans){ans=t;k=j;}
}
cout<<k<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M,x;
cin>>N>>M;
int a[N],b[N],c[M],d[M],Z[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++){
x=abs(a[i]-c[M-1])+abs(b[i]-d[M-1]);
Z[i]=M;
for(int j=M-1;j>=0;j--){
int L=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(x>=L){
x=L;
Z[i]=j+1;
}
}
}
for(int i=0;i<N;i++) cout<<Z[i]<<endl;
}
|
#include <stdio.h>
int main(void){
int n,m,i,j,s[50][2],p[50][2],d,min,l;
scanf("%d%d",&n,&m);
for (i=0;i<n;i++) scanf("%d%d",&s[i][0],&s[i][1]);
for (i=0;i<m;i++) scanf("%d%d",&p[i][0],&p[i][1]);
for (i=0;i<n;i++){
min=200000000;
for (j=0;j<m;j++){
d=(s[i][0]>p[j][0])? s[i][0]-p[j][0]:p[j][0]-s[i][0];
d+=(s[i][1]>p[j][1])? s[i][1]-p[j][1]:p[j][1]-s[i][1];
if (d<min){
min=d;
l=j;
}
}
printf("%d\n",l+1);
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
const int INF = 1001001001;
using namespace std;
int main()
{
int N, M;
int a[51], b[51], c[51], d[51];
int res[51];
cin >> N >> M;
rep(i,N) cin >> a[i] >> b[i];
rep(i,M) cin >> c[i] >> d[i];
rep(i,N){
int minmd = INF;
rep(j,M){
int md = abs(a[i]-c[j])+abs(b[i]-d[j]);
if(minmd > md) {
res[i]=j+1;
minmd = md;
}
}
}
rep(i,N){
cout << res[i] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin>>N>>M;
using pii=pair<int,int>;
vector<pii> A(N),B(M);
for(pii &i:A)
cin>>i.first>>i.second;
for(pii &i:B)
cin>>i.first>>i.second;
for(pii i:A){
int k=0,l=400000001;
for(int j=0;j<M;j++){
int p=abs(B[j].first-i.first)+abs(B[j].second-i.second);
if(l>p){
l=p;
k=j;
}
}
cout<<k+1<<endl;
}
}
|
#include<cstdio>
#include<cstring>
int a[51],b[51],c[51],d[51],ans[51],min[51];
int abs(int x) {return x>0?x:-x;}
int main()
{
int n,m;
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]);
memset(min,0x3f,sizeof(min));
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
int s=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(s<min[i]) {min[i]=s;ans[i]=j;}
}
for(int i=1;i<=n;i++)
printf("%d\n",ans[i]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
int a[51], b[51], c[51], d[51];
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 mn = 300000000;
int p = -1;
for(int j=1;j<=m;j++){
int crr = abs(a[i]-c[j]) + abs(b[i]-d[j]);
if(crr < mn){
mn = crr;
p = j;
}
}
cout << p << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int inf=1e9;
int main(){
int n,m;cin>>n>>m;
vector<int>a(n),b(n),c(m),d(m);
vector<int>ans(n,-1);
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 dst=inf;
for(int j=0;j<m;j++){
if(dst>abs(a[i]-c[j])+abs(b[i]-d[j])){
ans[i]=j+1;
dst=abs(a[i]-c[j])+abs(b[i]-d[j]);
}
}
}
for(auto&& u:ans)cout<<u<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
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 k = 0, mind = 1e9;
rep(j,m) {
int md = abs(a[i] - c[j]) + abs(b[i] - d[j]);
if(md < mind) {
mind = md;
k = j;
}
}
cout << k + 1 << endl;
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<limits>
#include<cmath>
using namespace std;
int N,M;
int n[51],m[51];
int nx[51],ny[51];
int cx[51],cy[51];
int main(){
cin>>N>>M;
for(int i=0;i<N;i++){
cin>>nx[i]>>ny[i];
}
for(int i=1;i<=M;i++){
cin>>cx[i]>>cy[i];
}
for(int i=0;i<N;i++){
int mi,mid=1000000000;
for(int j=1;j<=M;j++){
if(abs(nx[i]-cx[j])+abs(ny[i]-cy[j])<mid){
mid=abs(nx[i]-cx[j])+abs(ny[i]-cy[j]);
mi=j;
}
}
cout<<mi<<endl;
}
return 0;
}
|
#include<cstdio>
#include<cmath>
using namespace std;
int main(void)
{
int n,m,i,j,t;
int a[51],b[51],c[51],d[51];
int dist[51][51];
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++){
for(j=0;j<m;j++){
dist[i][j]=abs(a[i]-c[j])+abs(b[i]-d[j]);
}
t=0;
for(j=1;j<m;j++){
if(dist[i][j]<dist[i][t])t=j;
}
printf("%d\n",t+1);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a[64], b[64], c[64], d[64];
int n, m;
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 = 1;
int mini = 1e9 + 9;
for (int j = 0; j < m; ++j) {
if (mini > abs(a[i] - c[j]) + abs(b[i] - d[j])) {
ans = j + 1;
mini = 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;
vector<pair<int,int>>a(n),c(m);
for(int i=0;i<n;i++)cin>>a.at(i).first>>a.at(i).second;
for(int i=0;i<m;i++)cin>>c.at(i).first>>c.at(i).second;
for(int i=0;i<n;i++){
long int l=200000001;int p=0;
for(int j=0;j<m;j++){
long int x=abs(a.at(i).first-c.at(j).first)+abs(a.at(i).second-c.at(j).second);
if(x<l){p=j;l=x;}
}
cout<<p+1<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int 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 mini = 1000000000, p = -1;
for (int j = 0; j < M; j++) {
int m = abs(a[i] - c[j]) + abs(b[i] - d[j]);
if (m < mini) {
p = j + 1;
mini = m;
}
}
cout << p << 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[50],b[50],c[50],d[50];
rep(i,n) cin>>a[i]>>b[i];
rep(i,m) cin>>c[i]>>d[i];
rep(i,n){
int j=0;
rep(k,m) if(abs(a[i]-c[k])+abs(b[i]-d[k])<abs(a[i]-c[j])+abs(b[i]-d[j])) j=k;
cout<<j+1<<'\n';
}
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 j=0; j<m; j++) cin >> c[j] >> d[j];
for(int i=0; i<n; i++) {
int point, min_dist = INT_MAX;
for(int j=0; j<m; j++) {
int dist = abs(a[i]-c[j]) + abs(b[i]-d[j]);
if(min_dist>dist) {
min_dist = dist;
point = j+1;
}
}
cout << point << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int dn(int a,int b,int c,int d){
return abs(c-a)+abs(d-b);
}
int main(){
int n,m,i,j;
cin>>n>>m;
int a[n],b[n],c[m],d[m];
for(i=0;i<n;i++){
cin>>a[i]>>b[i];
}
for(i=0;i<m;i++){
cin>>c[i]>>d[i];
}
int min[n];
for(i=0;i<n;i++){
min[i]=0;
for(j=0;j<m;j++){
if(dn(a[i],b[i],c[j],d[j])<dn(a[i],b[i],c[min[i]],d[min[i]]))min[i]=j;
}
}
for(i=0;i<n;i++){
cout<<min[i]+1<<endl;
}
}
|
#include<iostream>
#include<complex>
using namespace std;
int a[99],b[99],c[99],d[99],n,m;
int main(){
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 ans=0;
for(int j=1;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[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 xl,yl,sum,ans;
for(int i=0;i<n;i++){
xl=200000000,yl=200000000;
sum=xl+yl;
for(int j=0;j<m;j++){
if(abs(a[i]-c[j]) + abs(b[i]-d[j])<sum){
sum=abs(a[i]-c[j]) + abs(b[i]-d[j]);
ans=j+1;
}
}
cout<<ans<<endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int N, M; cin >> N >> M;
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];
for(int i=0; i<N; ++i){
int P=abs(a[i]-c[0])+abs(b[i]-d[0]), Q=0;
for(int j=1; j<M; ++j){
int K=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(P>K){
P=K;
Q=j;
}
}
cout << Q+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),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 min=abs(a[i]-c[0])+abs(b[i]-d[0]);
int cnt=1;
for(int j=1; j<m; j++) {
int x=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(min>x) {
cnt=j+1;
min=x;
}
}
cout << cnt << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int(i)=0;i<(n);i++)
int main(){
int n,m;cin>>n>>m;
vector<int> ax(n,0),ay(n,0),cx(m,0),cy(m,0);
REP(i,n) cin>>ax.at(i)>>ay.at(i);
REP(i,m) cin>>cx.at(i)>>cy.at(i);
REP(i,n){
int num=0,dist=1e9;
REP(j,m){
if(dist>abs(ax.at(i)-cx.at(j))+abs(ay.at(i)-cy.at(j))){
dist=abs(ax.at(i)-cx.at(j))+abs(ay.at(i)-cy.at(j));
num=j+1;
}
}
cout<<num<<endl;
}
}
|
#include<bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
signed main(){
ll n,m;
ll a[100000],b[100000],c[100000],d[100000],sum[100000];
cin>>n>>m;
vector<pair<ll,ll> > pp(m);
rep(i,n) cin>>a[i]>>b[i];
rep(i,m) cin>>c[i]>>d[i];
rep(i,n){
rep(j,m){
sum[j] = abs(a[i]-c[j])+abs(b[i]-d[j]);
pp[j] = make_pair(sum[j],j+1);
}
sort(pp.begin(),pp.end());
cout<<pp[0].second<<"\n";
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,m,i,j,k,c,count,temp;
cin>>n>>m;
long long int a[n][2],b[m][2];
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++)
{
count=pow(10,15);
for(j=0;j<m;j++)
{
temp=abs(a[i][0]-b[j][0])+abs(a[i][1]-b[j][1]);
if(temp<count)
{
count=temp;
c=j;
}
}
cout<<c+1<<endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using namespace std;
typedef long long LL;
const int INF=1000000000;
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 dist=INF, ans=0;
rep(j,M){
int D=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(dist>D) dist=D, ans=j+1;
}
cout << ans << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000000
int main(){
int n,m;
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++){
int t=INF,ans;
for(int j=0;j<m;j++){
if(abs(a[i]-c[j])+abs(b[i]-d[j])<t){
t=abs(a[i]-c[j])+abs(b[i]-d[j]);
ans=j+1;
}
}
cout<<ans<<endl;
}
return(0);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n,m;
cin>>n>>m;
int s[60][60];
int c[60][60];
for(int i=0;i<n;i++)cin>>s[0][i]>>s[1][i];
for(int i=0;i<m;i++)cin>>c[0][i]>>c[1][i];
for(int i=0;i<n;i++){
int mi=1000000009;
int k=0;
for(int j=0;j<m;j++){
int kari=0;
kari=abs(s[0][i]-c[0][j])+abs(s[1][i]-c[1][j]);
if(kari<mi){
mi=kari;
k=j+1;
}
}
cout<<k<<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), ans(n);
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;
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[s] = c+1;
}
}
}
for(int s=0; s<n; s++) cout<<ans[s]<<"\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m; cin>>n>>m;
int sx[n],sy[n];
for(int i=0;i<n;i++){
cin>>sx[i]>>sy[i];
}int x[m],y[m];
for(int i=0;i<m;i++){
cin>>x[i]>>y[i];
}for(int i=0;i<n;i++){
int ans,minnum=1000000000;
for(int j=0;j<m;j++){
int log=minnum;
minnum=min(minnum,abs(sx[i]-x[j])+abs(sy[i]-y[j]));
if(minnum!=log){
ans=j+1;
}
}cout<<ans<<endl;
}
}
|
#include <iostream>
using namespace std;
int n, m, a[55], b[55], c[55], d[55];
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 e = -1;
for (int j = 1; j <= m; j++) if (e == -1 || abs(a[i]-c[j])+abs(b[i]-d[j])<abs(a[i]-c[e])+abs(b[i]-d[e])) e=j;
printf("%d\n", e);
}
return 0;
}
|
#include <iostream>
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 min_dist=abs(a[i]-c[0])+abs(b[i]-d[0]),ans=1;
for(int j=1; j<M; j++){
int cur_dist=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(min_dist>cur_dist){
min_dist = cur_dist;
ans=j+1;
}
}
cout << ans << endl;
}
}
|
#include<iostream>
#include <algorithm>
#include <math.h>
#include <stdlib.h>
#include <stdio.h>
using namespace std;
int main(){
int N,M;
int 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 an=0;
int ans=500000000;
for(int j=0;j<M;++j){
if(ans>abs(A[i]-C[j])+abs(B[i]-D[j])){
an=j+1;
ans=abs(A[i]-C[j])+abs(B[i]-D[j]);
}
}
cout<<an<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed 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 e = abs(a[i]-c[0])+abs(b[i]-d[0]);
int f = 1;
for(int j=0;j<m ;j++){
int g = abs(a[i]-c[j])+abs(b[i]-d[j]);
if( e>g){
e = g;
f = j+1;
}
}
cout << f << endl;
}
}
|
#include <iostream>
#include <climits>
#include <cmath>
using namespace std;
#define REP(i,n) for(int i=0;i<int(n);i++)
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 = INT_MAX, ans;
REP(j,M){
if(abs(a[i]-c[j])+abs(b[i]-d[j]) < md){
ans = j+1;
md = abs(a[i]-c[j])+abs(b[i]-d[j]);
}
}
cout << ans << endl;
}
}
|
#include<stdio.h>
#include <math.h>
#include <stdlib.h>
int main (){
//kkc
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;
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];
}
for(int i=0;i<n;i++){
int ma=1000000000,mb;
for(int j=0;j<m;j++){
if(abs(a[i]-c[j])+abs(b[i]-d[j])<ma){
ma=abs(a[i]-c[j])+abs(b[i]-d[j]);
mb=j+1;
}
}
cout<<mb<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;cin>>N>>M;
vector<int> a(N);
vector<int> b(N);
vector<int> c(M);
vector<int> 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++){
vector<pair<int,int>> h(M);
for(int j=0; j<M; j++){
h[j]=make_pair(abs(a[i]-c[j])+abs(b[i]-d[j]),j);
}
sort(h.begin(),h.end());
cout<<h[0].second+1<<endl;
}
}
|
#include <bits/stdc++.h>
#define FOR(i,x,y) for(int i=x;i<y;i++)
using namespace std;
int main(){
int a[100],b[100],c[100],d[100],N,M;
cin >> N >> M;
FOR(i,0,N)cin >> a[i] >> b[i];
FOR(i,0,M)cin >> c[i] >> d[i];
FOR(i,0,N){
int ma = 1e9,ans;
FOR(j,0,M){
if(ma > abs(a[i]-c[j])+abs(b[i]-d[j])){
ans = j;
ma = abs(a[i]-c[j])+abs(b[i]-d[j]);
}
}
cout << ans+1 << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
long long n,m,a[101],b[101],c[101],d[101],cnt,sum;
int main(){
scanf("%lld%lld",&n,&m);
for(register int i=1;i<=n;++i)
cin>>a[i]>>b[i];
for(register int i=1;i<=m;++i)
cin>>c[i]>>d[i];
for(register int i=1;i<=n;++i){
long long ans=999999999;
for(register int j=1;j<=m;++j){
cnt=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(cnt<ans) {
ans=cnt;
sum=j;
}
}
cout<<sum<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
const int inf=1145141919;
const int dd[]={0,-1,0,1,0};
using namespace std;
int a[50],b[50],c[50],d[50],e[50];
signed main(){
int n,m;
int i,j;
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(i=0;i<n;i++){
int u=inf,v=-1;
for(j=0;j<m;j++){
int x=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(x<u){
u=x;
v=j;
}
}
e[i]=v;
}
for(i=0;i<n;i++)
cout<<e[i]+1<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m,i,y,ans;
cin>>n>>m;
long int a[n],b[n],c[m],d[m];
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 = j+1;
}
}
cout<<ans<<endl;
}
}
|
#include <bits/stdc++.h>
int main()
{
int n,m;
scanf("%d%d",&n,&m);
long int i,j,a[n],b[n],c[m],d[m],ans,num,min=1000000000;
for(i=0;i<n;++i)
scanf("%ld%ld",&a[i],&b[i]);
for(i=0;i<m;++i)
scanf("%ld%ld",&c[i],&d[i]);
for(i=0;i<n;++i)
{
min=1000000000;
for(j=0;j<m;++j)
{
ans=abs(c[j]-a[i])+abs(d[j]-b[i]);
if(min>ans)
{ min=ans;
num=j+1;
}
}
printf("%ld\n",num);
}
}
|
#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(99*(abs(a[i]-c[j])+abs(b[i]-d[j]))+j<=99*(abs(a[i]-c[p])+abs(b[i]-d[p]))+p){
p=j;
}
}
cout<<p+1<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int a[1021],b[1021],c[1021],d[1021],ans;
int main(){
int n,m;
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 sum=1e9;
for(int j=1;j<=m;j++){
if(abs(c[j]-a[i])+abs(d[j]-b[i])<sum){
sum=abs(c[j]-a[i])+abs(d[j]-b[i]);
ans=j;
}
}
cout<<ans<<endl;
}
return 0;
}
|
#include <stdio.h>
int abs(int a) {
return a > 0 ? a : -a;
}
int main(void) {
int i, j, n, m;
scanf("%d%d", &n, &m);
int a[n], b[n], c[m], d[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) {
int min = 1e9, minn;
for(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]), minn = j + 1;
printf("%d\n", minn);
}
return 0;
}
|
#include <bits/stdc++.h>
#define full(c) c.begin(), c.end()
typedef signed long long int ll;
typedef unsigned long long int ull;
using namespace std;
int main(){
ll i,j,n,m,a[50],b[50],c[50],d[50];
cin>>n>>m;
for(i=0; i<n; i++) cin>>a[i],cin>>b[i];
for(i=0; i<m; i++) cin>>c[i],cin>>d[i];
for(i=0; i<n; i++){
ll mi,mx=1000000001;
for(j=0; j<m; j++){
ll md=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(md<mx) mi=j+1,mx=md;
}
cout<<mi<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll inf=1ll<<60;
int main()
{
//freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
ll n,m,i,j,a[50],b[50],c[50],d[50],t1,t;
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 (i=0;i<n;i++){
t1=inf;
for (j=0;j<m;j++){
if (t1>abs(c[j]-a[i])+abs(d[j]-b[i])){
t=j+1;
t1=abs(c[j]-a[i])+abs(d[j]-b[i]);
}
}
cout<<t<<"\n";
}
return 0;
}
|
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0; i<n; i++)
using namespace std;
int main(){
long long int ind,N,M,a[101],b[101],c[101],d[101],m;
cin >> N >> M;
REP(i,N) cin >> a[i] >> b[i];
REP(i,M) cin >> c[i] >> d[i];
REP(i,N){
m = 9.0E8+1;
int ans = -1;
REP(j,M){
if(m > abs(a[i]-c[j]) + abs(b[i]-d[j])){
m = abs(a[i]-c[j]) + abs(b[i]-d[j]);
ans = j+1;
}
}
cout << ans << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int ans,a[n],b[n],c[m],d[m];
for(int i=0; i<n; i++)
{
cin>>a[i];
cin>>b[i];
}
for(int j=0; j<m; j++)
{
cin>>c[j];
cin>>d[j];
}
for(int p=0; p<n; p++)
{
int min=INT_MAX;
for(int q=0; q<m; q++)
{
int dist=abs(a[p]-c[q])+abs(b[p]-d[q]);
if(dist<min)
{
min=dist;
ans=q;
}
}
cout<<ans+1<<endl;
}
}
|
#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=400000001;
int num=0;
for(int j=0;j<M;j++){
int dis=abs(A[i]-C[j])+abs(B[i]-D[j]);
if(dis<ans){
ans=dis;
num=j;
}
}
cout<<num+1<<endl;
}
}
|
#include<iostream>
using namespace std;
int main(void)
{
int n,m;
cin >> n >> m;
long long a[55],b[55],c[55],d[55];
for(int i=1;i<=n;i++)
cin >> a[i-1] >> b[i-1];
for(int i=1;i<=m;i++)
cin >> c[i-1] >> d[i-1];
for(int i=1;i<=n;i++)
{
int ans=0;
long long ansdis=5000000009;
for(int j=1;j<=m;j++)
{
long long dis=abs(a[i-1]-c[j-1])+abs(b[i-1]-d[j-1]);
if(dis<ansdis)
{
ansdis=dis;
ans=j;
}
}
cout << ans << endl;
}
}
|
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int main(void)
{
int i,j,n,m,a[51],b[51],c[51],d[51],mn,mm,x,y;
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++) {
mn=2000000000;
for(j=1;j<=m;j++) {
x=a[i]-c[j]; x=max(x,-x);
y=b[i]-d[j]; y=max(y,-y);
if(mn>x+y) {
mn=x+y;
mm=j;
}
}
printf("%d\n",mm);
}
return 0;
}
|
#include<bits/stdc++.h>
#define lp3(i,a,b) for(int i=a;i<b;i++)
#define lp2(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int a[51],b[51],c[51],d[51],n,m;
cin>>n>>m;
lp3(i,1,n+1){
cin>>a[i]>>b[i];
}
lp3(i,1,m+1){
cin>>c[i]>>d[i];
}
lp3(i,1,n+1){
int an = INT_MAX,ans=0;
lp3(j,1,m+1){
if(abs(a[i]-c[j])+abs(b[i]-d[j])<an){
ans=j;
an = abs(a[i]-c[j])+abs(b[i]-d[j]);
}
}
cout<<ans<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
long long n,m,mn,mi,x1[100],y11[100],x2[100],y2[100];
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++) scanf("%lld%lld",&x1[i],&y11[i]);
for(int i=1;i<=m;i++) scanf("%lld%lld",&x2[i],&y2[i]);
for(int i=1;i<=n;i++)
{
mn=900000010;mi=1;
for(int j=1;j<=m;j++)
{
if(abs(x1[i]-x2[j])+abs(y11[i]-y2[j])<mn)
mn=abs(x1[i]-x2[j])+abs(y11[i]-y2[j]),mi=j;
}
cout<<mi<<"\n";
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
struct node{
int x,y;
};
node a[101],b[101];
int dist(node da,node db){
return abs(da.x-db.x)+abs(da.y-db.y);
}
int main(){
int i,j,n,m,id,dism,disc;
cin>>n>>m;
for(i=1;i<=n;i++){
cin>>a[i].x>>a[i].y;
}
for(j=1;j<=m;j++){
cin>>b[j].x>>b[j].y;
}
for(i=1;i<=n;i++){
dism=dist(a[i],b[1]);
id=1;
for(j=2;j<=m;j++){
disc=dist(a[i],b[j]);
if(disc<dism){
dism=disc;
id=j;
}
}
cout<<id<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int a[100],b[100], c[100], d[100], ans[100], mini[100];
int main(void){
int n, m; 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++){
mini[i] = INT_MAX;
for(int j=0;j<m;j++){
if (abs(a[i]-c[j])+abs(b[i]-d[j])<mini[i]) {ans[i] = j+1; mini[i] = abs(a[i]-c[j])+abs(b[i]-d[j]);}
}
cout << ans[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
int x[n], y[n], c[m], d[m];
for(int i = 0; i < n; i++) cin >> x[i] >> y[i];
for(int i = 0; i < m; i++) cin >> c[i] >> d[i];
for(int i = 0; i < n; i++){
int res = 1, min = 1e9;
for(int j = 0; j < m; j++){
int tmp = abs(x[i] - c[j]) + abs(y[i] - d[j]);
if(tmp < min){
min = tmp;
res = j + 1;
}
}
cout << res << endl;
}
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];
}
int shu;
for(int i=0; i<n; i++){
long long int man = 9999999999;
for(int j=0; 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]);
shu = j;
}
}
cout << shu+1 << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
long long 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];
}
long long md,p;
for (int i = 0; i < n; i++){
long long mp=1e16;
for (int j = 0; j < m; j++){
md=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(mp>md){
mp=md;
p=j+1;
}
}
cout<<p<<endl;
}
}
|
#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 P=0;
int D=500000000;
int pD;
for(int j=0;j<M;j++){
pD=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(pD<D){P=j+1;D=pD;}
}
cout<<P<<endl;
}
}
|
#include<iostream>
#define abs(a) (a<0?-(a):a)
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 v=1e9,p=0;
for(int j=0;j<m;j++)
{
if(v>abs(a[i]-c[j])+abs(b[i]-d[j]))p=j,v=abs(a[i]-c[j])+abs(b[i]-d[j]);
}
cout<<p+1<<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 x=1e9,ans;
rep(j,m){
int cnt=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(cnt<x){
x=min(x,cnt);
ans=j+1;
}
}
cout<<ans<<endl;
}
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int n,m,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 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() {
long long N,M,x,y,z;
z=0;
cin >>N>>M;
vector<long long>a(N),b(N),c(M),d(M),e(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++){
z=1000000000;
for(int j=0;j<M;j++){
x=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(x<z){
e[i]=j+1;
z=x;
}
}
}
for(int i=0;i<N;i++){
cout<<e[i]<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,a[51],b[51],c[51],d[51],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 n,m;
struct hhh
{
long long l,k;
}x[1000],y[1000];
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
cin>>x[i].l>>x[i].k;
for(int i=1;i<=m;i++)
cin>>y[i].l>>y[i].k;
long long legm,minn=1<<30;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
long long pop=abs(x[i].l-y[j].l)+abs(x[i].k-y[j].k);
if(pop<minn)
{
minn=pop;
legm=j;
}
}
cout<<legm<<endl;
minn=1<<30;
}
return 0;
}
|
#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 cnt=0,ans=1e9;
rep(j,m){
int e=abs(a[i]-c[j])+abs(b[i]-d[j]);
if(e<ans){
cnt=j+1;
ans=e;
}
}
cout<<cnt<<endl;
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.