oj.uz

답안 #1038871

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1038871 2024-07-30T08:32:37 Z ibm2006 Two Dishes (JOI19_dishes) C++17
100 / 100
 3583 ms 235716 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx")
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(int x)
{
    while(x)
    {seg[x]=seg[x<<1]+seg[(x<<1)+1];
    x>>=1;
    }
}
ll g(int x,int y,int z) {
	x=l;
	y=r;
	ll res = 0;
	for(x+=1048575,y+=1048575; x<=y; x>>=1,y>>=1) {
    	if(x&1) res += seg[x--];
        if(~y&1) res += seg[y--];
    }
    return res;
}
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:122:13: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'll*' {aka 'long long int*'} [-Wformat=]
  122 |     scanf("%d %d",&n,&m);
      |            ~^     ~~
      |             |     |
      |             int*  ll* {aka long long int*}
      |            %lld
dishes.cpp:122:16: warning: format '%d' expects argument of type 'int*', but argument 3 has type 'll*' {aka 'long long int*'} [-Wformat=]
  122 |     scanf("%d %d",&n,&m);
      |               ~^     ~~
      |                |     |
      |                int*  ll* {aka long long int*}
      |               %lld
dishes.cpp:189: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]
  189 |         for(j=0;j<v.size();j++)
      |                 ~^~~~~~~~~
