oj.uz

Submission #831723

# Submission time Handle Problem Language Result Execution time Memory
831723 2023-08-20T12:41:29 Z Ronin13 Food Court (JOI21_foodcourt) C++17
100 / 100
 677 ms 90912 KB 
#include <bits/stdc++.h>
#define ll long long  
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
using namespace std;

const int nmax = 250001;

struct node{
    ll sum, mn;
    ll sum1, sum2;
    int ind;
    node(){
        sum = mn = sum1 = 0;
        ind = 0;
        sum2 = 0;
    }
    node(int val){
        mn = min(0, val);
        sum = sum1 = val;
    }
}t[4 * nmax];

node merg(node a, node b){
    node c;
    c.sum = a.sum + b.sum;
    c.sum1 = a.sum1 + b.sum1;
    c.sum2 = a.sum2 + b.sum2;
    if(a.mn <= a.sum + b.mn){
        c.mn = a.mn;
        c.ind = a.ind;
    }
    else{
        c.mn = a.sum + b.mn;
        c.ind = b.ind;
    }
    return c;
}

void add(int v, int l, int r, int pos, ll val){
    if(l > pos || r < pos) return;
    if(l == r){
        t[v].sum = val;
        t[v].mn = val;
        t[v].sum1 = val;
        return;
    }
    int m = (l + r) / 2;
    add(2 * v, l,m, pos, val);
    add(2 *  v + 1, m + 1, r, pos, val);
    t[v] = merg(t[2 * v], t[2 * v + 1]);
}

void rem(int v, int l, int r, int pos, ll val){
    if(l > pos || r < pos) return;
    if(l == r){
        t[v].sum = -val;
        t[v].mn = -val;
        t[v].sum2 = val;
        return;
    }
    int m = (l + r) / 2;
    rem(2 * v,l, m, pos, val);
    rem(2 * v + 1, m + 1, r, pos, val);
    t[v] = merg(t[2 * v], t[2 * v +  1]);
}


node get_mn(int v, int l, int r, int st, int fin){
    if(l > fin || r < st) return {0};
    if(l >= st && r <= fin){
        return t[v];
    }
    int m = (l + r) / 2;
    return merg(get_mn(2 * v, l, m, st, fin),
                    get_mn(2 * v + 1, m + 1, r, st, fin));
}


ll get(int v, int l, int r, int st, int fin){
    if(l > fin || r < st){
        return 0;
    }
    if(l >= st && r <= fin){
        return t[v].sum1;
    }
    int m = (l + r) / 2;
    return get(2 * v, l, m, st, fin) + get(2 * v + 1,m + 1, r, st, fin);
}
ll get1(int v, int l, int r, int st, int fin){
    if(l > fin || r < st)
        return 0;
    if(l >= st && r <= fin){
        return t[v].sum2;
    }
    int m = (l + r) / 2;
    return get1(2 * v, l, m, st, fin) + 
            get1(2 * v + 1, m + 1, r, st, fin);
}

int getfirst(int v, int l, int r, int st, int fin, ll val){
    if(l > fin || r < st) return 0;
    if(l >= st && r <= fin){
        if(t[v].sum1 >= val) {
            while(l != r){
                int m = (l + r) / 2;
                if(t[v * 2].sum1 >= val) v *= 2, r = m;
                else val -= t[2 * v].sum1, v = v * 2 + 1, l = m + 1;
            }
            return l;
        }
        return 0;
    }
    int m = (l + r) / 2;
    int x = getfirst(2 * v, l, m, st, fin, val);
    if(x) return x;
    return getfirst(2 * v + 1, m + 1, r, st, fin, val - t[2 * v].sum1);
}

void build(int v, int l, int r){
    if(l == r){
        t[v].ind = l;
        return;
    }
    int m = (l + r)/ 2;
    build(2 * v, l, m);
    build(2 * v + 1, m + 1, r);
}


