oj.uz

Submission #160025

# Submission time Handle Problem Language Result Execution time Memory
160025 2019-10-25T17:19:25 Z georgerapeanu Two Dishes (JOI19_dishes) C++11
65 / 100
 10000 ms 245740 KB 
#include <cstdio>
#include <algorithm>
#include <vector>

using namespace std;

const int NMAX = 1e6;

int n,m;
int a[NMAX + 5];
int b[NMAX + 5];
int p[NMAX + 5];
int q[NMAX + 5];
long long s[NMAX + 5];
long long t[NMAX + 5];

int pref_lin[NMAX + 5];
int pref_col[NMAX + 5];

long long pref_sum_a[NMAX + 5];
long long pref_sum_b[NMAX + 5];

vector<int> event[NMAX + 5];

struct node_t{
    long long base_offset;
    long long sum;
    long long val;
    int lazy;

    node_t operator + (const node_t &other)const{
        node_t ans;
        ans.base_offset = 0;
        ans.sum = (this->sum) + other.sum;
        ans.val = 0;
        ans.lazy = 0;
        return ans;
    }
}aint[4 * NMAX + 5];

void propag(int nod,int st,int dr){
    if(st == dr || aint[nod].lazy == 0){
        return ;
    }
    
    aint[2 * nod].lazy |= aint[nod].lazy;
    aint[2 * nod + 1].lazy |= aint[nod].lazy;
    
    aint[2 * nod].val = aint[2 * nod].sum = 0;
    aint[2 * nod + 1].val = aint[2 * nod + 1].sum = 0;

    aint[nod].lazy = 0;
}

void build(int nod,int st,int dr){
    aint[nod].base_offset = 0;
    aint[nod].sum = 0;
    aint[nod].val = 0;
    aint[nod].lazy = 0;

    if(st == dr){
        return ;
    }

    int mid = (st + dr) / 2;

    build(nod * 2,st,mid);
    build(nod * 2 + 1,mid + 1,dr);
}

void update_val(int nod,int st,int dr,int pos,int delta){///+= delta
    propag(nod,st,dr);

    if(dr < pos || st > pos){
        return ;
    }

    if(st == dr){
        aint[nod].val += delta;
        if(st != 0)aint[nod].val = max(0LL,aint[nod].val);
        aint[nod].sum = aint[nod].val;
        return ;
    }

    int mid = (st + dr) / 2;

    update_val(nod * 2,st,mid,pos,delta);
    update_val(nod * 2 + 1,mid + 1,dr,pos,delta);
        
    aint[nod] = aint[nod * 2] + aint[nod * 2 + 1];
}

void update_offset(int nod,int st,int dr,int pos,int delta,bool initial = false){/// += delta_offset
    propag(nod,st,dr);
    if(dr < pos || st > pos){
        return ;
    }

    if(st == dr){
        aint[nod].base_offset += delta;
        if(initial == false){
            aint[nod].val -= delta;
            aint[nod].val = max(aint[nod].val,0LL);
        }
        aint[nod].sum = aint[nod].val;
        return ;
    }

    int mid = (st + dr) / 2;

    update_offset(nod * 2,st,mid,pos,delta,initial);
    update_offset(nod * 2 + 1,mid + 1,dr,pos,delta,initial);
    
    aint[nod] = aint[nod * 2] + aint[nod * 2 + 1];
}

void update_0(int nod,int st,int dr,int l,int r){
    propag(nod,st,dr);
    if(r < st || l > dr){
        return ;
    }
    if(l <= st && dr <= r){
        aint[nod].lazy = 1;
        aint[nod].sum = 0;
        aint[nod].val = 0;
        return ;
    }

    int mid = (st + dr) / 2;

    update_0(nod * 2,st,mid,l,r);
    update_0(nod * 2 + 1,mid + 1,dr,l,r);

    aint[nod] = aint[nod * 2] + aint[nod * 2 + 1];
}
long long query_sum(int nod,int st,int dr,int l,int r){
    propag(nod,st,dr);
    if(r < st || l > dr){
        return 0;
    }
    
    if(l <= st && dr <= r){
        return aint[nod].sum;
    }
    
    int mid = (st + dr) / 2;

    return query_sum(nod * 2,st,mid,l,r) + query_sum(nod * 2 + 1,mid + 1,dr,l,r);
}

