oj.uz

Submission #1012413

# Submission time Handle Problem Language Result Execution time Memory
1012413 2024-07-02T06:27:43 Z modwwe Two Dishes (JOI19_dishes) C++17
100 / 100
 2723 ms 203276 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".ans ","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
{
    ib t[4000011];
    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[x].b=0;
    }
    void build(int node,int l,int r)
    {
        t[node].a=-inf;
        if(l==0&&r==0) t[node].a=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);
    }
    void upd2(int node,int l,int r,int l1,int c)
    {
        if(l==r)
        {
            t[node].a=max(t[node].a,c) ;
            return;
        }
        int mid=l+r>>1;
        ff(node);
        if(l1<=mid) upd2(node<<1,l,mid,l1,c);
        else upd2(node<<1|1,mid+1,r,l1,c);
        t[node].a=max(t[node<<1].a,t[node<<1|1].a);
    }
    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;
            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);
    }
    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;
            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);

    }
    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);
            st.upd2(1,0,m,x,s2);
        }
        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)
            {
                s5=s3+1;
                s2=st.get(1,0,m,0,s5);
                st.upd2(1,0,m,s5,s2);
            }
            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.get(1,0,m,0,m)+fe.get(m);
}

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:73:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   73 |         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)':
dishes.cpp:85:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   85 |         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:100:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  100 |         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:115:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  115 |         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:126:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  126 |         int mid=l+r>>1;
      |                 ~^~
dishes.cpp: In member function 'void FEN::upd(long long int, long long int)':
dishes.cpp:136:13: warning: statement has no effect [-Wunused-value]
  136 |         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:141:13: warning: statement has no effect [-Wunused-value]
  141 |         for(x; x; x-=x&-x) s+=bit[x];
      |             ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 66104 KB Output is correct
