oj.uz

Submission #165850

# Submission time Handle Problem Language Result Execution time Memory
165850 2019-11-29T10:45:27 Z choikiwon Two Dishes (JOI19_dishes) C++17
100 / 100
 6018 ms 459972 KB 
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int maxn = 2000010;

int N, M;
ll A[maxn], B[maxn], S[maxn], T[maxn], P[maxn], Q[maxn], nA[maxn], nB[maxn], nS[maxn], nT[maxn], nP[maxn], nQ[maxn];
int X[maxn], Y[maxn], inv[maxn], pnt[maxn];
pii ord[maxn];

vector<int> adj1[maxn], adj2[maxn];
ll dp[maxn];
ll offset;

struct BIT {
    ll tree[4 * maxn];
    ll lazy[4 * maxn];
    void init() {
        for(int i = 0; i < 4 * N; i++) {
            tree[i] = -1e17;
            lazy[i] = 0;
        }
    }
    void prop(int l, int r, int n) {
        if(l != r) {
            tree[2*n] += lazy[n];
            lazy[2*n] += lazy[n];
            tree[2*n + 1] += lazy[n];
            lazy[2*n + 1] += lazy[n];
            lazy[n] = 0;
        }
    }
    void upd(int a, int b, ll d, int l, int r, int n) {
        if(b < l || r < a) return;
        if(a <= l && r <= b) {
            tree[n] += d;
            lazy[n] += d;
            return;
        }
        prop(l, r, n);
        int m = (l + r)>>1;
        upd(a, b, d, l, m, 2*n);
        upd(a, b, d, m + 1, r, 2*n + 1);
        tree[n] = max(tree[2*n], tree[2*n + 1]);
    }
    void upd2(int x, ll v, int l, int r, int n) {
        if(x < l || r < x) return;
        if(l == r) {
            tree[n] = v;
            return;
        }
        prop(l, r, n);
        int m = (l + r)>>1;
        upd2(x, v, l, m, 2*n);
        upd2(x, v, m + 1, r, 2*n + 1);
        tree[n] = max(tree[2*n], tree[2*n + 1]);
    }
    ll quer(int a, int b, int l, int r, int n) {
        if(b < l || r < a) return -1e18;
        if(a <= l && r <= b) return tree[n];
        prop(l, r, n);
        int m = (l + r)>>1;
        ll L = quer(a, b, l, m, 2*n);
        ll R = quer(a, b, m + 1, r, 2*n + 1);
        return max(L, R);
    }
} bit;

void proc() {
    for(int i = 0; i < N; i++) {
        if(A[i] > S[i]) P[i] = 0;
        X[i] = upper_bound(B, B + M, S[i] - A[i]) - B;
    }
    for(int i = 0; i < M; i++) {
        if(B[i] > T[i]) Q[i] = 0;
        Y[i] = upper_bound(A, A + N, T[i] - B[i]) - A;
    }

    for(int i = 0; i < M; i++) adj1[i].clear();
    for(int i = 0; i < N; i++) adj2[i].clear();
    for(int i = 0; i < N; i++) adj1[ X[i] ].push_back(i);
    for(int i = 0; i < M; i++) adj2[ Y[i] ].push_back(i);
}

ll getInt() {
    ll ret = 0;
    bool s = false;
    while(1) {
        char c = getchar();
        if(c == ' ' || c == '\n') break;
        if(c == '-') {
            s = true;
            continue;
        }

        ret = (ret << 3) + (ret << 1);
        ret += c - '0';
    }
    return s? -ret : ret;
}