long long get_val(int nod,int st,int dr,int pos){
    propag(nod,st,dr);
    if(dr < pos || st > pos){
        return -1;
    }
    
    if(st == dr){
        return aint[nod].val;
    }

    int mid = (st + dr) / 2;

    return max(get_val(nod * 2,st,mid,pos),get_val(nod * 2 + 1,mid + 1,dr,pos));
}

int get_pos_sum(int pos,int elem){///TODO can be improved
   int l = pos - 1,r = n + 1;
    while(r - l > 1){
        int mid = (l + r) / 2;
        if(query_sum(1,0,n,pos,mid) + elem >= 0){
            r = mid;
        }
        else{
            l = mid;
        }
    }

    return r;
}

long long get_time(int i,int j){
    return pref_sum_a[i] + pref_sum_b[j];
}

long long get_ans(int nod,int st,int dr){
    propag(nod,st,dr);
    if(st == dr){
        return (aint[nod].val + aint[nod].base_offset);
    }

    int mid = (st + dr) / 2;

    return get_ans(nod * 2,st,mid) + get_ans(nod * 2 + 1,mid + 1,dr);
}

int main(){

    scanf("%d %d",&n,&m);

    for(int i = 1;i <= n;i++){
        scanf("%d %lld %d",&a[i],&s[i],&p[i]);
        pref_sum_a[i] = a[i] + pref_sum_a[i - 1];
    }
    
    for(int i = 1;i <= m;i++){
        scanf("%d %lld %d",&b[i],&t[i],&q[i]);
        pref_sum_b[i] = b[i] + pref_sum_b[i - 1];
    }

    for(int j = 0;j <= m;j++){
        int l = -1,r = n + 1;
        while(r - l > 1){
            int mid = (l + r) / 2;
            if(get_time(mid,j) <= t[j]){
                l = mid;
            }
            else{
                r = mid;
            }
        }

        pref_col[j] =  l;
    }


    for(int i = 0;i <= n;i++){
        int l = -1,r = m + 1;

        while(r - l > 1){
            int mid = (l + r) / 2;
            if(get_time(i,mid) <= s[i]){
                l = mid;
            }
            else{
                r = mid;
            }
        }

        pref_lin[i] = l;
    }

    build(1,0,n);

    for(int i = 1;i <= n;i++){
        if(pref_lin[i] > -1){
            update_offset(1,0,n,i,p[i],true);
            event[pref_lin[i] + 1].push_back(i);
        }
    }
   
    for(int j = 1;j <= m;j++){
        for(auto it:event[j]){
            update_offset(1,0,n,it,-p[it]);
            if(-p[it] > 0){
                int k = get_pos_sum(it + 1,p[it]);
                if(k <= n){
                    update_val(1,0,n,k,(query_sum(1,0,n,it + 1,k) + p[it]) - get_val(1,0,n,k));
                }
                if(it + 1 <= k - 1){
                    update_0(1,0,n,it + 1,k - 1);
                }
            }
        }
        if(pref_col[j] > -1){
            update_val(1,0,n,0,q[j]);
            int k = get_pos_sum(pref_col[j] + 1,-q[j]);
            if(k <= n){
                update_val(1,0,n,k,(query_sum(1,0,n,pref_col[j] + 1,k) - q[j]) - get_val(1,0,n,k));
            }
            if(pref_col[j] + 1 <= k - 1){
                update_0(1,0,n,pref_col[j] + 1,k - 1);
            }
        }
    }

    printf("%lld\n",get_ans(1,0,n));

    return 0;
}

Compilation message

