oj.uz

답안 #1038807

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1038807 2024-07-30T07:50:38 Z ibm2006 Two Dishes (JOI19_dishes) C++17
100 / 100
 6388 ms 288528 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],v;
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();
    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:163:18: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long 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("%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 462 ms 63444 KB Output is correct
2 Correct 497 ms 52116 KB Output is correct
3 Correct 204 ms 49948 KB Output is correct
4 Correct 445 ms 59944 KB Output is correct
5 Correct 13 ms 26460 KB Output is correct
6 Correct 510 ms 50892 KB Output is correct
7 Correct 108 ms 42176 KB Output is correct
8 Correct 116 ms 34148 KB Output is correct
9 Correct 240 ms 50032 KB Output is correct
10 Correct 571 ms 54404 KB Output is correct
11 Correct 191 ms 49856 KB Output is correct

Subtask #2
3.0 / 3.0

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

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 26460 KB Output is correct
2 Correct 11 ms 26460 KB Output is correct
3 Correct 11 ms 26308 KB Output is correct
4 Correct 12 ms 26244 KB Output is correct
5 Correct 11 ms 26400 KB Output is correct
6 Correct 10 ms 26460 KB Output is correct
7 Correct 11 ms 26460 KB Output is correct
8 Correct 13 ms 26460 KB Output is correct
9 Correct 12 ms 26344 KB Output is correct
10 Correct 14 ms 26460 KB Output is correct
11 Correct 11 ms 26464 KB Output is correct
12 Correct 11 ms 26460 KB Output is correct
13 Correct 10 ms 26460 KB Output is correct
14 Correct 11 ms 26384 KB Output is correct
15 Correct 10 ms 26436 KB Output is correct
16 Correct 10 ms 26460 KB Output is correct
17 Correct 19 ms 26716 KB Output is correct
18 Correct 13 ms 26716 KB Output is correct
19 Correct 20 ms 26640 KB Output is correct
20 Correct 14 ms 26716 KB Output is correct
21 Correct 15 ms 26584 KB Output is correct
22 Correct 18 ms 26712 KB Output is correct
23 Correct 17 ms 26716 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 26460 KB Output is correct
2 Correct 11 ms 26460 KB Output is correct
3 Correct 11 ms 26308 KB Output is correct
4 Correct 12 ms 26244 KB Output is correct
5 Correct 11 ms 26400 KB Output is correct
6 Correct 10 ms 26460 KB Output is correct
7 Correct 11 ms 26460 KB Output is correct
8 Correct 13 ms 26460 KB Output is correct
9 Correct 12 ms 26344 KB Output is correct
10 Correct 14 ms 26460 KB Output is correct
11 Correct 11 ms 26464 KB Output is correct
12 Correct 11 ms 26460 KB Output is correct
13 Correct 10 ms 26460 KB Output is correct
14 Correct 11 ms 26384 KB Output is correct
15 Correct 10 ms 26436 KB Output is correct
16 Correct 10 ms 26460 KB Output is correct
17 Correct 19 ms 26716 KB Output is correct
18 Correct 13 ms 26716 KB Output is correct
19 Correct 20 ms 26640 KB Output is correct
20 Correct 14 ms 26716 KB Output is correct
21 Correct 15 ms 26584 KB Output is correct
22 Correct 18 ms 26712 KB Output is correct
23 Correct 17 ms 26716 KB Output is correct
24 Correct 368 ms 50108 KB Output is correct
25 Correct 423 ms 63932 KB Output is correct
26 Correct 309 ms 50000 KB Output is correct
27 Correct 410 ms 66896 KB Output is correct
28 Correct 359 ms 50884 KB Output is correct
29 Correct 186 ms 49856 KB Output is correct
30 Correct 1066 ms 52560 KB Output is correct
31 Correct 203 ms 49100 KB Output is correct
32 Correct 162 ms 34152 KB Output is correct
33 Correct 606 ms 51632 KB Output is correct
34 Correct 724 ms 56016 KB Output is correct
35 Correct 1072 ms 52564 KB Output is correct
36 Correct 1031 ms 52692 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 26460 KB Output is correct
2 Correct 11 ms 26460 KB Output is correct
3 Correct 11 ms 26308 KB Output is correct
4 Correct 12 ms 26244 KB Output is correct
5 Correct 11 ms 26400 KB Output is correct
6 Correct 10 ms 26460 KB Output is correct
7 Correct 11 ms 26460 KB Output is correct
8 Correct 13 ms 26460 KB Output is correct
9 Correct 12 ms 26344 KB Output is correct
10 Correct 14 ms 26460 KB Output is correct
11 Correct 11 ms 26464 KB Output is correct
12 Correct 11 ms 26460 KB Output is correct
13 Correct 10 ms 26460 KB Output is correct
14 Correct 11 ms 26384 KB Output is correct
15 Correct 10 ms 26436 KB Output is correct
16 Correct 10 ms 26460 KB Output is correct
17 Correct 19 ms 26716 KB Output is correct
18 Correct 13 ms 26716 KB Output is correct
19 Correct 20 ms 26640 KB Output is correct
20 Correct 14 ms 26716 KB Output is correct
21 Correct 15 ms 26584 KB Output is correct
22 Correct 18 ms 26712 KB Output is correct
23 Correct 17 ms 26716 KB Output is correct
24 Correct 368 ms 50108 KB Output is correct
25 Correct 423 ms 63932 KB Output is correct
26 Correct 309 ms 50000 KB Output is correct
27 Correct 410 ms 66896 KB Output is correct
28 Correct 359 ms 50884 KB Output is correct
29 Correct 186 ms 49856 KB Output is correct
30 Correct 1066 ms 52560 KB Output is correct
31 Correct 203 ms 49100 KB Output is correct
32 Correct 162 ms 34152 KB Output is correct
33 Correct 606 ms 51632 KB Output is correct
34 Correct 724 ms 56016 KB Output is correct
35 Correct 1072 ms 52564 KB Output is correct
36 Correct 1031 ms 52692 KB Output is correct
37 Correct 364 ms 49992 KB Output is correct
38 Correct 410 ms 66948 KB Output is correct
39 Correct 688 ms 66900 KB Output is correct
40 Correct 444 ms 54356 KB Output is correct
41 Correct 13 ms 26456 KB Output is correct
42 Correct 1022 ms 52760 KB Output is correct
43 Correct 598 ms 51396 KB Output is correct
44 Correct 721 ms 55948 KB Output is correct
45 Correct 969 ms 52632 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 26460 KB Output is correct
2 Correct 11 ms 26460 KB Output is correct
3 Correct 11 ms 26308 KB Output is correct
4 Correct 12 ms 26244 KB Output is correct
5 Correct 11 ms 26400 KB Output is correct
6 Correct 10 ms 26460 KB Output is correct
7 Correct 11 ms 26460 KB Output is correct
8 Correct 13 ms 26460 KB Output is correct
9 Correct 12 ms 26344 KB Output is correct
10 Correct 14 ms 26460 KB Output is correct
11 Correct 11 ms 26464 KB Output is correct
12 Correct 11 ms 26460 KB Output is correct
13 Correct 10 ms 26460 KB Output is correct
14 Correct 11 ms 26384 KB Output is correct
15 Correct 10 ms 26436 KB Output is correct
16 Correct 10 ms 26460 KB Output is correct
17 Correct 19 ms 26716 KB Output is correct
18 Correct 13 ms 26716 KB Output is correct
19 Correct 20 ms 26640 KB Output is correct
20 Correct 14 ms 26716 KB Output is correct
21 Correct 15 ms 26584 KB Output is correct
22 Correct 18 ms 26712 KB Output is correct
23 Correct 17 ms 26716 KB Output is correct
24 Correct 368 ms 50108 KB Output is correct
25 Correct 423 ms 63932 KB Output is correct
26 Correct 309 ms 50000 KB Output is correct
27 Correct 410 ms 66896 KB Output is correct
28 Correct 359 ms 50884 KB Output is correct
29 Correct 186 ms 49856 KB Output is correct
30 Correct 1066 ms 52560 KB Output is correct
31 Correct 203 ms 49100 KB Output is correct
32 Correct 162 ms 34152 KB Output is correct
33 Correct 606 ms 51632 KB Output is correct
34 Correct 724 ms 56016 KB Output is correct
35 Correct 1072 ms 52564 KB Output is correct
36 Correct 1031 ms 52692 KB Output is correct
37 Correct 364 ms 49992 KB Output is correct
38 Correct 410 ms 66948 KB Output is correct
39 Correct 688 ms 66900 KB Output is correct
40 Correct 444 ms 54356 KB Output is correct
41 Correct 13 ms 26456 KB Output is correct
42 Correct 1022 ms 52760 KB Output is correct
43 Correct 598 ms 51396 KB Output is correct
44 Correct 721 ms 55948 KB Output is correct
45 Correct 969 ms 52632 KB Output is correct
46 Correct 1711 ms 143780 KB Output is correct
47 Correct 2504 ms 229684 KB Output is correct
48 Correct 4250 ms 229660 KB Output is correct
49 Correct 2586 ms 195684 KB Output is correct
50 Correct 6248 ms 192260 KB Output is correct
51 Correct 3501 ms 183236 KB Output is correct
52 Correct 4549 ms 202036 KB Output is correct
53 Correct 6388 ms 176764 KB Output is correct

Subtask #7
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 462 ms 63444 KB Output is correct
2 Correct 497 ms 52116 KB Output is correct
3 Correct 204 ms 49948 KB Output is correct
4 Correct 445 ms 59944 KB Output is correct
5 Correct 13 ms 26460 KB Output is correct
6 Correct 510 ms 50892 KB Output is correct
7 Correct 108 ms 42176 KB Output is correct
8 Correct 116 ms 34148 KB Output is correct
9 Correct 240 ms 50032 KB Output is correct
10 Correct 571 ms 54404 KB Output is correct
11 Correct 191 ms 49856 KB Output is correct
12 Correct 10 ms 26460 KB Output is correct
13 Correct 11 ms 26460 KB Output is correct
14 Correct 11 ms 26308 KB Output is correct
15 Correct 12 ms 26244 KB Output is correct
16 Correct 11 ms 26400 KB Output is correct
17 Correct 10 ms 26460 KB Output is correct
18 Correct 11 ms 26460 KB Output is correct
19 Correct 13 ms 26460 KB Output is correct
20 Correct 12 ms 26344 KB Output is correct
21 Correct 14 ms 26460 KB Output is correct
22 Correct 11 ms 26464 KB Output is correct
23 Correct 11 ms 26460 KB Output is correct
24 Correct 10 ms 26460 KB Output is correct
25 Correct 11 ms 26384 KB Output is correct
26 Correct 10 ms 26436 KB Output is correct
27 Correct 10 ms 26460 KB Output is correct
28 Correct 19 ms 26716 KB Output is correct
29 Correct 13 ms 26716 KB Output is correct
30 Correct 20 ms 26640 KB Output is correct
31 Correct 14 ms 26716 KB Output is correct
32 Correct 15 ms 26584 KB Output is correct
33 Correct 18 ms 26712 KB Output is correct
34 Correct 17 ms 26716 KB Output is correct
35 Correct 368 ms 50108 KB Output is correct
36 Correct 423 ms 63932 KB Output is correct
37 Correct 309 ms 50000 KB Output is correct
38 Correct 410 ms 66896 KB Output is correct
39 Correct 359 ms 50884 KB Output is correct
40 Correct 186 ms 49856 KB Output is correct
41 Correct 1066 ms 52560 KB Output is correct
42 Correct 203 ms 49100 KB Output is correct
43 Correct 162 ms 34152 KB Output is correct
44 Correct 606 ms 51632 KB Output is correct
45 Correct 724 ms 56016 KB Output is correct
46 Correct 1072 ms 52564 KB Output is correct
47 Correct 1031 ms 52692 KB Output is correct
48 Correct 364 ms 49992 KB Output is correct
49 Correct 410 ms 66948 KB Output is correct
50 Correct 688 ms 66900 KB Output is correct
51 Correct 444 ms 54356 KB Output is correct
52 Correct 13 ms 26456 KB Output is correct
53 Correct 1022 ms 52760 KB Output is correct
54 Correct 598 ms 51396 KB Output is correct
55 Correct 721 ms 55948 KB Output is correct
56 Correct 969 ms 52632 KB Output is correct
57 Correct 417 ms 69864 KB Output is correct
58 Correct 351 ms 61840 KB Output is correct
59 Correct 460 ms 60756 KB Output is correct
60 Correct 783 ms 78856 KB Output is correct
61 Correct 687 ms 63060 KB Output is correct
62 Correct 11 ms 26460 KB Output is correct
63 Correct 1064 ms 66520 KB Output is correct
64 Correct 579 ms 64456 KB Output is correct
65 Correct 837 ms 65740 KB Output is correct
66 Correct 971 ms 59992 KB Output is correct

Subtask #8
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 462 ms 63444 KB Output is correct
2 Correct 497 ms 52116 KB Output is correct
3 Correct 204 ms 49948 KB Output is correct
4 Correct 445 ms 59944 KB Output is correct
5 Correct 13 ms 26460 KB Output is correct
6 Correct 510 ms 50892 KB Output is correct
7 Correct 108 ms 42176 KB Output is correct
8 Correct 116 ms 34148 KB Output is correct
9 Correct 240 ms 50032 KB Output is correct
10 Correct 571 ms 54404 KB Output is correct
11 Correct 191 ms 49856 KB Output is correct
12 Correct 10 ms 26460 KB Output is correct
13 Correct 11 ms 26460 KB Output is correct
14 Correct 11 ms 26308 KB Output is correct
15 Correct 12 ms 26244 KB Output is correct
16 Correct 11 ms 26400 KB Output is correct
17 Correct 10 ms 26460 KB Output is correct
18 Correct 11 ms 26460 KB Output is correct
19 Correct 13 ms 26460 KB Output is correct
20 Correct 12 ms 26344 KB Output is correct
21 Correct 14 ms 26460 KB Output is correct
22 Correct 11 ms 26464 KB Output is correct
23 Correct 11 ms 26460 KB Output is correct
24 Correct 10 ms 26460 KB Output is correct
25 Correct 11 ms 26384 KB Output is correct
26 Correct 10 ms 26436 KB Output is correct
27 Correct 10 ms 26460 KB Output is correct
28 Correct 19 ms 26716 KB Output is correct
29 Correct 13 ms 26716 KB Output is correct
30 Correct 20 ms 26640 KB Output is correct
31 Correct 14 ms 26716 KB Output is correct
32 Correct 15 ms 26584 KB Output is correct
33 Correct 18 ms 26712 KB Output is correct
34 Correct 17 ms 26716 KB Output is correct
35 Correct 368 ms 50108 KB Output is correct
36 Correct 423 ms 63932 KB Output is correct
37 Correct 309 ms 50000 KB Output is correct
38 Correct 410 ms 66896 KB Output is correct
39 Correct 359 ms 50884 KB Output is correct
40 Correct 186 ms 49856 KB Output is correct
41 Correct 1066 ms 52560 KB Output is correct
42 Correct 203 ms 49100 KB Output is correct
43 Correct 162 ms 34152 KB Output is correct
44 Correct 606 ms 51632 KB Output is correct
45 Correct 724 ms 56016 KB Output is correct
46 Correct 1072 ms 52564 KB Output is correct
47 Correct 1031 ms 52692 KB Output is correct
48 Correct 364 ms 49992 KB Output is correct
49 Correct 410 ms 66948 KB Output is correct
50 Correct 688 ms 66900 KB Output is correct
51 Correct 444 ms 54356 KB Output is correct
52 Correct 13 ms 26456 KB Output is correct
53 Correct 1022 ms 52760 KB Output is correct
54 Correct 598 ms 51396 KB Output is correct
55 Correct 721 ms 55948 KB Output is correct
56 Correct 969 ms 52632 KB Output is correct
57 Correct 1711 ms 143780 KB Output is correct
58 Correct 2504 ms 229684 KB Output is correct
59 Correct 4250 ms 229660 KB Output is correct
60 Correct 2586 ms 195684 KB Output is correct
61 Correct 6248 ms 192260 KB Output is correct
62 Correct 3501 ms 183236 KB Output is correct
63 Correct 4549 ms 202036 KB Output is correct
64 Correct 6388 ms 176764 KB Output is correct
65 Correct 417 ms 69864 KB Output is correct
66 Correct 351 ms 61840 KB Output is correct
67 Correct 460 ms 60756 KB Output is correct
68 Correct 783 ms 78856 KB Output is correct
69 Correct 687 ms 63060 KB Output is correct
70 Correct 11 ms 26460 KB Output is correct
71 Correct 1064 ms 66520 KB Output is correct
72 Correct 579 ms 64456 KB Output is correct
73 Correct 837 ms 65740 KB Output is correct
74 Correct 971 ms 59992 KB Output is correct
75 Correct 2390 ms 278124 KB Output is correct
76 Correct 1974 ms 239096 KB Output is correct
77 Correct 2645 ms 226028 KB Output is correct
78 Correct 3863 ms 288528 KB Output is correct
79 Correct 6271 ms 227796 KB Output is correct
80 Correct 3249 ms 214600 KB Output is correct
81 Correct 4301 ms 220320 KB Output is correct
82 Correct 5717 ms 195668 KB Output is correct
83 Correct 5745 ms 215136 KB Output is correct