oj.uz

Submission #1012401

# Submission time Handle Problem Language Result Execution time Memory
1012401 2024-07-02T06:00:11 Z modwwe Two Dishes (JOI19_dishes) C++17
74 / 100
 2920 ms 261168 KB 
//https://www.instagram.com/_modwwe/
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2")
#include<bits/stdc++.h>
#define int long long
//#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
void phongbeo();
const int inf=1e18;
const int mod2=1e9+7;
const int  mod1=998244353;
struct icd
{
    int a,b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a,b,c,d;
};
struct ie
{
    int a,b,c, d,e,f;

};
int n,m,s0,s1,s2,s4,s3,sf,k,r,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,l,l2,r2,l3,l4;
int  i,s10,s12;
int el=29;
main()
{
#ifndef ONLINE_JUDGE
///     fin(task),fou(task);
#endif
    NHP
    /// cin>>s1;
    // modwwe
    phongbeo(),down
}
struct IT
{
    id t[4000007];
    void ff(int x)
    {
        for(int i=x*2; i<=x*2+1; i++)
            t[i].a+=t[x].b,
                    t[i].b+=t[x].b,
                            t[i].c+=t[x].d,
                                    t[i].d+=t[x].d;
        t[x].d=0;
        t[x].b=0;
    }
    void build(int node,int l,int r)
    {
        t[node].a=-inf;
        t[node].c=-inf;
        if(l==0&&r==0) t[node].a=0,t[node].c=0;
        if(l==r) return;
        int mid=l+r>>1;
        build(node<<1,l,mid);
        build(node<<1|1,mid+1,r);
        t[node].a=max(t[node<<1].a,t[node<<1|1].a);
        t[node].c=max(t[node<<1].c,t[node<<1|1].c);
    }
    void upd2(int node,int l,int r,int l1,int c,int y)
    {
        if(l==r)
        {
            t[node].a=c ;
            t[node].c=y;
            return;
        }
        int mid=l+r>>1;
        ff(node);
        if(l1<=mid) upd2(node<<1,l,mid,l1,c,y);
        else upd2(node<<1|1,mid+1,r,l1,c,y);
        t[node].a=max(t[node<<1].a,t[node<<1|1].a);
        t[node].c=max(t[node<<1].c,t[node<<1|1].c);
    }
    void upd(int node,int l,int r,int l1,int r1,int c)
    {
        if(l>r1||r<l1) return;
        if(l>=l1&&r<=r1)
        {
            t[node].a+=c;
            t[node].b+=c;
            /// t[node].c+=c;
            return;
        }
        int mid=l+r>>1;
        ff(node);
        upd(node<<1,l,mid,l1,r1,c);
        upd(node<<1|1,mid+1,r,l1,r1,c);
        t[node].a=max(t[node<<1].a,t[node<<1|1].a);
        t[node].c=max(t[node<<1].c,t[node<<1|1].c);

    }
    void upd3(int node,int l,int r,int l1,int r1,int c)
    {
        if(l>r1||r<l1) return;
        if(l>=l1&&r<=r1)
        {
            t[node].a+=c;
            t[node].b+=c;
            t[node].d+=c;
            t[node].c+=c;
            return;
        }
        int mid=l+r>>1;
        ff(node);
        upd3(node<<1,l,mid,l1,r1,c);
        upd3(node<<1|1,mid+1,r,l1,r1,c);
        t[node].a=max(t[node<<1].a,t[node<<1|1].a);
        t[node].c=max(t[node<<1].c,t[node<<1|1].c);

    }
    int get(int node,int l,int r,int l1,int r1)
    {
        if(l>r1||r1<l1) return -inf;
        if(l>=l1&&r<=r1) return t[node].a;
        int mid=l+r>>1;
        ff(node);
        return max(get(node<<1,l,mid,l1,r1),get(node<<1|1,mid+1,r,l1,r1));
    }
} st;
struct FEN
{
    int bit[1000007];
    void upd(int x,int y)
    {
        for(x; x<=m; x+=x&-x)bit[x]+=y;
    }
    int get(int x)
    {
        int s=0;
        for(x; x; x-=x&-x) s+=bit[x];
        return s;
    }
} fe;
ic a[1000007];
ic b[1000007];
vector<int> v[1000007];
vector<int> v3;
vector<int> v4;
void phongbeo()
{
    cin>>n>>m;
    for(int i=1; i<=n; i++)
        cin>>a[i].a>>a[i].b>>a[i].c,
            a[i].a+=a[i-1].a,
                    v3.pb(a[i].a);
    for(int i=1; i<=m; i++)
        cin>>b[i].a>>b[i].b>>b[i].c,
            b[i].a+=b[i-1].a,
                    v4.pb(b[i].a);
    st.build(1,0,m);
    for(int i=1; i<=m; i++)
    {
        s2=b[i].b-b[i].a;
        if(s2>=0)
        {
            fe.upd(i,b[i].c);
            s2=upper_bound(v3.begin(),v3.end(),s2)-v3.begin()+1;
            v[s2].pb(i);
        }
    }
    for(int i=1; i<=n+1; i++)
    {
        for(auto x:v[i])
        {
            s2=st.get(1,0,m,0,x);
            s3=fe.get(x);
            st.upd2(1,0,m,x,s2,s2+s3);
        }
        if(i==n+1) break;
        if(a[i].b-a[i].a>=0)
        {
            s3=upper_bound(v4.begin(),v4.end(),a[i].b-a[i].a)-v4.begin();
            if(s3!=m)
            {
                s2=st.get(1,0,m,0,s3+1);
                s4=fe.get(s3+1);
                st.upd2(1,0,m,s3+1,s2,s2+s4);
            }
            st.upd3(1,0,m,0,s3,a[i].c);
        }
        for(auto x:v[i])
        {
            fe.upd(x,-b[x].c);
            st.upd(1,0,m,x,m,b[x].c);
        }
    }
    cout<<st.t[1].c;

}

