oj.uz

답안 #208346

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
208346 2020-03-10T19:53:42 Z gs18115 Arranging Tickets (JOI17_arranging_tickets) C++14
100 / 100
 2442 ms 17772 KB 
#include<iostream>
#include<vector>
#include<queue>
#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+7;
int n,m;
ll s[200010];
ll s2[200010];
vector<pl>qv[200010];
priority_queue<pl>pq;
inline bool able(int x,ll mx,vector<pair<pi,ll> >&v)
{
    if(mx>=s[x])
        return 1;
    for(int i=0;i++<n;)
        s2[i]=s[i]-s[i-1],qv[i].clear();
    for(auto&t:v)
        qv[t.fi.fi].eb(t.fi.se,t.se);
    bool f=1;
    ll c=0;
    ll rev=s[x]-mx;
    s2[0]=rev;
    while(!pq.empty())
        pq.pop();
    for(int i=0;i++<n;)
    {
        s2[i]+=s2[i-1];
        for(pl&t:qv[i])
            pq.ep(t);
        ll rn=s2[i]>mx?(s2[i]-mx+1)/2:0;
        while(rn>0&&!pq.empty())
        {
            pl t=pq.top();
            if(t.fi<i)
                break;
            pq.pop();
            c+=min(t.se,rn);
            s2[i]-=2*min(t.se,rn);
            s2[t.fi+1]+=2*min(t.se,rn);
            if(t.se<=rn)
                rn-=t.se;
            else
            {
                t.se-=rn;
                rn=0;
                pq.ep(t);
            }
        }
        if(rn>0)
        {
            f=0;
            break;
        }
    }
    if(f&&c<=rev)
        return 1;
    for(int i=0;i++<n;)
        s2[i]=s[i]-s[i-1];
    f=1;
    c=0;
    rev=s[x]-mx+1;
    s2[0]=rev;
    while(!pq.empty())
        pq.pop();
    for(int i=0;i++<n;)
    {
        s2[i]+=s2[i-1];
        for(pl&t:qv[i])
            pq.ep(t);
        ll rn=s2[i]>mx?(s2[i]-mx+1)/2:0;
        while(rn>0&&!pq.empty())
        {
            pl t=pq.top();
            if(t.fi<i)
                break;
            pq.pop();
            c+=min(t.se,rn);
            s2[i]-=2*min(t.se,rn);
            s2[t.fi+1]+=2*min(t.se,rn);
            if(t.se<=rn)
                rn-=t.se;
            else
            {
                t.se-=rn;
                rn=0;
                pq.ep(t);
            }
        }
        if(rn>0)
        {
            f=0;
            break;
        }
    }
    if(f&&c<=rev)
        return 1;
    return 0;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>n>>m;
    vector<pair<pi,ll> >it(m);
    for(auto&t:it)
        cin>>t.fi.fi>>t.fi.se>>t.se;
    for(auto&t:it)
        if(t.fi.fi>t.fi.se)
            swap(t.fi.fi,t.fi.se);
    for(auto&t:it)
        s[t.fi.fi]+=t.se,s[t.fi.se--]-=t.se;
    s[0]=0;
    for(int i=0;i++<n;)
        s[i]+=s[i-1];
    ll m=-1;
    int mi=-1,mj=-1;
    for(int i=0;i++<n;)
    {
        if(s[i]>m)
            m=s[i],mi=i;
        if(s[i]==m)
            mj=i;
    }
    ll l=0,r=INF;
    vector<pair<pi,ll> >qv;
    for(auto&t:it)
        if(t.fi.fi<=mi&&t.fi.se>=mi)
            qv.eb(t);
    while(l<r)
    {
        ll mid=(l+r)/2;
        if(able(mi,mid,qv))
            r=mid;
        else
            l=mid+1;
    }
    ll l0=l;
    l=0,r=INF;
    qv.clear();
    for(auto&t:it)
        if(t.fi.fi<=mj&&t.fi.se>=mj)
            qv.eb(t);
    while(l<r)
    {
        ll mid=(l+r)/2;
        if(able(mj,mid,qv))
            r=mid;
        else
            l=mid+1;
    }
    cout<<min(l,l0)<<endl;
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 7 ms 4984 KB Output is correct
4 Correct 8 ms 4984 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct
6 Correct 7 ms 5112 KB Output is correct
7 Correct 7 ms 4984 KB Output is correct
8 Correct 7 ms 4984 KB Output is correct
9 Correct 7 ms 4984 KB Output is correct
10 Correct 7 ms 4984 KB Output is correct
11 Correct 7 ms 5112 KB Output is correct
12 Correct 7 ms 5112 KB Output is correct
13 Correct 7 ms 4984 KB Output is correct
14 Correct 7 ms 5116 KB Output is correct
15 Correct 7 ms 4988 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 7 ms 4984 KB Output is correct
4 Correct 8 ms 4984 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct
6 Correct 7 ms 5112 KB Output is correct
7 Correct 7 ms 4984 KB Output is correct
8 Correct 7 ms 4984 KB Output is correct
9 Correct 7 ms 4984 KB Output is correct
10 Correct 7 ms 4984 KB Output is correct
11 Correct 7 ms 5112 KB Output is correct
12 Correct 7 ms 5112 KB Output is correct
13 Correct 7 ms 4984 KB Output is correct
14 Correct 7 ms 5116 KB Output is correct
15 Correct 7 ms 4988 KB Output is correct
16 Correct 7 ms 5112 KB Output is correct
17 Correct 8 ms 5112 KB Output is correct
18 Correct 7 ms 5112 KB Output is correct
19 Correct 7 ms 5112 KB Output is correct
20 Correct 8 ms 5116 KB Output is correct
21 Correct 7 ms 5112 KB Output is correct
22 Correct 7 ms 5112 KB Output is correct
23 Correct 7 ms 5112 KB Output is correct
24 Correct 7 ms 5112 KB Output is correct
25 Correct 9 ms 5112 KB Output is correct
26 Correct 8 ms 5112 KB Output is correct
27 Correct 8 ms 5112 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 7 ms 4984 KB Output is correct
4 Correct 8 ms 4984 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct
6 Correct 7 ms 5112 KB Output is correct
7 Correct 7 ms 4984 KB Output is correct
8 Correct 7 ms 4984 KB Output is correct
9 Correct 7 ms 4984 KB Output is correct
10 Correct 7 ms 4984 KB Output is correct
11 Correct 7 ms 5112 KB Output is correct
12 Correct 7 ms 5112 KB Output is correct
13 Correct 7 ms 4984 KB Output is correct
14 Correct 7 ms 5116 KB Output is correct
15 Correct 7 ms 4988 KB Output is correct
16 Correct 7 ms 5112 KB Output is correct
17 Correct 8 ms 5112 KB Output is correct
18 Correct 7 ms 5112 KB Output is correct
19 Correct 7 ms 5112 KB Output is correct
20 Correct 8 ms 5116 KB Output is correct
21 Correct 7 ms 5112 KB Output is correct
22 Correct 7 ms 5112 KB Output is correct
23 Correct 7 ms 5112 KB Output is correct
24 Correct 7 ms 5112 KB Output is correct
25 Correct 9 ms 5112 KB Output is correct
26 Correct 8 ms 5112 KB Output is correct
27 Correct 8 ms 5112 KB Output is correct
28 Correct 11 ms 5244 KB Output is correct
29 Correct 12 ms 5240 KB Output is correct
30 Correct 13 ms 5240 KB Output is correct
31 Correct 13 ms 5240 KB Output is correct
32 Correct 16 ms 5368 KB Output is correct
33 Correct 14 ms 5240 KB Output is correct
34 Correct 13 ms 5240 KB Output is correct
35 Correct 14 ms 5240 KB Output is correct
36 Correct 13 ms 5240 KB Output is correct
37 Correct 11 ms 5240 KB Output is correct
38 Correct 8 ms 5112 KB Output is correct
39 Correct 10 ms 5240 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 7 ms 4984 KB Output is correct
4 Correct 8 ms 4984 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct
6 Correct 7 ms 5112 KB Output is correct
7 Correct 7 ms 4984 KB Output is correct
8 Correct 7 ms 4984 KB Output is correct
9 Correct 7 ms 4984 KB Output is correct
10 Correct 7 ms 4984 KB Output is correct
11 Correct 7 ms 5112 KB Output is correct
12 Correct 7 ms 5112 KB Output is correct
13 Correct 7 ms 4984 KB Output is correct
14 Correct 7 ms 5116 KB Output is correct
15 Correct 7 ms 4988 KB Output is correct
16 Correct 7 ms 5112 KB Output is correct
17 Correct 8 ms 5112 KB Output is correct
18 Correct 7 ms 5112 KB Output is correct
19 Correct 7 ms 5112 KB Output is correct
20 Correct 8 ms 5116 KB Output is correct
21 Correct 7 ms 5112 KB Output is correct
22 Correct 7 ms 5112 KB Output is correct
23 Correct 7 ms 5112 KB Output is correct
24 Correct 7 ms 5112 KB Output is correct
25 Correct 9 ms 5112 KB Output is correct
26 Correct 8 ms 5112 KB Output is correct
27 Correct 8 ms 5112 KB Output is correct
28 Correct 11 ms 5244 KB Output is correct
29 Correct 12 ms 5240 KB Output is correct
30 Correct 13 ms 5240 KB Output is correct
31 Correct 13 ms 5240 KB Output is correct
32 Correct 16 ms 5368 KB Output is correct
33 Correct 14 ms 5240 KB Output is correct
34 Correct 13 ms 5240 KB Output is correct
35 Correct 14 ms 5240 KB Output is correct
36 Correct 13 ms 5240 KB Output is correct
37 Correct 11 ms 5240 KB Output is correct
38 Correct 8 ms 5112 KB Output is correct
39 Correct 10 ms 5240 KB Output is correct
40 Correct 447 ms 15212 KB Output is correct
41 Correct 380 ms 15340 KB Output is correct
42 Correct 302 ms 15212 KB Output is correct
43 Correct 602 ms 14956 KB Output is correct
44 Correct 410 ms 15212 KB Output is correct
45 Correct 704 ms 14956 KB Output is correct
46 Correct 449 ms 15084 KB Output is correct
47 Correct 360 ms 15340 KB Output is correct
48 Correct 381 ms 14828 KB Output is correct
49 Correct 216 ms 13036 KB Output is correct
50 Correct 74 ms 8952 KB Output is correct
51 Correct 211 ms 12268 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 7 ms 4984 KB Output is correct
4 Correct 8 ms 4984 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct
6 Correct 7 ms 5112 KB Output is correct
7 Correct 7 ms 4984 KB Output is correct
8 Correct 7 ms 4984 KB Output is correct
9 Correct 7 ms 4984 KB Output is correct
10 Correct 7 ms 4984 KB Output is correct
11 Correct 7 ms 5112 KB Output is correct
12 Correct 7 ms 5112 KB Output is correct
13 Correct 7 ms 4984 KB Output is correct
14 Correct 7 ms 5116 KB Output is correct
15 Correct 7 ms 4988 KB Output is correct
16 Correct 7 ms 5112 KB Output is correct
17 Correct 8 ms 5112 KB Output is correct
18 Correct 7 ms 5112 KB Output is correct
19 Correct 7 ms 5112 KB Output is correct
20 Correct 8 ms 5116 KB Output is correct
21 Correct 7 ms 5112 KB Output is correct
22 Correct 7 ms 5112 KB Output is correct
23 Correct 7 ms 5112 KB Output is correct
24 Correct 7 ms 5112 KB Output is correct
25 Correct 9 ms 5112 KB Output is correct
26 Correct 8 ms 5112 KB Output is correct
27 Correct 8 ms 5112 KB Output is correct
28 Correct 11 ms 5244 KB Output is correct
29 Correct 12 ms 5240 KB Output is correct
30 Correct 13 ms 5240 KB Output is correct
31 Correct 13 ms 5240 KB Output is correct
32 Correct 16 ms 5368 KB Output is correct
33 Correct 14 ms 5240 KB Output is correct
34 Correct 13 ms 5240 KB Output is correct
35 Correct 14 ms 5240 KB Output is correct
36 Correct 13 ms 5240 KB Output is correct
37 Correct 11 ms 5240 KB Output is correct
38 Correct 8 ms 5112 KB Output is correct
39 Correct 10 ms 5240 KB Output is correct
40 Correct 447 ms 15212 KB Output is correct
41 Correct 380 ms 15340 KB Output is correct
42 Correct 302 ms 15212 KB Output is correct
43 Correct 602 ms 14956 KB Output is correct
44 Correct 410 ms 15212 KB Output is correct
45 Correct 704 ms 14956 KB Output is correct
46 Correct 449 ms 15084 KB Output is correct
47 Correct 360 ms 15340 KB Output is correct
48 Correct 381 ms 14828 KB Output is correct
49 Correct 216 ms 13036 KB Output is correct
50 Correct 74 ms 8952 KB Output is correct
51 Correct 211 ms 12268 KB Output is correct
52 Correct 1186 ms 15596 KB Output is correct
53 Correct 1006 ms 17772 KB Output is correct
54 Correct 2203 ms 17644 KB Output is correct
55 Correct 1174 ms 17732 KB Output is correct
56 Correct 2362 ms 17256 KB Output is correct
57 Correct 2442 ms 17004 KB Output is correct
58 Correct 1413 ms 17260 KB Output is correct
59 Correct 1065 ms 17136 KB Output is correct