oj.uz

Submission #1038825

# Submission time Handle Problem Language Result Execution time Memory
1038825 2024-07-30T08:03:31 Z ibm2006 Two Dishes (JOI19_dishes) C++17
100 / 100
 6597 ms 282196 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,t,range[1100000];
ll sum1[1100000],sum2[1100000],dp[1100000],add_cost[1100000],cost[1100000],c[1100000],d[1100000],seg[2200000],lazy[2200000],a[1100000],b[1100000],s;
vector<int> del_list[1100000],v;
set<pair<int,int>> chain;
pair<ll,ll> p,q;
pair<int,int> find_chain(int x)
{
    pair<int,int> p=*(--chain.lower_bound(make_pair(x,m+10)));
    return p;
}
void propagate(int x,int y,int z)
{
    if(z<1048576)
    {
        lazy[z*2]+=lazy[z];
        lazy[z*2+1]+=lazy[z];
    }
    seg[z]+=lazy[z];
    lazy[z]=0;
}
void f(int x,int y,int 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(int x,int y,int 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(int x,int y,ll z)
{
    l=x+1;
    r=y+1;
    f(1,1048576,1,z);
}
ll get_val(int x)
{
    l=x+1;
    r=x+1;
    return g(1,1048576,1);
}
void reconstruct_chain(int x)
{
    pair<int,int> p=find_chain(x);
    while(chain.upper_bound(p)!=chain.end())
    {
        pair<int,int> 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("%d %d",&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();
    v.clear();
        for(auto xx:del_list[i])
        {
            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;
            v.push_back(xx);
        }
        x=range[i];
        p=find_chain(x);
        if(x>=0)
        {
            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]);
        v.push_back(x);
        }
        sort(v.begin(),v.end());
        for(j=0;j<v.size();j++)
            reconstruct_chain(v[j]);
    }
    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:13: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'll*' {aka 'long long int*'} [-Wformat=]
   96 |     scanf("%d %d",&n,&m);
      |            ~^     ~~
      |             |     |
      |             int*  ll* {aka long long int*}
      |            %lld
dishes.cpp:96:16: warning: format '%d' expects argument of type 'int*', but argument 3 has type 'll*' {aka 'long long int*'} [-Wformat=]
   96 |     scanf("%d %d",&n,&m);
      |               ~^     ~~
      |                |     |
      |                int*  ll* {aka long long int*}
      |               %lld
dishes.cpp:163:18: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  163 |         for(j=0;j<v.size();j++)
      |                 ~^~~~~~~~~
dishes.cpp:96:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   96 |     scanf("%d %d",&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

# Verdict Execution time Memory Grader output
1 Correct 446 ms 72788 KB Output is correct
2 Correct 410 ms 65532 KB Output is correct
3 Correct 217 ms 62400 KB Output is correct
4 Correct 429 ms 71376 KB Output is correct
5 Correct 11 ms 26456 KB Output is correct
6 Correct 451 ms 63796 KB Output is correct
7 Correct 108 ms 48156 KB Output is correct
8 Correct 107 ms 41044 KB Output is correct
9 Correct 205 ms 63520 KB Output is correct
10 Correct 522 ms 61840 KB Output is correct
11 Correct 180 ms 57056 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 26460 KB Output is correct
2 Correct 11 ms 26280 KB Output is correct
3 Correct 11 ms 26456 KB Output is correct
4 Correct 11 ms 26280 KB Output is correct
5 Correct 10 ms 26460 KB Output is correct
6 Correct 10 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 26432 KB Output is correct
10 Correct 11 ms 26460 KB Output is correct
11 Correct 11 ms 26308 KB Output is correct
12 Correct 10 ms 26488 KB Output is correct
13 Correct 11 ms 26460 KB Output is correct
14 Correct 11 ms 26276 KB Output is correct
15 Correct 11 ms 26460 KB Output is correct
16 Correct 11 ms 26460 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 26460 KB Output is correct
2 Correct 11 ms 26280 KB Output is correct
3 Correct 11 ms 26456 KB Output is correct
4 Correct 11 ms 26280 KB Output is correct
5 Correct 10 ms 26460 KB Output is correct
6 Correct 10 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 26432 KB Output is correct
10 Correct 11 ms 26460 KB Output is correct
11 Correct 11 ms 26308 KB Output is correct
12 Correct 10 ms 26488 KB Output is correct
13 Correct 11 ms 26460 KB Output is correct
14 Correct 11 ms 26276 KB Output is correct
15 Correct 11 ms 26460 KB Output is correct
16 Correct 11 ms 26460 KB Output is correct
17 Correct 14 ms 26716 KB Output is correct
18 Correct 14 ms 26712 KB Output is correct
19 Correct 18 ms 26840 KB Output is correct
20 Correct 15 ms 26716 KB Output is correct
21 Correct 17 ms 26716 KB Output is correct
22 Correct 18 ms 26716 KB Output is correct
23 Correct 18 ms 26652 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 26460 KB Output is correct
2 Correct 11 ms 26280 KB Output is correct
3 Correct 11 ms 26456 KB Output is correct
4 Correct 11 ms 26280 KB Output is correct
5 Correct 10 ms 26460 KB Output is correct
6 Correct 10 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 26432 KB Output is correct
10 Correct 11 ms 26460 KB Output is correct
11 Correct 11 ms 26308 KB Output is correct
12 Correct 10 ms 26488 KB Output is correct
13 Correct 11 ms 26460 KB Output is correct
14 Correct 11 ms 26276 KB Output is correct
15 Correct 11 ms 26460 KB Output is correct
16 Correct 11 ms 26460 KB Output is correct
17 Correct 14 ms 26716 KB Output is correct
18 Correct 14 ms 26712 KB Output is correct
19 Correct 18 ms 26840 KB Output is correct
20 Correct 15 ms 26716 KB Output is correct
21 Correct 17 ms 26716 KB Output is correct
22 Correct 18 ms 26716 KB Output is correct
23 Correct 18 ms 26652 KB Output is correct
24 Correct 377 ms 59188 KB Output is correct
25 Correct 414 ms 69316 KB Output is correct
26 Correct 385 ms 59076 KB Output is correct
27 Correct 441 ms 73808 KB Output is correct
28 Correct 397 ms 60188 KB Output is correct
29 Correct 191 ms 59588 KB Output is correct
30 Correct 942 ms 62056 KB Output is correct
31 Correct 205 ms 51212 KB Output is correct
32 Correct 172 ms 39052 KB Output is correct
33 Correct 578 ms 60876 KB Output is correct
34 Correct 706 ms 64212 KB Output is correct
35 Correct 999 ms 56712 KB Output is correct
36 Correct 960 ms 56648 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 26460 KB Output is correct
2 Correct 11 ms 26280 KB Output is correct
3 Correct 11 ms 26456 KB Output is correct
4 Correct 11 ms 26280 KB Output is correct
5 Correct 10 ms 26460 KB Output is correct
6 Correct 10 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 26432 KB Output is correct
10 Correct 11 ms 26460 KB Output is correct
11 Correct 11 ms 26308 KB Output is correct
12 Correct 10 ms 26488 KB Output is correct
13 Correct 11 ms 26460 KB Output is correct
14 Correct 11 ms 26276 KB Output is correct
15 Correct 11 ms 26460 KB Output is correct
16 Correct 11 ms 26460 KB Output is correct
17 Correct 14 ms 26716 KB Output is correct
18 Correct 14 ms 26712 KB Output is correct
19 Correct 18 ms 26840 KB Output is correct
20 Correct 15 ms 26716 KB Output is correct
21 Correct 17 ms 26716 KB Output is correct
22 Correct 18 ms 26716 KB Output is correct
23 Correct 18 ms 26652 KB Output is correct
24 Correct 377 ms 59188 KB Output is correct
25 Correct 414 ms 69316 KB Output is correct
26 Correct 385 ms 59076 KB Output is correct
27 Correct 441 ms 73808 KB Output is correct
28 Correct 397 ms 60188 KB Output is correct
29 Correct 191 ms 59588 KB Output is correct
30 Correct 942 ms 62056 KB Output is correct
31 Correct 205 ms 51212 KB Output is correct
32 Correct 172 ms 39052 KB Output is correct
33 Correct 578 ms 60876 KB Output is correct
34 Correct 706 ms 64212 KB Output is correct
35 Correct 999 ms 56712 KB Output is correct
36 Correct 960 ms 56648 KB Output is correct
37 Correct 372 ms 62084 KB Output is correct
38 Correct 407 ms 77652 KB Output is correct
39 Correct 707 ms 74812 KB Output is correct
40 Correct 491 ms 65512 KB Output is correct
41 Correct 11 ms 26460 KB Output is correct
42 Correct 1037 ms 66080 KB Output is correct
43 Correct 585 ms 64200 KB Output is correct
44 Correct 706 ms 67668 KB Output is correct
45 Correct 994 ms 59572 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 26460 KB Output is correct
2 Correct 11 ms 26280 KB Output is correct
3 Correct 11 ms 26456 KB Output is correct
4 Correct 11 ms 26280 KB Output is correct
5 Correct 10 ms 26460 KB Output is correct
6 Correct 10 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 26432 KB Output is correct
10 Correct 11 ms 26460 KB Output is correct
11 Correct 11 ms 26308 KB Output is correct
12 Correct 10 ms 26488 KB Output is correct
13 Correct 11 ms 26460 KB Output is correct
14 Correct 11 ms 26276 KB Output is correct
15 Correct 11 ms 26460 KB Output is correct
16 Correct 11 ms 26460 KB Output is correct
17 Correct 14 ms 26716 KB Output is correct
18 Correct 14 ms 26712 KB Output is correct
19 Correct 18 ms 26840 KB Output is correct
20 Correct 15 ms 26716 KB Output is correct
21 Correct 17 ms 26716 KB Output is correct
22 Correct 18 ms 26716 KB Output is correct
23 Correct 18 ms 26652 KB Output is correct
24 Correct 377 ms 59188 KB Output is correct
25 Correct 414 ms 69316 KB Output is correct
26 Correct 385 ms 59076 KB Output is correct
27 Correct 441 ms 73808 KB Output is correct
28 Correct 397 ms 60188 KB Output is correct
29 Correct 191 ms 59588 KB Output is correct
30 Correct 942 ms 62056 KB Output is correct
31 Correct 205 ms 51212 KB Output is correct
32 Correct 172 ms 39052 KB Output is correct
33 Correct 578 ms 60876 KB Output is correct
34 Correct 706 ms 64212 KB Output is correct
35 Correct 999 ms 56712 KB Output is correct
36 Correct 960 ms 56648 KB Output is correct
37 Correct 372 ms 62084 KB Output is correct
38 Correct 407 ms 77652 KB Output is correct
39 Correct 707 ms 74812 KB Output is correct
40 Correct 491 ms 65512 KB Output is correct
41 Correct 11 ms 26460 KB Output is correct
42 Correct 1037 ms 66080 KB Output is correct
43 Correct 585 ms 64200 KB Output is correct
44 Correct 706 ms 67668 KB Output is correct
45 Correct 994 ms 59572 KB Output is correct
46 Correct 1785 ms 207992 KB Output is correct
47 Correct 2211 ms 282196 KB Output is correct
48 Correct 3752 ms 269108 KB Output is correct
49 Correct 2373 ms 220772 KB Output is correct
50 Correct 5749 ms 222192 KB Output is correct
51 Correct 3185 ms 210628 KB Output is correct
52 Correct 3895 ms 222692 KB Output is correct
53 Correct 5504 ms 192792 KB Output is correct

Subtask #7
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 446 ms 72788 KB Output is correct
2 Correct 410 ms 65532 KB Output is correct
3 Correct 217 ms 62400 KB Output is correct
4 Correct 429 ms 71376 KB Output is correct
5 Correct 11 ms 26456 KB Output is correct
6 Correct 451 ms 63796 KB Output is correct
7 Correct 108 ms 48156 KB Output is correct
8 Correct 107 ms 41044 KB Output is correct
9 Correct 205 ms 63520 KB Output is correct
10 Correct 522 ms 61840 KB Output is correct
11 Correct 180 ms 57056 KB Output is correct
12 Correct 11 ms 26460 KB Output is correct
13 Correct 11 ms 26280 KB Output is correct
14 Correct 11 ms 26456 KB Output is correct
15 Correct 11 ms 26280 KB Output is correct
16 Correct 10 ms 26460 KB Output is correct
17 Correct 10 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 26432 KB Output is correct
21 Correct 11 ms 26460 KB Output is correct
22 Correct 11 ms 26308 KB Output is correct
23 Correct 10 ms 26488 KB Output is correct
24 Correct 11 ms 26460 KB Output is correct
25 Correct 11 ms 26276 KB Output is correct
26 Correct 11 ms 26460 KB Output is correct
27 Correct 11 ms 26460 KB Output is correct
28 Correct 14 ms 26716 KB Output is correct
29 Correct 14 ms 26712 KB Output is correct
30 Correct 18 ms 26840 KB Output is correct
31 Correct 15 ms 26716 KB Output is correct
32 Correct 17 ms 26716 KB Output is correct
33 Correct 18 ms 26716 KB Output is correct
34 Correct 18 ms 26652 KB Output is correct
35 Correct 377 ms 59188 KB Output is correct
36 Correct 414 ms 69316 KB Output is correct
37 Correct 385 ms 59076 KB Output is correct
38 Correct 441 ms 73808 KB Output is correct
39 Correct 397 ms 60188 KB Output is correct
40 Correct 191 ms 59588 KB Output is correct
41 Correct 942 ms 62056 KB Output is correct
42 Correct 205 ms 51212 KB Output is correct
43 Correct 172 ms 39052 KB Output is correct
44 Correct 578 ms 60876 KB Output is correct
45 Correct 706 ms 64212 KB Output is correct
46 Correct 999 ms 56712 KB Output is correct
47 Correct 960 ms 56648 KB Output is correct
48 Correct 372 ms 62084 KB Output is correct
49 Correct 407 ms 77652 KB Output is correct
50 Correct 707 ms 74812 KB Output is correct
51 Correct 491 ms 65512 KB Output is correct
52 Correct 11 ms 26460 KB Output is correct
53 Correct 1037 ms 66080 KB Output is correct
54 Correct 585 ms 64200 KB Output is correct
55 Correct 706 ms 67668 KB Output is correct
56 Correct 994 ms 59572 KB Output is correct
57 Correct 398 ms 72640 KB Output is correct
58 Correct 357 ms 68688 KB Output is correct
59 Correct 485 ms 66496 KB Output is correct
60 Correct 702 ms 75348 KB Output is correct
61 Correct 695 ms 62808 KB Output is correct
62 Correct 11 ms 26712 KB Output is correct
63 Correct 1031 ms 65960 KB Output is correct
64 Correct 593 ms 63756 KB Output is correct
65 Correct 878 ms 64432 KB Output is correct
66 Correct 971 ms 59900 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 446 ms 72788 KB Output is correct
2 Correct 410 ms 65532 KB Output is correct
3 Correct 217 ms 62400 KB Output is correct
4 Correct 429 ms 71376 KB Output is correct
5 Correct 11 ms 26456 KB Output is correct
6 Correct 451 ms 63796 KB Output is correct
7 Correct 108 ms 48156 KB Output is correct
8 Correct 107 ms 41044 KB Output is correct
9 Correct 205 ms 63520 KB Output is correct
10 Correct 522 ms 61840 KB Output is correct
11 Correct 180 ms 57056 KB Output is correct
12 Correct 11 ms 26460 KB Output is correct
13 Correct 11 ms 26280 KB Output is correct
14 Correct 11 ms 26456 KB Output is correct
15 Correct 11 ms 26280 KB Output is correct
16 Correct 10 ms 26460 KB Output is correct
17 Correct 10 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 26432 KB Output is correct
21 Correct 11 ms 26460 KB Output is correct
22 Correct 11 ms 26308 KB Output is correct
23 Correct 10 ms 26488 KB Output is correct
24 Correct 11 ms 26460 KB Output is correct
25 Correct 11 ms 26276 KB Output is correct
26 Correct 11 ms 26460 KB Output is correct
27 Correct 11 ms 26460 KB Output is correct
28 Correct 14 ms 26716 KB Output is correct
29 Correct 14 ms 26712 KB Output is correct
30 Correct 18 ms 26840 KB Output is correct
31 Correct 15 ms 26716 KB Output is correct
32 Correct 17 ms 26716 KB Output is correct
33 Correct 18 ms 26716 KB Output is correct
34 Correct 18 ms 26652 KB Output is correct
35 Correct 377 ms 59188 KB Output is correct
36 Correct 414 ms 69316 KB Output is correct
37 Correct 385 ms 59076 KB Output is correct
38 Correct 441 ms 73808 KB Output is correct
39 Correct 397 ms 60188 KB Output is correct
40 Correct 191 ms 59588 KB Output is correct
41 Correct 942 ms 62056 KB Output is correct
42 Correct 205 ms 51212 KB Output is correct
43 Correct 172 ms 39052 KB Output is correct
44 Correct 578 ms 60876 KB Output is correct
45 Correct 706 ms 64212 KB Output is correct
46 Correct 999 ms 56712 KB Output is correct
47 Correct 960 ms 56648 KB Output is correct
48 Correct 372 ms 62084 KB Output is correct
49 Correct 407 ms 77652 KB Output is correct
50 Correct 707 ms 74812 KB Output is correct
51 Correct 491 ms 65512 KB Output is correct
52 Correct 11 ms 26460 KB Output is correct
53 Correct 1037 ms 66080 KB Output is correct
54 Correct 585 ms 64200 KB Output is correct
55 Correct 706 ms 67668 KB Output is correct
56 Correct 994 ms 59572 KB Output is correct
57 Correct 1785 ms 207992 KB Output is correct
58 Correct 2211 ms 282196 KB Output is correct
59 Correct 3752 ms 269108 KB Output is correct
60 Correct 2373 ms 220772 KB Output is correct
61 Correct 5749 ms 222192 KB Output is correct
62 Correct 3185 ms 210628 KB Output is correct
63 Correct 3895 ms 222692 KB Output is correct
64 Correct 5504 ms 192792 KB Output is correct
65 Correct 398 ms 72640 KB Output is correct
66 Correct 357 ms 68688 KB Output is correct
67 Correct 485 ms 66496 KB Output is correct
68 Correct 702 ms 75348 KB Output is correct
69 Correct 695 ms 62808 KB Output is correct
70 Correct 11 ms 26712 KB Output is correct
71 Correct 1031 ms 65960 KB Output is correct
72 Correct 593 ms 63756 KB Output is correct
73 Correct 878 ms 64432 KB Output is correct
74 Correct 971 ms 59900 KB Output is correct
75 Correct 2060 ms 255056 KB Output is correct
76 Correct 1690 ms 234836 KB Output is correct
77 Correct 2369 ms 222976 KB Output is correct
78 Correct 3623 ms 269608 KB Output is correct
79 Correct 6052 ms 223028 KB Output is correct
80 Correct 3459 ms 210588 KB Output is correct
81 Correct 4830 ms 213652 KB Output is correct
82 Correct 6597 ms 193352 KB Output is correct
83 Correct 6447 ms 210704 KB Output is correct