//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;
void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, K = 30;
const int mod = 998244353;
struct Tree{
vector<int>tab;
int size = 1;
Tree(int n){
while (size < n) size*=2;
tab.assign(2*size, 0);
}
void update(int x){
x += size;
while (x){
tab[x]++;
x/=2;
}
}
int query(int l, int r){
int ans = 0;
for (l += size-1, r += size+1; r-l>1; l/=2, r/=2){
if (!(l&1)) ans += tab[l+1];
if (r&1) ans += tab[r-1];
}
return ans;
}
};
void solve(){
int n, k; cin >> n >> k;
vector<T>p(n), p2;
for (auto &[xx, yy]: p) {
int x, y; cin >> x >> y;
xx = x+y;
yy = y-x;
p2.emplace_back(x, y);
}
auto check = [&](int m){
// debug(p);
vector<tuple<int, int, int, int>>sweep;
vector<int>s;
for (auto [x, y]: p){
sweep.emplace_back(y-m, x-m, x+m, -1);
sweep.emplace_back(y+m, x-m, x+m, +1);
sweep.emplace_back(y, x, x, 0);
s.emplace_back(x-m);
s.emplace_back(x);
s.emplace_back(x+m);
}
sort(s.begin(), s.end());
s.erase(unique(s.begin(), s.end()), s.end());
int M = (int)s.size();
Tree t(M+2);
auto get = [&](int x)->int {
return lower_bound(s.begin(), s.end(), x) - s.begin();
};
sort(sweep.begin(), sweep.end());
int all = 0;
for (auto [y, l, r, what]: sweep){
// debug(y, get(l), get(r), what);
if (what == 0){
t.update(get(l));
} else {
// debug(what * t.query(get(l), get(r)));
all += what * t.query(get(l), get(r));
}
}
all -= n;
all/=2;
debug(m, all);
return (all >= k);
};
int l = 1, r = oo2 * 3;
int d = oo2 * 3;
while (r >= l){
int m = (l+r)/2;
if (check(m)){
d = m;
r = m-1;
} else l = m+1;
}
debug(d);
long double D = (long double)d/sqrtl(2);
d = ceil(D)+2;
map<T, vector<int>>cnt;
for (int i = 0; i<n; i++){
cnt[{p[i].first/d, p[i].second/d}].emplace_back(i);
}
vector<int>X = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
vector<int>Y = {-1, 0, 1, -1, 0, 1, -1, 0, 1};
vector<int>ret;
auto dist = [&](int a, int b){
if (a <= b) return;
debug(a, b);
ret.emplace_back(abs(p2[a].first - p2[b].first) + abs(p2[a].second - p2[b].second));
};
for (auto [coord, vec]: cnt){
for (auto i: vec){
for (int rep = 0; rep < 9; rep++){
T now = {coord.first + X[rep], coord.second + Y[rep]};
for (auto j: cnt[now]){
dist(i, j);
}
}
}
}
sort(ret.begin(), ret.end());
for (int i = 0; i<k; i++) cout << ret[i] << "\n";
}
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
//cin >> t;
while (t--) solve();
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
85 ms |
6572 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
8795 ms |
112600 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
10062 ms |
64648 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
10062 ms |
64648 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
85 ms |
6572 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
85 ms |
6572 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
