oj.uz

답안 #1038686

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1038686 2024-07-30T06:12:56 Z ibm2006 Two Dishes (JOI19_dishes) C++17
74 / 100
 3760 ms 299664 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll inf=1e18;
ll n,m,i,j,k,l,r,x,y,z,w,s,t,a[1100000],b[1100000],seg[2200000],lazy[2200000],c[1100000],d[1100000],cost[1100000],add_cost[1100000],dp[1100000];
ll sum1[1100000],range[1100000],sum2[1100000];
vector<ll> del_list[1100000];
set<pair<ll,ll>> chain;
pair<ll,ll> p,q;
pair<ll,ll> find_chain(ll x)
{
    pair<ll,ll> p=*(--chain.lower_bound(make_pair(x,inf)));
    return p;
}
void propagate(ll x,ll y,ll z)
{
    if(z<1048576)
    {
        lazy[z*2]+=lazy[z];
        lazy[z*2+1]+=lazy[z];
    }
    seg[z]+=lazy[z];
    lazy[z]=0;
}
void f(ll x,ll y,ll z,ll w)
{
    propagate(x,y,z);
    if(y<l||x>r)
        return;
    if(l<=x&&y<=r)
    {
        lazy[z]+=w;
        propagate(x,y,z);
        return;
    }
    f(x,(x+y)/2,z*2,w);
    f((x+y)/2+1,y,z*2+1,w);
    seg[z]=max(seg[z*2],seg[z*2+1]);
}
ll g(ll x,ll y,ll z)
{
    propagate(x,y,z);
    if(y<l||x>r)
    {
        return -inf;
    }
    if(l<=x&&y<=r)
    {
        return seg[z];
    }
    return max(g(x,(x+y)/2,z*2),g((x+y)/2+1,y,z*2+1));
}
void add(ll x,ll y,ll z)
{
    l=x+1;
    r=y+1;
    f(1,1048576,1,z);
}
ll get_val(ll x)
{
    l=x+1;
    r=x+1;
    return g(1,1048576,1);
}
void reconstruct_chain(ll x)
{
    pair<ll,ll> p=find_chain(x);
    while(chain.upper_bound(p)!=chain.end())
    {
        pair<ll,ll> q=(*chain.upper_bound(p));
        y=get_val(p.second);
        z=get_val(q.first);
        //printf("(%lld,%lld,%lld,%lld)\n",p.first,p.second,q.first,q.second);
        if(z<=y+cost[p.second])
        {
            add(q.first,q.second,y+cost[p.second]-z);
            chain.erase(p);
            chain.erase(q);
            chain.insert({p.first,q.second});
            p.second=q.second;
        }
        else
            return;
    }
}
void show()
{
    return;
    ll i;
    for(i=0;i<=m;i++)
        printf("%lld ",get_val(i));
    printf("\n");
}
int main()
{
    scanf("%lld %lld",&n,&m);
    for(i=1;i<=n;i++)
    {
        scanf("%lld %lld %lld",&a[i],&c[i],&add_cost[i]);
        sum1[i]=sum1[i-1]+a[i];
    }
    for(i=1;i<=m;i++)
    {
        scanf("%lld %lld %lld",&b[i],&d[i],&cost[i-1]);
        sum2[i]=sum2[i-1]+b[i];
    }
    for(i=1;i<=n;i++)
    {
        range[i]=upper_bound(sum2,sum2+m+1,c[i]-sum1[i])-sum2-1;
        //printf("(%lld) ",range[i]);
    }
    //printf("\n");
    for(i=1;i<=m;i++)
    {
        x=upper_bound(sum1,sum1+n+1,d[i]-sum2[i])-sum1;
        del_list[x].push_back(i-1);
        //printf("(%lld)",x);
    }
    //printf("\n");
    for(auto xx:del_list[0])
    {
        cost[xx]=0;
    }
    for(i=1;i<=m;i++)
    {
        dp[i]=dp[i-1]+cost[i-1];
    }
    for(i=0;i<=m;i++)
    {
        add(i,i,dp[i]);
    }
    /*for(i=0;i<=m;i++)
    {
        printf("(%lld)",cost[i]);
    }
    printf("\n");
    */chain.insert({0,m});
    for(i=1;i<=n;i++)
    {show();
        for(auto xx:del_list[i])
        {
            //printf("{%lld}\n",xx);
            if(cost[xx]>0)
            {
                p=find_chain(xx);
            chain.erase(p);
            chain.insert({p.first,xx});
            if(xx+1<=p.second)
            chain.insert({xx+1,p.second});
            cost[xx]=0;
            }
            else
            {
                p=find_chain(xx);
                add(xx+1,p.second,-cost[xx]);
                cost[xx]=0;
            reconstruct_chain(xx);
            }
        }
        x=range[i];
        p=find_chain(x);
        if(x==-1)
            continue;
        if(add_cost[i]>0)
        {
            add(0,p.second,add_cost[i]);
            //printf("[%lld,%lld]\n",x,cost[x]);
        reconstruct_chain(x);
        }
        else
        {
            chain.erase(p);
            chain.insert({p.first,x});
            if(x+1<=p.second)
            chain.insert({x+1,p.second});
            add(0,x,add_cost[i]);
            reconstruct_chain(x);
        }
    }
    s=-inf;
    show();
    for(i=m;i<=m;i++)
    {
        s=max(s,get_val(i));
    }
    printf("%lld",s);
}

