oj.uz

Submission #275522

# Submission time Handle Problem Language Result Execution time Memory
275522 2020-08-20T06:22:40 Z 최은수(#5098) Radio (Balkan15_RADIO) C++17
45 / 100
 1614 ms 15316 KB 
#include<iostream>
#include<vector>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18;
pl operator+(pl x,pl y)
{
    return pl(x.fi+y.fi,x.se+y.se);
}
ll x[100010],p[100010],s[100010];
int n;
pl get(ll bnd)
{
    pl cur(0,0);
    ll ccnt=0;
    vector<pair<pl,pl> >cv;
    int ct=0;
    for(int i=0;i++<n;)
        if(s[i]<bnd)
            ct+=s[i]==bnd-1?2:4;
    cv.reserve(ct);
    for(int i=0;i++<n;)
    {
        cur.se+=bnd;
        if(s[i]<bnd)
        {
            if(s[i]==bnd-1)
            {
                cv.eb(pl(x[i]-p[i],1),pl(0,-1));
                cv.eb(pl(x[i]+p[i]+1,-1),pl(0,1));
            }
            else
            {
                cv.eb(pl(x[i]-p[i]-(bnd-s[i])+1,1),pl(-1,x[i]-p[i]-(bnd-s[i])));
                cv.eb(pl(x[i]-p[i],0),pl(1,-(x[i]-p[i])));
                cv.eb(pl(x[i]+p[i],0),pl(1,-(x[i]+p[i])));
                cv.eb(pl(x[i]+p[i]+(bnd-s[i]),-1),pl(-1,x[i]+p[i]+(bnd-s[i])));
            }
        }
    }
    pl mn(bnd*n,0);
    sort(all(cv));
    for(int i=0;i<(int)cv.size();i++)
    {
        auto&t=cv[i];
        cur=cur+t.se;
        ccnt+=t.fi.se;
        if(i==(int)cv.size()-1||cv[i].fi.fi!=cv[i+1].fi.fi)
            mn=min(mn,pl(cur.fi*t.fi.fi+cur.se,ccnt));
    }
    return mn;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int k;
    cin>>n>>k;
    for(int i=0;i++<n;)
        cin>>x[i]>>p[i]>>s[i];
    int cs=1,ce=2e9;
    while(cs<ce)
    {
        ll cm=cs+(ce-cs+1)/2;
        pl cur=get(cm);
        if(cur.se>k)
            ce=cm-1;
        else
            cs=cm;
    }
    ll ans=get(cs).fi-cs*(n-k);
    for(int i=0;i++<n;)
        ans-=s[i];
    cout<<ans<<endl;
    return 0;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 360 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Incorrect 0 ms 288 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 5 ms 484 KB Output is correct
4 Correct 9 ms 512 KB Output is correct
5 Correct 13 ms 512 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 7 ms 384 KB Output is correct
4 Correct 7 ms 512 KB Output is correct
5 Correct 11 ms 512 KB Output is correct
6 Correct 10 ms 512 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 5 ms 484 KB Output is correct
4 Correct 9 ms 512 KB Output is correct
5 Correct 13 ms 512 KB Output is correct
6 Correct 76 ms 1164 KB Output is correct
7 Correct 309 ms 3384 KB Output is correct
8 Correct 696 ms 7848 KB Output is correct
9 Correct 1324 ms 12280 KB Output is correct
10 Correct 1423 ms 15260 KB Output is correct
11 Correct 1614 ms 15316 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 7 ms 384 KB Output is correct
4 Correct 7 ms 512 KB Output is correct
5 Correct 11 ms 512 KB Output is correct
6 Correct 10 ms 512 KB Output is correct
7 Correct 55 ms 1164 KB Output is correct
8 Correct 265 ms 3908 KB Output is correct
9 Incorrect 723 ms 7964 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 360 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Incorrect 0 ms 288 KB Output isn't correct
4 Halted 0 ms 0 KB -