#include "bits/stdc++.h"
using namespace std;
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
using namespace __gnu_pbds;
template<class T> using oset = tree<T, null_type,
less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ar array
#define int long long
const int N = 75e4 + 5;
struct BIT{
int tree[N];
void add(int i, int v){ i++;
for(;i<N;i+=(i&-i)) tree[i] += v;
}
int get(int i){ i++;
int r = 0;
for(;i>0;i-=(i&-i)) r += tree[i];
return r;
}
int get(int l, int r) { return get(r) - get(l - 1); }
}bit;
vector<int> rr;
int a[N][2];
int Dis(int i, int j){
return abs(a[i][0] - a[j][0]) + abs(a[i][1] - a[j][1]);
}
struct ST{
set<int> tree[1 << 21];
void add(int l, int r, int i, int lx = 0, int rx = N, int x = 1){
if(lx > r || rx < l) return;
if(lx >= l && rx <= r){ tree[x].insert(i); return; }
int m = (lx + rx) >> 1;
add(l, r, i, lx, m, x<<1);
add(l, r, i, m+1, rx, x<<1|1);
}
void del(int l, int r, int i, int lx = 0, int rx = N, int x = 1){
if(lx > r || rx < l) return;
if(lx >= l && rx <= r) { tree[x].erase(i); return; }
int m = (lx + rx) >> 1;
del(l, r, i, lx, m, x<<1);
del(l, r, i, m+1, rx, x<<1|1);
}
void get(int I, int i, int lx = 0, int rx = N, int x = 1){
for(auto j : tree[x]){
if(i < j) rr.push_back(Dis(i, j));
}
if(lx == rx) return;
int m = (lx + rx) >> 1;
if(I <= m) get(I, i, lx, m, x<<1);
else get(I, i, m+1, rx, x<<1|1);
}
}T;
int n, k, p[N][2];
signed main(){
ios::sync_with_stdio(0); cin.tie(0);
cin>>n>>k;
for(int i=0;i<n;i++) cin>>a[i][0]>>a[i][1];
vector<int> q(n), ip(n), op(n);
for(int i=0;i<n;i++){
p[i][0] = a[i][0] + a[i][1];
p[i][1] = a[i][0] - a[i][1];
q[i] = ip[i] = op[i] = i;
}
int d = -1;
{
auto check = [&](int d){
vector<ar<int, 3>> in, out;
for(int i=0;i<n;i++){
in.push_back({p[i][0] - d, p[i][1] - d, p[i][1] + d});
out.push_back({p[i][0] + d, p[i][1] - d, p[i][1] + d});
//~ x.push_back({p[i][0], i << 2});
//~ x.push_back({p[i][0] - d, i << 2 | 1});
//~ x.push_back({p[i][0] + d, i << 2 | 2});
//~ y.push_back({p[i][1], i << 2});
//~ y.push_back({p[i][1] - d, i << 2 | 1});
//~ y.push_back({p[i][1] + d, i << 2 | 2});
}
//~ sort(x.begin(), x.end());
//~ sort(y.begin(), y.end());
//~ for(int i=0, last=0;i<(int)x.size();){
//~ int j = i;
//~ while(j < (int)x.size() && x[j][0] == x[i][0]){
//~ if((x[j][1]&3) == 0){
//~ p[x[j][1] >> 2][0] = last;
//~ } if((x[j][1]&3) == 1){
//~ in[x[j][1] >> 2][0] = last;
//~ } if((x[j][1]&3) == 2){
//~ out[x[j][1] >> 2][0] = last;
//~ } j++;
//~ } i = j; last++;
//~ }
//~ for(int i=0, last=0;i<(int)y.size();){
//~ int j = i;
//~ while(j < (int)y.size() && y[j][0] == y[i][0]){
//~ if((y[j][1]&3) == 0){
//~ p[y[j][1] >> 2][1] = last;
//~ } if((y[j][1]&3) == 1){
//~ in[y[j][1] >> 2][1] =
//~ out[y[j][1] >> 2][1] = last;
//~ } if((y[j][1]&3) == 2){
//~ in[y[j][1] >> 2][2] =
//~ out[y[j][1] >> 2][2] = last;
//~ } j++;
//~ } i = j, last++;
//~ }
int res = 0;
sort(in.begin(), in.end()),
sort(out.begin(), out.end());
sort(q.begin(), q.end(), [&](int i, int j) { return (p[i][0] < p[j][0]); });
int j=0, k=0;
oset<int> bit;
for(auto i : q){
while(j < n && p[i][0] >= in[j][0]){
res -= (bit.order_of_key(in[j][2] + 1) - bit.order_of_key(in[j][1]));
j++;
} while(k < n && p[i][0] > out[k][0]){
res += (bit.order_of_key(out[k][2] + 1) - bit.order_of_key(out[k][1]));
k++;
} bit.insert(p[i][1]);
}
while(j < n) res -= (bit.order_of_key(in[j][2] + 1) - bit.order_of_key(in[j][1])), j++;
while(k < n) res += (bit.order_of_key(out[k][2] + 1) - bit.order_of_key(out[k][1])), k++;
res = (res - n) >> 1;
return (res >= ::k);
};
int l = 1, r = 4e9;
while(l < r){
int m = (l + r) >> 1;
if(check(m)) r = m;
else l = m + 1;
} d = l;
}
int D = d; d--;
vector<ar<int, 2>> p(n), x, y;
vector<ar<int, 3>> in, out;
for(int i=0;i<n;i++){
in.push_back({p[i][0] - d, p[i][1] - d, p[i][1] + d});
out.push_back({p[i][0] + d, p[i][1] - d, p[i][1] + d});
x.push_back({p[i][0], i << 2});
x.push_back({p[i][0] - d, i << 2 | 1});
x.push_back({p[i][0] + d, i << 2 | 2});
y.push_back({p[i][1], i << 2});
y.push_back({p[i][1] - d, i << 2 | 1});
y.push_back({p[i][1] + d, i << 2 | 2});
}
sort(x.begin(), x.end());
sort(y.begin(), y.end());
for(int i=0, last=0;i<(int)x.size();){
int j = i;
while(j < (int)x.size() && x[j][0] == x[i][0]){
if((x[j][1]&3) == 0){
p[x[j][1] >> 2][0] = last;
} if((x[j][1]&3) == 1){
in[x[j][1] >> 2][0] = last;
} if((x[j][1]&3) == 2){
out[x[j][1] >> 2][0] = last;
} j++;
} i = j; last++;
}
for(int i=0, last=0;i<(int)y.size();){
int j = i;
while(j < (int)y.size() && y[j][0] == y[i][0]){
if((y[j][1]&3) == 0){
p[y[j][1] >> 2][1] = last;
} else {
in[y[j][1] >> 2][y[j][1]&3] =
out[y[j][1] >> 2][y[j][1]&3] = last;
} j++;
} i = j, last++;
}
sort(ip.begin(), ip.end(), [&](int i, int j) { return (in[i][0] < in[j][0]); });
sort(op.begin(), op.end(), [&](int i, int j) { return (out[i][0] < out[j][0]); });
sort(q.begin(), q.end(), [&](int i, int j) { return (p[i][0] < p[j][0]); });
int j=0, l=0;
for(auto i : q){
while(j<n && in[ip[j]][0] <= p[i][0]){
T.add(in[ip[j]][1], in[ip[j]][2], ip[j]);
j++;
} while(l<n && out[op[l]][0] < p[i][0]){
T.del(out[op[l]][1], out[op[l]][2], op[l]);
l++;
} T.get(p[i][1], i);
}
while((int)rr.size() < k) rr.push_back(D);
assert((int)rr.size() == k);
sort(rr.begin(), rr.end());
for(auto x : rr) cout<<x<<"\n";
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
146 ms |
209140 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
10059 ms |
149092 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
10066 ms |
144624 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
10066 ms |
144624 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
146 ms |
209140 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
146 ms |
209140 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
