oj.uz

Submission #363358

# Submission time Handle Problem Language Result Execution time Memory
363358 2021-02-05T17:46:22 Z denkendoemeer Arranging Tickets (JOI17_arranging_tickets) C++14
100 / 100
 1313 ms 16740 KB 
#include<bits/stdc++.h>
#define ll long long
using namespace std;
vector<pair<int,int>>g[200005];
ll sum[200005],maxi[200005],h[200005],t[200005];
int nr,n,m;
priority_queue<pair<int,int>>pq;
bool calc(ll k)
{
    int i;
    ll s=0;
    for(i=0;i<n;i++){
        h[i]=min(h[i],k);
        t[i]=0;
    }
    h[nr]=0;
    while(!pq.empty())
        pq.pop();
    for(i=1;i<=nr;i++){
        for(auto it:g[i])
            if (it.first>nr)
                pq.push(it);
        s=s+h[i-1]-h[i];
        while(s){
            if (pq.empty())
                return 0;
            pair<int,int>nod=pq.top();
            pq.pop();
            if (nod.second>=s){
                nod.second-=s;
                t[nod.first]-=s;
                pq.push(nod);
                s=0;
            }
            else{
                t[nod.first]-=nod.second;
                s-=nod.second;
            }
        }
    }
    for(i=1;i<n;i++){
        t[i]=t[i]+t[i-1];
        if (t[i]+h[i]<0)
            return 0;
    }
    return 1;
}
bool verif(ll k)
{
    ll i,j,val=maxi[nr]-k,num=k/2;
    for(i=val;i<=val+1;i++){
        for(j=0;j<n;j++)
            h[j]=(i+k-maxi[j])/2;
        if (h[0]<i)
            continue;
        if (calc(i))
            return 1;
    }
    return 0;
}
int main()
{
    //freopen(".in","r",stdin);
    //freopen(".out","w",stdout);
    int i,a,b,c;
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++){
        scanf("%d%d%d",&a,&b,&c);
        if (a>b)
            swap(a,b);
        g[a].push_back({b,c});
        sum[a]+=c;
        sum[b]-=c;
    }
    ll ma=-1;
    nr=-1;
    for(i=1;i<n;i++){
        sum[i]+=sum[i-1];
        if (ma<sum[i]){
            ma=sum[i];
            nr=i;
        }
    }
    for(i=1;i<=nr;i++)
        maxi[i]=max(maxi[i-1],sum[i]);
    for(i=n-1;i>=nr;i--)
        maxi[i]=max(maxi[i+1],sum[i]);
    ll st=0,dr=ma-1,mij,ans=ma;
    while(st<=dr){
        mij=(st+dr)/2;
        if (verif(mij)){
            ans=mij;
            dr=mij-1;
        }
        else
            st=mij+1;
    }
    printf("%lld\n",ans);
return 0;
}

Compilation message

arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:66:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   66 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
arranging_tickets.cpp:68:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   68 |         scanf("%d%d%d",&a,&b,&c);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 4 ms 5228 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 4 ms 5228 KB Output is correct
16 Correct 5 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct
19 Correct 4 ms 5100 KB Output is correct
20 Correct 4 ms 5100 KB Output is correct
21 Correct 4 ms 5100 KB Output is correct
22 Correct 4 ms 5100 KB Output is correct
23 Correct 4 ms 5100 KB Output is correct
24 Correct 4 ms 5120 KB Output is correct
25 Correct 5 ms 5100 KB Output is correct
26 Correct 4 ms 5100 KB Output is correct
27 Correct 4 ms 5100 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 4 ms 5228 KB Output is correct
16 Correct 5 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct
19 Correct 4 ms 5100 KB Output is correct
20 Correct 4 ms 5100 KB Output is correct
21 Correct 4 ms 5100 KB Output is correct
22 Correct 4 ms 5100 KB Output is correct
23 Correct 4 ms 5100 KB Output is correct
24 Correct 4 ms 5120 KB Output is correct
25 Correct 5 ms 5100 KB Output is correct
26 Correct 4 ms 5100 KB Output is correct
27 Correct 4 ms 5100 KB Output is correct
28 Correct 9 ms 5228 KB Output is correct
29 Correct 9 ms 5228 KB Output is correct
30 Correct 8 ms 5228 KB Output is correct
31 Correct 8 ms 5248 KB Output is correct
32 Correct 9 ms 5308 KB Output is correct
33 Correct 8 ms 5228 KB Output is correct
34 Correct 9 ms 5228 KB Output is correct
35 Correct 8 ms 5228 KB Output is correct
36 Correct 9 ms 5228 KB Output is correct
37 Correct 8 ms 5228 KB Output is correct
38 Correct 5 ms 5228 KB Output is correct
39 Correct 6 ms 5228 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 4 ms 5228 KB Output is correct
16 Correct 5 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct
19 Correct 4 ms 5100 KB Output is correct
20 Correct 4 ms 5100 KB Output is correct
21 Correct 4 ms 5100 KB Output is correct
22 Correct 4 ms 5100 KB Output is correct
23 Correct 4 ms 5100 KB Output is correct
24 Correct 4 ms 5120 KB Output is correct
25 Correct 5 ms 5100 KB Output is correct
26 Correct 4 ms 5100 KB Output is correct
27 Correct 4 ms 5100 KB Output is correct
28 Correct 9 ms 5228 KB Output is correct
29 Correct 9 ms 5228 KB Output is correct
30 Correct 8 ms 5228 KB Output is correct
31 Correct 8 ms 5248 KB Output is correct
32 Correct 9 ms 5308 KB Output is correct
33 Correct 8 ms 5228 KB Output is correct
34 Correct 9 ms 5228 KB Output is correct
35 Correct 8 ms 5228 KB Output is correct
36 Correct 9 ms 5228 KB Output is correct
37 Correct 8 ms 5228 KB Output is correct
38 Correct 5 ms 5228 KB Output is correct
39 Correct 6 ms 5228 KB Output is correct
40 Correct 334 ms 15596 KB Output is correct
41 Correct 364 ms 15720 KB Output is correct
42 Correct 340 ms 15340 KB Output is correct
43 Correct 443 ms 15464 KB Output is correct
44 Correct 258 ms 15592 KB Output is correct
45 Correct 481 ms 15208 KB Output is correct
46 Correct 341 ms 15208 KB Output is correct
47 Correct 362 ms 15340 KB Output is correct
48 Correct 316 ms 15080 KB Output is correct
49 Correct 246 ms 12780 KB Output is correct
50 Correct 85 ms 12652 KB Output is correct
51 Correct 197 ms 12524 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 4 ms 5228 KB Output is correct
16 Correct 5 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct
19 Correct 4 ms 5100 KB Output is correct
20 Correct 4 ms 5100 KB Output is correct
21 Correct 4 ms 5100 KB Output is correct
22 Correct 4 ms 5100 KB Output is correct
23 Correct 4 ms 5100 KB Output is correct
24 Correct 4 ms 5120 KB Output is correct
25 Correct 5 ms 5100 KB Output is correct
26 Correct 4 ms 5100 KB Output is correct
27 Correct 4 ms 5100 KB Output is correct
28 Correct 9 ms 5228 KB Output is correct
29 Correct 9 ms 5228 KB Output is correct
30 Correct 8 ms 5228 KB Output is correct
31 Correct 8 ms 5248 KB Output is correct
32 Correct 9 ms 5308 KB Output is correct
33 Correct 8 ms 5228 KB Output is correct
34 Correct 9 ms 5228 KB Output is correct
35 Correct 8 ms 5228 KB Output is correct
36 Correct 9 ms 5228 KB Output is correct
37 Correct 8 ms 5228 KB Output is correct
38 Correct 5 ms 5228 KB Output is correct
39 Correct 6 ms 5228 KB Output is correct
40 Correct 334 ms 15596 KB Output is correct
41 Correct 364 ms 15720 KB Output is correct
42 Correct 340 ms 15340 KB Output is correct
43 Correct 443 ms 15464 KB Output is correct
44 Correct 258 ms 15592 KB Output is correct
45 Correct 481 ms 15208 KB Output is correct
46 Correct 341 ms 15208 KB Output is correct
47 Correct 362 ms 15340 KB Output is correct
48 Correct 316 ms 15080 KB Output is correct
49 Correct 246 ms 12780 KB Output is correct
50 Correct 85 ms 12652 KB Output is correct
51 Correct 197 ms 12524 KB Output is correct
52 Correct 698 ms 16496 KB Output is correct
53 Correct 1004 ms 16740 KB Output is correct
54 Correct 1313 ms 16368 KB Output is correct
55 Correct 600 ms 16368 KB Output is correct
56 Correct 1095 ms 16108 KB Output is correct
57 Correct 1283 ms 15980 KB Output is correct
58 Correct 832 ms 16104 KB Output is correct
59 Correct 812 ms 13292 KB Output is correct