oj.uz

답안 #165840

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
165840 2019-11-29T09:54:48 Z choikiwon Two Dishes (JOI19_dishes) C++17
100 / 100
 7359 ms 502460 KB 
#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];
    inline void init() {
        for(int i = 0; i < 4 * N; i++) {
            tree[i] = -1e17;
            lazy[i] = 0;
        }
    }
    inline 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;
        }
    }
    inline 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]);
    }
    inline 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]);
    }
    inline 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];

    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.quer(0, N - 1, 0, N - 1, 1);
    ans = max(0LL, ans);

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

Compilation message

dishes.cpp: In function 'int main()':
dishes.cpp:145:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < adj2[i].size(); j++) {
                        ~~^~~~~~~~~~~~~~~~
dishes.cpp:170:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < adj1[i].size(); j++) {
                        ~~^~~~~~~~~~~~~~~~
dishes.cpp:218:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < adj2[i].size(); j++) {
                        ~~^~~~~~~~~~~~~~~~
dishes.cpp:111: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:114: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:117: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

# 결과 실행 시간 메모리 Grader output
1 Correct 573 ms 150776 KB Output is correct
2 Correct 591 ms 148200 KB Output is correct
3 Correct 466 ms 143200 KB Output is correct
4 Correct 520 ms 147524 KB Output is correct
5 Correct 96 ms 94328 KB Output is correct
6 Correct 528 ms 142716 KB Output is correct
7 Correct 208 ms 113764 KB Output is correct
8 Correct 328 ms 129640 KB Output is correct
9 Correct 470 ms 149468 KB Output is correct
10 Correct 516 ms 151964 KB Output is correct
11 Correct 415 ms 143052 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 94456 KB Output is correct
2 Correct 92 ms 94456 KB Output is correct
3 Correct 93 ms 94456 KB Output is correct
4 Correct 94 ms 94456 KB Output is correct
5 Correct 93 ms 94456 KB Output is correct
6 Correct 93 ms 94460 KB Output is correct
7 Correct 93 ms 94456 KB Output is correct
8 Correct 101 ms 94456 KB Output is correct
9 Correct 92 ms 94460 KB Output is correct
10 Correct 94 ms 94456 KB Output is correct
11 Correct 93 ms 94460 KB Output is correct
12 Correct 96 ms 94456 KB Output is correct
13 Correct 93 ms 94348 KB Output is correct
14 Correct 93 ms 94456 KB Output is correct
15 Correct 97 ms 94456 KB Output is correct
16 Correct 93 ms 94428 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 94456 KB Output is correct
2 Correct 92 ms 94456 KB Output is correct
3 Correct 93 ms 94456 KB Output is correct
4 Correct 94 ms 94456 KB Output is correct
5 Correct 93 ms 94456 KB Output is correct
6 Correct 93 ms 94460 KB Output is correct
7 Correct 93 ms 94456 KB Output is correct
8 Correct 101 ms 94456 KB Output is correct
9 Correct 92 ms 94460 KB Output is correct
10 Correct 94 ms 94456 KB Output is correct
11 Correct 93 ms 94460 KB Output is correct
12 Correct 96 ms 94456 KB Output is correct
13 Correct 93 ms 94348 KB Output is correct
14 Correct 93 ms 94456 KB Output is correct
15 Correct 97 ms 94456 KB Output is correct
16 Correct 93 ms 94428 KB Output is correct
17 Correct 97 ms 94956 KB Output is correct
18 Correct 96 ms 94996 KB Output is correct
19 Correct 101 ms 95008 KB Output is correct
20 Correct 98 ms 94940 KB Output is correct
21 Correct 104 ms 94968 KB Output is correct
22 Correct 125 ms 94868 KB Output is correct
23 Correct 94 ms 94840 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 94456 KB Output is correct
2 Correct 92 ms 94456 KB Output is correct
3 Correct 93 ms 94456 KB Output is correct
4 Correct 94 ms 94456 KB Output is correct
5 Correct 93 ms 94456 KB Output is correct
6 Correct 93 ms 94460 KB Output is correct
7 Correct 93 ms 94456 KB Output is correct
8 Correct 101 ms 94456 KB Output is correct
9 Correct 92 ms 94460 KB Output is correct
10 Correct 94 ms 94456 KB Output is correct
11 Correct 93 ms 94460 KB Output is correct
12 Correct 96 ms 94456 KB Output is correct
13 Correct 93 ms 94348 KB Output is correct
14 Correct 93 ms 94456 KB Output is correct
15 Correct 97 ms 94456 KB Output is correct
16 Correct 93 ms 94428 KB Output is correct
17 Correct 97 ms 94956 KB Output is correct
18 Correct 96 ms 94996 KB Output is correct
19 Correct 101 ms 95008 KB Output is correct
20 Correct 98 ms 94940 KB Output is correct
21 Correct 104 ms 94968 KB Output is correct
22 Correct 125 ms 94868 KB Output is correct
23 Correct 94 ms 94840 KB Output is correct
24 Correct 455 ms 139220 KB Output is correct
25 Correct 638 ms 143300 KB Output is correct
26 Correct 510 ms 144544 KB Output is correct
27 Correct 539 ms 144556 KB Output is correct
28 Correct 612 ms 144424 KB Output is correct
29 Correct 435 ms 146524 KB Output is correct
30 Correct 955 ms 145020 KB Output is correct
31 Correct 206 ms 111876 KB Output is correct
32 Correct 354 ms 127568 KB Output is correct
33 Correct 740 ms 142320 KB Output is correct
34 Correct 732 ms 142592 KB Output is correct
35 Correct 846 ms 144172 KB Output is correct
36 Correct 882 ms 144100 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 94456 KB Output is correct
2 Correct 92 ms 94456 KB Output is correct
3 Correct 93 ms 94456 KB Output is correct
4 Correct 94 ms 94456 KB Output is correct
5 Correct 93 ms 94456 KB Output is correct
6 Correct 93 ms 94460 KB Output is correct
7 Correct 93 ms 94456 KB Output is correct
8 Correct 101 ms 94456 KB Output is correct
9 Correct 92 ms 94460 KB Output is correct
10 Correct 94 ms 94456 KB Output is correct
11 Correct 93 ms 94460 KB Output is correct
12 Correct 96 ms 94456 KB Output is correct
13 Correct 93 ms 94348 KB Output is correct
14 Correct 93 ms 94456 KB Output is correct
15 Correct 97 ms 94456 KB Output is correct
16 Correct 93 ms 94428 KB Output is correct
17 Correct 97 ms 94956 KB Output is correct
18 Correct 96 ms 94996 KB Output is correct
19 Correct 101 ms 95008 KB Output is correct
20 Correct 98 ms 94940 KB Output is correct
21 Correct 104 ms 94968 KB Output is correct
22 Correct 125 ms 94868 KB Output is correct
23 Correct 94 ms 94840 KB Output is correct
24 Correct 455 ms 139220 KB Output is correct
25 Correct 638 ms 143300 KB Output is correct
26 Correct 510 ms 144544 KB Output is correct
27 Correct 539 ms 144556 KB Output is correct
28 Correct 612 ms 144424 KB Output is correct
29 Correct 435 ms 146524 KB Output is correct
30 Correct 955 ms 145020 KB Output is correct
31 Correct 206 ms 111876 KB Output is correct
32 Correct 354 ms 127568 KB Output is correct
33 Correct 740 ms 142320 KB Output is correct
34 Correct 732 ms 142592 KB Output is correct
35 Correct 846 ms 144172 KB Output is correct
36 Correct 882 ms 144100 KB Output is correct
37 Correct 541 ms 148120 KB Output is correct
38 Correct 587 ms 149020 KB Output is correct
39 Correct 587 ms 155512 KB Output is correct
40 Correct 560 ms 155552 KB Output is correct
41 Correct 92 ms 94456 KB Output is correct
42 Correct 945 ms 147224 KB Output is correct
43 Correct 749 ms 146312 KB Output is correct
44 Correct 770 ms 147132 KB Output is correct
45 Correct 881 ms 147196 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 94456 KB Output is correct
2 Correct 92 ms 94456 KB Output is correct
3 Correct 93 ms 94456 KB Output is correct
4 Correct 94 ms 94456 KB Output is correct
5 Correct 93 ms 94456 KB Output is correct
6 Correct 93 ms 94460 KB Output is correct
7 Correct 93 ms 94456 KB Output is correct
8 Correct 101 ms 94456 KB Output is correct
9 Correct 92 ms 94460 KB Output is correct
10 Correct 94 ms 94456 KB Output is correct
11 Correct 93 ms 94460 KB Output is correct
12 Correct 96 ms 94456 KB Output is correct
13 Correct 93 ms 94348 KB Output is correct
14 Correct 93 ms 94456 KB Output is correct
15 Correct 97 ms 94456 KB Output is correct
16 Correct 93 ms 94428 KB Output is correct
17 Correct 97 ms 94956 KB Output is correct
18 Correct 96 ms 94996 KB Output is correct
19 Correct 101 ms 95008 KB Output is correct
20 Correct 98 ms 94940 KB Output is correct
21 Correct 104 ms 94968 KB Output is correct
22 Correct 125 ms 94868 KB Output is correct
23 Correct 94 ms 94840 KB Output is correct
24 Correct 455 ms 139220 KB Output is correct
25 Correct 638 ms 143300 KB Output is correct
26 Correct 510 ms 144544 KB Output is correct
27 Correct 539 ms 144556 KB Output is correct
28 Correct 612 ms 144424 KB Output is correct
29 Correct 435 ms 146524 KB Output is correct
30 Correct 955 ms 145020 KB Output is correct
31 Correct 206 ms 111876 KB Output is correct
32 Correct 354 ms 127568 KB Output is correct
33 Correct 740 ms 142320 KB Output is correct
34 Correct 732 ms 142592 KB Output is correct
35 Correct 846 ms 144172 KB Output is correct
36 Correct 882 ms 144100 KB Output is correct
37 Correct 541 ms 148120 KB Output is correct
38 Correct 587 ms 149020 KB Output is correct
39 Correct 587 ms 155512 KB Output is correct
40 Correct 560 ms 155552 KB Output is correct
41 Correct 92 ms 94456 KB Output is correct
42 Correct 945 ms 147224 KB Output is correct
43 Correct 749 ms 146312 KB Output is correct
44 Correct 770 ms 147132 KB Output is correct
45 Correct 881 ms 147196 KB Output is correct
46 Correct 2497 ms 344412 KB Output is correct
47 Correct 2961 ms 348996 KB Output is correct
48 Correct 2529 ms 374956 KB Output is correct
49 Correct 2597 ms 369760 KB Output is correct
50 Correct 5756 ms 338796 KB Output is correct
51 Correct 4000 ms 328988 KB Output is correct
52 Correct 4067 ms 328244 KB Output is correct
53 Correct 5064 ms 338304 KB Output is correct

Subtask #7
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 573 ms 150776 KB Output is correct
2 Correct 591 ms 148200 KB Output is correct
3 Correct 466 ms 143200 KB Output is correct
4 Correct 520 ms 147524 KB Output is correct
5 Correct 96 ms 94328 KB Output is correct
6 Correct 528 ms 142716 KB Output is correct
7 Correct 208 ms 113764 KB Output is correct
8 Correct 328 ms 129640 KB Output is correct
9 Correct 470 ms 149468 KB Output is correct
10 Correct 516 ms 151964 KB Output is correct
11 Correct 415 ms 143052 KB Output is correct
12 Correct 93 ms 94456 KB Output is correct
13 Correct 92 ms 94456 KB Output is correct
14 Correct 93 ms 94456 KB Output is correct
15 Correct 94 ms 94456 KB Output is correct
16 Correct 93 ms 94456 KB Output is correct
17 Correct 93 ms 94460 KB Output is correct
18 Correct 93 ms 94456 KB Output is correct
19 Correct 101 ms 94456 KB Output is correct
20 Correct 92 ms 94460 KB Output is correct
21 Correct 94 ms 94456 KB Output is correct
22 Correct 93 ms 94460 KB Output is correct
23 Correct 96 ms 94456 KB Output is correct
24 Correct 93 ms 94348 KB Output is correct
25 Correct 93 ms 94456 KB Output is correct
26 Correct 97 ms 94456 KB Output is correct
27 Correct 93 ms 94428 KB Output is correct
28 Correct 97 ms 94956 KB Output is correct
29 Correct 96 ms 94996 KB Output is correct
30 Correct 101 ms 95008 KB Output is correct
31 Correct 98 ms 94940 KB Output is correct
32 Correct 104 ms 94968 KB Output is correct
33 Correct 125 ms 94868 KB Output is correct
34 Correct 94 ms 94840 KB Output is correct
35 Correct 455 ms 139220 KB Output is correct
36 Correct 638 ms 143300 KB Output is correct
37 Correct 510 ms 144544 KB Output is correct
38 Correct 539 ms 144556 KB Output is correct
39 Correct 612 ms 144424 KB Output is correct
40 Correct 435 ms 146524 KB Output is correct
41 Correct 955 ms 145020 KB Output is correct
42 Correct 206 ms 111876 KB Output is correct
43 Correct 354 ms 127568 KB Output is correct
44 Correct 740 ms 142320 KB Output is correct
45 Correct 732 ms 142592 KB Output is correct
46 Correct 846 ms 144172 KB Output is correct
47 Correct 882 ms 144100 KB Output is correct
48 Correct 541 ms 148120 KB Output is correct
49 Correct 587 ms 149020 KB Output is correct
50 Correct 587 ms 155512 KB Output is correct
51 Correct 560 ms 155552 KB Output is correct
52 Correct 92 ms 94456 KB Output is correct
53 Correct 945 ms 147224 KB Output is correct
54 Correct 749 ms 146312 KB Output is correct
55 Correct 770 ms 147132 KB Output is correct
56 Correct 881 ms 147196 KB Output is correct
57 Correct 675 ms 165684 KB Output is correct
58 Correct 798 ms 181348 KB Output is correct
59 Correct 760 ms 182904 KB Output is correct
60 Correct 647 ms 167856 KB Output is correct
61 Correct 953 ms 150904 KB Output is correct
62 Correct 93 ms 94456 KB Output is correct
63 Correct 1143 ms 162308 KB Output is correct
64 Correct 819 ms 157936 KB Output is correct
65 Correct 1012 ms 164880 KB Output is correct
66 Correct 1088 ms 164932 KB Output is correct

Subtask #8
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 573 ms 150776 KB Output is correct
2 Correct 591 ms 148200 KB Output is correct
3 Correct 466 ms 143200 KB Output is correct
4 Correct 520 ms 147524 KB Output is correct
5 Correct 96 ms 94328 KB Output is correct
6 Correct 528 ms 142716 KB Output is correct
7 Correct 208 ms 113764 KB Output is correct
8 Correct 328 ms 129640 KB Output is correct
9 Correct 470 ms 149468 KB Output is correct
10 Correct 516 ms 151964 KB Output is correct
11 Correct 415 ms 143052 KB Output is correct
12 Correct 93 ms 94456 KB Output is correct
13 Correct 92 ms 94456 KB Output is correct
14 Correct 93 ms 94456 KB Output is correct
15 Correct 94 ms 94456 KB Output is correct
16 Correct 93 ms 94456 KB Output is correct
17 Correct 93 ms 94460 KB Output is correct
18 Correct 93 ms 94456 KB Output is correct
19 Correct 101 ms 94456 KB Output is correct
20 Correct 92 ms 94460 KB Output is correct
21 Correct 94 ms 94456 KB Output is correct
22 Correct 93 ms 94460 KB Output is correct
23 Correct 96 ms 94456 KB Output is correct
24 Correct 93 ms 94348 KB Output is correct
25 Correct 93 ms 94456 KB Output is correct
26 Correct 97 ms 94456 KB Output is correct
27 Correct 93 ms 94428 KB Output is correct
28 Correct 97 ms 94956 KB Output is correct
29 Correct 96 ms 94996 KB Output is correct
30 Correct 101 ms 95008 KB Output is correct
31 Correct 98 ms 94940 KB Output is correct
32 Correct 104 ms 94968 KB Output is correct
33 Correct 125 ms 94868 KB Output is correct
34 Correct 94 ms 94840 KB Output is correct
35 Correct 455 ms 139220 KB Output is correct
36 Correct 638 ms 143300 KB Output is correct
37 Correct 510 ms 144544 KB Output is correct
38 Correct 539 ms 144556 KB Output is correct
39 Correct 612 ms 144424 KB Output is correct
40 Correct 435 ms 146524 KB Output is correct
41 Correct 955 ms 145020 KB Output is correct
42 Correct 206 ms 111876 KB Output is correct
43 Correct 354 ms 127568 KB Output is correct
44 Correct 740 ms 142320 KB Output is correct
45 Correct 732 ms 142592 KB Output is correct
46 Correct 846 ms 144172 KB Output is correct
47 Correct 882 ms 144100 KB Output is correct
48 Correct 541 ms 148120 KB Output is correct
49 Correct 587 ms 149020 KB Output is correct
50 Correct 587 ms 155512 KB Output is correct
51 Correct 560 ms 155552 KB Output is correct
52 Correct 92 ms 94456 KB Output is correct
53 Correct 945 ms 147224 KB Output is correct
54 Correct 749 ms 146312 KB Output is correct
55 Correct 770 ms 147132 KB Output is correct
56 Correct 881 ms 147196 KB Output is correct
57 Correct 2497 ms 344412 KB Output is correct
58 Correct 2961 ms 348996 KB Output is correct
59 Correct 2529 ms 374956 KB Output is correct
60 Correct 2597 ms 369760 KB Output is correct
61 Correct 5756 ms 338796 KB Output is correct
62 Correct 4000 ms 328988 KB Output is correct
63 Correct 4067 ms 328244 KB Output is correct
64 Correct 5064 ms 338304 KB Output is correct
65 Correct 675 ms 165684 KB Output is correct
66 Correct 798 ms 181348 KB Output is correct
67 Correct 760 ms 182904 KB Output is correct
68 Correct 647 ms 167856 KB Output is correct
69 Correct 953 ms 150904 KB Output is correct
70 Correct 93 ms 94456 KB Output is correct
71 Correct 1143 ms 162308 KB Output is correct
72 Correct 819 ms 157936 KB Output is correct
73 Correct 1012 ms 164880 KB Output is correct
74 Correct 1088 ms 164932 KB Output is correct
75 Correct 2922 ms 441404 KB Output is correct
76 Correct 3761 ms 502460 KB Output is correct
77 Correct 3580 ms 499432 KB Output is correct
78 Correct 3420 ms 433528 KB Output is correct
79 Correct 7359 ms 415428 KB Output is correct
80 Correct 4695 ms 355012 KB Output is correct
81 Correct 5323 ms 370812 KB Output is correct
82 Correct 6862 ms 399864 KB Output is correct
83 Correct 6606 ms 405072 KB Output is correct