oj.uz

답안 #1038835

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1038835 2024-07-30T08:11:26 Z ibm2006 Two Dishes (JOI19_dishes) C++17
100 / 100
 4320 ms 259992 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 f(ll x)
{
    seg[x]=seg[x<<1]+seg[(x<<1)+1];
    if(x==1)
        return;
    f(x>>1);
}
ll g(ll x,ll y,ll z)
{
    if(y<l||x>r)
        return 0;
    if(l<=x&&y<=r)
        return seg[z];
    return g(x,(x+y)>>1,z<<1)+g(((x+y)>>1)+1,y,(z<<1)+1);
}
void add(int x,int y,ll z)
{
    /*l=x+1;
    r=y+1;
    f(1,1048576,1,z);*/
    l=x+1;
    seg[l+1048575]+=z;
    f((l+1048575)/2);
    l=y+2;
    seg[l+1048575]-=z;
    f((l+1048575)/2);
}
ll get_val(int x)
{
    //l=x+1;
    l=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:118:13: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'll*' {aka 'long long int*'} [-Wformat=]
  118 |     scanf("%d %d",&n,&m);
      |            ~^     ~~
      |             |     |
      |             int*  ll* {aka long long int*}
      |            %lld
dishes.cpp:118:16: warning: format '%d' expects argument of type 'int*', but argument 3 has type 'll*' {aka 'long long int*'} [-Wformat=]
  118 |     scanf("%d %d",&n,&m);
      |               ~^     ~~
      |                |     |
      |                int*  ll* {aka long long int*}
      |               %lld
dishes.cpp:185: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]
  185 |         for(j=0;j<v.size();j++)
      |                 ~^~~~~~~~~
