solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
from sys import stdin
from math import inf
input = lambda: stdin.readline().strip()
ipnut = input
def dist(a,b):
return abs(a[0]-b[0])+abs(a[1]-b[1])<=k
for i in range(int(input())):
# n = int(input())
n,k = map(int,ipnut().split())
# d = list(map(int,input().split()))
coord = []
for i in range(n):
coord.append(tuple(map(int,input().split())))
f = -1
for i in range(n):
fl = 1
for j in range(n):
if not dist(coord[i],coord[j]):
fl = 0
if fl:
f = 1
break
print(f) | 8 | PYTHON3 |
# import sys
#
import sys
input = sys.stdin.readline
line_inp = lambda: list(map(int, input().strip().split()))
int_inp = lambda: int(input())
def distance(x, y):
return abs(x[0] - y[0]) + abs(x[1] - y[1])
def solve(n, k, points):
man_dist = [0] * n
for i in range(n):
for j in range(n):
dist = distance(points[i], points[j])
if dist <= k:
man_dist[i] += 1
if man_dist[i] == n:
return 1
return -1
for i in range(int_inp()):
n, k = line_inp()
points = []
for j in range(n):
points.append(line_inp())
# print(points)
print(solve(n, k, points))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
#define ll long long
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
using namespace std;
const int tINF = (int)INT_MAX;
const long long lINF = (long long)LLONG_MAX;
int getd(pair <int,int> l, pair <int,int> r) {
return abs(l.first - r.first) + abs(l.second - r.second);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef DEBUG
assert(freopen("inp", "r", stdin));
assert(freopen("out", "w",stdout));
#else
#define cerr if(false)cerr
#endif
int t;
cin >> t;
while (t--) {
int n, k;
cin >> n >> k;
vector<pair<int,int>> ar(n);
for (int i = 0; i < n; ++i) {
int x, y;
cin >> x >> y;
ar[i] = {x,y};
}
int res = 0;
vector <int> br(n);
for (int i = 0; i < n; ++i) {
int cnt = 0;
for (int j =0 ; j < n; ++j) {
if (i == j)
continue;
if (getd(ar[i], ar[j]) <= k) {
++cnt;
}
}
if (cnt == n - 1)
res = 1;
}
if (res) {
cout << 1 << '\n';
} else {
cout << -1 << '\n';
}
}
cerr << "Time execute: " << (double)clock() / (double)CLOCKS_PER_SEC
<< " sec" << endl;
} | 8 | CPP |
for _ in range(int(input())):
n, r = [int(i) for i in input().split()]
balls = []
z = False
for _ in range(n):
balls.append([int(i) for i in input().split()])
for i in balls:
if max([abs(i[0] - j[0]) + abs(i[1] - j[1]) for j in balls]) <= r:
print(1)
z = True
break
if not z:
print(-1) | 8 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int T;
int n,k,flag;
struct node{
int x,y,num;
}a[110];
int main()
{
cin>>T;
while(T--)
{
flag=0;
cin>>n>>k;
for(int i=1;i<=n;i++)
{
scanf("%d%d",&a[i].x,&a[i].y);
}
for(int i=1;i<=n;i++)
{
int tot=0;
for(int j=1;j<=n;j++)
{
if(i==j)
continue;
int dis=abs(a[i].x-a[j].x)+abs(a[i].y-a[j].y);
if(dis<=k)
tot++;
}
if(tot==n-1)
flag=1;
}
if(flag==1)
puts("1");
else puts("-1");
}
return 0;
} | 8 | CPP |
import sys
from math import gcd,ceil,sqrt,ceil
from math import gcd,ceil,floor,sqrt,copysign,factorial,fmod,fsum,degrees
from math import expm1,exp,log,log2,acos,asin,cos,tan,sin,pi,e,tau,inf,nan,atan2
INF = float('inf')
MOD = 998244353
mod = 10**9+7
from collections import Counter,defaultdict as df
from functools import reduce
def counter(l): return dict(Counter(l))
def printm(l):
for i in range(len(l[0])):
print(*l[i])
def P(n) :
if (n <= 1) :return False
if (n <= 3) :return True
if (n % 2 == 0 or n % 3 == 0) :return False
for i in range(5,ceil(sqrt(n))+1,6):
if (n % i == 0 or n % (i + 2) == 0) :return False
return True
import math
def lcm(a,b):
return int((a*b) / gcd(a,b))
def so(x): return {k: v for k, v in sorted(x.items(), key=lambda item: item[1])}
def rev(l): return list(reversed(l))
def ini(): return int(sys.stdin.readline())
def inp(): return map(int, sys.stdin.readline().strip().split())
def li(): return list(map(int, sys.stdin.readline().strip().split()))
def input(): return sys.stdin.readline().strip()
def inputm(n,m):return [li() for i in range(n)]
def d(x1 , y1 , x2 , y2):
return abs(x1-x2)+abs(y1-y2)
def solve():
n,k=inp()
l=[]
for i in range(n):
l+=[li()]
c=0
t=0
for i in l:
c=0
for j in l:
if d(i[0],i[1],j[0],j[1])<=k:
c+=1
if c==n:
t=1
break
if t:
print(1)
else:
print(-1)
for i in range(ini()):
solve()
#सर्वभूतेष्वभयदस्तं देवा ब्राह्मणं विदुः ॥ भावार्थ : जो व्यक्ति सम्मान दिए जाने अथवा अपमान किये जाने पर न तो प्रसन्न होता है और न ही नाखुश, और जो सभी प्राणियों अभय देता है उसी को देवतागण ब्राह्मण कहते है । नाभिनन्देत मरणं नाभिनन्देत जीवितम् ।
| 8 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int n,k,x[105],y[105];
void mian(){
cin>>n>>k;
int ans=-1;
for(int i=1;i<=n;i++){
cin>>x[i]>>y[i];
}
for(int i=1;i<=n;i++){
bool f=true;
for(int j=1;j<=n;j++){
if(abs(x[i]-x[j])+abs(y[i]-y[j])>k)f=false;
}
if(f)ans=1;
}
cout<<ans<<'\n';
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T;
cin>>T;
while(T--)mian();
return 0;
} | 8 | CPP |
#include <bits/stdc++.h>
#include <fstream>
#include<chrono>
#define ll long long
#define db double
#define deb(x) cout<<#x<<": "<<x<<"\n"
#define all(x) x.begin(),x.end()
#define fo(i, n) for(i=0 ; i<n ; i++)
#define Fo(i, k, n) for(i=k ; i<n ; i++)
#define setBits(x) __builtin_popcountll(x)
#define parity(x) __builtin_parity(x)
using namespace std;
using namespace chrono;
void solve()
{
int n,k;cin>>n>>k;
vector<pair<int,int>>v(n);
for(int i=0;i<n;i++){
int x,y;cin>>x>>y;
v[i]={x,y};
}
bool flag=false;
for(int i=0;i<n;i++){
int x=v[i].first;int y=v[i].second;
bool flag_each=true;
for(int j=0;j<n;j++){
int a=v[j].first;int b=v[j].second;
if(( abs(a-x)+abs(b-y) )>k){flag_each=false;break;}
}
if(flag_each){flag =true;break;}
}
if(flag)cout<<1<<endl;
else cout<<-1<<endl;
}
int32_t main() {
int t;cin>>t;
while(t--)solve();
return 0;
}
| 8 | CPP |
BUFSIZE = 8192
import os
import sys
import math
from io import BytesIO, IOBase
from bisect import bisect_left #c++ lowerbound bl(array,element)
from bisect import bisect_right #c++ upperbound br(array,element)
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
for _ in range(int(input())):
n,m=map(int,input().split())
a=[]
for i in range(n):
a.append(tuple(map(int,input().split())))
f=0
c=-1
for i in range(n):
f=0
for j in range(n):
if abs(a[i][0]-a[j][0])+abs(a[i][1]-a[j][1])<=m:
f+=1
if f==n:
c=1
break
print(c) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define scan(a,n) for(long long int index=0;index<n;index++) cin>>a[index];
#define print(a,n) for(long long int index=0;index<n;index++) cout<<a[index]<<" ";cout<<endl;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ss second
#define ff first
#define vli vector<long long int>
#define vlli vector<pair<long long int,long long int>>
#define vsi vector<string>
#define all(n) n.begin(),n.end()
#define forn(i,a,b) for(i=a;i<b;i++)
ll mul(ll x,ll y){ return (x*y)%mod;}
ll power(ll x, ll y) {ll res = 1; x %= mod;
while (y) {if (y & 1)res = mul(res, x); y >>= 1; x = mul(x, x);} return res;}
ll mod_inv(ll x) {return power(x, mod - 2);}
ll fact(ll n) {ll res = 1; for (ll i = 2; i <= n; i++) res = mul(res , i); return res; }
ll nCr(ll n, ll r) { return mul(fact(n),mod_inv(mul(fact(r),fact(n - r))));}
int main() {
fast;
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ll t=1;
cin>>t;
while(t--){
ll n,k;
cin>>n>>k;
ll a[n],b[n],i;
for(i=0;i<n;i++){
cin>>a[i]>>b[i];
}
ll f=-1,j;
ll x,y;
for(i=0;i<n;i++){
x=0;
for(j=0;j<n;j++){
y=abs(a[i]-a[j])+abs(b[i]-b[j]);
if(y<=k) x++;
}
if(x==n) f=1;
}
cout<<f<<endl;
}
return 0;
} | 8 | CPP |
t = int(input())
for _ in range(t):
n,k = map(int, input().split())
ali = []
for i in range(n):
li = list(map(int, input().split()))
ali.append(li)
for i in range(0,n):
f =0
for j in range(n):
q = abs(ali[i][0]-ali[j][0])
w = abs(ali[i][1] - ali[j][1])
if(q+w > k):
f = 1
break
if(f == 0):
break
if(f == 1):
print(-1)
else:
print(1)
| 8 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
#define pln puts("")
#define il inline
#define For(i,a,b) for(int i=(a),(i##i)=(b);i<=(i##i);++i)
#define rep(i,n) for(int i=0,(i##i)=(n);i<(i##i);++i)
#define Fodn(i,a,b) for(int i=(a),(i##i)=(b);i>=(i##i);--i)
typedef long long LL;
typedef unsigned int u32;
typedef unsigned long long u64;
typedef long double LD;
template<typename T>
il bool read(T&x){
x=0;char c=getchar();int f=1;
while((c<'0'||c>'9')&&(c!='-')&&(c!=EOF))c=getchar();
if(c==EOF)return 0;if(c=='-')f=-1,c=getchar();
while(c>='0'&&c<='9'){x=(x<<1)+(x<<3)+(c&15);c=getchar();}
x*=f;return 1;
}
template<typename T,typename...Args>
il bool read(T&x,Args&...args){bool res=1;res&=read(x);res&=read(args...);return res;}
const double EPS=1e-6;
const int M=1000000007,INF=0x3f3f3f3f;
const LL INFLL=0x3f3f3f3f3f3f3f3fLL;
const int N=1000010;
int n,k;
int x[N],y[N];
il void init(){
read(n,k);
For(i,1,n)read(x[i],y[i]);
}
il int solve(){
For(i,1,n){
bool can=1;
For(j,1,n){
if(abs(x[i]-x[j])+abs(y[i]-y[j])>k){
can=0;break;
}
}
if(can){return 1;}
}
return -1;
}
int main(){
int t;read(t);
while(t--){
init();printf("%d\n",solve());
}
return 0;
} | 8 | CPP |
t = int(input())
for i in range(t):
n,k = map(int,input().split())
L = []
for j in range(n):
x,y = map(int,input().split())
L.append([x,y])
mn = 0
ok = False
for i in range(n):
mn = 0
for j in range(n):
if i!= j:
x = abs(L[i][0]-L[j][0]) + abs(L[i][1] - L[j][1])
mn = max(mn,x)
if mn<=k:
ok = True
if ok == False:
print(-1)
else:
print(1)
| 8 | PYTHON3 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__);fflush(stderr);
#else
#define eprintf(...) 42
#endif
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
template<typename T>
using pair2 = pair<T, T>;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
return (ull)rng() % B;
}
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
clock_t startTime;
double getCurrentTime() {
return (double)(clock() - startTime) / CLOCKS_PER_SEC;
}
const int N = 111;
int n, k;
int a[N][2];
void solve() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++)
scanf("%d%d", &a[i][0], &a[i][1]);
for (int i = 0; i < n; i++) {
bool ok = true;
for (int j = 0; j < n; j++)
ok &= abs(a[i][0] - a[j][0]) + abs(a[i][1] - a[j][1]) <= k;
if (ok) {
printf("1\n");
return;
}
}
printf("-1\n");
}
int main()
{
startTime = clock();
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int t;
scanf("%d", &t);
while(t--) solve();
return 0;
}
| 8 | CPP |
#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <ctime>
#include <sstream>
#include <algorithm>
#include <functional>
#include <numeric>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long
#define pii pair < int, int >
#define pll pair < long long, long long>
#define ull unsigned long long
#define y1 stupid_cmath
#define left stupid_left
#define right stupid_right
#define vi vector <int>
#define sz(a) (int)a.size()
#define forit(it, s) for(__typeof(s.begin()) it = s.begin(); it != s.end(); it++)
#define all(a) a.begin(), a.end()
#define sqr(x) ((x) * (x))
const int inf = (int)1e9;
const int mod = inf + 7;
const double eps = 1e-9;
const double pi = acos(-1.0);
int n, k;
ll x[110], y[110];
void solve() {
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> x[i] >> y[i];
}
for (int i = 0; i < n; ++i) {
bool reachable = true;
for (int j = 0; j < n; ++j) {
ll dist = abs(x[i] - x[j]) + abs(y[i] - y[j]);
if (dist > k) {
reachable = false;
}
}
if (reachable) {
cout << 1 << endl;
return;
}
}
cout << -1 << endl;
}
int main(){
int t;
scanf("%d", &t);
while (t--) solve();
return 0;
}
| 8 | CPP |
def dist(a, b):
return abs(a[0]-b[0]) + abs(a[1]-b[1])
t=int(input())
for _ in range(t):
n, k = map(int, input().split())
points = []
for i in range(n):
x, y = map(int, input().split())
points.append([x,y])
deg = []
m = 0
for i in range(n):
d = 0
for j in range(n):
if (dist(points[i], points[j]) <= k):
d += 1
m = max(m, d)
#print("m", m, "n", n)
if m < n:
print(-1)
else:
print(1)
| 8 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 110;
struct node{
int x,y;
}e[MAXN];
bool cmp(node a,node b){
return a.x<b.x;
}
int l[MAXN],r[MAXN];
int main(){
int t;
scanf("%d",&t);
while(t--){
int n,k;
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++){
scanf("%d%d",&e[i].x,&e[i].y);
}
sort(e+1,e+n+1,cmp);
bool flag=false;
for(int i=2;i<=n;i++){
if(!(e[i].x==e[1].x&&e[i].y==e[1].y)) flag=true;
}
if(!flag){
printf("0\n");continue;
}
for(int i=1;i<=n;i++){
int pos=n;
for(int j=i+1;j<=n;j++){
if(abs(e[j].x-e[i].x)+abs(e[j].y-e[i].y)>k){
pos=j-1;break;
}
}
r[i]=pos;
pos=1;
for(int j=i-1;j>=1;j--){
if(abs(e[j].x-e[i].x)+abs(e[j].y-e[i].y)>k){
pos=j+1;break;
}
}
l[i]=pos;
}
flag=false;
for(int i=1;i<=n;i++){
if(l[i]==1&&r[i]==n) flag=true;
}
if(flag){
printf("1\n");
}
else printf("-1\n");
// printf("%d\n",dp[1][n]==1000?-1:dp[1][n]);
}
} | 8 | CPP |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define ll long long
#define quickie ios_base::sync_with_stdio(false); cin.tie(NULL);
#define rep(i, a, b) for(int i=a; i<b; i++)
#define rep1(i, a, b) for(int i=a; i<=b; i++)
#define repp(i, a, b) for(int i=b-1; i>=a; i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define db double
#define mi map<int, int>
#define vi vector<int>
#define qi queue<int>
#define mod 1000000007 ;
#define MI(x) power(x, mod-2)
#define test int t; cin >> t;
#define all(a) a.begin(),a.end()
#define pi 3.141592653589
#define fact(n) rep(i, 1, n+1)ft.pb((ft[i-1]*i)%mod) ;
int power(int x, int y) ;
int gcd(int a, int b) ;
int power(int x, int y) {
int res = 1; x %= mod;
while (y > 0) {
if (y & 1)
res = (res*x) % mod;
y = y>>1;
x = (x*x) % mod;
}
return res%mod;
}
int gcd(int a,int b) {
if(a==0) return b;
return gcd(b%a,a);
}
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template<typename T>
// using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
// template<typename T>
// using ordered_multiset = tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;
//(*****FOR USING ORDERED SET CHANGE INT*******)
// struct chash {
// const int RANDOM = (long long)(make_unique<char>().get()) ^ chrono::high_resolution_clock::now().time_since_epoch().count();
// static unsigned long long hash_f(unsigned long long x) {
// x += 0x9e3779b97f4a7c15;
// x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
// x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
// return x ^ (x >> 31);
// }
// static unsigned hash_combine(unsigned a, unsigned b) { return a * 31 + b; }
// int operator()(int x) const { return hash_f(x)^RANDOM; }
// };
signed main() {
quickie
test
while(t--) {
int n, k ;
cin >> n >> k ;
vector<pair<int, int>> v ;
rep(i, 0, n) {
int x, y ;
cin >> x >> y ;
v.pb({x, y}) ;
}
int ans = -1 ;
rep(i, 0, n) {
int f = 0 ;
rep(j, 0, n) {
if(i == j)
continue ;
if(abs(v[i].fi-v[j].fi) + abs(v[i].se-v[j].se) > k) {
f = 1 ;
break ;
}
}
if(f == 0) {
ans = 1 ;
break ;
}
}
cout << ans << "\n" ;
}
} | 8 | CPP |
import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
for _ in range(int(input())):
n,k=map(int,input().split())
a=[]
for i in range(n):
a.append(list(map(int,input().split())))
ans = -1
for i in range(n):
count=0
for j in range(n):
if abs(a[i][0]-a[j][0])+abs(a[i][1]-a[j][1])<=k:
count+=1
if count==n:
ans=1
break
print(ans) | 8 | PYTHON3 |
#ifndef ONLINE_JUDGE
#include "debug.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve()
{
int n, k;
cin >> n >> k;
vector<pair<int, int> > vp;
for (int i = 0; i < n; i++)
{
int x, y;
cin >> x >> y;
vp.push_back({x, y});
}
int ans = 0;
bool ok = 0;
// int cnt = 0;
for (int i = 0; i < n; i++)
{
// bad = 1;
int cnt = 0;
for (int j = 0; j < n; j++)
{
if (abs(vp[i].first - vp[j].first) + abs(vp[i].second - vp[j].second) <= k)
{
cnt++;
}
}
if (cnt == n)
ok = 1;
// if (cnt < n)
// {
// cout << "-1\n";
// return;
// }
}
if (ok)
cout << "1\n";
else
cout << "-1\n";
// cout << "1\n";
}
int32_t main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int t = 1;
cin >> t;
while (t--)
solve();
return 0;
} | 8 | CPP |
#include<bits/stdc++.h>
using namespace std ;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long int
//////////////////////////////////////////////////////////////////////////////////////////////
void solve();
//////////////////////////////////////////////////////////////////////////////////////////////
int main ()
{
// fastio
ll t;
cin>>t;
while(t--)
{
solve();
}
}
///////////////////////////////////////////
void solve()
{
ll n,i,doit=0,a,b,check=0,j,k;
cin>>n>>k;
ll temp=0 ,count =0;
vector<pair<ll,ll>>pq;
for( i=0;i<n;i++){
cin>>a>>b;
pq.push_back({a,b});
}
doit=0;
for(ll i=0;i<n;i++){
check= 0;
a+=b;
for(ll j=0;j<n;j++){
if(i==j)
continue;
a++;
a++;
b++;
b++;
a+=b;
a++;
temp = abs(pq[i].first-pq[j].first);
b++;
b++;
b+=a;
temp+=abs(pq[i].second-pq[j].second);
a++;
a++;
b++;
if(temp<=k)check++;
}
if(check==n-1)
doit= 1;
a++;
a++;
}
// (!doit)?cout<<-1<<"\n":cout<<1<<"\n";
if(doit)
cout<<1<<endl;
else
cout<<-1<<endl;
}
| 8 | CPP |
def balls_of_steel (n,k,balls) :
current_index = 0
while current_index < len(balls) :
compare = balls[current_index]
terminate = 1
for i,j in balls :
ans = abs(compare[0]-i) + abs(compare[1]-j)
if ans > k :
terminate = 0
break
if terminate == 0 :
current_index += 1
else :
return 1
return -1
test = int(input())
for y in range(test) :
n,k = list(map(int,input().split()))
balls = []
for x in range(n) :
q = list(map(int,input().split()))
balls.append(q)
print (balls_of_steel(n,k,balls))
| 8 | PYTHON3 |
# include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll t,c,f,x,x1,y,n,k;
cin>>t;
while(t--)
{
cin>>n>>k;
ll a[n],b[n];
for(int i=0; i<n; i++)
{
cin>>a[i]>>b[i];
}
x1=0;
for(int i=0; i<n; i++)
{
c=0;
for(int j=0; j<n; j++)
{
x=abs(a[i]-a[j]);
y=abs(b[i]-b[j]);
if(x+y<=k)
{
c++;
continue;
}
else
break;
}
if(c==n)
x1=1;
}
if(x1)
cout<<1<<endl;
else
cout<<-1<<endl;
}
} | 8 | CPP |
from math import *
from bisect import *
from collections import *
from random import *
from decimal import *
import sys
input=sys.stdin.readline
def inp():
return int(input())
def st():
return input().rstrip('\n')
def lis():
return list(map(int,input().split()))
def ma():
return map(int,input().split())
t=inp()
while(t):
t-=1
n,k=ma()
r=[]
for i in range(n):
x,y=ma()
r.append([x,y])
fl=0
for i in range(n):
co=0
for j in range(n):
m=abs(r[j][0]-r[i][0])+abs(r[j][1]-r[i][1])
if(m<=k):
co+=1
if(co==n):
fl=1
break
if(fl):
print(1)
else:
print(-1)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll mod = 1e9 + 7;
const ld eps = 1e-9;
const ld PI = acos(-1);
void solve(){
ll n,k;
cin >> n >> k;
vector<pair<ll,ll>> a(n);
for(int i=0;i<n;i++){
cin >> a[i].first >> a[i].second;
}
bool isBad = false;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(abs(a[j].first - a[i].first) + abs(a[j].second - a[i].second) > k){
isBad = true;
}
}
if(!isBad){
cout << 1 << "\n";
return;
}
isBad = false;
}
cout << -1 << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
ll t;
cin >> t;
while(t--)solve();
return 0;
} | 8 | CPP |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
def distance(p1, p2):
return abs(p1[0] - p2[0]) + abs(p1[1] - p2[1])
def balls_of_steel(P, n, k):
for i, p1 in enumerate(P):
possible = True
total_dist = 0
for j, p2 in enumerate(P):
dist = distance(p1, p2)
total_dist += dist
if dist > k:
possible = False
break
if possible:
break
if not possible:
return -1
else:
return 1 if total_dist > 0 else 0
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
P = [ [int(v) for v in input().split()] for _ in range(n) ]
ans = balls_of_steel(P, n, k)
print(ans) | 8 | PYTHON3 |
for i in range(int(input())):
a=[int(j) for j in input().split()]
n=a[0]
k=a[1]
x=[]
y=[]
s=0
for i in range(n):
a=[int(j) for j in input().split()]
x.append(a[0])
y.append(a[1])
for i in range(n):
j=0
t=0
while j<n:
if (abs(x[i]-x[j]) + abs(y[i]-y[j]))>k:
t=1
break
j+=1
if t==0:
s=1
break
if s==1:
print(1)
else:
print(-1)
| 8 | PYTHON3 |
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int N = 3e5 + 7;
int32_t main(){
IOS;
int t;
cin >> t;
while(t--){
int n,k;
cin >> n >>k;
vector<pair<int,int>> parth;
for(int i = 0; i<n; i++){
int x,y;
cin >> x >> y;
parth.push_back(make_pair(x,y));
}
sort(parth.begin(), parth.end());
int flag = -1;
int p;
for(int i = 0;i < n; i++){
int count = 0;
for(int j = 0;j < n; j++){
p = abs(parth[i].first-parth[j].first)+abs(parth[i].second-parth[j].second);
if(p<=k) count++;
}
if(count==n){
flag = true;
break;
}
}
cout << flag << endl;
}
return 0;
} | 8 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t, n, k;
cin>> t;
while(t--){
cin >> n >> k;
int res = -1;
vector<pair<int, int> > pts(n);
int x , y;
for (int i = 0; i < n; i++){
cin >> x >> y;
pts[i] = make_pair(x, y);
}
for (int i = 0; i < n; i++){
int cnt = 0;
for (int j = 0; j < n; j++){
if (abs(pts[i].first - pts[j].first) + abs(pts[i].second - pts[j].second) <= k)
cnt++;
}
if (cnt == n)
res = 1;
}
cout << res << endl;
}
return 0;
} | 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << " " << H; dbg_out(T...); }
#ifdef SMIE
#define debug(args...) cerr << "(" << #args << "):", dbg_out(args)
#else
#define debug(args...)
#endif
long long dis(pair<long long, long long> a, pair<long long, long long> b) {
return abs(a.first - b.first) + abs(a.second - b.second);
}
int main() {
int tests;
cin >> tests;
while (tests-- > 0) {
//remeber to clear variable
int n;
long long k;
vector<pair<long long, long long>> points;
cin >> n >> k;
for (int i = 0; i < n; i++ ) {
long long x, y;
cin >> x >> y;
points.push_back({x, y});
}
bool ok = false;
for (int i = 0; i < n; i++) {
bool cur_ok = true;
for (int j = 0; j < n; j++) {
if (dis(points[i], points[j]) > k) {
cur_ok = false;
break;
}
}
if (cur_ok == true) {
ok = true;
break;
}
}
if (ok == true) {
puts("1");
} else {
puts("-1");
}
}
}
| 8 | CPP |
using namespace std;
#include <iostream>
#include <set>
#include <queue>
#include <cstring>
#define MAXN 105
int arrX[MAXN],arrY[MAXN],degree[MAXN],important[MAXN];
bool edges[MAXN][MAXN],visited[MAXN];
int main() {
int T;
cin >> T;
while(T--) {
int N,K;
cin >> N >> K;
int counter = N;
for(int i = 0;i < N;++i) {
cin >> arrX[i] >> arrY[i];
}
memset(edges,0,sizeof(edges));
for(int i = 0;i < N;++i) {
for(int j = 0;j < N;++j) {
if(i == j) continue;
if(abs(arrX[i] - arrX[j]) + abs(arrY[i] - arrY[j]) <= K) {
edges[i][j] = true;
degree[i]++;
}
}
}
int curMax = 0;
bool ans = false;
for(int i = 0;i < N;++i) {
int counter = 0;
for(int j = 0;j < N;++j) {
if(edges[i][j]) counter++;
}
if(counter == N - 1) {
ans = true;
break;
}
}
cout << 2 * ans - 1 << endl;
}
} | 8 | CPP |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define ld long double
#define pb push_back
#define ppb pop_back
#define clr clear
#define len size()
#define beg begin()
#define end end()
#define ins insert
#define f first
#define s second
#define mp make_pair
#define forn(i, l, r) for(ll i = l; i <= r; ++i)
#define fastio ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr)
using namespace std;
int t, n, k;
const int MAXN = 110;
int d[MAXN][MAXN], x[MAXN], y[MAXN];
vector < int > g[MAXN];
int main()
{
fastio;
cin >> t;
while (t--)
{
cin >> n >> k;
for (int i = 1; i <= n; ++i)
{
cin >> x[i] >> y[i];
g[i].clr();
}
for (int i = 1; i < n; ++i)
{
for (int j = i + 1; j <= n; ++j)
d[i][j] = d[j][i] = abs(x[i] - x[j]) + abs(y[i] - y[j]);
}
for (int i = 1; i < n; ++i)
{
for (int j = i + 1; j <= n; ++j)
{
if (d[i][j] <= k)
{
g[i].pb(j);
g[j].pb(i);
}
}
}
int ans = -1;
for (int i = 1; i <= n; ++i)
{
if ((int)g[i].len == n - 1)
{
ans = 1;
break;
}
}
cout << ans << "\n";
}
return 0;
} | 8 | CPP |
for _ in range(int(input())):
n,k=map(int,input().split())
l=[];ans=[];l1=[]
for i in range(n):
x,y=map(int,input().split())
l.append([x,y])
for i in range(n):
l1.append([])
for j in range(n):
l1[i].append(abs(l[i][0]-l[j][0])+abs(l[i][1]-l[j][1]))
for i in range(n):
c=0
for j in l1[i]:
if(j<=k): c+=1
ans.append(c)
print(1 if n in ans else -1) | 8 | PYTHON3 |
for _ in range(int(input())):
n,k=map(int,input().split())
l=[];ans=[]
for i in range(n):
x,y=map(int,input().split())
l.append([x,y])
l1=[]
# print(l)
for i in range(n):
l1.append([])
for j in range(i+1,n):
l1[i].append(abs(l[i][0]-l[j][0])+abs(l[i][1]-l[j][1]))
for j in range(0,i+1):
l1[i].append(abs(l[i][0]-l[j][0])+abs(l[i][1]-l[j][1]))
# print(l1)
for i in range(n):
c=0
for j in l1[i]:
if(j<=k):
c+=1
ans.append(c)
# print(ans)
if n in ans:
print(1)
else:
print(-1) | 8 | PYTHON3 |
// Example program
#include <bits/stdc++.h>
using namespace std;
pair<int,int> p[200],last;
int main(){
int t; cin >>t ;
while(t--){
int n,k,tmp=0,ok=1;
cin >> n >> k;
for(int i=0;i<n;i++){
cin >> p[i].first >> p[i].second;
}
sort(p,p+n);
last={p[0].first,p[0].second};
for(int i=0;i<n;i++){
ok=1;
for(int j=0;j<n;j++){
if((abs(p[i].first-p[j].first)+abs(p[i].second-p[j].second))>k)
ok=0;
}
if(ok) break;
}
cout << (ok?1:-1)<<'\n';
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 110;
#define FOR(i,a,b) for(int i = a;i <= b;i++)
#define _FOR(i,a,b) for(int i = a;i >= b;i--)
template<typename T> void read(T &x)
{
x = 0;int f = 1;
char c = getchar();
for(;!isdigit(c);c = getchar()) if(c == '-') f = -1;
for(;isdigit(c);c = getchar()) x = x * 10 + c - '0';
x *= f;
}
int T,n,K,e[N][N],X[N],Y[N];
int main()
{
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
read(T);
while(T--)
{
bool flag;
memset(e,0,sizeof(e));
read(n),read(K);
FOR(i,1,n)
read(X[i]),read(Y[i]);
FOR(i,1,n)
FOR(j,1,n)
if(abs(X[i] - X[j]) + abs(Y[i] - Y[j]) <= K) e[i][j] = 1;
FOR(i,1,n)
{
flag = 1;
FOR(j,1,n)
if(!e[i][j]) {flag = 0; break;}
if(flag) break;
}
if(flag) puts("1");
else puts("-1");
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long int
#define pb push_back
#define pob pop_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define f0(i,n) for(i=0;i<n;i++)
#define rf0(i,n) for(i=n-1;i>=0;i--)
#define f2(i,n) for(i=1;i<n;i++)
#define f1(i,n) for(i=1;i<=n;i++)
#define fab(i,a,b) for(i=a;i<=b;i++)
#define shr ll t;cin>>t; while(t--)
#define fi first
#define sc second
#define pll pair<ll,ll>
#define vll vector<ll>
#define vpll vector<pll>
#define all(v) v.begin(),v.end()
#define mod 1000000007
#define dev(a) for(auto it:a)cout<<it<<" "
#define prec(nm,prc) cout<<fixed << setprecision(nm)<<prc
#define print(a) cout<<a<<endl;
#define nl '\n'
using namespace std;
bool comp(pll &a,pll &b)
{
return (a.sc<b.sc);
}
ll power(ll n,ll p)
{
if(p==0)
return 1;
else
{
ll ans=power(n,p/2)%mod;
ans=(ans*ans)%mod;
if(p%2==0)
return ans;
else
return ans=(ans*n)%mod;
}
}
bool isPrime(ll n)
{
if (n <= 1)
return false;
if (n <= 3)
return true;
if (n % 2 == 0 || n % 3 == 0)
return false;
for (ll i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
/********************HAR HAR MAHADEV***********JAI BAJRANG BALI************************/
int main()
{
FAST;
/* ifstream cin;
cin.open("input.txt");
ofstream cout;
cout.open("output.txt");
*/
shr
{
ll i,j,n,a,b,c,c1,d,m,sum=0,temp,k,k2,k1,ans=0,cnt=0,r=0,e=0,f;
string str,stri,om,s;
map<ll,ll>mp,mp1;
set<ll>st; vector<vll> v;
cin>>n>>k; ll x[n][2];
f0(i,n)
{
cin>>x[i][0]>>x[i][1];
}
f0(i,n)
{
vll vk;
f0(j,n)
{
if(i!=j)
{
vk.pb(abs(x[i][0]-x[j][0])+abs(x[i][1]-x[j][1]));
}
}
v.pb(vk);
r++;
}
f0(i,v.size())
{
ll p=*max_element(all(v[i]));
if(p<=k){e=1;break;}
}
if(e==1)cout<<1;
else cout<<-1;
cout<<endl;
}
return 0;
}
| 8 | CPP |
#define F first
#define S second
#define pb push_back
#include <bits/stdc++.h>
using namespace std;
int y[101] ;
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
int t ;
cin >> t ;
while ( t-- ) {
vector <pair<int,int>> x ;
int n , k , a , b ;
cin >> n >> k ;
for ( int i = 0 ; i < n ; i++ ) {
y[i] = 0 ;
cin >> a >> b ;
x.pb({a,b});
}
bool yes = false ;
for ( int i = 0 ; i < n ; i++ ) {
for ( int j = 0 ; j < n ; j++ ) {
if ( i == j ) continue ;
if ( abs(x[i].F-x[j].F)+abs(x[i].S-x[j].S) <= k ) {
y[i]++;
}
}
if ( y[i] == n-1 ) yes = true ;
}
cout << (yes?1:-1) << endl ;
}
return 0;
} | 8 | CPP |
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
x, y= [0]*n, [0]*n
for i in range(n):
x[i], y[i] = map(int, input().split())
ans = -1
for i in range(n):
for j in range(n):
if(abs(x[i] - x[j]) + abs(y[i] - y[j]) > k):
break
if(j == n-1):
ans = 1
print(ans) | 8 | PYTHON3 |
n=int(input())
while n:
m=list(map(int,input().split()))
list1=[]
i=0
while i!=m[0]:
list2=list(map(int,input().split()))
list1.append(list2)
i=i+1
for i in range(m[0]):
flag=0
for j in range(m[0]):
if abs(list1[i][0]-list1[j][0])+abs(list1[i][1]-list1[j][1])<=m[1]:
flag=flag+1
if flag==m[0]:
break
if flag==m[0]:
print(1)
else:
print(-1)
n=n-1
| 8 | PYTHON3 |
t= int(input())
for _ in range(t):
n, k = map(int, input().split())
XY = []
for i in range(n):
x,y = map(int, input().split())
XY.append((x, y))
flag = False
for i in range(n):
xi, yi = XY[i]
for j in range(n):
xj, yj = XY[j]
if abs(xi-xj)+abs(yi-yj)>k:
break
else:
flag = True
break
if flag:
print(1)
else:
print(-1)
| 8 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
#define ln "\n"
#define pb push_back
typedef long double ld;
typedef long long ll;
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
vector<pair<int, int>> a;
void go() {
int n;cin >>n;
int k;cin >> k;
a.assign(n, {});
for(int i = 0;i < n;i++) {
cin >> a[i].first >> a[i].second;
}
for(int i = 0;i < n;i++) {
bool ok = true;
for(int j =0;j < n;j++) {
if(k >= abs(a[i].first - a[j].first) + abs(a[i].second - a[j].second)) {
}else {
ok = false;
}
}
if(ok) {
cout << 1 << ln;
return;
}
}
cout << -1 << ln;
}
int main() {
IO;
int t;cin >> t;
while(t--) go();
}
| 8 | CPP |
for t in range(int(input())):
n,k=map(int,input().split())
a,f=[],0
for i in range(n):
a.append(tuple(map(int,input().split())))
for i in range(n):
f1=1
for j in range(n):
if abs(a[i][0]-a[j][0])+abs(a[i][1]-a[j][1])>k:
f1=0
break
if f1:
f=1
break
if f:
print(1)
else:
print(-1) | 8 | PYTHON3 |
#include <iostream>
using namespace std;
void solve(){
int n, k;
cin >> n >> k;
int x_cord[n], y_cord[n];
for(int i = 0; i < n; i++)
{
cin >> x_cord[i] >> y_cord[i];
}
int ans = -1;
for(int i = 0; i < n; i++)
{
bool flag = true;
for(int j = 0; j < n; j++){
if(j != i && abs(x_cord[i] - x_cord[j]) + abs(y_cord[i] - y_cord[j]) > k)
{
flag = false;
break;
}
}
if(flag)
{
ans = 1;
break;
}
}
cout << ans << endl;
}
int main() {
int t;
cin >> t;
while(t--) solve();
return 0;
}
| 8 | CPP |
t=int(input())
for _ in range(t):
n,k=map(int,input().split())
r=[]
for i in range(n):
x,y=map(int,input().split())
r.append([x,y])
flag=False
for i in range(n):
x0=r[i][0]
y0=r[i][1]
for j in range(n):
x=r[j][0]
y=r[j][1]
if abs(x0-x)+abs(y0-y)>k:
break
else:
flag=True
if flag:
print(1)
else:
print(-1) | 8 | PYTHON3 |
import sys
from collections import *
import math
input = sys.stdin.readline
t = int(input())
while t:
t-=1
n,k = [int(x) for x in input().split()]
x = [0]*n
y = [0]*n
for i in range(n):
x[i],y[i] = [int(x) for x in input().split()]
for i in range(n):
count = 0
for j in range(n):
if abs(x[i]-x[j])+abs(y[i]-y[j])<=k:
count+=1
if count==n:
break
if count==n:
print(1)
else:
print(-1)
| 8 | PYTHON3 |
rn=lambda:int(input())
rl=lambda:list(map(int,input().split()))
rns=lambda:map(int,input().split())
rs=lambda:input()
yn=lambda x:print('Yes') if x else print('No')
YN=lambda x:print('YES') if x else print('NO')
for _ in range(rn()):
n,k=rns()
points=[]
ans=-1
for i in range(n):
points.append(rl())
for i in range(n):
b=[]
for j in range(n):
if i!=j:
b.append(abs(points[i][0]-points[j][0])+abs(points[i][1]-points[j][1]))
if all([i<=k for i in b]):
ans=1
break
print(ans) | 8 | PYTHON3 |
#include<bits/stdc++.h>
#define ll long long
#define si(num) scanf("%d" ,&num)
#define sll(num) scanf("%lld" ,&num)
#define pll(num) printf("%lld\n" ,num)
#define pllS(num) printf("%lld " ,num)
#define p0(num1) cout <<num1 <<" ";
#define p1(num1) cout <<num1 <<endl;
#define p2(num1 ,num2) cout <<num1 <<" " <<num2 <<endl;
#define p3(num1 ,num2 ,num3) cout <<num1 <<" " <<num2 <<" " <<num3 <<endl;
#define nL cout <<endl;
#define f(i ,lV ,uV) for(i =lV ;i <=uV ;++i)
#define fd(i ,lV ,uV) for(i =lV ;i >=uV ;--i)
#define sz1 100002
using namespace std;
ll n ,k;
ll i ,j ,x ,y;
ll mm(ll x){ if(x >=0) return x; return -1*x;}
ll tP(){
cin >>n >>k;
ll x[n +1] ,y[n +1];
f(i ,1 ,n){
cin >>x[i] >>y[i];
}
f(i ,1 ,n){
ll t =0;
f(j ,1 ,n){
if(mm(x[i] -x[j]) +mm(y[i] -y[j]) >k) t =-1;
}if(t ==0) return 1;
}return -1;
}
int main(){
int test; cin >>test;
while(test--){
cout <<tP() <<endl;
}
}
| 8 | CPP |
#include<bits/stdc++.h>
#define lld long long int
#define llf long double
#define pb push_back
#define mp make_pair
#define in insert
#define loopN(n) for(lld i=0;i<n;i++)
#define loopN2(n) for(lld j=0;j<n;j++)
#define loop(p,n) for(lld i=p;i<=n;i++)
#define rloop(p,n) for(lld i=n;i>=p;i--)
#define loop2(p,n) for(lld j=p;j<=n;j++)
#define all(v) v.begin(),v.end()
#define f1 first
#define f2 second
#define INF 2e18
#define FILE freopen("input.txt","r",stdin);freopen("output.txt","w",stdout)
#define pi 2*acos(0.0)
#define ISO ios::sync_with_stdio(false);cin.tie(0)
#define mem(a,b) memset(a,b,sizeof(a))
#define case(z) cout<<"Case "<<z<<": "
#define setprec(a) fixed<< setprecision(a)
//_______________________________________________
#define on(m,p) (m|(1<<p))
#define ison(m,p) (m&(1<<p))
#define flip(m,p) (m^(1<<p))
#define allon(p) ((1<<p)-1)
//_______________________________________________
using namespace std;
const lld mod=1e9+7;
lld fx[]= {1,0,-1, 0 ,1, 1,-1,-1};
lld fy[]= {0,1,0 ,-1 ,1,-1,1 ,-1};
lld n;
lld x[105],y[105];
lld k;
void slv()
{
cin>>n>>k;
loopN(n)cin>>x[i]>>y[i];
lld ans=-1;
loopN(n)
{
bool f=1;
loopN2(n)
{
if(abs(x[i]-x[j])+abs(y[i]-y[j])>k)
{
f=0;
break;
}
}
if(f)
{
ans=1;break;
}
}
cout<<ans<<endl;
}
int main()
{
ISO;
lld idx=1;
lld t;cin>>t;while(t--)
{
//case(idx++);
slv();
}
return 0;
}
| 8 | CPP |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define f(i,k,n) for(ll i=k;i<n;i++)
#define all(s) s.begin(),s.end()
#define vec vector<ll>
#define pb push_back
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
void test(){
ll n,k,ans=1,till=0;
cin>>n>>k;
vector<pair<ll,ll> > v;
bool ok=true;
f(i,0,n){
ll a,b;
cin>>a>>b;
v.pb({a,b});
}
sort(all(v));
f(i,0,n){
f(j,0,n){
if(i!=j) till=max(till,abs(v[j].first-v[i].first)+abs(v[j].second-v[i].second));
}
if(till<=k) ok=false;
till=0;
}
ok?cout<<-1<<endl:cout<<1<<endl;
}
int main(){
IOS;
ll t=1;cin>>t;
while(t--){
test();
}
return 0;
}
| 8 | CPP |
def find():
N, K = map(int, input().split())
minX, maxX, minY, maxY = 10**5, 0, 10**5, 0
num = []
for __ in range(N):
X, Y = map(int, input().split())
num.append((X, Y))
for i in range(N):
for j in range(N):
if abs(num[i][0] - num[j][0]) + abs(num[i][1] - num[j][1]) > K:
break
else:
return 1
else:
return -1
for _ in range(int(input())):
print(find())
| 8 | PYTHON3 |
import sys
import math
input = sys.stdin.readline
def pi():
return(int(input()))
def pl():
return(int(input(), 16))
def ti():
return(list(map(int,input().split())))
def ts():
s = input()
return(list(s[:len(s) - 1]))
def invr():
return(map(int,input().split()))
def main():
B();
def A():
t = pi();
while t:
t -= 1;
n = ti();
s = ts();
temp = "";
for c in s:
if c == "b":
temp += "b";
ans = temp;
if len(temp) == 0:
print(*s, sep="");
continue;
for c in s:
if c != "b":
ans += c;
print(ans);
def B():
t = pi();
while t:
t -= 1;
[n,k] = ti();
p = [[]*n]*n;
for i in range(n):
p[i] = ti();
isPossible = False;
for i in range(n):
f = True;
for j in range(n):
d = abs(p[i][0]-p[j][0])+abs(p[i][1]-p[j][1]);
if d > k:
f = False;
break;
if f:
isPossible = True;
if not isPossible:
print(-1);
else:
print(1);
main();
| 8 | PYTHON3 |
#pragma GCC optimize("Ofast")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define gcd(a,b) __gcd(a,b)
#define pb push_back
#define DRACO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ll long long int
#define GO ll t; cin>>t; for(int i = 1 ; i <= t ;i++)
#define mod 1000000007
#define fore(p) for(auto& x:p)
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(), x.rend()
#define F first
#define S second
//check the corner cases(n==1)
//try checking in reverse order
//check your logic again
ll k;
void Solve()
{
ll i,j,l,n,m;
cin >> n >> k;
vector<pair<ll,ll>> v;
for(i = 0 ; i < n ;i++)
{ ll x, y;
cin >> x >> y;
v.pb({x,y});
}
sort(all(v));
for(i = 0 ; i< n ;i++)
{ ll f = 1;
for(j = 0 ; j < n ;j++)
{
if(abs(v[i].F-v[j].F) + abs(v[i].S-v[j].S) > k)
{
f = 0;
}
}
if(f)
{
cout << "1\n";
return;
}
}
cout << "-1\n";
}
int main()
{ DRACO
cout.precision(10);
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
GO
{
Solve();
}
return 0;
} | 8 | CPP |
#include<bits/stdc++.h>
using namespace std;
int r[110];
pair<int,int> p[110];
int main(){
int t;
cin >> t;
while(t --){
memset(r,0,sizeof r);
int n,k;
cin >> n >> k;
for(int i = 1;i <= n;i++) cin >> p[i].first >> p[i].second;
for(int i = 1;i <= n;i++){
for(int j = 1;j <= n;j++){
if(abs(p[i].first - p[j].first) + abs(p[i].second - p[j].second) <= k)
r[i] ++;
}
}
bool f = false;
for(int i = 1;i <= n;i++){
if(r[i] == n){
cout << "1" << endl;
f = true;
break;
}
}
if(f == false) cout << "-1" << endl;
}
} | 8 | CPP |
for _ in range(int(input())):
n, k = map(int, input().split())
a = []
for i in range(n):
a.append(list(map(int, input().split())))
s = True
for i in range(n):
p = True
for j in range(n):
if abs(a[i][0] - a[j][0]) + abs(a[i][1] - a[j][1]) > k: p = False; break
if p: print(1); s = False; break
if s: print(-1) | 8 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
long long t,n,m,k,ccnt,pos=0,sum=0,minn2=INT_MAX,sum2,cnt=0,cnt1=0,cnt2=0,cnt3=0,cnt4=0,cnt5=0,cnt6=0,cnt7=0,a[2000005],x1,y7,x2,y2,x3,y3,aaa,bbb;
long long vis[1000005],b[1000005],c[1000005],c3[2005][2005],c4[1000005],kk[1000005],x,y,z,d=0,l2,r2;
long long pos1=0,pos2=0,tem,tem2,l,r,ans=0,ans2,mod=998244353,tw[100005],th[100005],dd,ee,out[1000005],te[100005],dp[1000005],dp2[1000005],dp3[1000005];
long long minn=LONG_LONG_MAX,maxx=-LONG_LONG_MAX;
string s1,s2,s;
char cc[2005][2005],ch,cr[100005],ch2;
vector<int> v[100005];
//vector<int> v2[100005];
long long fpow(long long aa,long long bb)
{
long long kk1=aa;
long long kk2=1;
while(bb>1)
{
if(bb%2)
{
kk2*=kk1;
kk2%=mod;
}
kk1*=kk1;
kk1%=mod;
bb=bb/2;
}
return (kk1*kk2)%mod;
}
signed main()
{
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
cin>>t;
while(t--)
{
cin>>n>>k;
for(int i=0;i<n;i++)
{
cin>>a[i]>>b[i];
}
ans=0;
for(int i=0;i<n;i++)
{
d=1;
for(int j=0;j<n;j++)
{
if(abs(a[i]-a[j])+abs(b[i]-b[j])>k)
{
d=0;
}
}
if(d)
{
ans=1;
break;
}
}
if(ans)
{
cout<<1<<'\n';
}
else
{
cout<<-1<<'\n';
}
}
}
| 8 | CPP |
#include <bits/stdc++.h>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define reset(a,v) memset((a), v, sizeof(a))
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
const int N = 105;
int n, k;
ii dat[N];
int getManhattanDist(ii a, ii b) {
return abs(a.fi - b.fi) + abs(a.se - b.se);
}
int main() {
int tc; cin >> tc;
while (tc--) {
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> dat[i].fi >> dat[i].se;
bool ok = 0;
for (int i = 0; i < n; i++) {
bool can = 1;
for (int j = 0; j < n; j++) {
int dist = getManhattanDist(dat[i], dat[j]);
if (dist > k) {
can = 0;
break;
}
}
if (can) {
ok = 1;
break;
}
}
if (ok) cout << "1\n";
else cout << "-1\n";
}
return 0;
} | 8 | CPP |
def dist(a, b):
return abs(a[0] - b[0]) + abs(a[1] - b[1])
def solve(n, k, p):
for i in range(n):
if all(dist(p[i], p[j]) <= k for j in range(n)):
return 1
return -1
tests = int(input())
for test in range(tests):
n, k = map(int, input().split())
p = [list(map(int, input().split())) for i in range(n)]
print(solve(n, k, p))
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;cin>>t;
while(t--){
int n,k;
cin>>n>>k;
int arr[n][2];
for(int i=0;i<n;i++){
cin>>arr[i][0]>>arr[i][1];
}
int ans=-1;
for(int i=0;i<n;i++){
int mx=0;
for(int j=0;j<n;j++){
mx=max( mx,abs(arr[i][0]-arr[j][0])+abs(arr[i][1]-arr[j][1]) );
}
if(mx<=k){
ans=1;
}
}
cout<<ans<<endl;
}
return 0;
} | 8 | CPP |
t=int(input())
for s in range(t):
n,k=map(int,input().split())
l=[]
for i in range(n):
x,y=map(int,input().split())
l.append([x,y])
flag=0
for i in range(0,n):
c=0
for j in range(0,n):
if(abs(l[i][0]-l[j][0]) + abs(l[i][1]-l[j][1])>k):
break
c=c+1
if(c==n):
flag=1
print(1)
break
if(flag==0):
print(-1)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma optimization_level 3
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define f0r(a, b) for (long long a = 0; a < (b); ++a)
#define f1r(a, b, c) for (long long a = (b); a < (c); ++a)
#define f0rd(a, b) for (long long a = (b); a >= 0; --a)
#define f1rd(a, b, c) for (long long a = (b); a >= (c); --a)
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define pb push_back
#define send {ios_base::sync_with_stdio(false);}
#define help {cin.tie(NULL); cout.tie(NULL);}
#define fix(prec) {cout << setprecision(prec) << fixed;}
#define mp make_pair
#define f first
#define s second
#define all(v) v.begin(), v.end()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define readgraph(list, edges) for (int i = 0; i < edges; i++) {int a, b; cin >> a >> b; a--; b--; list[a].pb(b); list[b].pb(a);}
#define ai(a, n) for (int ele = 0; ele < n; ele++) cin >> a[ele];
#define ain(a, lb, rb) for (int ele = lb; ele <= rb; ele++) cin >> a[ele];
#define ao(a, n) {for (int ele = 0; ele < (n); ele++) { if (ele) cout << " "; cout << a[ele]; } cout << '\n';}
#define aout(a, lb, rb) {for (int ele = (lb); ele <= (rb); ele++) { if (ele > (lb)) cout << " "; cout << a[ele]; } cout << '\n';}
#define vsz(x) ((long long) x.size())
typedef long long int ll;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v);
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) {
cin >> p.first;
return cin >> p.second;
}
mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
// mt19937 rng(61378913);
/* usage - just do rng() */
void usaco(string filename) {
// #pragma message("be careful, freopen may be wrong")
freopen((filename + ".in").c_str(), "r", stdin);
freopen((filename + ".out").c_str(), "w", stdout);
}
const lld pi = 3.14159265358979323846;
// const ll mod = 1000000007;
// const ll mod = 998244353;
// ll mod;
ll n, m, k, q, l, r, x, y, z;
const ll template_array_size = 1e6 + 585;
ll a[template_array_size];
ll b[template_array_size];
ll c[template_array_size];
string s, t;
ll ans = 0;
void solve() {
int n,k;
cin >> n >> k;
vl xs(n),ys(n);
f0r(i,n) {
cin >> xs[i] >> ys[i];
}
int ans = -1;
f0r(i,n) {
ll mx = 0;
f0r(j,n) {
mx = max(mx,abs(xs[i]-xs[j])+abs(ys[i]-ys[j]));
}
if(mx <= k) ans = 1;
}
cout << ans << '\n';
}
int main() {
send help
int tc = 1;
cin >> tc;
while(tc--) solve();
}
| 8 | CPP |
#include<bits/stdc++.h>
using namespace std;
#define inf 1999999999999999999
#define mod 1000000007
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define bn binary_search
#define pq priority_queue
#define int long long
#define pii pair<int,int>
#define mii map<int,int>
#define umii unordered_map<int,int>
#define um unordered_map
#define vi vector<int>
#define mii map<int,int>
#define si set<int>
#define ft first
#define sc second
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a*(b/gcd(a,b))
#define bp(a) __builtin_popcountll(a)
#define mmst(a,b) memset(a,b,sizeof(a))
#define ld long double
void lc(){cout<<endl;}
int md(int n){return n%mod;}
void solve()
{
int n;
ld k;
cin>>n>>k;
//k=k*((ld)(sqrt(2)));
pii p[n];
for(int i=0;i<n;i++)
cin>>p[i].ft>>p[i].sc;
for(int i=0;i<n;i++)
{
int mind=0;
for(int j=0;j<n;j++)
{
if(i==j)continue;
int dis=abs(p[i].ft-p[j].ft)+abs(p[i].sc-p[j].sc);
mind=max(mind,dis);
}
if(mind<=k)
{
cout<<"1";
return;
}
}
cout<<"-1";
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
cin>>t;
while(t--)
{
solve();
lc();
}
} | 8 | CPP |
for _ in range(0, int(input())):
n, k = map(int, input().split())
p = [tuple(map(int, input().split())) for i in range(0, n)]
if any([all([(abs(p[i][0] - p[j][0]) + abs(p[i][1] - p[j][1]) <= k) for j in range(0, n)]) for i in range(0, n)]):
print(1)
else:
print(-1) | 8 | PYTHON3 |
for _ in range(int(input())):
n, k = list(map(int, input().split()))
a = []
s = 0
for i in range(n):
a.append(list(map(int, input().split())))
for x in a:
for y in a:
if (abs(x[0] - y[0]) + abs(x[1] - y[1])) > k:
s += 1
break
if s < n:
print(1)
else:
print(-1)
| 8 | PYTHON3 |
// I solemnly swear that I am upto no good //
#include <bits/stdc++.h>
#define sub freopen("input.txt", "r", stdin);//freopen("output.txt", "w", stdout);
using namespace std;
#define ll long long
#define time cerr << '\n'<<"Time (in s): " << double(clock() - clk) * 1.0 / CLOCKS_PER_SEC << '\n';
#define pb push_back
#define endl "\n"
#define input(arr,n) for(ll i1=0;i1<n;i1++ )cin>>arr[i1]
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define all(x) x.begin(),x.end()
#define mp make_pair
#define ff first
#define ss second
#define NN cout<<"NO"<<endl
#define YY cout<<"YES"<<endl
#define ub upper_bound
#define lb lower_bound
#define A 1000001
#define make(a,b,c) make_pair(a,make_pair(b,c))
bool comp(ll a,ll b){
return a>b;
}
void solve(){
ll n,q,k;
// string s;
cin>>n>>k;
// n=s.size();
std::vector<pair<int,int> > ar(n);
for(int i=0;i<n;i++){
ll a,b;
cin>>a>>b;
ar[i]=mp(a,b);
}
for(int i=0;i<n;i++){
ll cnt=0;
for(int j=0;j<n;j++){
ll p=abs(ar[i].ff-ar[j].ff)+abs(ar[i].ss-ar[j].ss);
if(p<=k){
cnt++;
}
}
if(cnt==n){
cout<<1<<endl;
return;
}
}
cout<<-1<<endl;
}
int main(){
// sub;
fast;
// pre();
// clock_t clk = clock();
int t=1;
cin>>t;
while(t--){
solve();
}
// time;
return 0;
}
// Mischief Managed //
| 8 | CPP |
import sys
input = sys.stdin.readline
def gcd(a, b):
if a == 0:
return b
return gcd(b % a, a)
def lcm(a, b):
return (a * b) / gcd(a, b)
def main():
for _ in range(int(input())):
#n=int(input())
# a=list(map(int, input().split()))
n,k=map(int, input().split())
xy=[]
for i in range(n):
xy.append(list(map(int, input().split())))
f=0
for i in range(n):
currx=xy[i][0]
curry=xy[i][1]
f=1
for j in range(n):
if abs(xy[j][0]-currx)+abs(xy[j][1]-curry)>k:
f=0
break
if f:
break
if f:
print(1)
else:
print(-1)
return
if __name__=="__main__":
main()
| 8 | PYTHON3 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define M1 1000007
#define for0(i, n) for (ll i = 0; i < (ll)(n); i++) // 0 based indexing
#define for1(i, n) for (ll i = 1; i <= (ll)(n); i++) // 1 based indexing
#define forc(i, l, r) for (ll i = (ll)(l); i <= (ll)(r); i++) // closed llerver from l to r r inclusive
#define forr0(i, n) for (ll i = (ll)(n) - 1; i >= 0; i--) // reverse 0 based.
#define forr1(i, n) for (ll i = (ll)(n); i >= 1; i--) // reverse 1 based
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef double ld;
vector<bool> isthisprime(M1,true);
bool inc(vi vec){ // tells if an array is NOn-decreasing or NOt in O(n) time complexity.
forc(i,0,vec.size()-1){
if(vec[i]<vec[i-1])return 0;
}
return 1;
}
bool dec(vi vec){
forc(i,0,vec.size()-1){
if(vec[i]>vec[i-1])return 0;
}
return 1;
}
bool isprime(ll n){ // miller rabin(deterministic version) with time complexity of O(log n).
if(n<2)
return false;
for(ll x:{2,3,5,7,11,13,17,19,23,29,31,37}){
if(n==x)
return true;
bool flag=true;
ll r=1;
ll t=1;
while(r<=((n-1)>>__builtin_ctzll(n-1))){
if(r&((n-1)>>__builtin_ctzll(n-1)))
t=((ll)t*x)%n;
x=((ll)x*x)%n;
r<<=1;
}
if(t==1||t==n-1)
flag=false;
for(r=0;r<__builtin_ctzll(n-1);r++){
t=((ll)t*t)%n;
if(t==n-1)
flag=false;
}
if(flag)
return false;
}
return true;
}
ll binpow(ll a, ll b) { // Time complexity-->log(n)
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
ll addmod(ll a,ll b){
return (a%M1 + b%M1)%M1;
}
//-----------------------------------------------------------END------------------------------------------------------------------------------//
void solve(){
int n,k;cin>>n>>k;
vii a(n);
for0(i,n)cin>>a[i].first>>a[i].second;
ll ans=-1,mx;
for0(i,n){
mx = 0;
for0(j,n){
mx = max(mx,(abs(a[i].first - a[j].first)+abs(a[j].second-a[i].second)));
}
if(mx<=k)ans=1;
}
cout<<ans<<'\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout.precision(10);
//cout << fixed;
/*isthisprime[0]=false;
isthisprime[1]=false;
forc(i,2,M1){
if(isthisprime[i]){
for(ll j=i*2;j<=M1;j+=i){
isthisprime[j]=false;
}
}
}*/
ll tt;cin>>tt;
while(tt--){
solve();
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ld = long double;
using ll = long long;
const ll mod = 1000000007;
#define fo(i,a,b) for(ll i=a;i<b;i++)
#define T ll t; cin>>t; fo(i,0,t)
#define printclock cerr<<"Time : "<<1000*(ld)clock()/(ld)CLOCKS_PER_SEC<<"ms\n";
/*vector<pair<ll, ll> > A; //sorting map in asc order by val //use A.begin() after the sort work as map
bool cmp(pair<ll, ll>& a, //if using multiple time dont forget to use A.clear();
pair<ll, ll>& b)
{
return a.second < b.second;
}
void sort(map<ll, ll>& M) //sort(ma);
{
for (auto& it : M) {
A.push_back(it);
}
sort(A.begin(), A.end(), cmp);
}
ll gcd(ll a,ll b){ //b>a
if(a==0)
return b;
gcd(b%a,a);
}
ll isprime(ll n){
if(n==2)
return 1;
if(n<=1)
return 0;
for(ll i=2;i<=sqrt(n);i++){
if(n%i==0)
return 0;
}
return 1;
}
ll fac(ll n){
if(n==0)
return 1;
if(n==1)
return 1;
ll i=n,fact=1;
while(n/i!=n){
fact=fact*i;
i--;
}
return fact%mod;
}*/
string dectobin(ll n){
string str=bitset<32>(n).to_string(); //string length 32
//const auto loc=str.find('1');//index of first '1' starting from 0
//if(loc!=string::npos)
// return str.substr(loc);
return str;
// return "0";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
T{
ll n,k; cin>>n>>k;
ll x[n],y[n];
fo(i,0,n){
cin>>x[i]>>y[i];
}
ll r=-1;
ll c;
fo(i,0,n){
fo(j,0,n){ if(i==j)
continue;
if((abs(x[i]-x[j])+abs(y[i]-y[j]))<=k){
//r=1; break;
c=1;
}
else{
c=-1; break;
}
}
if(c==1)
break;
}
if(c==1)
cout<<1;
else
cout<<r;
cout<<'\n';
}
printclock;
return 0;
}
| 8 | CPP |
for _ in range(int(input())):
n,k = list(map(int,input().split()))
l = []
for i in range(n):
l.append(list(map(int,input().split())))
mans = -1
for i in range(n):
ans = 1
for j in range(n):
if i != j and abs(l[i][0] - l[j][0]) + abs(l[i][1] - l[j][1]) > k:
ans -= 1
break
if ans == 1:
print(1)
mans = 1
break
if mans == -1:
print(-1) | 8 | PYTHON3 |
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
arr = []
for i in range(n):
x, y = map(int, input().split())
arr += [[x, y]]
flag = -1
for i in range(n):
count = 0
for j in range(n):
# print(arr[i], arr[j], count)
if abs(arr[i][0]-arr[j][0]) + abs(arr[i][1]-arr[j][1]) <= k:
count += 1
if count == n:
flag = 1
break
print(flag) | 8 | PYTHON3 |
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
A = [() for i in range(n)]
for i in range(n):
A[i] = tuple(list(map(int, input().split())))
for i in range(n):
for j in range(n):
if abs(A[i][0] - A[j][0]) + abs(A[i][1] - A[j][1]) > k:
break
else:
print(1)
break
else:
print(-1)
| 8 | PYTHON3 |
import bisect
import collections
import copy
import functools
import heapq
import itertools
import math
import random
import re
import sys
import time
import string
from typing import List
sys.setrecursionlimit(99999)
t, = map(int,input().split())
for _ in range(t):
n,k = map(int,input().split())
ps = []
for i in range(n):
x,y = map(int,input().split())
ps.append([x,y])
d = [0]*n
for a in range(n):
for i in range(a+1,n):
if abs(ps[i][0]-ps[a][0]) +abs(ps[i][1]-ps[a][1])<=k:
d[a]+=1
d[i]+=1
if n-1 in d:
print(1)
else:
print(-1)
| 8 | PYTHON3 |
#include <iostream>
using namespace std;
int main(){
int cases;
cin>>cases;
while(cases--){
int n,k;
cin>>n>>k;
int arr[n][2];
for(int i = 0 ; i < n ; i++){
cin>>arr[i][0]>>arr[i][1];
}
int check = 0;
for(int i = 0 ; i < n ; i++){
check = 0;
for(int j = 0 ; j < n ; j++){
if(abs(arr[i][0] - arr[j][0]) + abs(arr[i][1] - arr[j][1]) <= k)
check++;
}
if(check == n){
break;
}
else{
check = 0;
}
}
if(check)
cout<<"1"<<endl;
else
cout<<"-1"<<endl;
}
return 0;
} | 8 | CPP |
t=int(input())
for i in range(t):
n,m=map(int,input().split())
a=[]
for j in range(n):
a.append(list(map(int,input().split())))
c=0
for j in range(n):
p=0
for k in range(n):
if(abs(a[j][0]-a[k][0])+abs(a[j][1]-a[k][1])<=m):
p+=1
if(p==n):
c=1
if(c==1):
print("1")
else:
print("-1")
| 8 | PYTHON3 |
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
import threading
from bisect import bisect_right
from math import gcd,log
from collections import Counter
from pprint import pprint
from itertools import permutations
def main():
n,k=map(int,input().split())
# arr=list(map(input().split()))
ptr=[]
for i in range(n):
ptr.append(tuple(map(int,input().split())))
for i in range(n):
ok=True
for j in range(n):
if (abs(ptr[i][0]-ptr[j][0])+abs(ptr[i][1]-ptr[j][1])>k):
ok=False
if (ok):
print(1)
return
print(-1)
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
if __name__ == "__main__":
for _ in range(int(input())):
main()
| 8 | PYTHON3 |
from collections import deque
import sys
def input():
return sys.stdin.readline().rstrip()
INF = 1 << 40
def solve():
n, k = map(int, input().split())
point = [tuple(map(int, input().split())) for i in range(n)]
for i in range(n):
px, py = point[i]
if all(abs(px - x) + abs(py - y) <= k for (x, y) in point):
print(1)
return
print(-1)
return
def main():
t = 1
t = int(input())
for i in range(t):
solve()
return
if __name__ == "__main__":
main()
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define PB push_back
#define PF push_front
#define MK make_pair
#define MT make_tuple
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define MOD 1000000007
#define DEB(x) cout << #x << "=" << x << endl
#define DEB2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int T = 1, n, k;
cin >> T;
while (T--) {
cin >> n >> k;
int X[n], Y[n];
REP(i, 0, n - 1) { cin >> X[i] >> Y[i]; }
bool anypos = false;
REP(i, 0, n - 1) {
bool ispos = true;
REP(j, 0, n - 1) {
if (abs(X[i] - X[j]) + abs(Y[i] - Y[j]) > k) {
ispos = false;
break;
}
}
if (ispos) {
cout << 1 << endl;
anypos = true;
break;
}
}
if (!anypos)
cout << -1 << endl;
}
return 0;
}
| 8 | CPP |
t = int(input())
while (t):
n,k = list(map(int,input().split()))
a = []
for i in range(n):
x,y = list(map(int,input().split()))
a.append((x,y))
flag = False
for i in range(n):
tmp = set([(1 if abs(a[j][0]-a[i][0])+abs(a[j][1]-a[i][1]) <= k else 0) for j in range(n)])
if (0 not in tmp):
flag = True
break
if (flag):
print(1)
else:
print(-1)
t -= 1 | 8 | PYTHON3 |
# cook your dish here
for _ in range(int(input())):
n,k=map(int,input().split())
y=0
c,d=[],[]
for i in range(n):
a,b=map(int,input().split())
c.append(a)
d.append(b)
for i in range(n):
x=0
for j in range(n):
if abs(c[i]-c[j])+abs(d[i]-d[j])<=k:
x=x+1
if x>y:
y=x
if y==n:
print(1)
else:
print(-1)
| 8 | PYTHON3 |
import sys
t = int(sys.stdin.readline())
for _ in range(t):
n, k = map(int, sys.stdin.readline().split())
points = []
for _ in range(n):
points.append(list(map(int, sys.stdin.readline().split())))
found = False
for point1 in points:
good = True
for point2 in points:
dist = abs(point1[0] - point2[0]) + abs(point1[1] - point2[1])
if dist > k:
good = False
break
if good:
found = True
break
print(1 if found else -1) | 8 | PYTHON3 |
for i in range(int(input())):
n,k=map(int,input().split())
l=[]
for i in range(n):
x,y=map(int,input().split())
l.append([x,y])
c=0
q=0
for i in range(n):
c=0
for j in range(n):
if abs(l[i][0]-l[j][0])+abs(l[i][1]-l[j][1])<=k:
c+=1
else:
break
if c==n:
q+=1
print(1)
break
if q==0:
print(-1) | 8 | PYTHON3 |
#include <bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define MAXN 200005
#define REP(temp, init_val, end_val) for (int temp = init_val; temp <= end_val; ++temp)
#define REPR(temp, init_val, end_val) for (int temp = init_val; temp >= end_val; --temp)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> intpair;
int read(){
int f = 1, x = 0;
char c = getchar();
while (c < '0' || c > '9'){if(c == '-') f = -f; c = getchar();}
while (c >= '0' && c <= '9')x = x * 10 + c - '0', c = getchar();
return f * x;
}
inline int lowbit(int x){
return x & (-x);
}
inline int modadd(int x, int y){
return (x + y >= MOD ? x + y - MOD: x + y);
}
inline int sgn(int x){
return (x < 0 ? -1: (x > 0 ? 1: 0));
}
template<typename T>
T gcd(T a, T b){
return (!b) ? a: gcd(b, a % b);
}
int poww(int a, int b){
int res = 1;
while (b > 0){
if (b & 1) res = 1ll * res * a % MOD;
a = 1ll * a * a % MOD, b >>= 1;
}
return res;
}
const int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
const int ddx[] = {-1, -1, -1, 0, 0, 1, 1, 1}, ddy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
/*--------------------------------------------------------------------*/
/*--------------------------------------------------------------------*/
int n, k, x[105], y[105];
void init(){
n = read(), k = read();
REP(i, 1 , n) x[i] = read(), y[i] = read();
}
void solve(){
REP(i, 1, n){
bool flag = true;
REP(j, 1 ,n){
if (abs(x[i] - x[j]) + abs(y[i] - y[j]) > k){flag = false;break;
}
}
if(flag){printf("1\n"); return ;}
}
printf("-1\n");
}
int main(){
int T = read();
while (T--){
init();
solve();
}
return 0;
} | 8 | CPP |
import sys
# def BFS(pathMap):
# q = {0}
# visited = [False for i in range(len(pathMap))]
# while True:
# if not q:
# break
# node = q.pop()
# visited[node] = True
# childs = {i for i in range(len(pathMap)) if not visited[i] and pathMap[node][i]}
# q.update(childs)
# return all(visited)
T = int(input())
for t in range(T):
n, k = list(map(int, sys.stdin.readline().split()))
points = []
pathMap = [[False for i in range(n)] for j in range(n)]
for p in range(n):
x, y = list(map(int, sys.stdin.readline().split()))
points.append((x, y))
for i in range(n):
ok = True
pathMap[i][i] = True
for j in range(i+1, n):
if abs(points[i][0] - points[j][0]) + abs(points[i][1] - points[j][1]) <= k:
pathMap[i][j] = True
pathMap[j][i] = True
if not any(pathMap[i]):
ok = False
break
# for i in range(n):
# print(pathMap[i])
if not ok:
print(-1)
else:
ok = False
for i in range(n):
if all(pathMap[i]):
ok = True
break
print('{}'.format(1 if ok else -1)) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t,n,k,i,j,flag,x;
cin>>t;
while(t--)
{
flag=1;
cin>>n>>k;
pair<int,int> a[n];
for(i=0;i<n;i++)
{
cin>>a[i].first>>a[i].second;
}
x=-1;
for(i=0;i<n;i++)
{
flag=1;
for(j=0;j<n;j++)
{
if((abs(a[i].first - a[j].first) + abs(a[i].second - a[j].second))>k)
{flag=-1;
break;
}
}
if(flag==1)
{x=0;
break;
}
}
(x==0)?cout<<1<<endl:cout<<-1<<endl;
}
} | 8 | CPP |
for i in range(int(input())):
n,k=map(int,input().split())
l=[]
t=-1
for i in range(n):
x,y=map(int,input().split())
l.append([x,y])
for i in l:
q=0
for j in l:
if abs(i[1]-j[1])+abs(i[0]-j[0])<=k:q+=1
else:break
if q==n:t=1
print(t) | 8 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
int x[110];
int y[110];
int main(){
int t;
scanf("%d",&t);
while(t--){
int n,k;
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++){
scanf("%d%d",&x[i],&y[i]);
}
int f=0;
for(int i=1;i<=n;i++){
int c=1;
for(int j=1;j<=n;j++){
if(i==j) continue ;
if(abs(x[i]-x[j])+abs(y[i]-y[j])<=k) c++;
}
if(c==n) {
f=1;break;
}
}
if(f) printf("1\n");
else printf("-1\n");
}
} | 8 | CPP |
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <cstdio>
#include <string>
#include <cmath>
#include <queue>
#include <tuple>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <random>
#include <set>
#include <stack>
#include <time.h>
#include <unordered_map>
//#include <bits/stdc++.h>
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define FOR(i,i0,n) for(int (i)=(i0);(i)<(n);(i)++)
#define FORR(i,i0,n) for(int (i)=(n)-1; (i)>=(i0);(i)--)
#define SORT(x) sort(x.begin(),x.end())
#define SORTR(x) sort(x.begin(),x.end(),greater<int>())
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
using namespace std;
using ll = long long;
typedef std::pair<int, int> pii;
typedef std::pair<int, double> pid;
typedef std::vector<int> vi;
typedef std::vector<pii> vii;
const double PI = 3.14159265358979323846264338327950L;
const int mod = 1000000007;
const int INF = 1001001001;
struct container{
int bottom, top, id;
container(int id, int bottom, int top): top(top), bottom(bottom),id(id){
}
};
struct Data {
int ind;
ll time;
Data(int ind,ll time): ind(ind),time(time){}
bool operator<(const Data& a) const {
return time > a.time;
}
};
void solve(){
int n,k;
cin >> n >> k;
vector<vector<int>> p;
rep(i,n){
int x,y;
cin >> x >> y;
p.pb({x,y});
}
rep(i,n){
int ok = 1;
rep(j,n){
if (abs(p[i][0]-p[j][0]) + abs(p[i][1]-p[j][1]) > k){
ok = 0;
}
}
if (ok==0) continue;
cout << 1;
return;
}
cout << -1;
}
int main() {
int T = 1;
cin >> T;
while (T--){
solve();
cout << endl;
}
}
| 8 | CPP |
'''Author- Akshit Monga'''
from sys import stdin,stdout
input=stdin.readline
t=int(input())
for _ in range(t):
n,k=map(int,input().split())
arr=[]
ans=-1
for i in range(n):
x,y=map(int,input().split())
arr.append((x,y))
for i in arr:
val=0
for j in arr:
if abs(i[0]-j[0])+abs(i[1]-j[1])<=k:
val+=1
if val==n:
ans=1
break
print(ans)
| 8 | PYTHON3 |
#include<bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<ll>
#define pb push_back
#define fi(i,a,b) for(int i = (int)a; i<int(b); ++i)
#define itr(it,v) for(auto it = v.begin(); it != v.end(); ++it)
#define MAX 10000000
#define IOS ios_base::sync_with_stdio(false);
#define MOD 1000000000+7
using namespace std;
int dist(int a, int b, int c, int d){
int dis = abs(a-c)+abs(b-d);
return dis;
}
bool solve(int n, int k){
int a[n][2];
fi(i,0,n){
cin >> a[i][0] >> a[i][1];
}
bool pos = true;
fi(i,0,n){
pos = true;
fi(j,0,n){
if(dist(a[j][0], a[j][1], a[i][0], a[i][1]) > k){
pos = false;
break;
}
}
if(pos){
return true;
}
}
return false;
}
int main ()
{
IOS;
int t; cin >> t;
//char ch; cin >> ch;
while(t--){
int n,k; cin >> n >> k;
if(solve(n, k)){
cout << "1\n";
}
else{
cout << "-1\n";
}
}
return 0;
}
| 8 | CPP |
#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5+200;
struct node{
int x,y;
}p[maxn];
int main()
{
int T;cin>>T;
while(T--){
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>p[i].x>>p[i].y;
}
int flag=0;
for(int i=1;i<=n;i++){
int dis = 0;
for(int j=1;j<=n;j++){
dis = max(abs(p[i].x-p[j].x)+abs(p[i].y-p[j].y),dis);
}
if(dis<=k){flag=1;cout<<1<<endl;break;}
}
if(!flag)cout<<-1<<endl;
}
return 0;
}
| 8 | CPP |
t=int(input())
for j in range(0,t):
n,k=map(int,input().split())
x=[]
y=[]
for i in range(0,n):
a,b=0,0
a,b=map(int,input().split())
x.append(a)
y.append(b)
fl=0
for i in range(0,n):
fl=-1
for g in range(0,n):
if(abs(x[i]-x[g])+abs(y[i]-y[g])<=k):
fl=0
else:
fl=-1
break
if(fl==0):
break
if(fl==-1):
print(-1)
else:
print(1)
| 8 | PYTHON3 |
#include<bits/stdc++.h>
#include<cmath>
#include<string>
using namespace std;
#define L long long int
int check1(L x1,L y1,L x2,L y2,L k){
L a,b;
a= (x2 -x1);
b = (y2-y1);
if(a<0){
a = -1*a;
}
if(b<0){
b= -1*b;
}
L c;
c =a+b;
if(c <= k){
return 1;
}
else{
return 0;
}
}
int main(){
L t;
cin >>t;
for (size_t j = 0; j < t; j++) {
L n,p;
cin >>n>>p;
L check=0;
std::vector<L> x(n);
std::vector<L> y(n);
for (size_t i = 0; i < n; i++) {
cin >> x[i] >> y[i];
}
L try1;
for (size_t i = 0; i < n; i++) {
try1 = 0;
for (size_t k = 0; k < n; k++) {
if(check1(x[i],y[i],x[k],y[k],p)){
try1 ++;
}
else{
break;
}
}
if( try1 == n){
cout << "1" << endl;
check =1;
break;
}
}
if(check == 0){
std::cout << "-1" << '\n';
}
}
return 0;
}
| 8 | CPP |
def dis(x1,y1,x2,y2):
ans = abs(x1-x2) + abs(y1-y2)
return ans
for _ in range(int(input())):
n,k = map(int,input().split(' '))
arr = []
for _ in range(n):
x,y = map(int,input().split(' '))
arr.append([x,y])
d = []
v = []
ans = -1
for i in range(n):
d = []
for j in range(n):
p = dis(arr[i][0],arr[i][1],arr[j][0],arr[j][1])
d.append(p)
c = 0
for item in d:
if item<=k:
c = c + 1
if c==n:
ans = 1
break
print(ans)
| 8 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb push_back
#define int long long int
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#define mod 1000000007
#define MOD 998244353
#define inf 1000000000000000001;
#define all(c) c.begin(),c.end()
#define deb(x) cout<< ">" << #x << '=' << x << endl;
#define read(v) for(auto &it:v) cin>>it;
const int N = 2e5 + 5;
void solve() {
int n, k;
cin >> n >> k;
vector <pair<int, int>> v;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
v.pb({a, b});
}
bool flag = false;
for (int i = 0; i < v.size(); i++) {
int x = v[i].first, y = v[i].second;
bool f = true;
for (int j = 0; j < v.size(); j++) {
if (abs(v[j].first - x) + abs(v[j].second - y) > k) {
f = false;
break;
}
}
if (f) {
flag = true;
break;
}
}
if (flag) {
cout << 1 << endl;
}
else {
cout << -1 << endl;
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int t = 1;
cin >> t;
while (t--) solve();
return 0;
} | 8 | CPP |
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define sz(a) signed(a.size())
#define all(v) v.begin(),v.end()
#define rall(v) (v.rbegin(),v.rend())
#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())
#define rep(i,n) for(int i(0);i<n;++i)
#define trav(x, v) for (auto &x : v)
#define OK(ok) cout << (ok ? "YES\n" : "NO\n")
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
template <class T> T sqr(T x) { return x * x; }
template <class T> T abs(T x) { return x < 0? -x : x; }
template <class T> T gcd(T a, T b) { return b? gcd(b, a % b) : a; }
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
const int MOD=1000000007;
const int PRM=998244353;
void solve(){
int n,k,u,v,id=-1;
cin >> n >> k;
vector<int> x(n),y(n);
rep(i,n){
cin >> x[i] >> y[i];
}
for(int i(0);i<n;++i){
bool chk=1;
for(int j(0);j<n;++j){
if(j!=i){
if(abs(x[i]-x[j])+abs(y[i]-y[j]) > k){
chk=0;break;
}
}
}
if(chk){
id=i;break;
}
}
if(id!=-1){
cout << 1 << endl;
}
else{
cout << -1 << endl;
}
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
#ifdef HOME
assert(freopen("input.txt", "r", stdin));
assert(freopen("output.txt", "w", stdout));
#endif
int t;
cin >> t;
while(t--){
solve();
}
cerr << "Time execute: " << clock() / (double)CLOCKS_PER_SEC << " sec" << endl;
} | 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--)
{
long long int n, k;
cin >> n >> k;
int flag = 0;
long long int a[n][2];
for (int i = 0; i < n; i++)
{
for (int j = 0; j < 2; j++)
cin >> a[i][j];
}
for (int i = 0; i < n; i++)
{
int r = 0;
for (int j = 0; j < n; j++)
{
if (abs(a[i][0] - a[j][0]) + abs(a[i][1] - a[j][1]) > k)
{
break;
}
r++;
}
if (r == n)
{
flag = 1;
cout << 1 << endl;
break;
}
}
if (flag == 0)
{
cout << -1 << endl;
}
}
} | 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long t,n,k,x,y;
string s;
cin>>t;
while(t--)
{
int n,c=0;
cin>>n;
int k;
cin>>k;
vector<pair<int,int>>v(n);
for(int i=0;i<n;i++)
cin>>v[i].first>>v[i].second;
for(int i=0;i<n;i++){
int total=0;
for(int j=0;j<n;j++){
if(abs(v[i].first-v[j].first)+abs(v[i].second-v[j].second)<=k)
total++;
}
if(total==n){
c++;
cout<<1<<"\n";
break;
}
}
if(c==0)
cout<<-1<<"\n";
}
} | 8 | CPP |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(n) for(int i=0;i<n;i++)
#define rrep(n) for(int i=n-1;i>=0;i--)
#define mod 1000000007
typedef vector<int> vi;
typedef pair<int, int> pi;
#define F first
#define S second
#define PB push_back
void solve()
{
ll n,k;
cin>>n>>k;
vector<pair<int,int>>v;
rep(n){
int x,y;
cin>>x>>y;
v.push_back({x,y});
}
for(int i=0;i<n;i++)
{
bool ok=true;
for(int j=0;j<n;j++)
{
if(abs(v[i].first-v[j].first)+abs(v[i].second-v[j].second)>k)
{
ok=false;break;
}
}
if(ok)
{
cout<<1;return;
}
}
cout<<-1;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t=1;
cin>>t;
while(t--)
{
solve();
cout<<"\n";
}
return 0;
} | 8 | CPP |
/*
ALLAH IS ALMIGHTY ******BISMILLAHIR RAHMANIR RAHIM.****** ALLAH IS ALMIGHTY
```````````````````````````````
AUTHOR: ANISUR RAHAMAN
BSMRSTU(SHIICT)
ID:017
............LET's START OUR JOURNEY.............
*/
#include<bits/stdc++.h>
#define I_O ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
#define lls int64_t
#define ld long double
#define db double
#define ull unsigned long long int
//~~~~~~~~~~~~~~Pair~~~~~~~~~~~~~~~~~~//
#define pi pair<int,int>
#define pl pair<ll,ll>
#define pd pair<db,db>
#define psi pair<string,int>
#define vi vector<int>
#define vl vector<ll>
#define vd vector<db>
#define vb vector<bool>
#define vpi vector<pi>
#define vpl vector<pl>
#define vpd vector<pd>
#define vpsi vector<psi>
//~~~~~~~~~~~~~~Vector~~~~~~~~~~~~~~~~~//
#define pb push_back
#define pf push_front
#define MP make_pair
#define in insert
#define ff first
#define ss second
#define al(v) v.begin(),v.end()
#define alr(v) v.rbegin(), v.rend()
#define min(a, b) (((a) <= (b)) ? (a) : (b))
#define max(a, b) (((a) >= (b)) ? (a) : (b))
#define srt(v) sort(al(v))
#define sz(x) ((ll)(x).size())
#define rev(v) reverse(al(v))
#define acl(v, n) accumulate(al(v), n)
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define tpu(str) transform(al(str), str.begin(), ::toupper)
#define tpl(str) transform(al(str), str.begin(), ::tolower)
#define mxv(v) *max_element(al(v))
#define mnv(v) *min_element(al(v))
const int MOD = 1e9 + 7;
const ll INF = 2e18;
const int mxn = 2e9 + 9;
const int mxd = 2e5 + 5;
//~~~~~~~~~~~~~~~Loops and Short~~~~~~~~~~~~~~~~//
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define PI acos(-1)
#define C continue
#define B break
#define off return 0
#define N '\n'
#define rep(i, n) for(lls i = 0; i < n; i++)
#define repn(i, a, b) for(lls i = (lls)(a); i < (lls)(b); i++)
#define repr(i, a, b) for(lls i = (lls)(a) - 1; i >= (lls)(b); i--)
#define test_case() int T; cin >> T; while(T--)
using namespace std;
void SoLuTioN()
{
int n, k;
cin >> n >> k;
vi v(n), va(n);
rep(i, n) cin >> v[i] >> va[i];
rep(i, n){
int f = 0;
rep(j, n){
if(abs(v[i] - v[j]) + abs(va[i] - va[j]) > k){
f = 1;B;
}
}
if(f == 0){
cout << "1" << N;
return;
}
}
cout << "-1" << N;
}
int main()
{
I_O
test_case()
{
SoLuTioN();
}
off;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(){
int n,k;
cin>>n>>k;
pair<ll,ll> arr[n];
for(int i{};i<n;i++){
cin>>arr[i].first>>arr[i].second;
}
bool tr=false;
for(int i{};i<n;i++){
int tmp{};
for(int j{};j<n;j++){
if((abs(arr[i].first-arr[j].first)+abs(arr[i].second-arr[j].second)) <=k)
tmp++;
}
if(tmp==n){
tr=true;
break;
}
}
if(tr && k!=0)cout<<1;
else cout<<-1;
}
int main(){
int tt;
cin>>tt;
while(tt--){
solve();
cout<<"\n";
}
}
| 8 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.