oj.uz

Submission #165837

# Submission time Handle Problem Language Result Execution time Memory
165837 2019-11-29T09:45:44 Z choikiwon Two Dishes (JOI19_dishes) C++17
100 / 100
 7653 ms 500284 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];
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;

        int s = 0, e = M - 1, p = M;
        while(s <= e) {
            int m = (s + e)>>1;

            if(A[i] + B[m] > S[i]) {
                p = m;
                e = m - 1;
            }
            else s = m + 1;
        }
        X[i] = p;
    }
    for(int i = 0; i < M; i++) {
        if(B[i] > T[i]) Q[i] = 0;

        int s = 0, e = N - 1, p = N;
        while(s <= e) {
            int m = (s + e)>>1;

            if(B[i] + A[m] > T[i]) {
                p = m;
                e = m - 1;
            }
            else s = m + 1;
        }
        Y[i] = p;
    }

    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);
}

int main() {
    scanf("%d %d", &N, &M);

    for(int i = 0; i < N; i++) {
        scanf("%lld %lld %lld", &A[i], &S[i], &P[i]);
    }
    for(int i = 0; i < M; i++) {
        scanf("%lld %lld %lld", &B[i], &T[i], &Q[i]);
    }

    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];

    //*
    vector<ll> nA, nB, nS, nT, nP, nQ;
    for(int i = 0; i < N; i++) {
        if(P[i] >= 0) {
            nA.push_back(A[i]);
            nS.push_back(S[i]);
            nP.push_back(P[i]);
        }
        else {
            nA.push_back(A[i]);
            nS.push_back(S[i]);
            nP.push_back(0);
        }

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

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

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

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

    N = nA.size();
    M = nB.size();
    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.quer(0, N - 1, 0, N - 1, 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:146:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < adj2[i].size(); j++) {
                        ~~^~~~~~~~~~~~~~~~
dishes.cpp:168:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < adj1[i].size(); j++) {
                        ~~^~~~~~~~~~~~~~~~
dishes.cpp:215:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < adj2[i].size(); j++) {
                        ~~^~~~~~~~~~~~~~~~
dishes.cpp:115: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:118:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld %lld %lld", &A[i], &S[i], &P[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dishes.cpp:121:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld %lld %lld", &B[i], &T[i], &Q[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 569 ms 148616 KB Output is correct
2 Correct 574 ms 147332 KB Output is correct
3 Correct 550 ms 143424 KB Output is correct
4 Correct 552 ms 147676 KB Output is correct
5 Correct 99 ms 94340 KB Output is correct
6 Correct 541 ms 146024 KB Output is correct
7 Correct 218 ms 113916 KB Output is correct
8 Correct 336 ms 129748 KB Output is correct
9 Correct 468 ms 144324 KB Output is correct
10 Correct 512 ms 152256 KB Output is correct
11 Correct 437 ms 143056 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 94404 KB Output is correct
2 Correct 101 ms 94328 KB Output is correct
3 Correct 100 ms 94328 KB Output is correct
4 Correct 99 ms 94328 KB Output is correct
5 Correct 101 ms 94384 KB Output is correct
6 Correct 99 ms 94328 KB Output is correct
7 Correct 113 ms 94328 KB Output is correct
8 Correct 106 ms 94552 KB Output is correct
9 Correct 134 ms 94328 KB Output is correct
10 Correct 101 ms 94408 KB Output is correct
11 Correct 100 ms 94428 KB Output is correct
12 Correct 109 ms 94328 KB Output is correct
13 Correct 114 ms 94300 KB Output is correct
14 Correct 100 ms 94328 KB Output is correct
15 Correct 101 ms 94328 KB Output is correct
16 Correct 101 ms 94328 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 94404 KB Output is correct
2 Correct 101 ms 94328 KB Output is correct
3 Correct 100 ms 94328 KB Output is correct
4 Correct 99 ms 94328 KB Output is correct
5 Correct 101 ms 94384 KB Output is correct
6 Correct 99 ms 94328 KB Output is correct
7 Correct 113 ms 94328 KB Output is correct
8 Correct 106 ms 94552 KB Output is correct
9 Correct 134 ms 94328 KB Output is correct
10 Correct 101 ms 94408 KB Output is correct
11 Correct 100 ms 94428 KB Output is correct
12 Correct 109 ms 94328 KB Output is correct
13 Correct 114 ms 94300 KB Output is correct
14 Correct 100 ms 94328 KB Output is correct
15 Correct 101 ms 94328 KB Output is correct
16 Correct 101 ms 94328 KB Output is correct
17 Correct 102 ms 94840 KB Output is correct
18 Correct 127 ms 94840 KB Output is correct
19 Correct 105 ms 94972 KB Output is correct
20 Correct 103 ms 94968 KB Output is correct
21 Correct 106 ms 94920 KB Output is correct
22 Correct 115 ms 94840 KB Output is correct
23 Correct 104 ms 94840 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 94404 KB Output is correct
2 Correct 101 ms 94328 KB Output is correct
3 Correct 100 ms 94328 KB Output is correct
4 Correct 99 ms 94328 KB Output is correct
5 Correct 101 ms 94384 KB Output is correct
6 Correct 99 ms 94328 KB Output is correct
7 Correct 113 ms 94328 KB Output is correct
8 Correct 106 ms 94552 KB Output is correct
9 Correct 134 ms 94328 KB Output is correct
10 Correct 101 ms 94408 KB Output is correct
11 Correct 100 ms 94428 KB Output is correct
12 Correct 109 ms 94328 KB Output is correct
13 Correct 114 ms 94300 KB Output is correct
14 Correct 100 ms 94328 KB Output is correct
15 Correct 101 ms 94328 KB Output is correct
16 Correct 101 ms 94328 KB Output is correct
17 Correct 102 ms 94840 KB Output is correct
18 Correct 127 ms 94840 KB Output is correct
19 Correct 105 ms 94972 KB Output is correct
20 Correct 103 ms 94968 KB Output is correct
21 Correct 106 ms 94920 KB Output is correct
22 Correct 115 ms 94840 KB Output is correct
23 Correct 104 ms 94840 KB Output is correct
24 Correct 465 ms 142064 KB Output is correct
25 Correct 562 ms 141440 KB Output is correct
26 Correct 510 ms 150152 KB Output is correct
27 Correct 555 ms 150080 KB Output is correct
28 Correct 688 ms 147660 KB Output is correct
29 Correct 443 ms 143168 KB Output is correct
30 Correct 909 ms 150596 KB Output is correct
31 Correct 217 ms 111768 KB Output is correct
32 Correct 357 ms 127436 KB Output is correct
33 Correct 721 ms 147508 KB Output is correct
34 Correct 750 ms 147904 KB Output is correct
35 Correct 855 ms 144192 KB Output is correct
36 Correct 876 ms 144336 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 94404 KB Output is correct
2 Correct 101 ms 94328 KB Output is correct
3 Correct 100 ms 94328 KB Output is correct
4 Correct 99 ms 94328 KB Output is correct
5 Correct 101 ms 94384 KB Output is correct
6 Correct 99 ms 94328 KB Output is correct
7 Correct 113 ms 94328 KB Output is correct
8 Correct 106 ms 94552 KB Output is correct
9 Correct 134 ms 94328 KB Output is correct
10 Correct 101 ms 94408 KB Output is correct
11 Correct 100 ms 94428 KB Output is correct
12 Correct 109 ms 94328 KB Output is correct
13 Correct 114 ms 94300 KB Output is correct
14 Correct 100 ms 94328 KB Output is correct
15 Correct 101 ms 94328 KB Output is correct
16 Correct 101 ms 94328 KB Output is correct
17 Correct 102 ms 94840 KB Output is correct
18 Correct 127 ms 94840 KB Output is correct
19 Correct 105 ms 94972 KB Output is correct
20 Correct 103 ms 94968 KB Output is correct
21 Correct 106 ms 94920 KB Output is correct
22 Correct 115 ms 94840 KB Output is correct
23 Correct 104 ms 94840 KB Output is correct
24 Correct 465 ms 142064 KB Output is correct
25 Correct 562 ms 141440 KB Output is correct
26 Correct 510 ms 150152 KB Output is correct
27 Correct 555 ms 150080 KB Output is correct
28 Correct 688 ms 147660 KB Output is correct
29 Correct 443 ms 143168 KB Output is correct
30 Correct 909 ms 150596 KB Output is correct
31 Correct 217 ms 111768 KB Output is correct
32 Correct 357 ms 127436 KB Output is correct
33 Correct 721 ms 147508 KB Output is correct
34 Correct 750 ms 147904 KB Output is correct
35 Correct 855 ms 144192 KB Output is correct
36 Correct 876 ms 144336 KB Output is correct
37 Correct 546 ms 146748 KB Output is correct
38 Correct 594 ms 146848 KB Output is correct
39 Correct 558 ms 151564 KB Output is correct
40 Correct 555 ms 151492 KB Output is correct
41 Correct 101 ms 94336 KB Output is correct
42 Correct 946 ms 149184 KB Output is correct
43 Correct 746 ms 143688 KB Output is correct
44 Correct 764 ms 144084 KB Output is correct
45 Correct 889 ms 147328 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 94404 KB Output is correct
2 Correct 101 ms 94328 KB Output is correct
3 Correct 100 ms 94328 KB Output is correct
4 Correct 99 ms 94328 KB Output is correct
5 Correct 101 ms 94384 KB Output is correct
6 Correct 99 ms 94328 KB Output is correct
7 Correct 113 ms 94328 KB Output is correct
8 Correct 106 ms 94552 KB Output is correct
9 Correct 134 ms 94328 KB Output is correct
10 Correct 101 ms 94408 KB Output is correct
11 Correct 100 ms 94428 KB Output is correct
12 Correct 109 ms 94328 KB Output is correct
13 Correct 114 ms 94300 KB Output is correct
14 Correct 100 ms 94328 KB Output is correct
15 Correct 101 ms 94328 KB Output is correct
16 Correct 101 ms 94328 KB Output is correct
17 Correct 102 ms 94840 KB Output is correct
18 Correct 127 ms 94840 KB Output is correct
19 Correct 105 ms 94972 KB Output is correct
20 Correct 103 ms 94968 KB Output is correct
21 Correct 106 ms 94920 KB Output is correct
22 Correct 115 ms 94840 KB Output is correct
23 Correct 104 ms 94840 KB Output is correct
24 Correct 465 ms 142064 KB Output is correct
25 Correct 562 ms 141440 KB Output is correct
26 Correct 510 ms 150152 KB Output is correct
27 Correct 555 ms 150080 KB Output is correct
28 Correct 688 ms 147660 KB Output is correct
29 Correct 443 ms 143168 KB Output is correct
30 Correct 909 ms 150596 KB Output is correct
31 Correct 217 ms 111768 KB Output is correct
32 Correct 357 ms 127436 KB Output is correct
33 Correct 721 ms 147508 KB Output is correct
34 Correct 750 ms 147904 KB Output is correct
35 Correct 855 ms 144192 KB Output is correct
36 Correct 876 ms 144336 KB Output is correct
37 Correct 546 ms 146748 KB Output is correct
38 Correct 594 ms 146848 KB Output is correct
39 Correct 558 ms 151564 KB Output is correct
40 Correct 555 ms 151492 KB Output is correct
41 Correct 101 ms 94336 KB Output is correct
42 Correct 946 ms 149184 KB Output is correct
43 Correct 746 ms 143688 KB Output is correct
44 Correct 764 ms 144084 KB Output is correct
45 Correct 889 ms 147328 KB Output is correct
46 Correct 2518 ms 338220 KB Output is correct
47 Correct 2676 ms 334832 KB Output is correct
48 Correct 2527 ms 358920 KB Output is correct
49 Correct 2483 ms 358336 KB Output is correct
50 Correct 5755 ms 339096 KB Output is correct
51 Correct 3932 ms 313048 KB Output is correct
52 Correct 4123 ms 315112 KB Output is correct
53 Correct 5353 ms 327372 KB Output is correct

Subtask #7
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 569 ms 148616 KB Output is correct
2 Correct 574 ms 147332 KB Output is correct
3 Correct 550 ms 143424 KB Output is correct
4 Correct 552 ms 147676 KB Output is correct
5 Correct 99 ms 94340 KB Output is correct
6 Correct 541 ms 146024 KB Output is correct
7 Correct 218 ms 113916 KB Output is correct
8 Correct 336 ms 129748 KB Output is correct
9 Correct 468 ms 144324 KB Output is correct
10 Correct 512 ms 152256 KB Output is correct
11 Correct 437 ms 143056 KB Output is correct
12 Correct 100 ms 94404 KB Output is correct
13 Correct 101 ms 94328 KB Output is correct
14 Correct 100 ms 94328 KB Output is correct
15 Correct 99 ms 94328 KB Output is correct
16 Correct 101 ms 94384 KB Output is correct
17 Correct 99 ms 94328 KB Output is correct
18 Correct 113 ms 94328 KB Output is correct
19 Correct 106 ms 94552 KB Output is correct
20 Correct 134 ms 94328 KB Output is correct
21 Correct 101 ms 94408 KB Output is correct
22 Correct 100 ms 94428 KB Output is correct
23 Correct 109 ms 94328 KB Output is correct
24 Correct 114 ms 94300 KB Output is correct
25 Correct 100 ms 94328 KB Output is correct
26 Correct 101 ms 94328 KB Output is correct
27 Correct 101 ms 94328 KB Output is correct
28 Correct 102 ms 94840 KB Output is correct
29 Correct 127 ms 94840 KB Output is correct
30 Correct 105 ms 94972 KB Output is correct
31 Correct 103 ms 94968 KB Output is correct
32 Correct 106 ms 94920 KB Output is correct
33 Correct 115 ms 94840 KB Output is correct
34 Correct 104 ms 94840 KB Output is correct
35 Correct 465 ms 142064 KB Output is correct
36 Correct 562 ms 141440 KB Output is correct
37 Correct 510 ms 150152 KB Output is correct
38 Correct 555 ms 150080 KB Output is correct
39 Correct 688 ms 147660 KB Output is correct
40 Correct 443 ms 143168 KB Output is correct
41 Correct 909 ms 150596 KB Output is correct
42 Correct 217 ms 111768 KB Output is correct
43 Correct 357 ms 127436 KB Output is correct
44 Correct 721 ms 147508 KB Output is correct
45 Correct 750 ms 147904 KB Output is correct
46 Correct 855 ms 144192 KB Output is correct
47 Correct 876 ms 144336 KB Output is correct
48 Correct 546 ms 146748 KB Output is correct
49 Correct 594 ms 146848 KB Output is correct
50 Correct 558 ms 151564 KB Output is correct
51 Correct 555 ms 151492 KB Output is correct
52 Correct 101 ms 94336 KB Output is correct
53 Correct 946 ms 149184 KB Output is correct
54 Correct 746 ms 143688 KB Output is correct
55 Correct 764 ms 144084 KB Output is correct
56 Correct 889 ms 147328 KB Output is correct
57 Correct 649 ms 163740 KB Output is correct
58 Correct 840 ms 180032 KB Output is correct
59 Correct 745 ms 180660 KB Output is correct
60 Correct 654 ms 167140 KB Output is correct
61 Correct 903 ms 146616 KB Output is correct
62 Correct 100 ms 94328 KB Output is correct
63 Correct 1185 ms 161288 KB Output is correct
64 Correct 825 ms 149932 KB Output is correct
65 Correct 1032 ms 158432 KB Output is correct
66 Correct 1110 ms 164916 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 569 ms 148616 KB Output is correct
2 Correct 574 ms 147332 KB Output is correct
3 Correct 550 ms 143424 KB Output is correct
4 Correct 552 ms 147676 KB Output is correct
5 Correct 99 ms 94340 KB Output is correct
6 Correct 541 ms 146024 KB Output is correct
7 Correct 218 ms 113916 KB Output is correct
8 Correct 336 ms 129748 KB Output is correct
9 Correct 468 ms 144324 KB Output is correct
10 Correct 512 ms 152256 KB Output is correct
11 Correct 437 ms 143056 KB Output is correct
12 Correct 100 ms 94404 KB Output is correct
13 Correct 101 ms 94328 KB Output is correct
14 Correct 100 ms 94328 KB Output is correct
15 Correct 99 ms 94328 KB Output is correct
16 Correct 101 ms 94384 KB Output is correct
17 Correct 99 ms 94328 KB Output is correct
18 Correct 113 ms 94328 KB Output is correct
19 Correct 106 ms 94552 KB Output is correct
20 Correct 134 ms 94328 KB Output is correct
21 Correct 101 ms 94408 KB Output is correct
22 Correct 100 ms 94428 KB Output is correct
23 Correct 109 ms 94328 KB Output is correct
24 Correct 114 ms 94300 KB Output is correct
25 Correct 100 ms 94328 KB Output is correct
26 Correct 101 ms 94328 KB Output is correct
27 Correct 101 ms 94328 KB Output is correct
28 Correct 102 ms 94840 KB Output is correct
29 Correct 127 ms 94840 KB Output is correct
30 Correct 105 ms 94972 KB Output is correct
31 Correct 103 ms 94968 KB Output is correct
32 Correct 106 ms 94920 KB Output is correct
33 Correct 115 ms 94840 KB Output is correct
34 Correct 104 ms 94840 KB Output is correct
35 Correct 465 ms 142064 KB Output is correct
36 Correct 562 ms 141440 KB Output is correct
37 Correct 510 ms 150152 KB Output is correct
38 Correct 555 ms 150080 KB Output is correct
39 Correct 688 ms 147660 KB Output is correct
40 Correct 443 ms 143168 KB Output is correct
41 Correct 909 ms 150596 KB Output is correct
42 Correct 217 ms 111768 KB Output is correct
43 Correct 357 ms 127436 KB Output is correct
44 Correct 721 ms 147508 KB Output is correct
45 Correct 750 ms 147904 KB Output is correct
46 Correct 855 ms 144192 KB Output is correct
47 Correct 876 ms 144336 KB Output is correct
48 Correct 546 ms 146748 KB Output is correct
49 Correct 594 ms 146848 KB Output is correct
50 Correct 558 ms 151564 KB Output is correct
51 Correct 555 ms 151492 KB Output is correct
52 Correct 101 ms 94336 KB Output is correct
53 Correct 946 ms 149184 KB Output is correct
54 Correct 746 ms 143688 KB Output is correct
55 Correct 764 ms 144084 KB Output is correct
56 Correct 889 ms 147328 KB Output is correct
57 Correct 2518 ms 338220 KB Output is correct
58 Correct 2676 ms 334832 KB Output is correct
59 Correct 2527 ms 358920 KB Output is correct
60 Correct 2483 ms 358336 KB Output is correct
61 Correct 5755 ms 339096 KB Output is correct
62 Correct 3932 ms 313048 KB Output is correct
63 Correct 4123 ms 315112 KB Output is correct
64 Correct 5353 ms 327372 KB Output is correct
65 Correct 649 ms 163740 KB Output is correct
66 Correct 840 ms 180032 KB Output is correct
67 Correct 745 ms 180660 KB Output is correct
68 Correct 654 ms 167140 KB Output is correct
69 Correct 903 ms 146616 KB Output is correct
70 Correct 100 ms 94328 KB Output is correct
71 Correct 1185 ms 161288 KB Output is correct
72 Correct 825 ms 149932 KB Output is correct
73 Correct 1032 ms 158432 KB Output is correct
74 Correct 1110 ms 164916 KB Output is correct
75 Correct 3068 ms 432200 KB Output is correct
76 Correct 4010 ms 500284 KB Output is correct
77 Correct 3526 ms 497332 KB Output is correct
78 Correct 3119 ms 421684 KB Output is correct
79 Correct 7653 ms 408772 KB Output is correct
80 Correct 4875 ms 354572 KB Output is correct
81 Correct 5451 ms 365576 KB Output is correct
82 Correct 6809 ms 395984 KB Output is correct
83 Correct 6888 ms 402428 KB Output is correct