int main() {
    N = getInt();
    M = getInt();

    for(int i = 0; i < N; i++) {
        A[i] = getInt();
        S[i] = getInt();
        P[i] = getInt();
    }
    for(int i = 0; i < M; i++) {
        B[i] = getInt();
        T[i] = getInt();
        Q[i] = getInt();
    }

    for(int i = 1; i < N; i++) A[i] += A[i - 1];
    for(int i = 1; i < M; i++) B[i] += B[i - 1];

    proc();

    for(int i = 0; i < N; i++) if(P[i] < 0) offset += P[i];
    for(int i = 0; i < M; i++) if(Q[i] < 0) offset += Q[i];

    int cnt1 = 0;
    int cnt2 = 0;

    for(int i = 0; i < N; i++) {
        if(P[i] >= 0) {
            nA[cnt1] = A[i];
            nS[cnt1] = S[i];
            nP[cnt1] = P[i];
            cnt1++;
        }
        /*
        else {
            nA[cnt1] = A[i];
            nS[cnt1] = S[i];
            nP[cnt1] = 0;
            cnt1++;
        }
        //*/

        for(int j = 0; j < adj2[i].size(); j++) {
            int k = adj2[i][j];

            if(Q[k] < 0) {
                nA[cnt1] = A[i];
                nS[cnt1] = A[i] + B[k] - 1;
                nP[cnt1] = -Q[k];
                cnt1++;
            }
        }
    }
    for(int i = 0; i < M; i++) {
        if(Q[i] >= 0) {
            nB[cnt2] = B[i];
            nT[cnt2] = T[i];
            nQ[cnt2] = Q[i];
            cnt2++;
        }
        /*
        else {
            nB[cnt2] = B[i];
            nT[cnt2] = T[i];
            nQ[cnt2] = 0;
            cnt2++;
        }
        //*/

        for(int j = 0; j < adj1[i].size(); j++) {
            int k = adj1[i][j];

            if(P[k] < 0) {
                nB[cnt2] = B[i];
                nT[cnt2] = B[i] + A[k] - 1;
                nQ[cnt2] = -P[k];
                cnt2++;
            }
        }
    }

    N = cnt1;
    M = cnt2;
    for(int i = 0; i < N; i++) {
        A[i] = nA[i];
        S[i] = nS[i];
        P[i] = nP[i];
    }
    for(int i = 0; i < M; i++) {
        B[i] = nB[i];
        T[i] = nT[i];
        Q[i] = nQ[i];
    }

    proc();

    //*/

    for(int i = 0; i < N; i++) ord[i] = pii(X[i], -i);
    sort(ord, ord + N);
    for(int i = 0; i < N; i++) inv[ -ord[i].second ] = i;
    int pos = 0;
    for(int i = 0; i < M; i++) {
        while(pos < N && ord[pos].first <= i) pos++;
        pnt[i] = pos - 1;
    }

    for(int i = 0; i < M; i++) offset += Q[i];

    bit.init();
    for(int i = N - 1; i >= 0; i--) {
        dp[i] = bit.quer(inv[i] + 1, N - 1, 0, N - 1, 1);
        dp[i] = max(0LL, dp[i]);

        bit.upd2(inv[i], dp[i], 0, N - 1, 1);
        bit.upd(0, inv[i], P[i], 0, N - 1, 1);

        for(int j = 0; j < adj2[i].size(); j++) {
            int k = adj2[i][j];

            bit.upd(0, pnt[k], -Q[k], 0, N - 1, 1);
        }
    }

    ll ans = bit.tree[1];
    ans = max(0LL, ans);

    printf("%lld", ans + offset);
}

Compilation message

dishes.cpp:1:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")
 