Compilation message

dishes.cpp:48:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   48 | main()
      | ^~~~
dishes.cpp: In member function 'void IT::build(long long int, long long int, long long int)':
dishes.cpp:77:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   77 |         int mid=l+r>>1;
      |                 ~^~
dishes.cpp: In member function 'void IT::upd2(long long int, long long int, long long int, long long int, long long int, long long int)':
dishes.cpp:91:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   91 |         int mid=l+r>>1;
      |                 ~^~
dishes.cpp: In member function 'void IT::upd(long long int, long long int, long long int, long long int, long long int, long long int)':
dishes.cpp:108:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  108 |         int mid=l+r>>1;
      |                 ~^~
dishes.cpp: In member function 'void IT::upd3(long long int, long long int, long long int, long long int, long long int, long long int)':
dishes.cpp:127:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  127 |         int mid=l+r>>1;
      |                 ~^~
dishes.cpp: In member function 'long long int IT::get(long long int, long long int, long long int, long long int, long long int)':
dishes.cpp:139:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  139 |         int mid=l+r>>1;
      |                 ~^~
dishes.cpp: In member function 'void FEN::upd(long long int, long long int)':
dishes.cpp:149:13: warning: statement has no effect [-Wunused-value]
  149 |         for(x; x<=m; x+=x&-x)bit[x]+=y;
      |             ^
dishes.cpp: In member function 'long long int FEN::get(long long int)':
dishes.cpp:154:13: warning: statement has no effect [-Wunused-value]
  154 |         for(x; x; x-=x&-x) s+=bit[x];
      |             ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 287 ms 80696 KB Output is correct