Compilation message

dishes.cpp: In function 'int main()':
dishes.cpp:96:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   96 |     scanf("%lld %lld",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
dishes.cpp:99:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   99 |         scanf("%lld %lld %lld",&a[i],&c[i],&add_cost[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dishes.cpp:104:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  104 |         scanf("%lld %lld %lld",&b[i],&d[i],&cost[i-1]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 330 ms 77016 KB Output is correct
2 Correct 356 ms 65908 KB Output is correct
3 Correct 190 ms 63248 KB Output is correct
4 Correct 335 ms 73720 KB Output is correct
5 Correct 11 ms 26456 KB Output is correct
6 Correct 388 ms 64616 KB Output is correct
7 Correct 107 ms 49084 KB Output is correct
8 Correct 113 ms 41300 KB Output is correct
9 Correct 206 ms 64188 KB Output is correct
10 Correct 430 ms 62036 KB Output is correct
11 Correct 172 ms 57788 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 26460 KB Output is correct
2 Correct 10 ms 26460 KB Output is correct
3 Correct 10 ms 26436 KB Output is correct
4 Correct 12 ms 26460 KB Output is correct
5 Correct 10 ms 26460 KB Output is correct
6 Correct 11 ms 26460 KB Output is correct
7 Correct 11 ms 26460 KB Output is correct
8 Correct 11 ms 26460 KB Output is correct
9 Correct 11 ms 26256 KB Output is correct
10 Correct 10 ms 26712 KB Output is correct
11 Correct 11 ms 26460 KB Output is correct
12 Correct 9 ms 26460 KB Output is correct
13 Correct 12 ms 26460 KB Output is correct
14 Correct 11 ms 26460 KB Output is correct
15 Correct 10 ms 26456 KB Output is correct
16 Correct 14 ms 26456 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 26460 KB Output is correct
2 Correct 10 ms 26460 KB Output is correct
3 Correct 10 ms 26436 KB Output is correct
4 Correct 12 ms 26460 KB Output is correct
5 Correct 10 ms 26460 KB Output is correct
6 Correct 11 ms 26460 KB Output is correct
7 Correct 11 ms 26460 KB Output is correct
8 Correct 11 ms 26460 KB Output is correct
9 Correct 11 ms 26256 KB Output is correct
10 Correct 10 ms 26712 KB Output is correct
11 Correct 11 ms 26460 KB Output is correct
12 Correct 9 ms 26460 KB Output is correct
13 Correct 12 ms 26460 KB Output is correct
14 Correct 11 ms 26460 KB Output is correct
15 Correct 10 ms 26456 KB Output is correct
16 Correct 14 ms 26456 KB Output is correct
17 Correct 12 ms 26624 KB Output is correct
18 Correct 12 ms 26804 KB Output is correct
19 Correct 16 ms 26716 KB Output is correct
20 Correct 14 ms 26744 KB Output is correct
21 Correct 18 ms 26968 KB Output is correct
22 Correct 15 ms 26716 KB Output is correct
23 Correct 16 ms 26696 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 26460 KB Output is correct
2 Correct 10 ms 26460 KB Output is correct
3 Correct 10 ms 26436 KB Output is correct
4 Correct 12 ms 26460 KB Output is correct
5 Correct 10 ms 26460 KB Output is correct
6 Correct 11 ms 26460 KB Output is correct
7 Correct 11 ms 26460 KB Output is correct
8 Correct 11 ms 26460 KB Output is correct
9 Correct 11 ms 26256 KB Output is correct
10 Correct 10 ms 26712 KB Output is correct
11 Correct 11 ms 26460 KB Output is correct
12 Correct 9 ms 26460 KB Output is correct
13 Correct 12 ms 26460 KB Output is correct
14 Correct 11 ms 26460 KB Output is correct
15 Correct 10 ms 26456 KB Output is correct
16 Correct 14 ms 26456 KB Output is correct
17 Correct 12 ms 26624 KB Output is correct
18 Correct 12 ms 26804 KB Output is correct
19 Correct 16 ms 26716 KB Output is correct
20 Correct 14 ms 26744 KB Output is correct
21 Correct 18 ms 26968 KB Output is correct
22 Correct 15 ms 26716 KB Output is correct
23 Correct 16 ms 26696 KB Output is correct
24 Correct 185 ms 60652 KB Output is correct
25 Correct 298 ms 72896 KB Output is correct
26 Correct 194 ms 60724 KB Output is correct
27 Correct 289 ms 77648 KB Output is correct
28 Correct 309 ms 61632 KB Output is correct
29 Correct 184 ms 61120 KB Output is correct
30 Correct 635 ms 63180 KB Output is correct
31 Correct 147 ms 53356 KB Output is correct
32 Correct 102 ms 39464 KB Output is correct
33 Correct 405 ms 62032 KB Output is correct
34 Correct 423 ms 66756 KB Output is correct
35 Correct 591 ms 56912 KB Output is correct
36 Correct 588 ms 56912 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 26460 KB Output is correct
2 Correct 10 ms 26460 KB Output is correct
3 Correct 10 ms 26436 KB Output is correct
4 Correct 12 ms 26460 KB Output is correct
5 Correct 10 ms 26460 KB Output is correct
6 Correct 11 ms 26460 KB Output is correct
7 Correct 11 ms 26460 KB Output is correct
8 Correct 11 ms 26460 KB Output is correct
9 Correct 11 ms 26256 KB Output is correct
10 Correct 10 ms 26712 KB Output is correct
11 Correct 11 ms 26460 KB Output is correct
12 Correct 9 ms 26460 KB Output is correct
13 Correct 12 ms 26460 KB Output is correct
14 Correct 11 ms 26460 KB Output is correct
15 Correct 10 ms 26456 KB Output is correct
16 Correct 14 ms 26456 KB Output is correct
17 Correct 12 ms 26624 KB Output is correct
18 Correct 12 ms 26804 KB Output is correct
19 Correct 16 ms 26716 KB Output is correct
20 Correct 14 ms 26744 KB Output is correct
21 Correct 18 ms 26968 KB Output is correct
22 Correct 15 ms 26716 KB Output is correct
23 Correct 16 ms 26696 KB Output is correct
24 Correct 185 ms 60652 KB Output is correct
25 Correct 298 ms 72896 KB Output is correct
26 Correct 194 ms 60724 KB Output is correct
27 Correct 289 ms 77648 KB Output is correct
28 Correct 309 ms 61632 KB Output is correct
29 Correct 184 ms 61120 KB Output is correct
30 Correct 635 ms 63180 KB Output is correct
31 Correct 147 ms 53356 KB Output is correct
32 Correct 102 ms 39464 KB Output is correct
33 Correct 405 ms 62032 KB Output is correct
34 Correct 423 ms 66756 KB Output is correct
35 Correct 591 ms 56912 KB Output is correct
36 Correct 588 ms 56912 KB Output is correct
37 Correct 200 ms 63568 KB Output is correct
38 Correct 318 ms 80720 KB Output is correct
39 Correct 565 ms 77996 KB Output is correct
40 Correct 396 ms 65464 KB Output is correct
41 Correct 12 ms 26456 KB Output is correct
42 Correct 751 ms 66448 KB Output is correct
43 Correct 441 ms 64704 KB Output is correct
44 Correct 530 ms 69516 KB Output is correct
45 Correct 646 ms 59888 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 26460 KB Output is correct
2 Correct 10 ms 26460 KB Output is correct
3 Correct 10 ms 26436 KB Output is correct
4 Correct 12 ms 26460 KB Output is correct
5 Correct 10 ms 26460 KB Output is correct
6 Correct 11 ms 26460 KB Output is correct
7 Correct 11 ms 26460 KB Output is correct
8 Correct 11 ms 26460 KB Output is correct
9 Correct 11 ms 26256 KB Output is correct
10 Correct 10 ms 26712 KB Output is correct
11 Correct 11 ms 26460 KB Output is correct
12 Correct 9 ms 26460 KB Output is correct
13 Correct 12 ms 26460 KB Output is correct
14 Correct 11 ms 26460 KB Output is correct
15 Correct 10 ms 26456 KB Output is correct
16 Correct 14 ms 26456 KB Output is correct
17 Correct 12 ms 26624 KB Output is correct
18 Correct 12 ms 26804 KB Output is correct
19 Correct 16 ms 26716 KB Output is correct
20 Correct 14 ms 26744 KB Output is correct
21 Correct 18 ms 26968 KB Output is correct
22 Correct 15 ms 26716 KB Output is correct
23 Correct 16 ms 26696 KB Output is correct
24 Correct 185 ms 60652 KB Output is correct
25 Correct 298 ms 72896 KB Output is correct
26 Correct 194 ms 60724 KB Output is correct
27 Correct 289 ms 77648 KB Output is correct
28 Correct 309 ms 61632 KB Output is correct
29 Correct 184 ms 61120 KB Output is correct
30 Correct 635 ms 63180 KB Output is correct
31 Correct 147 ms 53356 KB Output is correct
32 Correct 102 ms 39464 KB Output is correct
33 Correct 405 ms 62032 KB Output is correct
34 Correct 423 ms 66756 KB Output is correct
35 Correct 591 ms 56912 KB Output is correct
36 Correct 588 ms 56912 KB Output is correct
37 Correct 200 ms 63568 KB Output is correct
38 Correct 318 ms 80720 KB Output is correct
39 Correct 565 ms 77996 KB Output is correct
40 Correct 396 ms 65464 KB Output is correct
41 Correct 12 ms 26456 KB Output is correct
42 Correct 751 ms 66448 KB Output is correct
43 Correct 441 ms 64704 KB Output is correct
44 Correct 530 ms 69516 KB Output is correct
45 Correct 646 ms 59888 KB Output is correct
46 Correct 949 ms 213908 KB Output is correct
47 Correct 1517 ms 299664 KB Output is correct
48 Correct 3039 ms 286032 KB Output is correct
49 Correct 1934 ms 223588 KB Output is correct
50 Correct 3738 ms 227152 KB Output is correct
51 Correct 2156 ms 216504 KB Output is correct
52 Correct 2512 ms 235020 KB Output is correct
53 Correct 3760 ms 195744 KB Output is correct

Subtask #7
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 330 ms 77016 KB Output is correct
2 Correct 356 ms 65908 KB Output is correct
3 Correct 190 ms 63248 KB Output is correct
4 Correct 335 ms 73720 KB Output is correct
5 Correct 11 ms 26456 KB Output is correct
6 Correct 388 ms 64616 KB Output is correct
7 Correct 107 ms 49084 KB Output is correct
8 Correct 113 ms 41300 KB Output is correct
9 Correct 206 ms 64188 KB Output is correct
10 Correct 430 ms 62036 KB Output is correct
11 Correct 172 ms 57788 KB Output is correct
12 Correct 11 ms 26460 KB Output is correct
13 Correct 10 ms 26460 KB Output is correct
14 Correct 10 ms 26436 KB Output is correct
15 Correct 12 ms 26460 KB Output is correct
16 Correct 10 ms 26460 KB Output is correct
17 Correct 11 ms 26460 KB Output is correct
18 Correct 11 ms 26460 KB Output is correct
19 Correct 11 ms 26460 KB Output is correct
20 Correct 11 ms 26256 KB Output is correct
21 Correct 10 ms 26712 KB Output is correct
22 Correct 11 ms 26460 KB Output is correct
23 Correct 9 ms 26460 KB Output is correct
24 Correct 12 ms 26460 KB Output is correct
25 Correct 11 ms 26460 KB Output is correct
26 Correct 10 ms 26456 KB Output is correct
27 Correct 14 ms 26456 KB Output is correct
28 Correct 12 ms 26624 KB Output is correct
29 Correct 12 ms 26804 KB Output is correct
30 Correct 16 ms 26716 KB Output is correct
31 Correct 14 ms 26744 KB Output is correct
32 Correct 18 ms 26968 KB Output is correct
33 Correct 15 ms 26716 KB Output is correct
34 Correct 16 ms 26696 KB Output is correct
35 Correct 185 ms 60652 KB Output is correct
36 Correct 298 ms 72896 KB Output is correct
37 Correct 194 ms 60724 KB Output is correct
38 Correct 289 ms 77648 KB Output is correct
39 Correct 309 ms 61632 KB Output is correct
40 Correct 184 ms 61120 KB Output is correct
41 Correct 635 ms 63180 KB Output is correct
42 Correct 147 ms 53356 KB Output is correct
43 Correct 102 ms 39464 KB Output is correct
44 Correct 405 ms 62032 KB Output is correct
45 Correct 423 ms 66756 KB Output is correct
46 Correct 591 ms 56912 KB Output is correct
47 Correct 588 ms 56912 KB Output is correct
48 Correct 200 ms 63568 KB Output is correct
49 Correct 318 ms 80720 KB Output is correct
50 Correct 565 ms 77996 KB Output is correct
51 Correct 396 ms 65464 KB Output is correct
52 Correct 12 ms 26456 KB Output is correct
53 Correct 751 ms 66448 KB Output is correct
54 Correct 441 ms 64704 KB Output is correct
55 Correct 530 ms 69516 KB Output is correct
56 Correct 646 ms 59888 KB Output is correct
57 Correct 471 ms 76396 KB Output is correct
58 Correct 265 ms 68688 KB Output is correct
59 Incorrect 381 ms 66464 KB Output isn't correct
60 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 330 ms 77016 KB Output is correct
2 Correct 356 ms 65908 KB Output is correct
3 Correct 190 ms 63248 KB Output is correct
4 Correct 335 ms 73720 KB Output is correct
5 Correct 11 ms 26456 KB Output is correct
6 Correct 388 ms 64616 KB Output is correct
7 Correct 107 ms 49084 KB Output is correct
8 Correct 113 ms 41300 KB Output is correct
9 Correct 206 ms 64188 KB Output is correct
10 Correct 430 ms 62036 KB Output is correct
11 Correct 172 ms 57788 KB Output is correct
12 Correct 11 ms 26460 KB Output is correct
13 Correct 10 ms 26460 KB Output is correct
14 Correct 10 ms 26436 KB Output is correct
15 Correct 12 ms 26460 KB Output is correct
16 Correct 10 ms 26460 KB Output is correct
17 Correct 11 ms 26460 KB Output is correct
18 Correct 11 ms 26460 KB Output is correct
19 Correct 11 ms 26460 KB Output is correct
20 Correct 11 ms 26256 KB Output is correct
21 Correct 10 ms 26712 KB Output is correct
22 Correct 11 ms 26460 KB Output is correct
23 Correct 9 ms 26460 KB Output is correct
24 Correct 12 ms 26460 KB Output is correct
25 Correct 11 ms 26460 KB Output is correct
26 Correct 10 ms 26456 KB Output is correct
27 Correct 14 ms 26456 KB Output is correct
28 Correct 12 ms 26624 KB Output is correct
29 Correct 12 ms 26804 KB Output is correct
30 Correct 16 ms 26716 KB Output is correct
31 Correct 14 ms 26744 KB Output is correct
32 Correct 18 ms 26968 KB Output is correct
33 Correct 15 ms 26716 KB Output is correct
34 Correct 16 ms 26696 KB Output is correct
35 Correct 185 ms 60652 KB Output is correct
36 Correct 298 ms 72896 KB Output is correct
37 Correct 194 ms 60724 KB Output is correct
38 Correct 289 ms 77648 KB Output is correct
39 Correct 309 ms 61632 KB Output is correct
40 Correct 184 ms 61120 KB Output is correct
41 Correct 635 ms 63180 KB Output is correct
42 Correct 147 ms 53356 KB Output is correct
43 Correct 102 ms 39464 KB Output is correct
44 Correct 405 ms 62032 KB Output is correct
45 Correct 423 ms 66756 KB Output is correct
46 Correct 591 ms 56912 KB Output is correct
47 Correct 588 ms 56912 KB Output is correct
48 Correct 200 ms 63568 KB Output is correct
49 Correct 318 ms 80720 KB Output is correct
50 Correct 565 ms 77996 KB Output is correct
51 Correct 396 ms 65464 KB Output is correct
52 Correct 12 ms 26456 KB Output is correct
53 Correct 751 ms 66448 KB Output is correct
54 Correct 441 ms 64704 KB Output is correct
55 Correct 530 ms 69516 KB Output is correct
56 Correct 646 ms 59888 KB Output is correct
57 Correct 949 ms 213908 KB Output is correct
58 Correct 1517 ms 299664 KB Output is correct
59 Correct 3039 ms 286032 KB Output is correct
60 Correct 1934 ms 223588 KB Output is correct
61 Correct 3738 ms 227152 KB Output is correct
62 Correct 2156 ms 216504 KB Output is correct
63 Correct 2512 ms 235020 KB Output is correct
64 Correct 3760 ms 195744 KB Output is correct
65 Correct 471 ms 76396 KB Output is correct
66 Correct 265 ms 68688 KB Output is correct
67 Incorrect 381 ms 66464 KB Output isn't correct
68 Halted 0 ms 0 KB -