oj.uz

Submission #275481

# Submission time Handle Problem Language Result Execution time Memory
275481 2020-08-20T06:14:23 Z 최은수(#5098) Radio (Balkan15_RADIO) C++17
45 / 100
 2000 ms 34732 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;
    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;
    vector<ll>lst;
    for(int i=0;i++<n;)
        cin>>x[i]>>p[i]>>s[i];
    ll cs=0;
    ll ce=4e9;
    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
15.0 / 15.0

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

Subtask #2
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 5 ms 512 KB Output is correct
4 Correct 10 ms 672 KB Output is correct
5 Correct 13 ms 768 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 512 KB Output is correct
4 Correct 11 ms 700 KB Output is correct
5 Correct 11 ms 684 KB Output is correct
6 Correct 12 ms 640 KB Output is correct

Subtask #4
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 5 ms 512 KB Output is correct
4 Correct 10 ms 672 KB Output is correct
5 Correct 13 ms 768 KB Output is correct
6 Correct 85 ms 2216 KB Output is correct
7 Correct 398 ms 8232 KB Output is correct
8 Correct 1010 ms 17304 KB Output is correct
9 Correct 1895 ms 31172 KB Output is correct
10 Correct 1962 ms 33180 KB Output is correct
11 Execution timed out 2027 ms 34732 KB Time limit exceeded

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 512 KB Output is correct
4 Correct 11 ms 700 KB Output is correct
5 Correct 11 ms 684 KB Output is correct
6 Correct 12 ms 640 KB Output is correct
7 Correct 78 ms 2320 KB Output is correct
8 Correct 449 ms 8456 KB Output is correct
9 Correct 943 ms 17028 KB Output is correct
10 Correct 1558 ms 29900 KB Output is correct
11 Correct 1200 ms 28016 KB Output is correct
12 Execution timed out 2087 ms 33992 KB Time limit exceeded

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 10 ms 672 KB Output is correct
12 Correct 13 ms 768 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 7 ms 512 KB Output is correct
16 Correct 11 ms 700 KB Output is correct
17 Correct 11 ms 684 KB Output is correct
18 Correct 12 ms 640 KB Output is correct
19 Correct 85 ms 2216 KB Output is correct
20 Correct 398 ms 8232 KB Output is correct
21 Correct 1010 ms 17304 KB Output is correct
22 Correct 1895 ms 31172 KB Output is correct
23 Correct 1962 ms 33180 KB Output is correct
24 Execution timed out 2027 ms 34732 KB Time limit exceeded