dishes.cpp: In function 'int main()':
dishes.cpp:198:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~~
dishes.cpp:201:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %lld %d",&a[i],&s[i],&p[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dishes.cpp:206:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %lld %d",&b[i],&t[i],&q[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1749 ms 55160 KB Output is correct
2 Correct 1469 ms 68600 KB Output is correct
3 Correct 421 ms 65980 KB Output is correct
4 Correct 1325 ms 68572 KB Output is correct
5 Correct 28 ms 23800 KB Output is correct
6 Correct 1338 ms 67432 KB Output is correct
7 Correct 134 ms 36220 KB Output is correct
8 Correct 224 ms 53996 KB Output is correct
9 Correct 437 ms 67096 KB Output is correct
10 Correct 1696 ms 64888 KB Output is correct
11 Correct 363 ms 60140 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23800 KB Output is correct
2 Correct 23 ms 23928 KB Output is correct
3 Correct 24 ms 23800 KB Output is correct
4 Correct 23 ms 23800 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 23 ms 23800 KB Output is correct
7 Correct 25 ms 23800 KB Output is correct
8 Correct 25 ms 23928 KB Output is correct
9 Correct 25 ms 23800 KB Output is correct
10 Correct 23 ms 23800 KB Output is correct
11 Correct 23 ms 23928 KB Output is correct
12 Correct 23 ms 23928 KB Output is correct
13 Correct 23 ms 23800 KB Output is correct
14 Correct 23 ms 23804 KB Output is correct
15 Correct 23 ms 23800 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23800 KB Output is correct
2 Correct 23 ms 23928 KB Output is correct
3 Correct 24 ms 23800 KB Output is correct
4 Correct 23 ms 23800 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 23 ms 23800 KB Output is correct
7 Correct 25 ms 23800 KB Output is correct
8 Correct 25 ms 23928 KB Output is correct
9 Correct 25 ms 23800 KB Output is correct
10 Correct 23 ms 23800 KB Output is correct
11 Correct 23 ms 23928 KB Output is correct
12 Correct 23 ms 23928 KB Output is correct
13 Correct 23 ms 23800 KB Output is correct
14 Correct 23 ms 23804 KB Output is correct
15 Correct 23 ms 23800 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 26 ms 24184 KB Output is correct
18 Correct 31 ms 24152 KB Output is correct
19 Correct 33 ms 24184 KB Output is correct
20 Correct 30 ms 24184 KB Output is correct
21 Correct 32 ms 24140 KB Output is correct
22 Correct 33 ms 24184 KB Output is correct
23 Correct 35 ms 24184 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23800 KB Output is correct
2 Correct 23 ms 23928 KB Output is correct
3 Correct 24 ms 23800 KB Output is correct
4 Correct 23 ms 23800 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 23 ms 23800 KB Output is correct
7 Correct 25 ms 23800 KB Output is correct
8 Correct 25 ms 23928 KB Output is correct
9 Correct 25 ms 23800 KB Output is correct
10 Correct 23 ms 23800 KB Output is correct
11 Correct 23 ms 23928 KB Output is correct
12 Correct 23 ms 23928 KB Output is correct
13 Correct 23 ms 23800 KB Output is correct
14 Correct 23 ms 23804 KB Output is correct
15 Correct 23 ms 23800 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 26 ms 24184 KB Output is correct
18 Correct 31 ms 24152 KB Output is correct
19 Correct 33 ms 24184 KB Output is correct
20 Correct 30 ms 24184 KB Output is correct
21 Correct 32 ms 24140 KB Output is correct
22 Correct 33 ms 24184 KB Output is correct
23 Correct 35 ms 24184 KB Output is correct
24 Correct 440 ms 52496 KB Output is correct
25 Correct 1632 ms 62524 KB Output is correct
26 Correct 456 ms 68204 KB Output is correct
27 Correct 1730 ms 62580 KB Output is correct
28 Correct 1040 ms 63852 KB Output is correct
29 Correct 390 ms 63728 KB Output is correct
30 Correct 2644 ms 65972 KB Output is correct
31 Correct 129 ms 34552 KB Output is correct
32 Correct 243 ms 52216 KB Output is correct
33 Correct 1490 ms 63992 KB Output is correct
34 Correct 2108 ms 64392 KB Output is correct
35 Correct 2606 ms 59680 KB Output is correct
36 Correct 2549 ms 59472 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23800 KB Output is correct
2 Correct 23 ms 23928 KB Output is correct
3 Correct 24 ms 23800 KB Output is correct
4 Correct 23 ms 23800 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 23 ms 23800 KB Output is correct
7 Correct 25 ms 23800 KB Output is correct
8 Correct 25 ms 23928 KB Output is correct
9 Correct 25 ms 23800 KB Output is correct
10 Correct 23 ms 23800 KB Output is correct
11 Correct 23 ms 23928 KB Output is correct
12 Correct 23 ms 23928 KB Output is correct
13 Correct 23 ms 23800 KB Output is correct
14 Correct 23 ms 23804 KB Output is correct
15 Correct 23 ms 23800 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 26 ms 24184 KB Output is correct
18 Correct 31 ms 24152 KB Output is correct
19 Correct 33 ms 24184 KB Output is correct
20 Correct 30 ms 24184 KB Output is correct
21 Correct 32 ms 24140 KB Output is correct
22 Correct 33 ms 24184 KB Output is correct
23 Correct 35 ms 24184 KB Output is correct
24 Correct 440 ms 52496 KB Output is correct
25 Correct 1632 ms 62524 KB Output is correct
26 Correct 456 ms 68204 KB Output is correct
27 Correct 1730 ms 62580 KB Output is correct
28 Correct 1040 ms 63852 KB Output is correct
29 Correct 390 ms 63728 KB Output is correct
30 Correct 2644 ms 65972 KB Output is correct
31 Correct 129 ms 34552 KB Output is correct
32 Correct 243 ms 52216 KB Output is correct
33 Correct 1490 ms 63992 KB Output is correct
34 Correct 2108 ms 64392 KB Output is correct
35 Correct 2606 ms 59680 KB Output is correct
36 Correct 2549 ms 59472 KB Output is correct
37 Correct 522 ms 71264 KB Output is correct
38 Correct 1774 ms 65644 KB Output is correct
39 Correct 2151 ms 68756 KB Output is correct
40 Correct 1674 ms 68744 KB Output is correct
41 Correct 24 ms 23800 KB Output is correct
42 Correct 2731 ms 69308 KB Output is correct
43 Correct 1636 ms 67032 KB Output is correct
44 Correct 2003 ms 67192 KB Output is correct
45 Correct 2700 ms 62616 KB Output is correct

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23800 KB Output is correct
2 Correct 23 ms 23928 KB Output is correct
3 Correct 24 ms 23800 KB Output is correct
4 Correct 23 ms 23800 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 23 ms 23800 KB Output is correct
7 Correct 25 ms 23800 KB Output is correct
8 Correct 25 ms 23928 KB Output is correct
9 Correct 25 ms 23800 KB Output is correct
10 Correct 23 ms 23800 KB Output is correct
11 Correct 23 ms 23928 KB Output is correct
12 Correct 23 ms 23928 KB Output is correct
13 Correct 23 ms 23800 KB Output is correct
14 Correct 23 ms 23804 KB Output is correct
15 Correct 23 ms 23800 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 26 ms 24184 KB Output is correct
18 Correct 31 ms 24152 KB Output is correct
19 Correct 33 ms 24184 KB Output is correct
20 Correct 30 ms 24184 KB Output is correct
21 Correct 32 ms 24140 KB Output is correct
22 Correct 33 ms 24184 KB Output is correct
23 Correct 35 ms 24184 KB Output is correct
24 Correct 440 ms 52496 KB Output is correct
25 Correct 1632 ms 62524 KB Output is correct
26 Correct 456 ms 68204 KB Output is correct
27 Correct 1730 ms 62580 KB Output is correct
28 Correct 1040 ms 63852 KB Output is correct
29 Correct 390 ms 63728 KB Output is correct
30 Correct 2644 ms 65972 KB Output is correct
31 Correct 129 ms 34552 KB Output is correct
32 Correct 243 ms 52216 KB Output is correct
33 Correct 1490 ms 63992 KB Output is correct
34 Correct 2108 ms 64392 KB Output is correct
35 Correct 2606 ms 59680 KB Output is correct
36 Correct 2549 ms 59472 KB Output is correct
37 Correct 522 ms 71264 KB Output is correct
38 Correct 1774 ms 65644 KB Output is correct
39 Correct 2151 ms 68756 KB Output is correct
40 Correct 1674 ms 68744 KB Output is correct
41 Correct 24 ms 23800 KB Output is correct
42 Correct 2731 ms 69308 KB Output is correct
43 Correct 1636 ms 67032 KB Output is correct
44 Correct 2003 ms 67192 KB Output is correct
45 Correct 2700 ms 62616 KB Output is correct
46 Correct 2702 ms 245740 KB Output is correct
47 Execution timed out 10026 ms 216656 KB Time limit exceeded
48 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1749 ms 55160 KB Output is correct
2 Correct 1469 ms 68600 KB Output is correct
3 Correct 421 ms 65980 KB Output is correct
4 Correct 1325 ms 68572 KB Output is correct
5 Correct 28 ms 23800 KB Output is correct
6 Correct 1338 ms 67432 KB Output is correct
7 Correct 134 ms 36220 KB Output is correct
8 Correct 224 ms 53996 KB Output is correct
9 Correct 437 ms 67096 KB Output is correct
10 Correct 1696 ms 64888 KB Output is correct
11 Correct 363 ms 60140 KB Output is correct
12 Correct 23 ms 23800 KB Output is correct
13 Correct 23 ms 23928 KB Output is correct
14 Correct 24 ms 23800 KB Output is correct
15 Correct 23 ms 23800 KB Output is correct
16 Correct 23 ms 23928 KB Output is correct
17 Correct 23 ms 23800 KB Output is correct
18 Correct 25 ms 23800 KB Output is correct
19 Correct 25 ms 23928 KB Output is correct
20 Correct 25 ms 23800 KB Output is correct
21 Correct 23 ms 23800 KB Output is correct
22 Correct 23 ms 23928 KB Output is correct
23 Correct 23 ms 23928 KB Output is correct
24 Correct 23 ms 23800 KB Output is correct
25 Correct 23 ms 23804 KB Output is correct
26 Correct 23 ms 23800 KB Output is correct
27 Correct 24 ms 23928 KB Output is correct
28 Correct 26 ms 24184 KB Output is correct
29 Correct 31 ms 24152 KB Output is correct
30 Correct 33 ms 24184 KB Output is correct
31 Correct 30 ms 24184 KB Output is correct
32 Correct 32 ms 24140 KB Output is correct
33 Correct 33 ms 24184 KB Output is correct
34 Correct 35 ms 24184 KB Output is correct
35 Correct 440 ms 52496 KB Output is correct
36 Correct 1632 ms 62524 KB Output is correct
37 Correct 456 ms 68204 KB Output is correct
38 Correct 1730 ms 62580 KB Output is correct
39 Correct 1040 ms 63852 KB Output is correct
40 Correct 390 ms 63728 KB Output is correct
41 Correct 2644 ms 65972 KB Output is correct
42 Correct 129 ms 34552 KB Output is correct
43 Correct 243 ms 52216 KB Output is correct
44 Correct 1490 ms 63992 KB Output is correct
45 Correct 2108 ms 64392 KB Output is correct
46 Correct 2606 ms 59680 KB Output is correct
47 Correct 2549 ms 59472 KB Output is correct
48 Correct 522 ms 71264 KB Output is correct
49 Correct 1774 ms 65644 KB Output is correct
50 Correct 2151 ms 68756 KB Output is correct
51 Correct 1674 ms 68744 KB Output is correct
52 Correct 24 ms 23800 KB Output is correct
53 Correct 2731 ms 69308 KB Output is correct
54 Correct 1636 ms 67032 KB Output is correct
55 Correct 2003 ms 67192 KB Output is correct
56 Correct 2700 ms 62616 KB Output is correct
57 Correct 1877 ms 71836 KB Output is correct
58 Correct 1549 ms 66036 KB Output is correct
59 Incorrect 1665 ms 69624 KB Output isn't correct
60 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1749 ms 55160 KB Output is correct
2 Correct 1469 ms 68600 KB Output is correct
3 Correct 421 ms 65980 KB Output is correct
4 Correct 1325 ms 68572 KB Output is correct
5 Correct 28 ms 23800 KB Output is correct
6 Correct 1338 ms 67432 KB Output is correct
7 Correct 134 ms 36220 KB Output is correct
8 Correct 224 ms 53996 KB Output is correct
9 Correct 437 ms 67096 KB Output is correct
10 Correct 1696 ms 64888 KB Output is correct
11 Correct 363 ms 60140 KB Output is correct
12 Correct 23 ms 23800 KB Output is correct
13 Correct 23 ms 23928 KB Output is correct
14 Correct 24 ms 23800 KB Output is correct
15 Correct 23 ms 23800 KB Output is correct
16 Correct 23 ms 23928 KB Output is correct
17 Correct 23 ms 23800 KB Output is correct
18 Correct 25 ms 23800 KB Output is correct
19 Correct 25 ms 23928 KB Output is correct
20 Correct 25 ms 23800 KB Output is correct
21 Correct 23 ms 23800 KB Output is correct
22 Correct 23 ms 23928 KB Output is correct
23 Correct 23 ms 23928 KB Output is correct
24 Correct 23 ms 23800 KB Output is correct
25 Correct 23 ms 23804 KB Output is correct
26 Correct 23 ms 23800 KB Output is correct
27 Correct 24 ms 23928 KB Output is correct
28 Correct 26 ms 24184 KB Output is correct
29 Correct 31 ms 24152 KB Output is correct
30 Correct 33 ms 24184 KB Output is correct
31 Correct 30 ms 24184 KB Output is correct
32 Correct 32 ms 24140 KB Output is correct
33 Correct 33 ms 24184 KB Output is correct
34 Correct 35 ms 24184 KB Output is correct
35 Correct 440 ms 52496 KB Output is correct
36 Correct 1632 ms 62524 KB Output is correct
37 Correct 456 ms 68204 KB Output is correct
38 Correct 1730 ms 62580 KB Output is correct
39 Correct 1040 ms 63852 KB Output is correct
40 Correct 390 ms 63728 KB Output is correct
41 Correct 2644 ms 65972 KB Output is correct
42 Correct 129 ms 34552 KB Output is correct
43 Correct 243 ms 52216 KB Output is correct
44 Correct 1490 ms 63992 KB Output is correct
45 Correct 2108 ms 64392 KB Output is correct
46 Correct 2606 ms 59680 KB Output is correct
47 Correct 2549 ms 59472 KB Output is correct
48 Correct 522 ms 71264 KB Output is correct
49 Correct 1774 ms 65644 KB Output is correct
50 Correct 2151 ms 68756 KB Output is correct
51 Correct 1674 ms 68744 KB Output is correct
52 Correct 24 ms 23800 KB Output is correct
53 Correct 2731 ms 69308 KB Output is correct
54 Correct 1636 ms 67032 KB Output is correct
55 Correct 2003 ms 67192 KB Output is correct
56 Correct 2700 ms 62616 KB Output is correct
57 Correct 2702 ms 245740 KB Output is correct
58 Execution timed out 10026 ms 216656 KB Time limit exceeded
59 Halted 0 ms 0 KB -