oj.uz

Submission #275490

# Submission time Handle Problem Language Result Execution time Memory
275490 2020-08-20T06:15:24 Z 최은수(#5098) Radio (Balkan15_RADIO) C++17
60 / 100
 2000 ms 31916 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=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
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 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 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 15 ms 892 KB Output is correct
5 Correct 12 ms 640 KB Output is correct

Subtask #3
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 10 ms 512 KB Output is correct
4 Correct 14 ms 672 KB Output is correct
5 Correct 11 ms 688 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 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 15 ms 892 KB Output is correct
5 Correct 12 ms 640 KB Output is correct
6 Correct 84 ms 2204 KB Output is correct
7 Correct 373 ms 7532 KB Output is correct
8 Correct 928 ms 16336 KB Output is correct
9 Correct 1691 ms 28816 KB Output is correct
10 Correct 1919 ms 31916 KB Output is correct
11 Execution timed out 2041 ms 31792 KB Time limit exceeded

Subtask #5
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 10 ms 512 KB Output is correct
4 Correct 14 ms 672 KB Output is correct
5 Correct 11 ms 688 KB Output is correct
6 Correct 12 ms 640 KB Output is correct
7 Correct 75 ms 2192 KB Output is correct
8 Correct 354 ms 8048 KB Output is correct
9 Correct 909 ms 16208 KB Output is correct
10 Correct 1461 ms 28512 KB Output is correct
11 Correct 1160 ms 26868 KB Output is correct
12 Correct 1953 ms 31864 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 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 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 15 ms 892 KB Output is correct
12 Correct 12 ms 640 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 10 ms 512 KB Output is correct
16 Correct 14 ms 672 KB Output is correct
17 Correct 11 ms 688 KB Output is correct
18 Correct 12 ms 640 KB Output is correct
19 Correct 84 ms 2204 KB Output is correct
20 Correct 373 ms 7532 KB Output is correct
21 Correct 928 ms 16336 KB Output is correct
22 Correct 1691 ms 28816 KB Output is correct
23 Correct 1919 ms 31916 KB Output is correct
24 Execution timed out 2041 ms 31792 KB Time limit exceeded