dishes.cpp:118:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  118 |     scanf("%d %d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~~
dishes.cpp:121:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  121 |         scanf("%lld %lld %lld",&a[i],&c[i],&add_cost[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dishes.cpp:126:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  126 |         scanf("%lld %lld %lld",&b[i],&d[i],&cost[i-1]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 69460 KB Output is correct
2 Correct 270 ms 60972 KB Output is correct
3 Correct 158 ms 58308 KB Output is correct
4 Correct 320 ms 67024 KB Output is correct
5 Correct 11 ms 26204 KB Output is correct
6 Correct 302 ms 59600 KB Output is correct
7 Correct 73 ms 44488 KB Output is correct
8 Correct 111 ms 40788 KB Output is correct
9 Correct 155 ms 59076 KB Output is correct
10 Correct 333 ms 58192 KB Output is correct
11 Correct 125 ms 53192 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 26204 KB Output is correct
2 Correct 10 ms 26204 KB Output is correct
3 Correct 11 ms 26200 KB Output is correct
4 Correct 10 ms 26280 KB Output is correct
5 Correct 10 ms 26204 KB Output is correct
6 Correct 11 ms 26204 KB Output is correct
7 Correct 11 ms 26204 KB Output is correct
8 Correct 11 ms 26204 KB Output is correct
9 Correct 11 ms 26204 KB Output is correct
10 Correct 10 ms 26204 KB Output is correct
11 Correct 13 ms 26456 KB Output is correct
12 Correct 10 ms 26204 KB Output is correct
13 Correct 11 ms 26300 KB Output is correct
14 Correct 10 ms 26204 KB Output is correct
15 Correct 10 ms 26184 KB Output is correct
16 Correct 11 ms 26428 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 26204 KB Output is correct
2 Correct 10 ms 26204 KB Output is correct
3 Correct 11 ms 26200 KB Output is correct
4 Correct 10 ms 26280 KB Output is correct
5 Correct 10 ms 26204 KB Output is correct
6 Correct 11 ms 26204 KB Output is correct
7 Correct 11 ms 26204 KB Output is correct
8 Correct 11 ms 26204 KB Output is correct
9 Correct 11 ms 26204 KB Output is correct
10 Correct 10 ms 26204 KB Output is correct
11 Correct 13 ms 26456 KB Output is correct
12 Correct 10 ms 26204 KB Output is correct
13 Correct 11 ms 26300 KB Output is correct
14 Correct 10 ms 26204 KB Output is correct
15 Correct 10 ms 26184 KB Output is correct
16 Correct 11 ms 26428 KB Output is correct
17 Correct 13 ms 26716 KB Output is correct
18 Correct 12 ms 26716 KB Output is correct
19 Correct 15 ms 26712 KB Output is correct
20 Correct 13 ms 26716 KB Output is correct
21 Correct 15 ms 26716 KB Output is correct
22 Correct 16 ms 26460 KB Output is correct
23 Correct 20 ms 26560 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 26204 KB Output is correct
2 Correct 10 ms 26204 KB Output is correct
3 Correct 11 ms 26200 KB Output is correct
4 Correct 10 ms 26280 KB Output is correct
5 Correct 10 ms 26204 KB Output is correct
6 Correct 11 ms 26204 KB Output is correct
7 Correct 11 ms 26204 KB Output is correct
8 Correct 11 ms 26204 KB Output is correct
9 Correct 11 ms 26204 KB Output is correct
10 Correct 10 ms 26204 KB Output is correct
11 Correct 13 ms 26456 KB Output is correct
12 Correct 10 ms 26204 KB Output is correct
13 Correct 11 ms 26300 KB Output is correct
14 Correct 10 ms 26204 KB Output is correct
15 Correct 10 ms 26184 KB Output is correct
16 Correct 11 ms 26428 KB Output is correct
17 Correct 13 ms 26716 KB Output is correct
18 Correct 12 ms 26716 KB Output is correct
19 Correct 15 ms 26712 KB Output is correct
20 Correct 13 ms 26716 KB Output is correct
21 Correct 15 ms 26716 KB Output is correct
22 Correct 16 ms 26460 KB Output is correct
23 Correct 20 ms 26560 KB Output is correct
24 Correct 228 ms 55752 KB Output is correct
25 Correct 356 ms 65724 KB Output is correct
26 Correct 220 ms 55748 KB Output is correct
27 Correct 387 ms 70484 KB Output is correct
28 Correct 291 ms 57032 KB Output is correct
29 Correct 142 ms 56516 KB Output is correct
30 Correct 683 ms 58704 KB Output is correct
31 Correct 150 ms 48144 KB Output is correct
32 Correct 144 ms 39248 KB Output is correct
33 Correct 421 ms 57680 KB Output is correct
34 Correct 544 ms 61008 KB Output is correct
35 Correct 694 ms 53256 KB Output is correct
36 Correct 696 ms 53076 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 26204 KB Output is correct
2 Correct 10 ms 26204 KB Output is correct
3 Correct 11 ms 26200 KB Output is correct
4 Correct 10 ms 26280 KB Output is correct
5 Correct 10 ms 26204 KB Output is correct
6 Correct 11 ms 26204 KB Output is correct
7 Correct 11 ms 26204 KB Output is correct
8 Correct 11 ms 26204 KB Output is correct
9 Correct 11 ms 26204 KB Output is correct
10 Correct 10 ms 26204 KB Output is correct
11 Correct 13 ms 26456 KB Output is correct
12 Correct 10 ms 26204 KB Output is correct
13 Correct 11 ms 26300 KB Output is correct
14 Correct 10 ms 26204 KB Output is correct
15 Correct 10 ms 26184 KB Output is correct
16 Correct 11 ms 26428 KB Output is correct
17 Correct 13 ms 26716 KB Output is correct
18 Correct 12 ms 26716 KB Output is correct
19 Correct 15 ms 26712 KB Output is correct
20 Correct 13 ms 26716 KB Output is correct
21 Correct 15 ms 26716 KB Output is correct
22 Correct 16 ms 26460 KB Output is correct
23 Correct 20 ms 26560 KB Output is correct
24 Correct 228 ms 55752 KB Output is correct
25 Correct 356 ms 65724 KB Output is correct
26 Correct 220 ms 55748 KB Output is correct
27 Correct 387 ms 70484 KB Output is correct
28 Correct 291 ms 57032 KB Output is correct
29 Correct 142 ms 56516 KB Output is correct
30 Correct 683 ms 58704 KB Output is correct
31 Correct 150 ms 48144 KB Output is correct
32 Correct 144 ms 39248 KB Output is correct
33 Correct 421 ms 57680 KB Output is correct
34 Correct 544 ms 61008 KB Output is correct
35 Correct 694 ms 53256 KB Output is correct
36 Correct 696 ms 53076 KB Output is correct
37 Correct 229 ms 58752 KB Output is correct
38 Correct 357 ms 73260 KB Output is correct
39 Correct 542 ms 70740 KB Output is correct
40 Correct 294 ms 61512 KB Output is correct
41 Correct 11 ms 26200 KB Output is correct
42 Correct 732 ms 61592 KB Output is correct
43 Correct 438 ms 60048 KB Output is correct
44 Correct 493 ms 63320 KB Output is correct
45 Correct 629 ms 56032 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 26204 KB Output is correct
2 Correct 10 ms 26204 KB Output is correct
3 Correct 11 ms 26200 KB Output is correct
4 Correct 10 ms 26280 KB Output is correct
5 Correct 10 ms 26204 KB Output is correct
6 Correct 11 ms 26204 KB Output is correct
7 Correct 11 ms 26204 KB Output is correct
8 Correct 11 ms 26204 KB Output is correct
9 Correct 11 ms 26204 KB Output is correct
10 Correct 10 ms 26204 KB Output is correct
11 Correct 13 ms 26456 KB Output is correct
12 Correct 10 ms 26204 KB Output is correct
13 Correct 11 ms 26300 KB Output is correct
14 Correct 10 ms 26204 KB Output is correct
15 Correct 10 ms 26184 KB Output is correct
16 Correct 11 ms 26428 KB Output is correct
17 Correct 13 ms 26716 KB Output is correct
18 Correct 12 ms 26716 KB Output is correct
19 Correct 15 ms 26712 KB Output is correct
20 Correct 13 ms 26716 KB Output is correct
21 Correct 15 ms 26716 KB Output is correct
22 Correct 16 ms 26460 KB Output is correct
23 Correct 20 ms 26560 KB Output is correct
24 Correct 228 ms 55752 KB Output is correct
25 Correct 356 ms 65724 KB Output is correct
26 Correct 220 ms 55748 KB Output is correct
27 Correct 387 ms 70484 KB Output is correct
28 Correct 291 ms 57032 KB Output is correct
29 Correct 142 ms 56516 KB Output is correct
30 Correct 683 ms 58704 KB Output is correct
31 Correct 150 ms 48144 KB Output is correct
32 Correct 144 ms 39248 KB Output is correct
33 Correct 421 ms 57680 KB Output is correct
34 Correct 544 ms 61008 KB Output is correct
35 Correct 694 ms 53256 KB Output is correct
36 Correct 696 ms 53076 KB Output is correct
37 Correct 229 ms 58752 KB Output is correct
38 Correct 357 ms 73260 KB Output is correct
39 Correct 542 ms 70740 KB Output is correct
40 Correct 294 ms 61512 KB Output is correct
41 Correct 11 ms 26200 KB Output is correct
42 Correct 732 ms 61592 KB Output is correct
43 Correct 438 ms 60048 KB Output is correct
44 Correct 493 ms 63320 KB Output is correct
45 Correct 629 ms 56032 KB Output is correct
46 Correct 1040 ms 185824 KB Output is correct
47 Correct 1821 ms 259992 KB Output is correct
48 Correct 2903 ms 247928 KB Output is correct
49 Correct 1317 ms 201292 KB Output is correct
50 Correct 3968 ms 202192 KB Output is correct
51 Correct 2336 ms 190652 KB Output is correct
52 Correct 3553 ms 204056 KB Output is correct
53 Correct 4061 ms 178384 KB Output is correct

Subtask #7
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 69460 KB Output is correct
2 Correct 270 ms 60972 KB Output is correct
3 Correct 158 ms 58308 KB Output is correct
4 Correct 320 ms 67024 KB Output is correct
5 Correct 11 ms 26204 KB Output is correct
6 Correct 302 ms 59600 KB Output is correct
7 Correct 73 ms 44488 KB Output is correct
8 Correct 111 ms 40788 KB Output is correct
9 Correct 155 ms 59076 KB Output is correct
10 Correct 333 ms 58192 KB Output is correct
11 Correct 125 ms 53192 KB Output is correct
12 Correct 10 ms 26204 KB Output is correct
13 Correct 10 ms 26204 KB Output is correct
14 Correct 11 ms 26200 KB Output is correct
15 Correct 10 ms 26280 KB Output is correct
16 Correct 10 ms 26204 KB Output is correct
17 Correct 11 ms 26204 KB Output is correct
18 Correct 11 ms 26204 KB Output is correct
19 Correct 11 ms 26204 KB Output is correct
20 Correct 11 ms 26204 KB Output is correct
21 Correct 10 ms 26204 KB Output is correct
22 Correct 13 ms 26456 KB Output is correct
23 Correct 10 ms 26204 KB Output is correct
24 Correct 11 ms 26300 KB Output is correct
25 Correct 10 ms 26204 KB Output is correct
26 Correct 10 ms 26184 KB Output is correct
27 Correct 11 ms 26428 KB Output is correct
28 Correct 13 ms 26716 KB Output is correct
29 Correct 12 ms 26716 KB Output is correct
30 Correct 15 ms 26712 KB Output is correct
31 Correct 13 ms 26716 KB Output is correct
32 Correct 15 ms 26716 KB Output is correct
33 Correct 16 ms 26460 KB Output is correct
34 Correct 20 ms 26560 KB Output is correct
35 Correct 228 ms 55752 KB Output is correct
36 Correct 356 ms 65724 KB Output is correct
37 Correct 220 ms 55748 KB Output is correct
38 Correct 387 ms 70484 KB Output is correct
39 Correct 291 ms 57032 KB Output is correct
40 Correct 142 ms 56516 KB Output is correct
41 Correct 683 ms 58704 KB Output is correct
42 Correct 150 ms 48144 KB Output is correct
43 Correct 144 ms 39248 KB Output is correct
44 Correct 421 ms 57680 KB Output is correct
45 Correct 544 ms 61008 KB Output is correct
46 Correct 694 ms 53256 KB Output is correct
47 Correct 696 ms 53076 KB Output is correct
48 Correct 229 ms 58752 KB Output is correct
49 Correct 357 ms 73260 KB Output is correct
50 Correct 542 ms 70740 KB Output is correct
51 Correct 294 ms 61512 KB Output is correct
52 Correct 11 ms 26200 KB Output is correct
53 Correct 732 ms 61592 KB Output is correct
54 Correct 438 ms 60048 KB Output is correct
55 Correct 493 ms 63320 KB Output is correct
56 Correct 629 ms 56032 KB Output is correct
57 Correct 329 ms 69316 KB Output is correct
58 Correct 229 ms 65556 KB Output is correct
59 Correct 286 ms 63316 KB Output is correct
60 Correct 523 ms 72776 KB Output is correct
61 Correct 393 ms 59708 KB Output is correct
62 Correct 11 ms 26200 KB Output is correct
63 Correct 701 ms 63124 KB Output is correct
64 Correct 414 ms 60908 KB Output is correct
65 Correct 567 ms 61644 KB Output is correct
66 Correct 639 ms 56656 KB Output is correct

Subtask #8
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 69460 KB Output is correct
2 Correct 270 ms 60972 KB Output is correct
3 Correct 158 ms 58308 KB Output is correct
4 Correct 320 ms 67024 KB Output is correct
5 Correct 11 ms 26204 KB Output is correct
6 Correct 302 ms 59600 KB Output is correct
7 Correct 73 ms 44488 KB Output is correct
8 Correct 111 ms 40788 KB Output is correct
9 Correct 155 ms 59076 KB Output is correct
10 Correct 333 ms 58192 KB Output is correct
11 Correct 125 ms 53192 KB Output is correct
12 Correct 10 ms 26204 KB Output is correct
13 Correct 10 ms 26204 KB Output is correct
14 Correct 11 ms 26200 KB Output is correct
15 Correct 10 ms 26280 KB Output is correct
16 Correct 10 ms 26204 KB Output is correct
17 Correct 11 ms 26204 KB Output is correct
18 Correct 11 ms 26204 KB Output is correct
19 Correct 11 ms 26204 KB Output is correct
20 Correct 11 ms 26204 KB Output is correct
21 Correct 10 ms 26204 KB Output is correct
22 Correct 13 ms 26456 KB Output is correct
23 Correct 10 ms 26204 KB Output is correct
24 Correct 11 ms 26300 KB Output is correct
25 Correct 10 ms 26204 KB Output is correct
26 Correct 10 ms 26184 KB Output is correct
27 Correct 11 ms 26428 KB Output is correct
28 Correct 13 ms 26716 KB Output is correct
29 Correct 12 ms 26716 KB Output is correct
30 Correct 15 ms 26712 KB Output is correct
31 Correct 13 ms 26716 KB Output is correct
32 Correct 15 ms 26716 KB Output is correct
33 Correct 16 ms 26460 KB Output is correct
34 Correct 20 ms 26560 KB Output is correct
35 Correct 228 ms 55752 KB Output is correct
36 Correct 356 ms 65724 KB Output is correct
37 Correct 220 ms 55748 KB Output is correct
38 Correct 387 ms 70484 KB Output is correct
39 Correct 291 ms 57032 KB Output is correct
40 Correct 142 ms 56516 KB Output is correct
41 Correct 683 ms 58704 KB Output is correct
42 Correct 150 ms 48144 KB Output is correct
43 Correct 144 ms 39248 KB Output is correct
44 Correct 421 ms 57680 KB Output is correct
45 Correct 544 ms 61008 KB Output is correct
46 Correct 694 ms 53256 KB Output is correct
47 Correct 696 ms 53076 KB Output is correct
48 Correct 229 ms 58752 KB Output is correct
49 Correct 357 ms 73260 KB Output is correct
50 Correct 542 ms 70740 KB Output is correct
51 Correct 294 ms 61512 KB Output is correct
52 Correct 11 ms 26200 KB Output is correct
53 Correct 732 ms 61592 KB Output is correct
54 Correct 438 ms 60048 KB Output is correct
55 Correct 493 ms 63320 KB Output is correct
56 Correct 629 ms 56032 KB Output is correct
57 Correct 1040 ms 185824 KB Output is correct
58 Correct 1821 ms 259992 KB Output is correct
59 Correct 2903 ms 247928 KB Output is correct
60 Correct 1317 ms 201292 KB Output is correct
61 Correct 3968 ms 202192 KB Output is correct
62 Correct 2336 ms 190652 KB Output is correct
63 Correct 3553 ms 204056 KB Output is correct
64 Correct 4061 ms 178384 KB Output is correct
65 Correct 329 ms 69316 KB Output is correct
66 Correct 229 ms 65556 KB Output is correct
67 Correct 286 ms 63316 KB Output is correct
68 Correct 523 ms 72776 KB Output is correct
69 Correct 393 ms 59708 KB Output is correct
70 Correct 11 ms 26200 KB Output is correct
71 Correct 701 ms 63124 KB Output is correct
72 Correct 414 ms 60908 KB Output is correct
73 Correct 567 ms 61644 KB Output is correct
74 Correct 639 ms 56656 KB Output is correct
75 Correct 1772 ms 242048 KB Output is correct
76 Correct 1183 ms 222260 KB Output is correct
77 Correct 1397 ms 209788 KB Output is correct
78 Correct 3007 ms 256736 KB Output is correct
79 Correct 4320 ms 208636 KB Output is correct
80 Correct 2380 ms 195976 KB Output is correct
81 Correct 3000 ms 197700 KB Output is correct
82 Correct 4222 ms 177464 KB Output is correct
83 Correct 3908 ms 196760 KB Output is correct