dishes.cpp:122:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  122 |     scanf("%d %d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~~
dishes.cpp:125:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  125 |         scanf("%lld %lld %lld",&a[i],&c[i],&add_cost[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dishes.cpp:130:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  130 |         scanf("%lld %lld %lld",&b[i],&d[i],&cost[i-1]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 262 ms 67888 KB Output is correct
2 Correct 226 ms 59472 KB Output is correct
3 Correct 157 ms 56632 KB Output is correct
4 Correct 299 ms 65664 KB Output is correct
5 Correct 5 ms 33372 KB Output is correct
6 Correct 253 ms 58124 KB Output is correct
7 Correct 67 ms 49188 KB Output is correct
8 Correct 106 ms 42848 KB Output is correct
9 Correct 150 ms 57908 KB Output is correct
10 Correct 252 ms 58984 KB Output is correct
11 Correct 128 ms 54724 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 35460 KB Output is correct
2 Correct 5 ms 33568 KB Output is correct
3 Correct 6 ms 33484 KB Output is correct
4 Correct 5 ms 33372 KB Output is correct
5 Correct 5 ms 33372 KB Output is correct
6 Correct 5 ms 33372 KB Output is correct
7 Correct 5 ms 33372 KB Output is correct
8 Correct 5 ms 33372 KB Output is correct
9 Correct 5 ms 33372 KB Output is correct
10 Correct 5 ms 33372 KB Output is correct
11 Correct 7 ms 33372 KB Output is correct
12 Correct 7 ms 33372 KB Output is correct
13 Correct 5 ms 33372 KB Output is correct
14 Correct 5 ms 33388 KB Output is correct
15 Correct 5 ms 35420 KB Output is correct
16 Correct 5 ms 35420 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 35460 KB Output is correct
2 Correct 5 ms 33568 KB Output is correct
3 Correct 6 ms 33484 KB Output is correct
4 Correct 5 ms 33372 KB Output is correct
5 Correct 5 ms 33372 KB Output is correct
6 Correct 5 ms 33372 KB Output is correct
7 Correct 5 ms 33372 KB Output is correct
8 Correct 5 ms 33372 KB Output is correct
9 Correct 5 ms 33372 KB Output is correct
10 Correct 5 ms 33372 KB Output is correct
11 Correct 7 ms 33372 KB Output is correct
12 Correct 7 ms 33372 KB Output is correct
13 Correct 5 ms 33372 KB Output is correct
14 Correct 5 ms 33388 KB Output is correct
15 Correct 5 ms 35420 KB Output is correct
16 Correct 5 ms 35420 KB Output is correct
17 Correct 7 ms 33760 KB Output is correct
18 Correct 7 ms 33884 KB Output is correct
19 Correct 9 ms 35864 KB Output is correct
20 Correct 8 ms 35676 KB Output is correct
21 Correct 8 ms 33700 KB Output is correct
22 Correct 9 ms 33760 KB Output is correct
23 Correct 10 ms 33760 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 35460 KB Output is correct
2 Correct 5 ms 33568 KB Output is correct
3 Correct 6 ms 33484 KB Output is correct
4 Correct 5 ms 33372 KB Output is correct
5 Correct 5 ms 33372 KB Output is correct
6 Correct 5 ms 33372 KB Output is correct
7 Correct 5 ms 33372 KB Output is correct
8 Correct 5 ms 33372 KB Output is correct
9 Correct 5 ms 33372 KB Output is correct
10 Correct 5 ms 33372 KB Output is correct
11 Correct 7 ms 33372 KB Output is correct
12 Correct 7 ms 33372 KB Output is correct
13 Correct 5 ms 33372 KB Output is correct
14 Correct 5 ms 33388 KB Output is correct
15 Correct 5 ms 35420 KB Output is correct
16 Correct 5 ms 35420 KB Output is correct
17 Correct 7 ms 33760 KB Output is correct
18 Correct 7 ms 33884 KB Output is correct
19 Correct 9 ms 35864 KB Output is correct
20 Correct 8 ms 35676 KB Output is correct
21 Correct 8 ms 33700 KB Output is correct
22 Correct 9 ms 33760 KB Output is correct
23 Correct 10 ms 33760 KB Output is correct
24 Correct 188 ms 55496 KB Output is correct
25 Correct 315 ms 65364 KB Output is correct
26 Correct 177 ms 56172 KB Output is correct
27 Correct 346 ms 70236 KB Output is correct
28 Correct 233 ms 56400 KB Output is correct
29 Correct 149 ms 55764 KB Output is correct
30 Correct 584 ms 58448 KB Output is correct
31 Correct 132 ms 51980 KB Output is correct
32 Correct 112 ms 42576 KB Output is correct
33 Correct 355 ms 57804 KB Output is correct
34 Correct 430 ms 60504 KB Output is correct
35 Correct 559 ms 55124 KB Output is correct
36 Correct 562 ms 55168 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 35460 KB Output is correct
2 Correct 5 ms 33568 KB Output is correct
3 Correct 6 ms 33484 KB Output is correct
4 Correct 5 ms 33372 KB Output is correct
5 Correct 5 ms 33372 KB Output is correct
6 Correct 5 ms 33372 KB Output is correct
7 Correct 5 ms 33372 KB Output is correct
8 Correct 5 ms 33372 KB Output is correct
9 Correct 5 ms 33372 KB Output is correct
10 Correct 5 ms 33372 KB Output is correct
11 Correct 7 ms 33372 KB Output is correct
12 Correct 7 ms 33372 KB Output is correct
13 Correct 5 ms 33372 KB Output is correct
14 Correct 5 ms 33388 KB Output is correct
15 Correct 5 ms 35420 KB Output is correct
16 Correct 5 ms 35420 KB Output is correct
17 Correct 7 ms 33760 KB Output is correct
18 Correct 7 ms 33884 KB Output is correct
19 Correct 9 ms 35864 KB Output is correct
20 Correct 8 ms 35676 KB Output is correct
21 Correct 8 ms 33700 KB Output is correct
22 Correct 9 ms 33760 KB Output is correct
23 Correct 10 ms 33760 KB Output is correct
24 Correct 188 ms 55496 KB Output is correct
25 Correct 315 ms 65364 KB Output is correct
26 Correct 177 ms 56172 KB Output is correct
27 Correct 346 ms 70236 KB Output is correct
28 Correct 233 ms 56400 KB Output is correct
29 Correct 149 ms 55764 KB Output is correct
30 Correct 584 ms 58448 KB Output is correct
31 Correct 132 ms 51980 KB Output is correct
32 Correct 112 ms 42576 KB Output is correct
33 Correct 355 ms 57804 KB Output is correct
34 Correct 430 ms 60504 KB Output is correct
35 Correct 559 ms 55124 KB Output is correct
36 Correct 562 ms 55168 KB Output is correct
37 Correct 198 ms 57252 KB Output is correct
38 Correct 321 ms 72328 KB Output is correct
39 Correct 434 ms 70036 KB Output is correct
40 Correct 216 ms 61008 KB Output is correct
41 Correct 5 ms 33368 KB Output is correct
42 Correct 607 ms 59984 KB Output is correct
43 Correct 327 ms 58316 KB Output is correct
44 Correct 451 ms 61776 KB Output is correct
45 Correct 575 ms 56652 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 35460 KB Output is correct
2 Correct 5 ms 33568 KB Output is correct
3 Correct 6 ms 33484 KB Output is correct
4 Correct 5 ms 33372 KB Output is correct
5 Correct 5 ms 33372 KB Output is correct
6 Correct 5 ms 33372 KB Output is correct
7 Correct 5 ms 33372 KB Output is correct
8 Correct 5 ms 33372 KB Output is correct
9 Correct 5 ms 33372 KB Output is correct
10 Correct 5 ms 33372 KB Output is correct
11 Correct 7 ms 33372 KB Output is correct
12 Correct 7 ms 33372 KB Output is correct
13 Correct 5 ms 33372 KB Output is correct
14 Correct 5 ms 33388 KB Output is correct
15 Correct 5 ms 35420 KB Output is correct
16 Correct 5 ms 35420 KB Output is correct
17 Correct 7 ms 33760 KB Output is correct
18 Correct 7 ms 33884 KB Output is correct
19 Correct 9 ms 35864 KB Output is correct
20 Correct 8 ms 35676 KB Output is correct
21 Correct 8 ms 33700 KB Output is correct
22 Correct 9 ms 33760 KB Output is correct
23 Correct 10 ms 33760 KB Output is correct
24 Correct 188 ms 55496 KB Output is correct
25 Correct 315 ms 65364 KB Output is correct
26 Correct 177 ms 56172 KB Output is correct
27 Correct 346 ms 70236 KB Output is correct
28 Correct 233 ms 56400 KB Output is correct
29 Correct 149 ms 55764 KB Output is correct
30 Correct 584 ms 58448 KB Output is correct
31 Correct 132 ms 51980 KB Output is correct
32 Correct 112 ms 42576 KB Output is correct
33 Correct 355 ms 57804 KB Output is correct
34 Correct 430 ms 60504 KB Output is correct
35 Correct 559 ms 55124 KB Output is correct
36 Correct 562 ms 55168 KB Output is correct
37 Correct 198 ms 57252 KB Output is correct
38 Correct 321 ms 72328 KB Output is correct
39 Correct 434 ms 70036 KB Output is correct
40 Correct 216 ms 61008 KB Output is correct
41 Correct 5 ms 33368 KB Output is correct
42 Correct 607 ms 59984 KB Output is correct
43 Correct 327 ms 58316 KB Output is correct
44 Correct 451 ms 61776 KB Output is correct
45 Correct 575 ms 56652 KB Output is correct
46 Correct 917 ms 161392 KB Output is correct
47 Correct 1721 ms 235716 KB Output is correct
48 Correct 2486 ms 228772 KB Output is correct
49 Correct 1004 ms 182084 KB Output is correct
50 Correct 3583 ms 177260 KB Output is correct
51 Correct 2033 ms 167304 KB Output is correct
52 Correct 2535 ms 183236 KB Output is correct
53 Correct 3340 ms 161720 KB Output is correct

Subtask #7
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 262 ms 67888 KB Output is correct
2 Correct 226 ms 59472 KB Output is correct
3 Correct 157 ms 56632 KB Output is correct
4 Correct 299 ms 65664 KB Output is correct
5 Correct 5 ms 33372 KB Output is correct
6 Correct 253 ms 58124 KB Output is correct
7 Correct 67 ms 49188 KB Output is correct
8 Correct 106 ms 42848 KB Output is correct
9 Correct 150 ms 57908 KB Output is correct
10 Correct 252 ms 58984 KB Output is correct
11 Correct 128 ms 54724 KB Output is correct
12 Correct 5 ms 35460 KB Output is correct
13 Correct 5 ms 33568 KB Output is correct
14 Correct 6 ms 33484 KB Output is correct
15 Correct 5 ms 33372 KB Output is correct
16 Correct 5 ms 33372 KB Output is correct
17 Correct 5 ms 33372 KB Output is correct
18 Correct 5 ms 33372 KB Output is correct
19 Correct 5 ms 33372 KB Output is correct
20 Correct 5 ms 33372 KB Output is correct
21 Correct 5 ms 33372 KB Output is correct
22 Correct 7 ms 33372 KB Output is correct
23 Correct 7 ms 33372 KB Output is correct
24 Correct 5 ms 33372 KB Output is correct
25 Correct 5 ms 33388 KB Output is correct
26 Correct 5 ms 35420 KB Output is correct
27 Correct 5 ms 35420 KB Output is correct
28 Correct 7 ms 33760 KB Output is correct
29 Correct 7 ms 33884 KB Output is correct
30 Correct 9 ms 35864 KB Output is correct
31 Correct 8 ms 35676 KB Output is correct
32 Correct 8 ms 33700 KB Output is correct
33 Correct 9 ms 33760 KB Output is correct
34 Correct 10 ms 33760 KB Output is correct
35 Correct 188 ms 55496 KB Output is correct
36 Correct 315 ms 65364 KB Output is correct
37 Correct 177 ms 56172 KB Output is correct
38 Correct 346 ms 70236 KB Output is correct
39 Correct 233 ms 56400 KB Output is correct
40 Correct 149 ms 55764 KB Output is correct
41 Correct 584 ms 58448 KB Output is correct
42 Correct 132 ms 51980 KB Output is correct
43 Correct 112 ms 42576 KB Output is correct
44 Correct 355 ms 57804 KB Output is correct
45 Correct 430 ms 60504 KB Output is correct
46 Correct 559 ms 55124 KB Output is correct
47 Correct 562 ms 55168 KB Output is correct
48 Correct 198 ms 57252 KB Output is correct
49 Correct 321 ms 72328 KB Output is correct
50 Correct 434 ms 70036 KB Output is correct
51 Correct 216 ms 61008 KB Output is correct
52 Correct 5 ms 33368 KB Output is correct
53 Correct 607 ms 59984 KB Output is correct
54 Correct 327 ms 58316 KB Output is correct
55 Correct 451 ms 61776 KB Output is correct
56 Correct 575 ms 56652 KB Output is correct
57 Correct 306 ms 66528 KB Output is correct
58 Correct 217 ms 62544 KB Output is correct
59 Correct 217 ms 61268 KB Output is correct
60 Correct 458 ms 70572 KB Output is correct
61 Correct 321 ms 59216 KB Output is correct
62 Correct 5 ms 33372 KB Output is correct
63 Correct 577 ms 59984 KB Output is correct
64 Correct 368 ms 58312 KB Output is correct
65 Correct 465 ms 58828 KB Output is correct
66 Correct 527 ms 56912 KB Output is correct

Subtask #8
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 262 ms 67888 KB Output is correct
2 Correct 226 ms 59472 KB Output is correct
3 Correct 157 ms 56632 KB Output is correct
4 Correct 299 ms 65664 KB Output is correct
5 Correct 5 ms 33372 KB Output is correct
6 Correct 253 ms 58124 KB Output is correct
7 Correct 67 ms 49188 KB Output is correct
8 Correct 106 ms 42848 KB Output is correct
9 Correct 150 ms 57908 KB Output is correct
10 Correct 252 ms 58984 KB Output is correct
11 Correct 128 ms 54724 KB Output is correct
12 Correct 5 ms 35460 KB Output is correct
13 Correct 5 ms 33568 KB Output is correct
14 Correct 6 ms 33484 KB Output is correct
15 Correct 5 ms 33372 KB Output is correct
16 Correct 5 ms 33372 KB Output is correct
17 Correct 5 ms 33372 KB Output is correct
18 Correct 5 ms 33372 KB Output is correct
19 Correct 5 ms 33372 KB Output is correct
20 Correct 5 ms 33372 KB Output is correct
21 Correct 5 ms 33372 KB Output is correct
22 Correct 7 ms 33372 KB Output is correct
23 Correct 7 ms 33372 KB Output is correct
24 Correct 5 ms 33372 KB Output is correct
25 Correct 5 ms 33388 KB Output is correct
26 Correct 5 ms 35420 KB Output is correct
27 Correct 5 ms 35420 KB Output is correct
28 Correct 7 ms 33760 KB Output is correct
29 Correct 7 ms 33884 KB Output is correct
30 Correct 9 ms 35864 KB Output is correct
31 Correct 8 ms 35676 KB Output is correct
32 Correct 8 ms 33700 KB Output is correct
33 Correct 9 ms 33760 KB Output is correct
34 Correct 10 ms 33760 KB Output is correct
35 Correct 188 ms 55496 KB Output is correct
36 Correct 315 ms 65364 KB Output is correct
37 Correct 177 ms 56172 KB Output is correct
38 Correct 346 ms 70236 KB Output is correct
39 Correct 233 ms 56400 KB Output is correct
40 Correct 149 ms 55764 KB Output is correct
41 Correct 584 ms 58448 KB Output is correct
42 Correct 132 ms 51980 KB Output is correct
43 Correct 112 ms 42576 KB Output is correct
44 Correct 355 ms 57804 KB Output is correct
45 Correct 430 ms 60504 KB Output is correct
46 Correct 559 ms 55124 KB Output is correct
47 Correct 562 ms 55168 KB Output is correct
48 Correct 198 ms 57252 KB Output is correct
49 Correct 321 ms 72328 KB Output is correct
50 Correct 434 ms 70036 KB Output is correct
51 Correct 216 ms 61008 KB Output is correct
52 Correct 5 ms 33368 KB Output is correct
53 Correct 607 ms 59984 KB Output is correct
54 Correct 327 ms 58316 KB Output is correct
55 Correct 451 ms 61776 KB Output is correct
56 Correct 575 ms 56652 KB Output is correct
57 Correct 917 ms 161392 KB Output is correct
58 Correct 1721 ms 235716 KB Output is correct
59 Correct 2486 ms 228772 KB Output is correct
60 Correct 1004 ms 182084 KB Output is correct
61 Correct 3583 ms 177260 KB Output is correct
62 Correct 2033 ms 167304 KB Output is correct
63 Correct 2535 ms 183236 KB Output is correct
64 Correct 3340 ms 161720 KB Output is correct
65 Correct 306 ms 66528 KB Output is correct
66 Correct 217 ms 62544 KB Output is correct
67 Correct 217 ms 61268 KB Output is correct
68 Correct 458 ms 70572 KB Output is correct
69 Correct 321 ms 59216 KB Output is correct
70 Correct 5 ms 33372 KB Output is correct
71 Correct 577 ms 59984 KB Output is correct
72 Correct 368 ms 58312 KB Output is correct
73 Correct 465 ms 58828 KB Output is correct
74 Correct 527 ms 56912 KB Output is correct
75 Correct 1616 ms 209324 KB Output is correct
76 Correct 895 ms 189780 KB Output is correct
77 Correct 1047 ms 183532 KB Output is correct
78 Correct 2485 ms 229948 KB Output is correct
79 Correct 3459 ms 195596 KB Output is correct
80 Correct 1758 ms 184524 KB Output is correct
81 Correct 2295 ms 185352 KB Output is correct
82 Correct 3063 ms 171232 KB Output is correct
83 Correct 2994 ms 186204 KB Output is correct