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 pb push_back
#define s second
#define f first
#define pb push_back
#define pii pair <int,int>
#define ll long long
#define left h*2,l,(l + r)/2
#define right h*2+1,(l + r)/2 + 1,r
#pragma GCC optimize("Ofast,unroll-loops")
// #define int ll
#define pli pair <ll,int>
#define pll pair <ll,ll>
using namespace std;
const int N = 3e5 + 3;
const ll inf = 1e18;
pli t[2][3*N];
int x[N],y[N],yy[N],n,k,L,R;
multiset <ll> st[2][3*N];
pii arr[N];
vector <ll> answ;
ll oldval,newval,w1;
int idx,v1,v2,id;
bool z,ID;
pli res;
void upd(int h,int l,int r){
if (l == r){
if (!z) st[ID][l].erase(st[ID][l].find(oldval));
st[ID][l].insert(newval);
t[ID][h] = {*--st[ID][l].end(),l};
return;
}
if (idx > (l + r)/2) upd(right);
else upd(left);
t[ID][h] = max(t[ID][h*2],t[ID][h*2 + 1]);
}
void build(int h,int l,int r){
t[1][h] = t[0][h] = {-inf,0};
if (l == r) {
st[1][l].clear();
st[0][l].clear();
return;
}
build(left);
build(right);
}
pli get(int h,int l,int r){
if (r < L || R < l) return {-inf,0};
if (L <= l && r <= R) return t[ID][h];
return max(get(left),get(right));
}
int count(ll w,bool zz){
build(1,1,n);
int tot = 0,i,j;
for (i = 1; i <= n; i++){
if (tot > k) return tot;
vector <pair <pii,pll> > roll;
id = arr[i].s; v1 = x[id] + y[id];
while (tot <= k){
L = 1; R = yy[id]; ID = 0;
res = get(1,1,n);
w1 = v1 - res.f;
if (w1 > w) break;
if (zz) answ.pb(w1);
tot += 1;
if (tot > k) return tot;
roll.pb({{0,res.s},{res.f,-inf}});
idx = res.s; oldval = res.f; newval = -inf;
z = 0; ID = 0;
upd(1,1,n);
}
v2 = x[id] - y[id];
while (tot <= k){
L = yy[id] + 1; R = n; ID = 1;
res = get(1,1,n);
w1 = v2 - res.f;
if (w1 > w) break;
if (zz) answ.pb(w1);
tot += 1;
if (tot > k) return tot;
roll.pb({{1,res.s},{res.f,-inf}});
oldval = res.f;
newval = -inf;
idx = res.s;
z = 0; ID = 1;
upd(1,1,n);
}
for (j = roll.size() - 1; j >= 0; j--){
oldval = roll[j].s.s;
newval = roll[j].s.f;
idx = roll[j].f.s;
z = 0; ID = roll[j].f.f;
upd(1,1,n);
}
oldval = -inf;
newval = v1;
idx = yy[id];
z = 1; ID = 0;
upd(1,1,n);
newval = v2; ID = 1;
upd(1,1,n);
}
return tot;
}
signed main() {
ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
cin>>n>>k;
vector <int> vec;
for (int i = 1; i <= n; i++){
cin >> x[i] >> y[i];
vec.pb(y[i]);
}
sort(vec.begin(),vec.end());
map <int,int> mp;
int val = 0;
for (int i=0;i<vec.size();i++){
if (!i || vec[i] != vec[i - 1]) ++val;
mp[vec[i]] = val;
}
for (int i = 1; i<= n; i++){
yy[i] = mp[y[i]];
arr[i] = {x[i],i};
}
sort(arr+1,arr+n+1);
ll l = 0,r = 4e9,res = -1;
while (l <= r){
ll mid = (l + r) >> 1;
//umciresi w iseti rom w ze naklebi an toli wonis wiboebis raodenoba >= k ze
if (count(mid,0) >= k) {
res = mid;
r = mid - 1;
}else{
l = mid + 1;
}
}
int cnt1 = count(res - 1,1);
sort(answ.begin(),answ.end());
for (int i = 1; i <= k - cnt1; i++)
answ.pb(res);
for (ll x: answ)
cout<<x<<endl;
}
Compilation message (stderr)
road_construction.cpp: In function 'int main()':
road_construction.cpp:135:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
135 | for (int i=0;i<vec.size();i++){
| ~^~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |