Submission #47943722

Source Code Expand

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
#define pb push_back
#define ff first
#define ss second
const int N=2e3+7;
const int mod=1e9+7;
const double eps=1e-9;
const double pi=    3.14159265358979323846;
using namespace std;  
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    op_set;

long long leastOperationsReq(vector<long long>&ar,vector<long long>&pre,long long mid,long long n)
{
    long long ops=1e18;
    long long before=0ll;
    for(int i=0;i<n;i++)//this loop is for ranges of the type [ar[i],ar[i]+mid]
    {
        long long currReq=ar[i]*i-before;
        long long j=upper_bound(ar.begin(),ar.end(),ar[i]+mid)-ar.begin();
        currReq=currReq+(pre[n]-pre[j])-(n-j)*(ar[i]+mid);
        ops=std::min(ops,currReq);
        before+=ar[i];
    }

    for(int i=0;i<n;i++)//this loop is for ranges like [ar[i]-mid,ar[i]]
    {
        long long currReq=(pre[n]-pre[i])-ar[i]*(n-i);
        int a=1;
        int b=n;
        long long c=0;//number of values smaller than ar[i]-mid
        while(a<=b)
        {
            int m=(a+b)/2;
            if(ar[m-1] < ar[i]-mid)
            {
                c=m;
                a=m+1;
            }
            else
                b=m-1;
        }
        currReq=currReq+(ar[i]-mid)*c-pre[c];
        ops=std::min(ops,currReq);
    }

    return ops;
}

int32_t main() 
{
   ios_base::sync_with_stdio(false);
   cin.tie(0);

   long long n,k;
   cin >> n >> k;

   vector<long long> x(n),y(n);
   for(int i=0;i<n;i++)
        cin >> x[i] >> y[i];
   
   sort(x.begin(),x.end());
   sort(y.begin(),y.end());

   vector<long long> preX(n+1),preY(n+1);
   for(int i=1;i<=n;i++)
   {
        preY[i]=preY[i-1]+y[i-1];
        preX[i]=preX[i-1]+x[i-1];
   } 

   long long low=0;
   long long high=1e9;
   long long ans=1e9;
   while(low<=high)
   {
        long long mid=(low+high)/2;

        if( leastOperationsReq(x,preX,mid,n)+leastOperationsReq(y,preY,mid,n)<=k)
        {
            ans=mid;
            high=mid-1;
        }
        else
            low=mid+1;
   }

   cout << ans << "\n";
}

/*
I'm sorry, I'm sorry I don't see you more
Sorry we ain't close as we should've been
Sorry I'm not empathetic
Sorry you think I'm pathetic
Sorry you don't know me on a personal level to pinpoint what it is
*/

Submission Info

Submission Time
Task F - Minimize Bounding Square
User 18o3
Language C++ 20 (gcc 12.2)
Score 525
Code Size 2547 Byte
Status AC
Exec Time 1108 ms
Memory 9456 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 525 / 525
Status
AC × 3
AC × 104
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All hack_01.txt, hack_02.txt, hack_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt, test_51.txt, test_52.txt, test_53.txt, test_54.txt, test_55.txt, test_56.txt, test_57.txt, test_58.txt, test_59.txt, test_60.txt, test_61.txt, test_62.txt, test_63.txt, test_64.txt, test_65.txt, test_66.txt, test_67.txt, test_68.txt, test_69.txt, test_70.txt, test_71.txt, test_72.txt, test_73.txt, test_74.txt, test_75.txt, test_76.txt, test_77.txt, test_78.txt, test_79.txt, test_80.txt, test_81.txt, test_82.txt, test_83.txt, test_84.txt, test_85.txt, test_86.txt, test_87.txt, test_88.txt, test_89.txt, test_90.txt, test_91.txt, test_92.txt, test_93.txt, test_94.txt, test_95.txt, test_96.txt, test_97.txt, test_98.txt
Case Name Status Exec Time Memory
hack_01.txt AC 407 ms 9456 KiB
hack_02.txt AC 407 ms 9308 KiB
hack_03.txt AC 407 ms 9412 KiB
sample_01.txt AC 1 ms 3472 KiB
sample_02.txt AC 1 ms 3472 KiB
sample_03.txt AC 1 ms 3416 KiB
test_01.txt AC 1 ms 3412 KiB
test_02.txt AC 1 ms 3504 KiB
test_03.txt AC 1 ms 3412 KiB
test_04.txt AC 1 ms 3464 KiB
test_05.txt AC 1 ms 3412 KiB
test_06.txt AC 1 ms 3468 KiB
test_07.txt AC 1 ms 3600 KiB
test_08.txt AC 1 ms 3480 KiB
test_09.txt AC 1 ms 3500 KiB
test_10.txt AC 1 ms 3460 KiB
test_11.txt AC 1 ms 3596 KiB
test_12.txt AC 1 ms 3376 KiB
test_13.txt AC 1 ms 3384 KiB
test_14.txt AC 1 ms 3572 KiB
test_15.txt AC 1 ms 3464 KiB
test_16.txt AC 1 ms 3408 KiB
test_17.txt AC 1 ms 3408 KiB
test_18.txt AC 1 ms 3340 KiB
test_19.txt AC 1 ms 3316 KiB
test_20.txt AC 1 ms 3464 KiB
test_21.txt AC 1 ms 3380 KiB
test_22.txt AC 1 ms 3448 KiB
test_23.txt AC 1 ms 3404 KiB
test_24.txt AC 1 ms 3428 KiB
test_25.txt AC 1 ms 3468 KiB
test_26.txt AC 1 ms 3456 KiB
test_27.txt AC 966 ms 9408 KiB
test_28.txt AC 21 ms 3508 KiB
test_29.txt AC 261 ms 4568 KiB
test_30.txt AC 1106 ms 9316 KiB
test_31.txt AC 952 ms 8628 KiB
test_32.txt AC 451 ms 9364 KiB
test_33.txt AC 839 ms 9324 KiB
test_34.txt AC 351 ms 6152 KiB
test_35.txt AC 995 ms 9152 KiB
test_36.txt AC 519 ms 9372 KiB
test_37.txt AC 895 ms 8100 KiB
test_38.txt AC 790 ms 7480 KiB
test_39.txt AC 1107 ms 9356 KiB
test_40.txt AC 96 ms 4560 KiB
test_41.txt AC 38 ms 3596 KiB
test_42.txt AC 976 ms 9304 KiB
test_43.txt AC 919 ms 9096 KiB
test_44.txt AC 58 ms 3696 KiB
test_45.txt AC 1107 ms 9356 KiB
test_46.txt AC 864 ms 8000 KiB
test_47.txt AC 127 ms 3828 KiB
test_48.txt AC 457 ms 9412 KiB
test_49.txt AC 496 ms 7392 KiB
test_50.txt AC 69 ms 3632 KiB
test_51.txt AC 905 ms 9364 KiB
test_52.txt AC 681 ms 9044 KiB
test_53.txt AC 782 ms 7376 KiB
test_54.txt AC 1103 ms 9356 KiB
test_55.txt AC 785 ms 7532 KiB
test_56.txt AC 433 ms 9112 KiB
test_57.txt AC 841 ms 9412 KiB
test_58.txt AC 326 ms 6140 KiB
test_59.txt AC 815 ms 7872 KiB
test_60.txt AC 1108 ms 9400 KiB
test_61.txt AC 768 ms 7740 KiB
test_62.txt AC 948 ms 8268 KiB
test_63.txt AC 1105 ms 9320 KiB
test_64.txt AC 342 ms 7828 KiB
test_65.txt AC 351 ms 5896 KiB
test_66.txt AC 816 ms 9360 KiB
test_67.txt AC 556 ms 6176 KiB
test_68.txt AC 379 ms 5764 KiB
test_69.txt AC 1104 ms 9324 KiB
test_70.txt AC 425 ms 7744 KiB
test_71.txt AC 808 ms 7816 KiB
test_72.txt AC 456 ms 9360 KiB
test_73.txt AC 155 ms 4224 KiB
test_74.txt AC 51 ms 3648 KiB
test_75.txt AC 400 ms 9304 KiB
test_76.txt AC 399 ms 9328 KiB
test_77.txt AC 394 ms 9364 KiB
test_78.txt AC 408 ms 9356 KiB
test_79.txt AC 408 ms 9384 KiB
test_80.txt AC 408 ms 9328 KiB
test_81.txt AC 409 ms 9308 KiB
test_82.txt AC 408 ms 9328 KiB
test_83.txt AC 666 ms 9384 KiB
test_84.txt AC 753 ms 9336 KiB
test_85.txt AC 751 ms 9400 KiB
test_86.txt AC 756 ms 9308 KiB
test_87.txt AC 752 ms 9380 KiB
test_88.txt AC 433 ms 9380 KiB
test_89.txt AC 597 ms 9320 KiB
test_90.txt AC 751 ms 9328 KiB
test_91.txt AC 752 ms 9308 KiB
test_92.txt AC 750 ms 9396 KiB
test_93.txt AC 755 ms 9456 KiB
test_94.txt AC 753 ms 9320 KiB
test_95.txt AC 753 ms 9308 KiB
test_96.txt AC 434 ms 9244 KiB
test_97.txt AC 522 ms 9376 KiB
test_98.txt AC 520 ms 9384 KiB