| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 890283 | LucaIlie | Road Construction (JOI21_road_construction) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
using namespace std;
struct point {
int x, y;
};
const int MAX_N = 2.5e5;
const int MAX_X = 1e9;
const int INF = 2e9 + 1;
point v[MAX_N];
struct AIB {
vector<int> pos;
vector<int> aib;
void init() {
pos.clear();
aib.clear();
}
void add( int i ) {
pos.push_back( i );
}
void prep() {
pos.push_back( -INF );
sort( pos.begin(), pos.end() );
pos.resize( unique( pos.begin(), pos.end() ) - pos.begin() );
for ( int i = 0; i < pos.size(); i++ )
aib.push_back( 0 );
}
void clear() {
for ( int i = 0; i < aib.size(); i++ )
aib[i] = 0;
}
void update( int i, int x ) {
int l = 0, r = pos.size();
while ( r - l > 1 ) {
int p = (l + r) / 2;
if ( pos[p] > i )
r = p;
else
l = p;
}
if ( pos[l] != i )
exit( 1 );
i = l;
while ( i < aib.size() ) {
aib[i] += x;
i += (i & -i);
}
}
int query( int i ) {
int l = 0, r = pos.size();
while ( r - l > 1 ) {
int p = (l + r) / 2;
if ( pos[p] > i )
r = p;
else
l = p;
}
i = l;
int s = 0;
while ( i > 0 ) {
s += aib[i];
i -= (i & -i);
}
return s;
}
};
struct AIB2D {
vector<int> pos;
vector<AIB> aib;
vector<point> pts;
AIB emptyAIB;
void init() {
pos.clear();
aib.clear();
}
void add( int i, int j ) {
pts.push_back( { i, j } );
pos.push_back( i );
emptyAIB.init();
}
void prep() {
pos.push_back( -INF );
sort( pos.begin(), pos.end() );
pos.resize( unique( pos.begin(), pos.end() ) - pos.begin() );
for ( int i = 0; i < pos.size(); i++ )
aib.push_back( emptyAIB );
for ( point q: pts ) {
int l = 0, r = pos.size();
while ( r - l > 1 ) {
int p = (l + r) / 2;
if ( pos[p] > q.x )
r = p;
else
l = p;
}
int i = l;
while ( i < aib.size() ) {
aib[i].add( q.y );
i += (i & -i);
}
}
for ( int i = 0; i < pos.size(); i++ )
aib[i].prep();
}
void clear() {
for ( int i = 0; i < aib.size(); i++ )
aib[i].clear();
}
void update( int i, int j, int x ) {
int l = 0, r = pos.size();
while ( r - l > 1 ) {
int p = (l + r) / 2;
if ( pos[p] > i )
r = p;
else
l = p;
}
i = l;
while ( i < aib.size() ) {
aib[i].update( j, x );
i += (i & -i);
}
}
int query( int i, int j ) {
int l = 0, r = pos.size();
while ( r - l > 1 ) {
int p = (l + r) / 2;
if ( pos[p] > i )
r = p;
else
l = p;
}
i = l;
int s = 0;
while ( i > 0 ) {
s += aib[i].query( j );
i -= (i & -i);
}
return s;
}
} leftPoints, rightPoints;
signed main() {
int n, k;
cin >> n >> k;
for ( int i = 0; i < n; i++ )
cin >> v[i].x >> v[i].y;
sort( v, v + n, []( point a, point b ) {
if ( a.x == b.x )
return a.y < b.y;
return a.x < b.x;
} );
leftPoints.init();
rightPoints.init();
for ( int i = 0; i < n; i++ ) {
leftPoints.add( v[i].y, -v[i].x - v[i].y );
rightPoints.add( v[i].y, -v[i].x + v[i].y );
}
leftPoints.prep();
rightPoints.prep();
int ld = 0, rd = 2 * INF;
while ( rd - ld > 1 ) {
int d = (ld + rd) / 2;
int pairs = 0;
leftPoints.clear();
rightPoints.clear();
for ( int i = 0; i < n; i++ ) {
pairs += leftPoints.query( v[i].y, d - (v[i].x + v[i].y) );
pairs += rightPoints.query( MAX_X, d - (v[i].x - v[i].y) ) - rightPoints.query( v[i].y, d - (v[i].x - v[i].y) );
leftPoints.update( v[i].y, -v[i].x - v[i].y, 1 );
rightPoints.update( v[i].y, -v[i].x + v[i].y, 1 );
}
if ( pairs < k )
ld = d;
else
rd = d;
}
int d = rd;
vector<int> sol;
while ( sol.size() < k )
sol.push_back( d );
sort( sol.begin(), sol.end() );
for( int x: sol )
cout << x << "\n";
return 0;
}