2 Correct 251 ms 66184 KB Output is correct
3 Correct 146 ms 64988 KB Output is correct
4 Correct 185 ms 63796 KB Output is correct
5 Correct 7 ms 31324 KB Output is correct
6 Correct 208 ms 63236 KB Output is correct
7 Correct 88 ms 53792 KB Output is correct
8 Correct 55 ms 43056 KB Output is correct
9 Correct 150 ms 65852 KB Output is correct
10 Correct 219 ms 65120 KB Output is correct
11 Correct 116 ms 62024 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 31580 KB Output is correct
2 Correct 7 ms 29272 KB Output is correct
3 Correct 7 ms 31324 KB Output is correct
4 Correct 7 ms 31332 KB Output is correct
5 Correct 9 ms 31324 KB Output is correct
6 Correct 7 ms 31320 KB Output is correct
7 Correct 7 ms 31324 KB Output is correct
8 Correct 8 ms 31324 KB Output is correct
9 Correct 8 ms 31324 KB Output is correct
10 Correct 7 ms 31324 KB Output is correct
11 Correct 7 ms 31400 KB Output is correct
12 Correct 8 ms 31324 KB Output is correct
13 Correct 8 ms 31324 KB Output is correct
14 Correct 9 ms 31580 KB Output is correct
15 Correct 7 ms 31388 KB Output is correct
16 Correct 7 ms 31320 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 31580 KB Output is correct
2 Correct 7 ms 29272 KB Output is correct
3 Correct 7 ms 31324 KB Output is correct
4 Correct 7 ms 31332 KB Output is correct
5 Correct 9 ms 31324 KB Output is correct
6 Correct 7 ms 31320 KB Output is correct
7 Correct 7 ms 31324 KB Output is correct
8 Correct 8 ms 31324 KB Output is correct
9 Correct 8 ms 31324 KB Output is correct
10 Correct 7 ms 31324 KB Output is correct
11 Correct 7 ms 31400 KB Output is correct
12 Correct 8 ms 31324 KB Output is correct
13 Correct 8 ms 31324 KB Output is correct
14 Correct 9 ms 31580 KB Output is correct
15 Correct 7 ms 31388 KB Output is correct
16 Correct 7 ms 31320 KB Output is correct
17 Correct 8 ms 31400 KB Output is correct
18 Correct 8 ms 31324 KB Output is correct
19 Correct 10 ms 31580 KB Output is correct
20 Correct 9 ms 31324 KB Output is correct
21 Correct 9 ms 31324 KB Output is correct
22 Correct 9 ms 31512 KB Output is correct
23 Correct 9 ms 31324 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 31580 KB Output is correct
2 Correct 7 ms 29272 KB Output is correct
3 Correct 7 ms 31324 KB Output is correct
4 Correct 7 ms 31332 KB Output is correct
5 Correct 9 ms 31324 KB Output is correct
6 Correct 7 ms 31320 KB Output is correct
7 Correct 7 ms 31324 KB Output is correct
8 Correct 8 ms 31324 KB Output is correct
9 Correct 8 ms 31324 KB Output is correct
10 Correct 7 ms 31324 KB Output is correct
11 Correct 7 ms 31400 KB Output is correct
12 Correct 8 ms 31324 KB Output is correct
13 Correct 8 ms 31324 KB Output is correct
14 Correct 9 ms 31580 KB Output is correct
15 Correct 7 ms 31388 KB Output is correct
16 Correct 7 ms 31320 KB Output is correct
17 Correct 8 ms 31400 KB Output is correct
18 Correct 8 ms 31324 KB Output is correct
19 Correct 10 ms 31580 KB Output is correct
20 Correct 9 ms 31324 KB Output is correct
21 Correct 9 ms 31324 KB Output is correct
22 Correct 9 ms 31512 KB Output is correct
23 Correct 9 ms 31324 KB Output is correct
24 Correct 228 ms 62372 KB Output is correct
25 Correct 155 ms 63556 KB Output is correct
26 Correct 184 ms 62468 KB Output is correct
27 Correct 162 ms 67160 KB Output is correct
28 Correct 193 ms 62788 KB Output is correct
29 Correct 137 ms 63956 KB Output is correct
30 Correct 322 ms 64776 KB Output is correct
31 Correct 95 ms 52628 KB Output is correct
32 Correct 48 ms 41960 KB Output is correct
33 Correct 238 ms 62788 KB Output is correct
34 Correct 282 ms 61580 KB Output is correct
35 Correct 319 ms 61316 KB Output is correct
36 Correct 281 ms 61256 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 31580 KB Output is correct
2 Correct 7 ms 29272 KB Output is correct
3 Correct 7 ms 31324 KB Output is correct
4 Correct 7 ms 31332 KB Output is correct
5 Correct 9 ms 31324 KB Output is correct
6 Correct 7 ms 31320 KB Output is correct
7 Correct 7 ms 31324 KB Output is correct
8 Correct 8 ms 31324 KB Output is correct
9 Correct 8 ms 31324 KB Output is correct
10 Correct 7 ms 31324 KB Output is correct
11 Correct 7 ms 31400 KB Output is correct
12 Correct 8 ms 31324 KB Output is correct
13 Correct 8 ms 31324 KB Output is correct
14 Correct 9 ms 31580 KB Output is correct
15 Correct 7 ms 31388 KB Output is correct
16 Correct 7 ms 31320 KB Output is correct
17 Correct 8 ms 31400 KB Output is correct
18 Correct 8 ms 31324 KB Output is correct
19 Correct 10 ms 31580 KB Output is correct
20 Correct 9 ms 31324 KB Output is correct
21 Correct 9 ms 31324 KB Output is correct
22 Correct 9 ms 31512 KB Output is correct
23 Correct 9 ms 31324 KB Output is correct
24 Correct 228 ms 62372 KB Output is correct
25 Correct 155 ms 63556 KB Output is correct
26 Correct 184 ms 62468 KB Output is correct
27 Correct 162 ms 67160 KB Output is correct
28 Correct 193 ms 62788 KB Output is correct
29 Correct 137 ms 63956 KB Output is correct
30 Correct 322 ms 64776 KB Output is correct
31 Correct 95 ms 52628 KB Output is correct
32 Correct 48 ms 41960 KB Output is correct
33 Correct 238 ms 62788 KB Output is correct
34 Correct 282 ms 61580 KB Output is correct
35 Correct 319 ms 61316 KB Output is correct
36 Correct 281 ms 61256 KB Output is correct
37 Correct 185 ms 63972 KB Output is correct
38 Correct 160 ms 68536 KB Output is correct
39 Correct 213 ms 66872 KB Output is correct
40 Correct 217 ms 67048 KB Output is correct
41 Correct 7 ms 31320 KB Output is correct
42 Correct 358 ms 66204 KB Output is correct
43 Correct 217 ms 64320 KB Output is correct
44 Correct 257 ms 62792 KB Output is correct
45 Correct 326 ms 62852 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 31580 KB Output is correct
2 Correct 7 ms 29272 KB Output is correct
3 Correct 7 ms 31324 KB Output is correct
4 Correct 7 ms 31332 KB Output is correct
5 Correct 9 ms 31324 KB Output is correct
6 Correct 7 ms 31320 KB Output is correct
7 Correct 7 ms 31324 KB Output is correct
8 Correct 8 ms 31324 KB Output is correct
9 Correct 8 ms 31324 KB Output is correct
10 Correct 7 ms 31324 KB Output is correct
11 Correct 7 ms 31400 KB Output is correct
12 Correct 8 ms 31324 KB Output is correct
13 Correct 8 ms 31324 KB Output is correct
14 Correct 9 ms 31580 KB Output is correct
15 Correct 7 ms 31388 KB Output is correct
16 Correct 7 ms 31320 KB Output is correct
17 Correct 8 ms 31400 KB Output is correct
18 Correct 8 ms 31324 KB Output is correct
19 Correct 10 ms 31580 KB Output is correct
20 Correct 9 ms 31324 KB Output is correct
21 Correct 9 ms 31324 KB Output is correct
22 Correct 9 ms 31512 KB Output is correct
23 Correct 9 ms 31324 KB Output is correct
24 Correct 228 ms 62372 KB Output is correct
25 Correct 155 ms 63556 KB Output is correct
26 Correct 184 ms 62468 KB Output is correct
27 Correct 162 ms 67160 KB Output is correct
28 Correct 193 ms 62788 KB Output is correct
29 Correct 137 ms 63956 KB Output is correct
30 Correct 322 ms 64776 KB Output is correct
31 Correct 95 ms 52628 KB Output is correct
32 Correct 48 ms 41960 KB Output is correct
33 Correct 238 ms 62788 KB Output is correct
34 Correct 282 ms 61580 KB Output is correct
35 Correct 319 ms 61316 KB Output is correct
36 Correct 281 ms 61256 KB Output is correct
37 Correct 185 ms 63972 KB Output is correct
38 Correct 160 ms 68536 KB Output is correct
39 Correct 213 ms 66872 KB Output is correct
40 Correct 217 ms 67048 KB Output is correct
41 Correct 7 ms 31320 KB Output is correct
42 Correct 358 ms 66204 KB Output is correct
43 Correct 217 ms 64320 KB Output is correct
44 Correct 257 ms 62792 KB Output is correct
45 Correct 326 ms 62852 KB Output is correct
46 Correct 920 ms 170496 KB Output is correct
47 Correct 857 ms 193496 KB Output is correct
48 Correct 1101 ms 186960 KB Output is correct
49 Correct 1191 ms 187004 KB Output is correct
50 Correct 2339 ms 183596 KB Output is correct
51 Correct 1393 ms 172252 KB Output is correct
52 Correct 1698 ms 174364 KB Output is correct
53 Correct 2105 ms 167236 KB Output is correct