int main(){
    int n, m, q; cin >> n >> m >> q;
    build(1, 1, q + 1);
    add(1, 1, q + 1, 1, 0);
    vector <vector <pll> > in(n + 1);
    vector <vector <pll > > out(n + 1);
    vector <vector <pll> > uu(n + 1);
    vector <vector <pll> > vv(n + 1);
    vector <vector <pll> > qv(n + 1);
    int Val[q + 1];
   vector <pll> ans;
    for(int i = 1; i <= q; i++){
        int t; cin >> t;
        if(t == 1){
            ll a, b, c; cin >> a >> b >> c;
            ll d; cin >> d;
            Val[i] = c;
            in[a].pb({d, i});
            out[b].pb({d, i});
        }
        if(t == 2){
            ll a, b, c; cin >> a >> b >> c;
            uu[a].pb({c, i});
            vv[b].pb({0, i});
        }
        if(t == 3){
            int p; cin >> p;
            ll b; cin >> b;
            qv[p].pb({i, b});
        }
    }
    q++;
    for(int i = 1; i <= n; ++i){
        for(auto to : in[i]){
            add(1, 1, q, to.s + 1, to.f);
        }
        for(auto to : uu[i]){
            rem(1, 1, q, to.s + 1, to.f);
        }
        for(auto to : qv[i]){
            node x = get_mn(1, 1, q, 1, to.f);
            //cout << x.ind << "\n";
            ll sum = get(1, 1, q, 1, x.ind);
            ll val = get1(1, 1, q, x.ind + 1, to.f);
            int pp = getfirst(1, 1, q, x.ind, to.f, val + sum + to.s);
            if(pp > 1){
                ans.pb({to.f, Val[pp - 1]});
            }
            else ans.pb({to.f, 0});
        }
        for(auto to : out[i]){
            add(1, 1, q, to.s + 1, 0);
        }
        for(auto to : vv[i]){
            rem(1, 1, q, to.s + 1, 0);
        }
    }
    sort(ans.begin(), ans.end());
    for(auto to : ans){
        cout << to.s << "\n";
    }
    return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 39636 KB Output is correct
2 Correct 18 ms 39764 KB Output is correct
3 Correct 22 ms 39724 KB Output is correct
4 Correct 18 ms 39788 KB Output is correct
5 Correct 18 ms 39504 KB Output is correct
6 Correct 17 ms 39432 KB Output is correct
7 Correct 18 ms 39764 KB Output is correct
8 Correct 19 ms 39764 KB Output is correct
9 Correct 18 ms 39764 KB Output is correct
10 Correct 22 ms 39764 KB Output is correct
11 Correct 18 ms 39712 KB Output is correct
12 Correct 19 ms 39740 KB Output is correct
13 Correct 18 ms 39672 KB Output is correct
14 Correct 19 ms 39768 KB Output is correct
15 Correct 18 ms 39636 KB Output is correct
16 Correct 19 ms 39764 KB Output is correct
17 Correct 18 ms 39664 KB Output is correct
18 Correct 19 ms 39680 KB Output is correct
19 Correct 19 ms 39652 KB Output is correct
20 Correct 19 ms 39760 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 39636 KB Output is correct
2 Correct 18 ms 39764 KB Output is correct
3 Correct 22 ms 39724 KB Output is correct
4 Correct 18 ms 39788 KB Output is correct
5 Correct 18 ms 39504 KB Output is correct
6 Correct 17 ms 39432 KB Output is correct
7 Correct 18 ms 39764 KB Output is correct
8 Correct 19 ms 39764 KB Output is correct
9 Correct 18 ms 39764 KB Output is correct
10 Correct 22 ms 39764 KB Output is correct
11 Correct 18 ms 39712 KB Output is correct
12 Correct 19 ms 39740 KB Output is correct
13 Correct 18 ms 39672 KB Output is correct
14 Correct 19 ms 39768 KB Output is correct
15 Correct 18 ms 39636 KB Output is correct
16 Correct 19 ms 39764 KB Output is correct
17 Correct 18 ms 39664 KB Output is correct
18 Correct 19 ms 39680 KB Output is correct
19 Correct 19 ms 39652 KB Output is correct
20 Correct 19 ms 39760 KB Output is correct
21 Correct 18 ms 39676 KB Output is correct
22 Correct 19 ms 39804 KB Output is correct
23 Correct 19 ms 39704 KB Output is correct
24 Correct 19 ms 39808 KB Output is correct
25 Correct 18 ms 39440 KB Output is correct
26 Correct 18 ms 39540 KB Output is correct
27 Correct 19 ms 39756 KB Output is correct
28 Correct 18 ms 39732 KB Output is correct
29 Correct 20 ms 39724 KB Output is correct
30 Correct 19 ms 39800 KB Output is correct
31 Correct 19 ms 39712 KB Output is correct
32 Correct 21 ms 39828 KB Output is correct
33 Correct 18 ms 39764 KB Output is correct
34 Correct 18 ms 39840 KB Output is correct
35 Correct 22 ms 39652 KB Output is correct
36 Correct 20 ms 39756 KB Output is correct
37 Correct 21 ms 39660 KB Output is correct
38 Correct 19 ms 39764 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 51084 KB Output is correct
2 Correct 115 ms 51012 KB Output is correct
3 Correct 118 ms 51080 KB Output is correct
4 Correct 132 ms 51100 KB Output is correct
5 Correct 115 ms 50948 KB Output is correct
6 Correct 125 ms 50892 KB Output is correct
7 Correct 73 ms 42132 KB Output is correct
8 Correct 76 ms 42288 KB Output is correct
9 Correct 115 ms 51088 KB Output is correct
10 Correct 123 ms 50944 KB Output is correct
11 Correct 114 ms 50968 KB Output is correct
12 Correct 114 ms 50880 KB Output is correct
13 Correct 101 ms 48204 KB Output is correct
14 Correct 113 ms 51032 KB Output is correct
15 Correct 114 ms 48332 KB Output is correct
16 Correct 125 ms 50952 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 582 ms 79748 KB Output is correct
2 Correct 420 ms 77228 KB Output is correct
3 Correct 645 ms 89828 KB Output is correct
4 Correct 408 ms 83920 KB Output is correct
5 Correct 414 ms 76856 KB Output is correct
6 Correct 565 ms 89412 KB Output is correct
7 Correct 306 ms 54172 KB Output is correct
8 Correct 342 ms 54820 KB Output is correct
9 Correct 541 ms 88508 KB Output is correct
10 Correct 566 ms 88616 KB Output is correct
11 Correct 542 ms 89320 KB Output is correct
12 Correct 592 ms 89360 KB Output is correct
13 Correct 559 ms 89292 KB Output is correct
14 Correct 621 ms 89356 KB Output is correct
15 Correct 569 ms 89268 KB Output is correct
16 Correct 582 ms 89212 KB Output is correct
17 Correct 599 ms 89296 KB Output is correct
18 Correct 623 ms 89300 KB Output is correct
19 Correct 652 ms 89268 KB Output is correct
20 Correct 607 ms 89264 KB Output is correct
21 Correct 594 ms 89312 KB Output is correct
22 Correct 613 ms 89224 KB Output is correct
23 Correct 570 ms 89208 KB Output is correct
24 Correct 628 ms 89264 KB Output is correct
25 Correct 486 ms 81896 KB Output is correct
26 Correct 500 ms 89048 KB Output is correct
27 Correct 473 ms 90180 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 39636 KB Output is correct
2 Correct 18 ms 39764 KB Output is correct
3 Correct 22 ms 39724 KB Output is correct
4 Correct 18 ms 39788 KB Output is correct
5 Correct 18 ms 39504 KB Output is correct
6 Correct 17 ms 39432 KB Output is correct
7 Correct 18 ms 39764 KB Output is correct
8 Correct 19 ms 39764 KB Output is correct
9 Correct 18 ms 39764 KB Output is correct
10 Correct 22 ms 39764 KB Output is correct
11 Correct 18 ms 39712 KB Output is correct
12 Correct 19 ms 39740 KB Output is correct
13 Correct 18 ms 39672 KB Output is correct
14 Correct 19 ms 39768 KB Output is correct
15 Correct 18 ms 39636 KB Output is correct
16 Correct 19 ms 39764 KB Output is correct
17 Correct 18 ms 39664 KB Output is correct
18 Correct 19 ms 39680 KB Output is correct
19 Correct 19 ms 39652 KB Output is correct
20 Correct 19 ms 39760 KB Output is correct
21 Correct 126 ms 51084 KB Output is correct
22 Correct 115 ms 51012 KB Output is correct
23 Correct 118 ms 51080 KB Output is correct
24 Correct 132 ms 51100 KB Output is correct
25 Correct 115 ms 50948 KB Output is correct
26 Correct 125 ms 50892 KB Output is correct
27 Correct 73 ms 42132 KB Output is correct
28 Correct 76 ms 42288 KB Output is correct
29 Correct 115 ms 51088 KB Output is correct
30 Correct 123 ms 50944 KB Output is correct
31 Correct 114 ms 50968 KB Output is correct
32 Correct 114 ms 50880 KB Output is correct
33 Correct 101 ms 48204 KB Output is correct
34 Correct 113 ms 51032 KB Output is correct
35 Correct 114 ms 48332 KB Output is correct
36 Correct 125 ms 50952 KB Output is correct
37 Correct 108 ms 49992 KB Output is correct
38 Correct 94 ms 49452 KB Output is correct
39 Correct 77 ms 41584 KB Output is correct
40 Correct 77 ms 42048 KB Output is correct
41 Correct 121 ms 50888 KB Output is correct
42 Correct 122 ms 50892 KB Output is correct
43 Correct 120 ms 50872 KB Output is correct
44 Correct 126 ms 50872 KB Output is correct
45 Correct 114 ms 50884 KB Output is correct
46 Correct 119 ms 50892 KB Output is correct
47 Correct 94 ms 50084 KB Output is correct
48 Correct 105 ms 50888 KB Output is correct
49 Correct 84 ms 47512 KB Output is correct
50 Correct 101 ms 50332 KB Output is correct
51 Correct 124 ms 51020 KB Output is correct
52 Correct 118 ms 50996 KB Output is correct
53 Correct 101 ms 49120 KB Output is correct
54 Correct 122 ms 50860 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 50188 KB Output is correct
2 Correct 132 ms 51056 KB Output is correct
3 Correct 125 ms 52456 KB Output is correct
4 Correct 105 ms 50692 KB Output is correct
5 Correct 110 ms 51460 KB Output is correct
6 Correct 134 ms 52512 KB Output is correct
7 Correct 83 ms 42892 KB Output is correct
8 Correct 80 ms 43192 KB Output is correct
9 Correct 131 ms 51524 KB Output is correct
10 Correct 87 ms 49868 KB Output is correct
11 Correct 123 ms 51980 KB Output is correct
12 Correct 119 ms 51992 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 39636 KB Output is correct
2 Correct 18 ms 39764 KB Output is correct
3 Correct 22 ms 39724 KB Output is correct
4 Correct 18 ms 39788 KB Output is correct
5 Correct 18 ms 39504 KB Output is correct
6 Correct 17 ms 39432 KB Output is correct
7 Correct 18 ms 39764 KB Output is correct
8 Correct 19 ms 39764 KB Output is correct
9 Correct 18 ms 39764 KB Output is correct
10 Correct 22 ms 39764 KB Output is correct
11 Correct 18 ms 39712 KB Output is correct
12 Correct 19 ms 39740 KB Output is correct
13 Correct 18 ms 39672 KB Output is correct
14 Correct 19 ms 39768 KB Output is correct
15 Correct 18 ms 39636 KB Output is correct
16 Correct 19 ms 39764 KB Output is correct
17 Correct 18 ms 39664 KB Output is correct
18 Correct 19 ms 39680 KB Output is correct
19 Correct 19 ms 39652 KB Output is correct
20 Correct 19 ms 39760 KB Output is correct
21 Correct 18 ms 39676 KB Output is correct
22 Correct 19 ms 39804 KB Output is correct
23 Correct 19 ms 39704 KB Output is correct
24 Correct 19 ms 39808 KB Output is correct
25 Correct 18 ms 39440 KB Output is correct
26 Correct 18 ms 39540 KB Output is correct
27 Correct 19 ms 39756 KB Output is correct
28 Correct 18 ms 39732 KB Output is correct
29 Correct 20 ms 39724 KB Output is correct
30 Correct 19 ms 39800 KB Output is correct
31 Correct 19 ms 39712 KB Output is correct
32 Correct 21 ms 39828 KB Output is correct
33 Correct 18 ms 39764 KB Output is correct
34 Correct 18 ms 39840 KB Output is correct
35 Correct 22 ms 39652 KB Output is correct
36 Correct 20 ms 39756 KB Output is correct
37 Correct 21 ms 39660 KB Output is correct
38 Correct 19 ms 39764 KB Output is correct
39 Correct 126 ms 51084 KB Output is correct
40 Correct 115 ms 51012 KB Output is correct
41 Correct 118 ms 51080 KB Output is correct
42 Correct 132 ms 51100 KB Output is correct
43 Correct 115 ms 50948 KB Output is correct
44 Correct 125 ms 50892 KB Output is correct
45 Correct 73 ms 42132 KB Output is correct
46 Correct 76 ms 42288 KB Output is correct
47 Correct 115 ms 51088 KB Output is correct
48 Correct 123 ms 50944 KB Output is correct
49 Correct 114 ms 50968 KB Output is correct
50 Correct 114 ms 50880 KB Output is correct
51 Correct 101 ms 48204 KB Output is correct
52 Correct 113 ms 51032 KB Output is correct
53 Correct 114 ms 48332 KB Output is correct
54 Correct 125 ms 50952 KB Output is correct
55 Correct 108 ms 49992 KB Output is correct
56 Correct 94 ms 49452 KB Output is correct
57 Correct 77 ms 41584 KB Output is correct
58 Correct 77 ms 42048 KB Output is correct
59 Correct 121 ms 50888 KB Output is correct
60 Correct 122 ms 50892 KB Output is correct
61 Correct 120 ms 50872 KB Output is correct
62 Correct 126 ms 50872 KB Output is correct
63 Correct 114 ms 50884 KB Output is correct
64 Correct 119 ms 50892 KB Output is correct
65 Correct 94 ms 50084 KB Output is correct
66 Correct 105 ms 50888 KB Output is correct
67 Correct 84 ms 47512 KB Output is correct
68 Correct 101 ms 50332 KB Output is correct
69 Correct 124 ms 51020 KB Output is correct
70 Correct 118 ms 50996 KB Output is correct
71 Correct 101 ms 49120 KB Output is correct
72 Correct 122 ms 50860 KB Output is correct
73 Correct 116 ms 50188 KB Output is correct
74 Correct 132 ms 51056 KB Output is correct
75 Correct 125 ms 52456 KB Output is correct
76 Correct 105 ms 50692 KB Output is correct
77 Correct 110 ms 51460 KB Output is correct
78 Correct 134 ms 52512 KB Output is correct
79 Correct 83 ms 42892 KB Output is correct
80 Correct 80 ms 43192 KB Output is correct
81 Correct 131 ms 51524 KB Output is correct
82 Correct 87 ms 49868 KB Output is correct
83 Correct 123 ms 51980 KB Output is correct
84 Correct 119 ms 51992 KB Output is correct
85 Correct 124 ms 50420 KB Output is correct
86 Correct 131 ms 52536 KB Output is correct
87 Correct 114 ms 51348 KB Output is correct
88 Correct 124 ms 52556 KB Output is correct
89 Correct 87 ms 49168 KB Output is correct
90 Correct 144 ms 52492 KB Output is correct
91 Correct 103 ms 48940 KB Output is correct
92 Correct 106 ms 48912 KB Output is correct
93 Correct 128 ms 52504 KB Output is correct
94 Correct 130 ms 52740 KB Output is correct
95 Correct 136 ms 51672 KB Output is correct
96 Correct 127 ms 52488 KB Output is correct
97 Correct 135 ms 52496 KB Output is correct
98 Correct 127 ms 49436 KB Output is correct
99 Correct 115 ms 51492 KB Output is correct
100 Correct 104 ms 50380 KB Output is correct
101 Correct 121 ms 52384 KB Output is correct
102 Correct 139 ms 52748 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 39636 KB Output is correct
2 Correct 18 ms 39764 KB Output is correct
3 Correct 22 ms 39724 KB Output is correct
4 Correct 18 ms 39788 KB Output is correct
5 Correct 18 ms 39504 KB Output is correct
6 Correct 17 ms 39432 KB Output is correct
7 Correct 18 ms 39764 KB Output is correct
8 Correct 19 ms 39764 KB Output is correct
9 Correct 18 ms 39764 KB Output is correct
10 Correct 22 ms 39764 KB Output is correct
11 Correct 18 ms 39712 KB Output is correct
12 Correct 19 ms 39740 KB Output is correct
13 Correct 18 ms 39672 KB Output is correct
14 Correct 19 ms 39768 KB Output is correct
15 Correct 18 ms 39636 KB Output is correct
16 Correct 19 ms 39764 KB Output is correct
17 Correct 18 ms 39664 KB Output is correct
18 Correct 19 ms 39680 KB Output is correct
19 Correct 19 ms 39652 KB Output is correct
20 Correct 19 ms 39760 KB Output is correct
21 Correct 18 ms 39676 KB Output is correct
22 Correct 19 ms 39804 KB Output is correct
23 Correct 19 ms 39704 KB Output is correct
24 Correct 19 ms 39808 KB Output is correct
25 Correct 18 ms 39440 KB Output is correct
26 Correct 18 ms 39540 KB Output is correct
27 Correct 19 ms 39756 KB Output is correct
28 Correct 18 ms 39732 KB Output is correct
29 Correct 20 ms 39724 KB Output is correct
30 Correct 19 ms 39800 KB Output is correct
31 Correct 19 ms 39712 KB Output is correct
32 Correct 21 ms 39828 KB Output is correct
33 Correct 18 ms 39764 KB Output is correct
34 Correct 18 ms 39840 KB Output is correct
35 Correct 22 ms 39652 KB Output is correct
36 Correct 20 ms 39756 KB Output is correct
37 Correct 21 ms 39660 KB Output is correct
38 Correct 19 ms 39764 KB Output is correct
39 Correct 126 ms 51084 KB Output is correct
40 Correct 115 ms 51012 KB Output is correct
41 Correct 118 ms 51080 KB Output is correct
42 Correct 132 ms 51100 KB Output is correct
43 Correct 115 ms 50948 KB Output is correct
44 Correct 125 ms 50892 KB Output is correct
45 Correct 73 ms 42132 KB Output is correct
46 Correct 76 ms 42288 KB Output is correct
47 Correct 115 ms 51088 KB Output is correct
48 Correct 123 ms 50944 KB Output is correct
49 Correct 114 ms 50968 KB Output is correct
50 Correct 114 ms 50880 KB Output is correct
51 Correct 101 ms 48204 KB Output is correct
52 Correct 113 ms 51032 KB Output is correct
53 Correct 114 ms 48332 KB Output is correct
54 Correct 125 ms 50952 KB Output is correct
55 Correct 582 ms 79748 KB Output is correct
56 Correct 420 ms 77228 KB Output is correct
57 Correct 645 ms 89828 KB Output is correct
58 Correct 408 ms 83920 KB Output is correct
59 Correct 414 ms 76856 KB Output is correct
60 Correct 565 ms 89412 KB Output is correct
61 Correct 306 ms 54172 KB Output is correct
62 Correct 342 ms 54820 KB Output is correct
63 Correct 541 ms 88508 KB Output is correct
64 Correct 566 ms 88616 KB Output is correct
65 Correct 542 ms 89320 KB Output is correct
66 Correct 592 ms 89360 KB Output is correct
67 Correct 559 ms 89292 KB Output is correct
68 Correct 621 ms 89356 KB Output is correct
69 Correct 569 ms 89268 KB Output is correct
70 Correct 582 ms 89212 KB Output is correct
71 Correct 599 ms 89296 KB Output is correct
72 Correct 623 ms 89300 KB Output is correct
73 Correct 652 ms 89268 KB Output is correct
74 Correct 607 ms 89264 KB Output is correct
75 Correct 594 ms 89312 KB Output is correct
76 Correct 613 ms 89224 KB Output is correct
77 Correct 570 ms 89208 KB Output is correct
78 Correct 628 ms 89264 KB Output is correct
79 Correct 486 ms 81896 KB Output is correct
80 Correct 500 ms 89048 KB Output is correct
81 Correct 473 ms 90180 KB Output is correct
82 Correct 108 ms 49992 KB Output is correct
83 Correct 94 ms 49452 KB Output is correct
84 Correct 77 ms 41584 KB Output is correct
85 Correct 77 ms 42048 KB Output is correct
86 Correct 121 ms 50888 KB Output is correct
87 Correct 122 ms 50892 KB Output is correct
88 Correct 120 ms 50872 KB Output is correct
89 Correct 126 ms 50872 KB Output is correct
90 Correct 114 ms 50884 KB Output is correct
91 Correct 119 ms 50892 KB Output is correct
92 Correct 94 ms 50084 KB Output is correct
93 Correct 105 ms 50888 KB Output is correct
94 Correct 84 ms 47512 KB Output is correct
95 Correct 101 ms 50332 KB Output is correct
96 Correct 124 ms 51020 KB Output is correct
97 Correct 118 ms 50996 KB Output is correct
98 Correct 101 ms 49120 KB Output is correct
99 Correct 122 ms 50860 KB Output is correct
100 Correct 116 ms 50188 KB Output is correct
101 Correct 132 ms 51056 KB Output is correct
102 Correct 125 ms 52456 KB Output is correct
103 Correct 105 ms 50692 KB Output is correct
104 Correct 110 ms 51460 KB Output is correct
105 Correct 134 ms 52512 KB Output is correct
106 Correct 83 ms 42892 KB Output is correct
107 Correct 80 ms 43192 KB Output is correct
108 Correct 131 ms 51524 KB Output is correct
109 Correct 87 ms 49868 KB Output is correct
110 Correct 123 ms 51980 KB Output is correct
111 Correct 119 ms 51992 KB Output is correct
112 Correct 124 ms 50420 KB Output is correct
113 Correct 131 ms 52536 KB Output is correct
114 Correct 114 ms 51348 KB Output is correct
115 Correct 124 ms 52556 KB Output is correct
116 Correct 87 ms 49168 KB Output is correct
117 Correct 144 ms 52492 KB Output is correct
118 Correct 103 ms 48940 KB Output is correct
119 Correct 106 ms 48912 KB Output is correct
120 Correct 128 ms 52504 KB Output is correct
121 Correct 130 ms 52740 KB Output is correct
122 Correct 136 ms 51672 KB Output is correct
123 Correct 127 ms 52488 KB Output is correct
124 Correct 135 ms 52496 KB Output is correct
125 Correct 127 ms 49436 KB Output is correct
126 Correct 115 ms 51492 KB Output is correct
127 Correct 104 ms 50380 KB Output is correct
128 Correct 121 ms 52384 KB Output is correct
129 Correct 139 ms 52748 KB Output is correct
130 Correct 614 ms 89436 KB Output is correct
131 Correct 424 ms 76552 KB Output is correct
132 Correct 645 ms 90140 KB Output is correct
133 Correct 591 ms 88204 KB Output is correct
134 Correct 501 ms 85984 KB Output is correct
135 Correct 602 ms 90212 KB Output is correct
136 Correct 566 ms 89540 KB Output is correct
137 Correct 584 ms 89568 KB Output is correct
138 Correct 568 ms 89988 KB Output is correct
139 Correct 605 ms 89892 KB Output is correct
140 Correct 584 ms 89856 KB Output is correct
141 Correct 618 ms 90000 KB Output is correct
142 Correct 580 ms 89876 KB Output is correct
143 Correct 605 ms 89764 KB Output is correct
144 Correct 590 ms 90000 KB Output is correct
145 Correct 655 ms 89888 KB Output is correct
146 Correct 603 ms 89816 KB Output is correct
147 Correct 677 ms 89876 KB Output is correct
148 Correct 600 ms 89836 KB Output is correct
149 Correct 601 ms 89872 KB Output is correct
150 Correct 410 ms 86036 KB Output is correct
151 Correct 516 ms 89320 KB Output is correct
152 Correct 517 ms 89332 KB Output is correct
153 Correct 481 ms 90912 KB Output is correct