2 Correct 300 ms 80736 KB Output is correct
3 Correct 166 ms 79424 KB Output is correct
4 Correct 224 ms 78428 KB Output is correct
5 Correct 7 ms 31324 KB Output is correct
6 Correct 244 ms 77724 KB Output is correct
7 Correct 105 ms 65320 KB Output is correct
8 Correct 55 ms 46024 KB Output is correct
9 Correct 158 ms 80464 KB Output is correct
10 Correct 273 ms 76868 KB Output is correct
11 Correct 131 ms 74040 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 31324 KB Output is correct
2 Correct 8 ms 29276 KB Output is correct
3 Correct 7 ms 31336 KB Output is correct
4 Correct 7 ms 31324 KB Output is correct
5 Correct 6 ms 31324 KB Output is correct
6 Correct 8 ms 31320 KB Output is correct
7 Correct 7 ms 31324 KB Output is correct
8 Correct 7 ms 31324 KB Output is correct
9 Correct 6 ms 31324 KB Output is correct
10 Correct 7 ms 31324 KB Output is correct
11 Correct 7 ms 31324 KB Output is correct
12 Correct 7 ms 31324 KB Output is correct
13 Correct 7 ms 31320 KB Output is correct
14 Correct 6 ms 31396 KB Output is correct
15 Correct 7 ms 31324 KB Output is correct
16 Correct 7 ms 31324 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 31324 KB Output is correct
2 Correct 8 ms 29276 KB Output is correct
3 Correct 7 ms 31336 KB Output is correct
4 Correct 7 ms 31324 KB Output is correct
5 Correct 6 ms 31324 KB Output is correct
6 Correct 8 ms 31320 KB Output is correct
7 Correct 7 ms 31324 KB Output is correct
8 Correct 7 ms 31324 KB Output is correct
9 Correct 6 ms 31324 KB Output is correct
10 Correct 7 ms 31324 KB Output is correct
11 Correct 7 ms 31324 KB Output is correct
12 Correct 7 ms 31324 KB Output is correct
13 Correct 7 ms 31320 KB Output is correct
14 Correct 6 ms 31396 KB Output is correct
15 Correct 7 ms 31324 KB Output is correct
16 Correct 7 ms 31324 KB Output is correct
17 Correct 9 ms 31320 KB Output is correct
18 Correct 7 ms 31440 KB Output is correct
19 Correct 8 ms 31396 KB Output is correct
20 Correct 9 ms 31320 KB Output is correct
21 Correct 9 ms 31324 KB Output is correct
22 Correct 9 ms 31504 KB Output is correct
23 Correct 10 ms 31324 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 31324 KB Output is correct
2 Correct 8 ms 29276 KB Output is correct
3 Correct 7 ms 31336 KB Output is correct
4 Correct 7 ms 31324 KB Output is correct
5 Correct 6 ms 31324 KB Output is correct
6 Correct 8 ms 31320 KB Output is correct
7 Correct 7 ms 31324 KB Output is correct
8 Correct 7 ms 31324 KB Output is correct
9 Correct 6 ms 31324 KB Output is correct
10 Correct 7 ms 31324 KB Output is correct
11 Correct 7 ms 31324 KB Output is correct
12 Correct 7 ms 31324 KB Output is correct
13 Correct 7 ms 31320 KB Output is correct
14 Correct 6 ms 31396 KB Output is correct
15 Correct 7 ms 31324 KB Output is correct
16 Correct 7 ms 31324 KB Output is correct
17 Correct 9 ms 31320 KB Output is correct
18 Correct 7 ms 31440 KB Output is correct
19 Correct 8 ms 31396 KB Output is correct
20 Correct 9 ms 31320 KB Output is correct
21 Correct 9 ms 31324 KB Output is correct
22 Correct 9 ms 31504 KB Output is correct
23 Correct 10 ms 31324 KB Output is correct
24 Correct 234 ms 75612 KB Output is correct
25 Correct 166 ms 76872 KB Output is correct
26 Correct 204 ms 75660 KB Output is correct
27 Correct 189 ms 80128 KB Output is correct
28 Correct 198 ms 76312 KB Output is correct
29 Correct 142 ms 77388 KB Output is correct
30 Correct 438 ms 77944 KB Output is correct
31 Correct 119 ms 63176 KB Output is correct
32 Correct 46 ms 44236 KB Output is correct
33 Correct 249 ms 75988 KB Output is correct
34 Correct 357 ms 75336 KB Output is correct
35 Correct 378 ms 71752 KB Output is correct
36 Correct 342 ms 71452 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 31324 KB Output is correct
2 Correct 8 ms 29276 KB Output is correct
3 Correct 7 ms 31336 KB Output is correct
4 Correct 7 ms 31324 KB Output is correct
5 Correct 6 ms 31324 KB Output is correct
6 Correct 8 ms 31320 KB Output is correct
7 Correct 7 ms 31324 KB Output is correct
8 Correct 7 ms 31324 KB Output is correct
9 Correct 6 ms 31324 KB Output is correct
10 Correct 7 ms 31324 KB Output is correct
11 Correct 7 ms 31324 KB Output is correct
12 Correct 7 ms 31324 KB Output is correct
13 Correct 7 ms 31320 KB Output is correct
14 Correct 6 ms 31396 KB Output is correct
15 Correct 7 ms 31324 KB Output is correct
16 Correct 7 ms 31324 KB Output is correct
17 Correct 9 ms 31320 KB Output is correct
18 Correct 7 ms 31440 KB Output is correct
19 Correct 8 ms 31396 KB Output is correct
20 Correct 9 ms 31320 KB Output is correct
21 Correct 9 ms 31324 KB Output is correct
22 Correct 9 ms 31504 KB Output is correct
23 Correct 10 ms 31324 KB Output is correct
24 Correct 234 ms 75612 KB Output is correct
25 Correct 166 ms 76872 KB Output is correct
26 Correct 204 ms 75660 KB Output is correct
27 Correct 189 ms 80128 KB Output is correct
28 Correct 198 ms 76312 KB Output is correct
29 Correct 142 ms 77388 KB Output is correct
30 Correct 438 ms 77944 KB Output is correct
31 Correct 119 ms 63176 KB Output is correct
32 Correct 46 ms 44236 KB Output is correct
33 Correct 249 ms 75988 KB Output is correct
34 Correct 357 ms 75336 KB Output is correct
35 Correct 378 ms 71752 KB Output is correct
36 Correct 342 ms 71452 KB Output is correct
37 Correct 217 ms 78660 KB Output is correct
38 Correct 191 ms 83084 KB Output is correct
39 Correct 279 ms 80452 KB Output is correct
40 Correct 278 ms 80296 KB Output is correct
41 Correct 7 ms 31324 KB Output is correct
42 Correct 421 ms 80976 KB Output is correct
43 Correct 274 ms 79048 KB Output is correct
44 Correct 320 ms 77636 KB Output is correct
45 Correct 390 ms 74572 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 31324 KB Output is correct
2 Correct 8 ms 29276 KB Output is correct
3 Correct 7 ms 31336 KB Output is correct
4 Correct 7 ms 31324 KB Output is correct
5 Correct 6 ms 31324 KB Output is correct
6 Correct 8 ms 31320 KB Output is correct
7 Correct 7 ms 31324 KB Output is correct
8 Correct 7 ms 31324 KB Output is correct
9 Correct 6 ms 31324 KB Output is correct
10 Correct 7 ms 31324 KB Output is correct
11 Correct 7 ms 31324 KB Output is correct
12 Correct 7 ms 31324 KB Output is correct
13 Correct 7 ms 31320 KB Output is correct
14 Correct 6 ms 31396 KB Output is correct
15 Correct 7 ms 31324 KB Output is correct
16 Correct 7 ms 31324 KB Output is correct
17 Correct 9 ms 31320 KB Output is correct
18 Correct 7 ms 31440 KB Output is correct
19 Correct 8 ms 31396 KB Output is correct
20 Correct 9 ms 31320 KB Output is correct
21 Correct 9 ms 31324 KB Output is correct
22 Correct 9 ms 31504 KB Output is correct
23 Correct 10 ms 31324 KB Output is correct
24 Correct 234 ms 75612 KB Output is correct
25 Correct 166 ms 76872 KB Output is correct
26 Correct 204 ms 75660 KB Output is correct
27 Correct 189 ms 80128 KB Output is correct
28 Correct 198 ms 76312 KB Output is correct
29 Correct 142 ms 77388 KB Output is correct
30 Correct 438 ms 77944 KB Output is correct
31 Correct 119 ms 63176 KB Output is correct
32 Correct 46 ms 44236 KB Output is correct
33 Correct 249 ms 75988 KB Output is correct
34 Correct 357 ms 75336 KB Output is correct
35 Correct 378 ms 71752 KB Output is correct
36 Correct 342 ms 71452 KB Output is correct
37 Correct 217 ms 78660 KB Output is correct
38 Correct 191 ms 83084 KB Output is correct
39 Correct 279 ms 80452 KB Output is correct
40 Correct 278 ms 80296 KB Output is correct
41 Correct 7 ms 31324 KB Output is correct
42 Correct 421 ms 80976 KB Output is correct
43 Correct 274 ms 79048 KB Output is correct
44 Correct 320 ms 77636 KB Output is correct
45 Correct 390 ms 74572 KB Output is correct
46 Correct 1062 ms 237864 KB Output is correct
47 Correct 1049 ms 261168 KB Output is correct
48 Correct 1458 ms 247344 KB Output is correct
49 Correct 1492 ms 247552 KB Output is correct
50 Correct 2920 ms 250940 KB Output is correct
51 Correct 1675 ms 238064 KB Output is correct
52 Correct 2066 ms 237872 KB Output is correct
53 Correct 2833 ms 219300 KB Output is correct

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 287 ms 80696 KB Output is correct
2 Correct 300 ms 80736 KB Output is correct
3 Correct 166 ms 79424 KB Output is correct
4 Correct 224 ms 78428 KB Output is correct
5 Correct 7 ms 31324 KB Output is correct
6 Correct 244 ms 77724 KB Output is correct
7 Correct 105 ms 65320 KB Output is correct
8 Correct 55 ms 46024 KB Output is correct
9 Correct 158 ms 80464 KB Output is correct
10 Correct 273 ms 76868 KB Output is correct
11 Correct 131 ms 74040 KB Output is correct
12 Correct 7 ms 31324 KB Output is correct
13 Correct 8 ms 29276 KB Output is correct
14 Correct 7 ms 31336 KB Output is correct
15 Correct 7 ms 31324 KB Output is correct
16 Correct 6 ms 31324 KB Output is correct
17 Correct 8 ms 31320 KB Output is correct
18 Correct 7 ms 31324 KB Output is correct
19 Correct 7 ms 31324 KB Output is correct
20 Correct 6 ms 31324 KB Output is correct
21 Correct 7 ms 31324 KB Output is correct
22 Correct 7 ms 31324 KB Output is correct
23 Correct 7 ms 31324 KB Output is correct
24 Correct 7 ms 31320 KB Output is correct
25 Correct 6 ms 31396 KB Output is correct
26 Correct 7 ms 31324 KB Output is correct
27 Correct 7 ms 31324 KB Output is correct
28 Correct 9 ms 31320 KB Output is correct
29 Correct 7 ms 31440 KB Output is correct
30 Correct 8 ms 31396 KB Output is correct
31 Correct 9 ms 31320 KB Output is correct
32 Correct 9 ms 31324 KB Output is correct
33 Correct 9 ms 31504 KB Output is correct
34 Correct 10 ms 31324 KB Output is correct
35 Correct 234 ms 75612 KB Output is correct
36 Correct 166 ms 76872 KB Output is correct
37 Correct 204 ms 75660 KB Output is correct
38 Correct 189 ms 80128 KB Output is correct
39 Correct 198 ms 76312 KB Output is correct
40 Correct 142 ms 77388 KB Output is correct
41 Correct 438 ms 77944 KB Output is correct
42 Correct 119 ms 63176 KB Output is correct
43 Correct 46 ms 44236 KB Output is correct
44 Correct 249 ms 75988 KB Output is correct
45 Correct 357 ms 75336 KB Output is correct
46 Correct 378 ms 71752 KB Output is correct
47 Correct 342 ms 71452 KB Output is correct
48 Correct 217 ms 78660 KB Output is correct
49 Correct 191 ms 83084 KB Output is correct
50 Correct 279 ms 80452 KB Output is correct
51 Correct 278 ms 80296 KB Output is correct
52 Correct 7 ms 31324 KB Output is correct
53 Correct 421 ms 80976 KB Output is correct
54 Correct 274 ms 79048 KB Output is correct
55 Correct 320 ms 77636 KB Output is correct
56 Correct 390 ms 74572 KB Output is correct
57 Incorrect 230 ms 79176 KB Output isn't correct
58 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 287 ms 80696 KB Output is correct
2 Correct 300 ms 80736 KB Output is correct
3 Correct 166 ms 79424 KB Output is correct
4 Correct 224 ms 78428 KB Output is correct
5 Correct 7 ms 31324 KB Output is correct
6 Correct 244 ms 77724 KB Output is correct
7 Correct 105 ms 65320 KB Output is correct
8 Correct 55 ms 46024 KB Output is correct
9 Correct 158 ms 80464 KB Output is correct
10 Correct 273 ms 76868 KB Output is correct
11 Correct 131 ms 74040 KB Output is correct
12 Correct 7 ms 31324 KB Output is correct
13 Correct 8 ms 29276 KB Output is correct
14 Correct 7 ms 31336 KB Output is correct
15 Correct 7 ms 31324 KB Output is correct
16 Correct 6 ms 31324 KB Output is correct
17 Correct 8 ms 31320 KB Output is correct
18 Correct 7 ms 31324 KB Output is correct
19 Correct 7 ms 31324 KB Output is correct
20 Correct 6 ms 31324 KB Output is correct
21 Correct 7 ms 31324 KB Output is correct
22 Correct 7 ms 31324 KB Output is correct
23 Correct 7 ms 31324 KB Output is correct
24 Correct 7 ms 31320 KB Output is correct
25 Correct 6 ms 31396 KB Output is correct
26 Correct 7 ms 31324 KB Output is correct
27 Correct 7 ms 31324 KB Output is correct
28 Correct 9 ms 31320 KB Output is correct
29 Correct 7 ms 31440 KB Output is correct
30 Correct 8 ms 31396 KB Output is correct
31 Correct 9 ms 31320 KB Output is correct
32 Correct 9 ms 31324 KB Output is correct
33 Correct 9 ms 31504 KB Output is correct
34 Correct 10 ms 31324 KB Output is correct
35 Correct 234 ms 75612 KB Output is correct
36 Correct 166 ms 76872 KB Output is correct
37 Correct 204 ms 75660 KB Output is correct
38 Correct 189 ms 80128 KB Output is correct
39 Correct 198 ms 76312 KB Output is correct
40 Correct 142 ms 77388 KB Output is correct
41 Correct 438 ms 77944 KB Output is correct
42 Correct 119 ms 63176 KB Output is correct
43 Correct 46 ms 44236 KB Output is correct
44 Correct 249 ms 75988 KB Output is correct
45 Correct 357 ms 75336 KB Output is correct
46 Correct 378 ms 71752 KB Output is correct
47 Correct 342 ms 71452 KB Output is correct
48 Correct 217 ms 78660 KB Output is correct
49 Correct 191 ms 83084 KB Output is correct
50 Correct 279 ms 80452 KB Output is correct
51 Correct 278 ms 80296 KB Output is correct
52 Correct 7 ms 31324 KB Output is correct
53 Correct 421 ms 80976 KB Output is correct
54 Correct 274 ms 79048 KB Output is correct
55 Correct 320 ms 77636 KB Output is correct
56 Correct 390 ms 74572 KB Output is correct
57 Correct 1062 ms 237864 KB Output is correct
58 Correct 1049 ms 261168 KB Output is correct
59 Correct 1458 ms 247344 KB Output is correct
60 Correct 1492 ms 247552 KB Output is correct
61 Correct 2920 ms 250940 KB Output is correct
62 Correct 1675 ms 238064 KB Output is correct
63 Correct 2066 ms 237872 KB Output is correct
64 Correct 2833 ms 219300 KB Output is correct
65 Incorrect 230 ms 79176 KB Output isn't correct
66 Halted 0 ms 0 KB -