Subtask #7
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 66104 KB Output is correct
2 Correct 251 ms 66184 KB Output is correct
3 Correct 146 ms 64988 KB Output is correct
4 Correct 185 ms 63796 KB Output is correct
5 Correct 7 ms 31324 KB Output is correct
6 Correct 208 ms 63236 KB Output is correct
7 Correct 88 ms 53792 KB Output is correct
8 Correct 55 ms 43056 KB Output is correct
9 Correct 150 ms 65852 KB Output is correct
10 Correct 219 ms 65120 KB Output is correct
11 Correct 116 ms 62024 KB Output is correct
12 Correct 10 ms 31580 KB Output is correct
13 Correct 7 ms 29272 KB Output is correct
14 Correct 7 ms 31324 KB Output is correct
15 Correct 7 ms 31332 KB Output is correct
16 Correct 9 ms 31324 KB Output is correct
17 Correct 7 ms 31320 KB Output is correct
18 Correct 7 ms 31324 KB Output is correct
19 Correct 8 ms 31324 KB Output is correct
20 Correct 8 ms 31324 KB Output is correct
21 Correct 7 ms 31324 KB Output is correct
22 Correct 7 ms 31400 KB Output is correct
23 Correct 8 ms 31324 KB Output is correct
24 Correct 8 ms 31324 KB Output is correct
25 Correct 9 ms 31580 KB Output is correct
26 Correct 7 ms 31388 KB Output is correct
27 Correct 7 ms 31320 KB Output is correct
28 Correct 8 ms 31400 KB Output is correct
29 Correct 8 ms 31324 KB Output is correct
30 Correct 10 ms 31580 KB Output is correct
31 Correct 9 ms 31324 KB Output is correct
32 Correct 9 ms 31324 KB Output is correct
33 Correct 9 ms 31512 KB Output is correct
34 Correct 9 ms 31324 KB Output is correct
35 Correct 228 ms 62372 KB Output is correct
36 Correct 155 ms 63556 KB Output is correct
37 Correct 184 ms 62468 KB Output is correct
38 Correct 162 ms 67160 KB Output is correct
39 Correct 193 ms 62788 KB Output is correct
40 Correct 137 ms 63956 KB Output is correct
41 Correct 322 ms 64776 KB Output is correct
42 Correct 95 ms 52628 KB Output is correct
43 Correct 48 ms 41960 KB Output is correct
44 Correct 238 ms 62788 KB Output is correct
45 Correct 282 ms 61580 KB Output is correct
46 Correct 319 ms 61316 KB Output is correct
47 Correct 281 ms 61256 KB Output is correct
48 Correct 185 ms 63972 KB Output is correct
49 Correct 160 ms 68536 KB Output is correct
50 Correct 213 ms 66872 KB Output is correct
51 Correct 217 ms 67048 KB Output is correct
52 Correct 7 ms 31320 KB Output is correct
53 Correct 358 ms 66204 KB Output is correct
54 Correct 217 ms 64320 KB Output is correct
55 Correct 257 ms 62792 KB Output is correct
56 Correct 326 ms 62852 KB Output is correct
57 Correct 199 ms 64484 KB Output is correct
58 Correct 182 ms 68548 KB Output is correct
59 Correct 251 ms 67508 KB Output is correct
60 Correct 225 ms 67276 KB Output is correct
61 Correct 340 ms 64684 KB Output is correct
62 Correct 8 ms 31320 KB Output is correct
63 Correct 374 ms 66340 KB Output is correct
64 Correct 234 ms 62196 KB Output is correct
65 Correct 336 ms 63044 KB Output is correct
66 Correct 335 ms 63048 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 66104 KB Output is correct
2 Correct 251 ms 66184 KB Output is correct
3 Correct 146 ms 64988 KB Output is correct
4 Correct 185 ms 63796 KB Output is correct
5 Correct 7 ms 31324 KB Output is correct
6 Correct 208 ms 63236 KB Output is correct
7 Correct 88 ms 53792 KB Output is correct
8 Correct 55 ms 43056 KB Output is correct
9 Correct 150 ms 65852 KB Output is correct
10 Correct 219 ms 65120 KB Output is correct
11 Correct 116 ms 62024 KB Output is correct
12 Correct 10 ms 31580 KB Output is correct
13 Correct 7 ms 29272 KB Output is correct
14 Correct 7 ms 31324 KB Output is correct
15 Correct 7 ms 31332 KB Output is correct
16 Correct 9 ms 31324 KB Output is correct
17 Correct 7 ms 31320 KB Output is correct
18 Correct 7 ms 31324 KB Output is correct
19 Correct 8 ms 31324 KB Output is correct
20 Correct 8 ms 31324 KB Output is correct
21 Correct 7 ms 31324 KB Output is correct
22 Correct 7 ms 31400 KB Output is correct
23 Correct 8 ms 31324 KB Output is correct
24 Correct 8 ms 31324 KB Output is correct
25 Correct 9 ms 31580 KB Output is correct
26 Correct 7 ms 31388 KB Output is correct
27 Correct 7 ms 31320 KB Output is correct
28 Correct 8 ms 31400 KB Output is correct
29 Correct 8 ms 31324 KB Output is correct
30 Correct 10 ms 31580 KB Output is correct
31 Correct 9 ms 31324 KB Output is correct
32 Correct 9 ms 31324 KB Output is correct
33 Correct 9 ms 31512 KB Output is correct
34 Correct 9 ms 31324 KB Output is correct
35 Correct 228 ms 62372 KB Output is correct
36 Correct 155 ms 63556 KB Output is correct
37 Correct 184 ms 62468 KB Output is correct
38 Correct 162 ms 67160 KB Output is correct
39 Correct 193 ms 62788 KB Output is correct
40 Correct 137 ms 63956 KB Output is correct
41 Correct 322 ms 64776 KB Output is correct
42 Correct 95 ms 52628 KB Output is correct
43 Correct 48 ms 41960 KB Output is correct
44 Correct 238 ms 62788 KB Output is correct
45 Correct 282 ms 61580 KB Output is correct
46 Correct 319 ms 61316 KB Output is correct
47 Correct 281 ms 61256 KB Output is correct
48 Correct 185 ms 63972 KB Output is correct
49 Correct 160 ms 68536 KB Output is correct
50 Correct 213 ms 66872 KB Output is correct
51 Correct 217 ms 67048 KB Output is correct
52 Correct 7 ms 31320 KB Output is correct
53 Correct 358 ms 66204 KB Output is correct
54 Correct 217 ms 64320 KB Output is correct
55 Correct 257 ms 62792 KB Output is correct
56 Correct 326 ms 62852 KB Output is correct
57 Correct 920 ms 170496 KB Output is correct
58 Correct 857 ms 193496 KB Output is correct
59 Correct 1101 ms 186960 KB Output is correct
60 Correct 1191 ms 187004 KB Output is correct
61 Correct 2339 ms 183596 KB Output is correct
62 Correct 1393 ms 172252 KB Output is correct
63 Correct 1698 ms 174364 KB Output is correct
64 Correct 2105 ms 167236 KB Output is correct
65 Correct 199 ms 64484 KB Output is correct
66 Correct 182 ms 68548 KB Output is correct
67 Correct 251 ms 67508 KB Output is correct
68 Correct 225 ms 67276 KB Output is correct
69 Correct 340 ms 64684 KB Output is correct
70 Correct 8 ms 31320 KB Output is correct
71 Correct 374 ms 66340 KB Output is correct
72 Correct 234 ms 62196 KB Output is correct
73 Correct 336 ms 63044 KB Output is correct
74 Correct 335 ms 63048 KB Output is correct
75 Correct 963 ms 171328 KB Output is correct
76 Correct 939 ms 194384 KB Output is correct
77 Correct 1182 ms 203276 KB Output is correct
78 Correct 1278 ms 188248 KB Output is correct
79 Correct 2723 ms 183588 KB Output is correct
80 Correct 1409 ms 172076 KB Output is correct
81 Correct 1679 ms 174244 KB Output is correct
82 Correct 2273 ms 167544 KB Output is correct
83 Correct 2286 ms 176920 KB Output is correct