oj.uz

답안 #275532

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
275532 2020-08-20T06:24:37 Z 최은수(#5098) Radio (Balkan15_RADIO) C++17
75 / 100
 1617 ms 18172 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];
    ll 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
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 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 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 512 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 10 ms 512 KB Output is correct
5 Correct 11 ms 556 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 6 ms 492 KB Output is correct
4 Correct 9 ms 512 KB Output is correct
5 Correct 9 ms 512 KB Output is correct
6 Correct 10 ms 560 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 10 ms 512 KB Output is correct
5 Correct 11 ms 556 KB Output is correct
6 Correct 61 ms 1152 KB Output is correct
7 Correct 260 ms 3512 KB Output is correct
8 Correct 628 ms 7820 KB Output is correct
9 Correct 1230 ms 12356 KB Output is correct
10 Correct 1418 ms 15356 KB Output is correct
11 Correct 1617 ms 15356 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 6 ms 492 KB Output is correct
4 Correct 9 ms 512 KB Output is correct
5 Correct 9 ms 512 KB Output is correct
6 Correct 10 ms 560 KB Output is correct
7 Correct 56 ms 1152 KB Output is correct
8 Correct 280 ms 3840 KB Output is correct
9 Correct 683 ms 7924 KB Output is correct
10 Correct 1012 ms 11904 KB Output is correct
11 Correct 734 ms 10344 KB Output is correct
12 Correct 1397 ms 15356 KB Output is correct

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 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 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 512 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 384 KB Output is correct
11 Correct 10 ms 512 KB Output is correct
12 Correct 11 ms 556 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 6 ms 492 KB Output is correct
16 Correct 9 ms 512 KB Output is correct
17 Correct 9 ms 512 KB Output is correct
18 Correct 10 ms 560 KB Output is correct
19 Correct 61 ms 1152 KB Output is correct
20 Correct 260 ms 3512 KB Output is correct
21 Correct 628 ms 7820 KB Output is correct
22 Correct 1230 ms 12356 KB Output is correct
23 Correct 1418 ms 15356 KB Output is correct
24 Correct 1617 ms 15356 KB Output is correct
25 Correct 56 ms 1152 KB Output is correct
26 Correct 280 ms 3840 KB Output is correct
27 Correct 683 ms 7924 KB Output is correct
28 Correct 1012 ms 11904 KB Output is correct
29 Correct 734 ms 10344 KB Output is correct
30 Correct 1397 ms 15356 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 362 ms 5504 KB Output is correct
33 Correct 480 ms 7552 KB Output is correct
34 Correct 336 ms 9336 KB Output is correct
35 Correct 654 ms 11524 KB Output is correct
36 Correct 689 ms 18172 KB Output is correct
37 Correct 1282 ms 17400 KB Output is correct
38 Correct 1330 ms 17184 KB Output is correct
39 Incorrect 910 ms 17184 KB Output isn't correct
40 Halted 0 ms 0 KB -