dishes.cpp: In function 'int main()':
dishes.cpp:151:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < adj2[i].size(); j++) {
                        ~~^~~~~~~~~~~~~~~~
dishes.cpp:178:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < adj1[i].size(); j++) {
                        ~~^~~~~~~~~~~~~~~~
dishes.cpp:226:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < adj2[i].size(); j++) {
                        ~~^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 582 ms 146424 KB Output is correct
2 Correct 655 ms 143704 KB Output is correct
3 Correct 497 ms 142336 KB Output is correct
4 Correct 543 ms 146620 KB Output is correct
5 Correct 99 ms 94456 KB Output is correct
6 Correct 556 ms 140240 KB Output is correct
7 Correct 230 ms 112740 KB Output is correct
8 Correct 345 ms 128404 KB Output is correct
9 Correct 510 ms 141668 KB Output is correct
10 Correct 484 ms 148948 KB Output is correct
11 Correct 407 ms 138676 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 94456 KB Output is correct
2 Correct 99 ms 94424 KB Output is correct
3 Correct 99 ms 94456 KB Output is correct
4 Correct 97 ms 94456 KB Output is correct
5 Correct 98 ms 94456 KB Output is correct
6 Correct 98 ms 94456 KB Output is correct
7 Correct 97 ms 94428 KB Output is correct
8 Correct 98 ms 94456 KB Output is correct
9 Correct 100 ms 94436 KB Output is correct
10 Correct 99 ms 94712 KB Output is correct
11 Correct 98 ms 94456 KB Output is correct
12 Correct 97 ms 94456 KB Output is correct
13 Correct 97 ms 94584 KB Output is correct
14 Correct 98 ms 94456 KB Output is correct
15 Correct 130 ms 94480 KB Output is correct
16 Correct 99 ms 94452 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 94456 KB Output is correct
2 Correct 99 ms 94424 KB Output is correct
3 Correct 99 ms 94456 KB Output is correct
4 Correct 97 ms 94456 KB Output is correct
5 Correct 98 ms 94456 KB Output is correct
6 Correct 98 ms 94456 KB Output is correct
7 Correct 97 ms 94428 KB Output is correct
8 Correct 98 ms 94456 KB Output is correct
9 Correct 100 ms 94436 KB Output is correct
10 Correct 99 ms 94712 KB Output is correct
11 Correct 98 ms 94456 KB Output is correct
12 Correct 97 ms 94456 KB Output is correct
13 Correct 97 ms 94584 KB Output is correct
14 Correct 98 ms 94456 KB Output is correct
15 Correct 130 ms 94480 KB Output is correct
16 Correct 99 ms 94452 KB Output is correct
17 Correct 102 ms 94952 KB Output is correct
18 Correct 113 ms 94820 KB Output is correct
19 Correct 191 ms 95044 KB Output is correct
20 Correct 105 ms 95004 KB Output is correct
21 Correct 102 ms 94968 KB Output is correct
22 Correct 114 ms 94968 KB Output is correct
23 Correct 101 ms 94968 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 94456 KB Output is correct
2 Correct 99 ms 94424 KB Output is correct
3 Correct 99 ms 94456 KB Output is correct
4 Correct 97 ms 94456 KB Output is correct
5 Correct 98 ms 94456 KB Output is correct
6 Correct 98 ms 94456 KB Output is correct
7 Correct 97 ms 94428 KB Output is correct
8 Correct 98 ms 94456 KB Output is correct
9 Correct 100 ms 94436 KB Output is correct
10 Correct 99 ms 94712 KB Output is correct
11 Correct 98 ms 94456 KB Output is correct
12 Correct 97 ms 94456 KB Output is correct
13 Correct 97 ms 94584 KB Output is correct
14 Correct 98 ms 94456 KB Output is correct
15 Correct 130 ms 94480 KB Output is correct
16 Correct 99 ms 94452 KB Output is correct
17 Correct 102 ms 94952 KB Output is correct
18 Correct 113 ms 94820 KB Output is correct
19 Correct 191 ms 95044 KB Output is correct
20 Correct 105 ms 95004 KB Output is correct
21 Correct 102 ms 94968 KB Output is correct
22 Correct 114 ms 94968 KB Output is correct
23 Correct 101 ms 94968 KB Output is correct
24 Correct 434 ms 137700 KB Output is correct
25 Correct 522 ms 140264 KB Output is correct
26 Correct 485 ms 146324 KB Output is correct
27 Correct 521 ms 146168 KB Output is correct
28 Correct 618 ms 139328 KB Output is correct
29 Correct 455 ms 141212 KB Output is correct
30 Correct 852 ms 146680 KB Output is correct
31 Correct 197 ms 109864 KB Output is correct
32 Correct 343 ms 125684 KB Output is correct
33 Correct 673 ms 143472 KB Output is correct
34 Correct 724 ms 144368 KB Output is correct
35 Correct 769 ms 143864 KB Output is correct
36 Correct 778 ms 143344 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 94456 KB Output is correct
2 Correct 99 ms 94424 KB Output is correct
3 Correct 99 ms 94456 KB Output is correct
4 Correct 97 ms 94456 KB Output is correct
5 Correct 98 ms 94456 KB Output is correct
6 Correct 98 ms 94456 KB Output is correct
7 Correct 97 ms 94428 KB Output is correct
8 Correct 98 ms 94456 KB Output is correct
9 Correct 100 ms 94436 KB Output is correct
10 Correct 99 ms 94712 KB Output is correct
11 Correct 98 ms 94456 KB Output is correct
12 Correct 97 ms 94456 KB Output is correct
13 Correct 97 ms 94584 KB Output is correct
14 Correct 98 ms 94456 KB Output is correct
15 Correct 130 ms 94480 KB Output is correct
16 Correct 99 ms 94452 KB Output is correct
17 Correct 102 ms 94952 KB Output is correct
18 Correct 113 ms 94820 KB Output is correct
19 Correct 191 ms 95044 KB Output is correct
20 Correct 105 ms 95004 KB Output is correct
21 Correct 102 ms 94968 KB Output is correct
22 Correct 114 ms 94968 KB Output is correct
23 Correct 101 ms 94968 KB Output is correct
24 Correct 434 ms 137700 KB Output is correct
25 Correct 522 ms 140264 KB Output is correct
26 Correct 485 ms 146324 KB Output is correct
27 Correct 521 ms 146168 KB Output is correct
28 Correct 618 ms 139328 KB Output is correct
29 Correct 455 ms 141212 KB Output is correct
30 Correct 852 ms 146680 KB Output is correct
31 Correct 197 ms 109864 KB Output is correct
32 Correct 343 ms 125684 KB Output is correct
33 Correct 673 ms 143472 KB Output is correct
34 Correct 724 ms 144368 KB Output is correct
35 Correct 769 ms 143864 KB Output is correct
36 Correct 778 ms 143344 KB Output is correct
37 Correct 531 ms 146204 KB Output is correct
38 Correct 726 ms 148304 KB Output is correct
39 Correct 546 ms 150456 KB Output is correct
40 Correct 535 ms 150292 KB Output is correct
41 Correct 100 ms 94456 KB Output is correct
42 Correct 908 ms 142284 KB Output is correct
43 Correct 725 ms 143052 KB Output is correct
44 Correct 794 ms 143244 KB Output is correct
45 Correct 884 ms 144676 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 94456 KB Output is correct
2 Correct 99 ms 94424 KB Output is correct
3 Correct 99 ms 94456 KB Output is correct
4 Correct 97 ms 94456 KB Output is correct
5 Correct 98 ms 94456 KB Output is correct
6 Correct 98 ms 94456 KB Output is correct
7 Correct 97 ms 94428 KB Output is correct
8 Correct 98 ms 94456 KB Output is correct
9 Correct 100 ms 94436 KB Output is correct
10 Correct 99 ms 94712 KB Output is correct
11 Correct 98 ms 94456 KB Output is correct
12 Correct 97 ms 94456 KB Output is correct
13 Correct 97 ms 94584 KB Output is correct
14 Correct 98 ms 94456 KB Output is correct
15 Correct 130 ms 94480 KB Output is correct
16 Correct 99 ms 94452 KB Output is correct
17 Correct 102 ms 94952 KB Output is correct
18 Correct 113 ms 94820 KB Output is correct
19 Correct 191 ms 95044 KB Output is correct
20 Correct 105 ms 95004 KB Output is correct
21 Correct 102 ms 94968 KB Output is correct
22 Correct 114 ms 94968 KB Output is correct
23 Correct 101 ms 94968 KB Output is correct
24 Correct 434 ms 137700 KB Output is correct
25 Correct 522 ms 140264 KB Output is correct
26 Correct 485 ms 146324 KB Output is correct
27 Correct 521 ms 146168 KB Output is correct
28 Correct 618 ms 139328 KB Output is correct
29 Correct 455 ms 141212 KB Output is correct
30 Correct 852 ms 146680 KB Output is correct
31 Correct 197 ms 109864 KB Output is correct
32 Correct 343 ms 125684 KB Output is correct
33 Correct 673 ms 143472 KB Output is correct
34 Correct 724 ms 144368 KB Output is correct
35 Correct 769 ms 143864 KB Output is correct
36 Correct 778 ms 143344 KB Output is correct
37 Correct 531 ms 146204 KB Output is correct
38 Correct 726 ms 148304 KB Output is correct
39 Correct 546 ms 150456 KB Output is correct
40 Correct 535 ms 150292 KB Output is correct
41 Correct 100 ms 94456 KB Output is correct
42 Correct 908 ms 142284 KB Output is correct
43 Correct 725 ms 143052 KB Output is correct
44 Correct 794 ms 143244 KB Output is correct
45 Correct 884 ms 144676 KB Output is correct
46 Correct 2533 ms 325800 KB Output is correct
47 Correct 2679 ms 328772 KB Output is correct
48 Correct 2420 ms 355416 KB Output is correct
49 Correct 2411 ms 350024 KB Output is correct
50 Correct 5655 ms 330496 KB Output is correct
51 Correct 3823 ms 308000 KB Output is correct
52 Correct 4030 ms 309496 KB Output is correct
53 Correct 4847 ms 329832 KB Output is correct

Subtask #7
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 582 ms 146424 KB Output is correct
2 Correct 655 ms 143704 KB Output is correct
3 Correct 497 ms 142336 KB Output is correct
4 Correct 543 ms 146620 KB Output is correct
5 Correct 99 ms 94456 KB Output is correct
6 Correct 556 ms 140240 KB Output is correct
7 Correct 230 ms 112740 KB Output is correct
8 Correct 345 ms 128404 KB Output is correct
9 Correct 510 ms 141668 KB Output is correct
10 Correct 484 ms 148948 KB Output is correct
11 Correct 407 ms 138676 KB Output is correct
12 Correct 99 ms 94456 KB Output is correct
13 Correct 99 ms 94424 KB Output is correct
14 Correct 99 ms 94456 KB Output is correct
15 Correct 97 ms 94456 KB Output is correct
16 Correct 98 ms 94456 KB Output is correct
17 Correct 98 ms 94456 KB Output is correct
18 Correct 97 ms 94428 KB Output is correct
19 Correct 98 ms 94456 KB Output is correct
20 Correct 100 ms 94436 KB Output is correct
21 Correct 99 ms 94712 KB Output is correct
22 Correct 98 ms 94456 KB Output is correct
23 Correct 97 ms 94456 KB Output is correct
24 Correct 97 ms 94584 KB Output is correct
25 Correct 98 ms 94456 KB Output is correct
26 Correct 130 ms 94480 KB Output is correct
27 Correct 99 ms 94452 KB Output is correct
28 Correct 102 ms 94952 KB Output is correct
29 Correct 113 ms 94820 KB Output is correct
30 Correct 191 ms 95044 KB Output is correct
31 Correct 105 ms 95004 KB Output is correct
32 Correct 102 ms 94968 KB Output is correct
33 Correct 114 ms 94968 KB Output is correct
34 Correct 101 ms 94968 KB Output is correct
35 Correct 434 ms 137700 KB Output is correct
36 Correct 522 ms 140264 KB Output is correct
37 Correct 485 ms 146324 KB Output is correct
38 Correct 521 ms 146168 KB Output is correct
39 Correct 618 ms 139328 KB Output is correct
40 Correct 455 ms 141212 KB Output is correct
41 Correct 852 ms 146680 KB Output is correct
42 Correct 197 ms 109864 KB Output is correct
43 Correct 343 ms 125684 KB Output is correct
44 Correct 673 ms 143472 KB Output is correct
45 Correct 724 ms 144368 KB Output is correct
46 Correct 769 ms 143864 KB Output is correct
47 Correct 778 ms 143344 KB Output is correct
48 Correct 531 ms 146204 KB Output is correct
49 Correct 726 ms 148304 KB Output is correct
50 Correct 546 ms 150456 KB Output is correct
51 Correct 535 ms 150292 KB Output is correct
52 Correct 100 ms 94456 KB Output is correct
53 Correct 908 ms 142284 KB Output is correct
54 Correct 725 ms 143052 KB Output is correct
55 Correct 794 ms 143244 KB Output is correct
56 Correct 884 ms 144676 KB Output is correct
57 Correct 381 ms 128412 KB Output is correct
58 Correct 569 ms 148912 KB Output is correct
59 Correct 632 ms 173032 KB Output is correct
60 Correct 373 ms 139852 KB Output is correct
61 Correct 927 ms 147668 KB Output is correct
62 Correct 99 ms 94456 KB Output is correct
63 Correct 973 ms 142712 KB Output is correct
64 Correct 764 ms 149240 KB Output is correct
65 Correct 824 ms 147084 KB Output is correct
66 Correct 869 ms 145248 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 582 ms 146424 KB Output is correct
2 Correct 655 ms 143704 KB Output is correct
3 Correct 497 ms 142336 KB Output is correct
4 Correct 543 ms 146620 KB Output is correct
5 Correct 99 ms 94456 KB Output is correct
6 Correct 556 ms 140240 KB Output is correct
7 Correct 230 ms 112740 KB Output is correct
8 Correct 345 ms 128404 KB Output is correct
9 Correct 510 ms 141668 KB Output is correct
10 Correct 484 ms 148948 KB Output is correct
11 Correct 407 ms 138676 KB Output is correct
12 Correct 99 ms 94456 KB Output is correct
13 Correct 99 ms 94424 KB Output is correct
14 Correct 99 ms 94456 KB Output is correct
15 Correct 97 ms 94456 KB Output is correct
16 Correct 98 ms 94456 KB Output is correct
17 Correct 98 ms 94456 KB Output is correct
18 Correct 97 ms 94428 KB Output is correct
19 Correct 98 ms 94456 KB Output is correct
20 Correct 100 ms 94436 KB Output is correct
21 Correct 99 ms 94712 KB Output is correct
22 Correct 98 ms 94456 KB Output is correct
23 Correct 97 ms 94456 KB Output is correct
24 Correct 97 ms 94584 KB Output is correct
25 Correct 98 ms 94456 KB Output is correct
26 Correct 130 ms 94480 KB Output is correct
27 Correct 99 ms 94452 KB Output is correct
28 Correct 102 ms 94952 KB Output is correct
29 Correct 113 ms 94820 KB Output is correct
30 Correct 191 ms 95044 KB Output is correct
31 Correct 105 ms 95004 KB Output is correct
32 Correct 102 ms 94968 KB Output is correct
33 Correct 114 ms 94968 KB Output is correct
34 Correct 101 ms 94968 KB Output is correct
35 Correct 434 ms 137700 KB Output is correct
36 Correct 522 ms 140264 KB Output is correct
37 Correct 485 ms 146324 KB Output is correct
38 Correct 521 ms 146168 KB Output is correct
39 Correct 618 ms 139328 KB Output is correct
40 Correct 455 ms 141212 KB Output is correct
41 Correct 852 ms 146680 KB Output is correct
42 Correct 197 ms 109864 KB Output is correct
43 Correct 343 ms 125684 KB Output is correct
44 Correct 673 ms 143472 KB Output is correct
45 Correct 724 ms 144368 KB Output is correct
46 Correct 769 ms 143864 KB Output is correct
47 Correct 778 ms 143344 KB Output is correct
48 Correct 531 ms 146204 KB Output is correct
49 Correct 726 ms 148304 KB Output is correct
50 Correct 546 ms 150456 KB Output is correct
51 Correct 535 ms 150292 KB Output is correct
52 Correct 100 ms 94456 KB Output is correct
53 Correct 908 ms 142284 KB Output is correct
54 Correct 725 ms 143052 KB Output is correct
55 Correct 794 ms 143244 KB Output is correct
56 Correct 884 ms 144676 KB Output is correct
57 Correct 2533 ms 325800 KB Output is correct
58 Correct 2679 ms 328772 KB Output is correct
59 Correct 2420 ms 355416 KB Output is correct
60 Correct 2411 ms 350024 KB Output is correct
61 Correct 5655 ms 330496 KB Output is correct
62 Correct 3823 ms 308000 KB Output is correct
63 Correct 4030 ms 309496 KB Output is correct
64 Correct 4847 ms 329832 KB Output is correct
65 Correct 381 ms 128412 KB Output is correct
66 Correct 569 ms 148912 KB Output is correct
67 Correct 632 ms 173032 KB Output is correct
68 Correct 373 ms 139852 KB Output is correct
69 Correct 927 ms 147668 KB Output is correct
70 Correct 99 ms 94456 KB Output is correct
71 Correct 973 ms 142712 KB Output is correct
72 Correct 764 ms 149240 KB Output is correct
73 Correct 824 ms 147084 KB Output is correct
74 Correct 869 ms 145248 KB Output is correct
75 Correct 1550 ms 255348 KB Output is correct
76 Correct 2571 ms 365516 KB Output is correct
77 Correct 3093 ms 459972 KB Output is correct
78 Correct 1472 ms 308072 KB Output is correct
79 Correct 6018 ms 343636 KB Output is correct
80 Correct 4156 ms 326656 KB Output is correct
81 Correct 4354 ms 303244 KB Output is correct
82 Correct 5592 ms 340720 KB Output is correct
83 Correct 5600 ms 341024 KB Output is correct