oj.uz

답안 #165839

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
165839 2019-11-29T09:53:30 Z choikiwon Two Dishes (JOI19_dishes) C++17
100 / 100
 7585 ms 501048 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];
    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:1:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")
 
dishes.cpp: In function 'int main()':
dishes.cpp:149:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < adj2[i].size(); j++) {
                        ~~^~~~~~~~~~~~~~~~
dishes.cpp:174:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < adj1[i].size(); j++) {
                        ~~^~~~~~~~~~~~~~~~
dishes.cpp:222: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

# 결과 실행 시간 메모리 Grader output
1 Correct 562 ms 143692 KB Output is correct
2 Correct 546 ms 143604 KB Output is correct
3 Correct 470 ms 138904 KB Output is correct
4 Correct 514 ms 143220 KB Output is correct
5 Correct 102 ms 94412 KB Output is correct
6 Correct 529 ms 142656 KB Output is correct
7 Correct 216 ms 113892 KB Output is correct
8 Correct 339 ms 129764 KB Output is correct
9 Correct 474 ms 143576 KB Output is correct
10 Correct 503 ms 151160 KB Output is correct
11 Correct 413 ms 141968 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 94352 KB Output is correct
2 Correct 108 ms 94428 KB Output is correct
3 Correct 103 ms 94532 KB Output is correct
4 Correct 100 ms 94456 KB Output is correct
5 Correct 100 ms 94456 KB Output is correct
6 Correct 103 ms 94456 KB Output is correct
7 Correct 103 ms 94456 KB Output is correct
8 Correct 99 ms 94584 KB Output is correct
9 Correct 101 ms 94444 KB Output is correct
10 Correct 100 ms 94456 KB Output is correct
11 Correct 101 ms 94456 KB Output is correct
12 Correct 103 ms 94584 KB Output is correct
13 Correct 101 ms 94456 KB Output is correct
14 Correct 102 ms 94456 KB Output is correct
15 Correct 99 ms 94456 KB Output is correct
16 Correct 102 ms 94548 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 94352 KB Output is correct
2 Correct 108 ms 94428 KB Output is correct
3 Correct 103 ms 94532 KB Output is correct
4 Correct 100 ms 94456 KB Output is correct
5 Correct 100 ms 94456 KB Output is correct
6 Correct 103 ms 94456 KB Output is correct
7 Correct 103 ms 94456 KB Output is correct
8 Correct 99 ms 94584 KB Output is correct
9 Correct 101 ms 94444 KB Output is correct
10 Correct 100 ms 94456 KB Output is correct
11 Correct 101 ms 94456 KB Output is correct
12 Correct 103 ms 94584 KB Output is correct
13 Correct 101 ms 94456 KB Output is correct
14 Correct 102 ms 94456 KB Output is correct
15 Correct 99 ms 94456 KB Output is correct
16 Correct 102 ms 94548 KB Output is correct
17 Correct 103 ms 94840 KB Output is correct
18 Correct 103 ms 94840 KB Output is correct
19 Correct 105 ms 94980 KB Output is correct
20 Correct 104 ms 94968 KB Output is correct
21 Correct 104 ms 94968 KB Output is correct
22 Correct 103 ms 94840 KB Output is correct
23 Correct 106 ms 94840 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 94352 KB Output is correct
2 Correct 108 ms 94428 KB Output is correct
3 Correct 103 ms 94532 KB Output is correct
4 Correct 100 ms 94456 KB Output is correct
5 Correct 100 ms 94456 KB Output is correct
6 Correct 103 ms 94456 KB Output is correct
7 Correct 103 ms 94456 KB Output is correct
8 Correct 99 ms 94584 KB Output is correct
9 Correct 101 ms 94444 KB Output is correct
10 Correct 100 ms 94456 KB Output is correct
11 Correct 101 ms 94456 KB Output is correct
12 Correct 103 ms 94584 KB Output is correct
13 Correct 101 ms 94456 KB Output is correct
14 Correct 102 ms 94456 KB Output is correct
15 Correct 99 ms 94456 KB Output is correct
16 Correct 102 ms 94548 KB Output is correct
17 Correct 103 ms 94840 KB Output is correct
18 Correct 103 ms 94840 KB Output is correct
19 Correct 105 ms 94980 KB Output is correct
20 Correct 104 ms 94968 KB Output is correct
21 Correct 104 ms 94968 KB Output is correct
22 Correct 103 ms 94840 KB Output is correct
23 Correct 106 ms 94840 KB Output is correct
24 Correct 562 ms 141384 KB Output is correct
25 Correct 530 ms 141208 KB Output is correct
26 Correct 514 ms 150320 KB Output is correct
27 Correct 562 ms 150272 KB Output is correct
28 Correct 621 ms 146032 KB Output is correct
29 Correct 433 ms 138716 KB Output is correct
30 Correct 895 ms 150716 KB Output is correct
31 Correct 207 ms 111936 KB Output is correct
32 Correct 355 ms 127588 KB Output is correct
33 Correct 735 ms 147488 KB Output is correct
34 Correct 740 ms 147924 KB Output is correct
35 Correct 822 ms 144224 KB Output is correct
36 Correct 828 ms 144248 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 94352 KB Output is correct
2 Correct 108 ms 94428 KB Output is correct
3 Correct 103 ms 94532 KB Output is correct
4 Correct 100 ms 94456 KB Output is correct
5 Correct 100 ms 94456 KB Output is correct
6 Correct 103 ms 94456 KB Output is correct
7 Correct 103 ms 94456 KB Output is correct
8 Correct 99 ms 94584 KB Output is correct
9 Correct 101 ms 94444 KB Output is correct
10 Correct 100 ms 94456 KB Output is correct
11 Correct 101 ms 94456 KB Output is correct
12 Correct 103 ms 94584 KB Output is correct
13 Correct 101 ms 94456 KB Output is correct
14 Correct 102 ms 94456 KB Output is correct
15 Correct 99 ms 94456 KB Output is correct
16 Correct 102 ms 94548 KB Output is correct
17 Correct 103 ms 94840 KB Output is correct
18 Correct 103 ms 94840 KB Output is correct
19 Correct 105 ms 94980 KB Output is correct
20 Correct 104 ms 94968 KB Output is correct
21 Correct 104 ms 94968 KB Output is correct
22 Correct 103 ms 94840 KB Output is correct
23 Correct 106 ms 94840 KB Output is correct
24 Correct 562 ms 141384 KB Output is correct
25 Correct 530 ms 141208 KB Output is correct
26 Correct 514 ms 150320 KB Output is correct
27 Correct 562 ms 150272 KB Output is correct
28 Correct 621 ms 146032 KB Output is correct
29 Correct 433 ms 138716 KB Output is correct
30 Correct 895 ms 150716 KB Output is correct
31 Correct 207 ms 111936 KB Output is correct
32 Correct 355 ms 127588 KB Output is correct
33 Correct 735 ms 147488 KB Output is correct
34 Correct 740 ms 147924 KB Output is correct
35 Correct 822 ms 144224 KB Output is correct
36 Correct 828 ms 144248 KB Output is correct
37 Correct 535 ms 146484 KB Output is correct
38 Correct 588 ms 143168 KB Output is correct
39 Correct 585 ms 147864 KB Output is correct
40 Correct 566 ms 147804 KB Output is correct
41 Correct 100 ms 94328 KB Output is correct
42 Correct 914 ms 146232 KB Output is correct
43 Correct 778 ms 140816 KB Output is correct
44 Correct 752 ms 140892 KB Output is correct
45 Correct 846 ms 146556 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 94352 KB Output is correct
2 Correct 108 ms 94428 KB Output is correct
3 Correct 103 ms 94532 KB Output is correct
4 Correct 100 ms 94456 KB Output is correct
5 Correct 100 ms 94456 KB Output is correct
6 Correct 103 ms 94456 KB Output is correct
7 Correct 103 ms 94456 KB Output is correct
8 Correct 99 ms 94584 KB Output is correct
9 Correct 101 ms 94444 KB Output is correct
10 Correct 100 ms 94456 KB Output is correct
11 Correct 101 ms 94456 KB Output is correct
12 Correct 103 ms 94584 KB Output is correct
13 Correct 101 ms 94456 KB Output is correct
14 Correct 102 ms 94456 KB Output is correct
15 Correct 99 ms 94456 KB Output is correct
16 Correct 102 ms 94548 KB Output is correct
17 Correct 103 ms 94840 KB Output is correct
18 Correct 103 ms 94840 KB Output is correct
19 Correct 105 ms 94980 KB Output is correct
20 Correct 104 ms 94968 KB Output is correct
21 Correct 104 ms 94968 KB Output is correct
22 Correct 103 ms 94840 KB Output is correct
23 Correct 106 ms 94840 KB Output is correct
24 Correct 562 ms 141384 KB Output is correct
25 Correct 530 ms 141208 KB Output is correct
26 Correct 514 ms 150320 KB Output is correct
27 Correct 562 ms 150272 KB Output is correct
28 Correct 621 ms 146032 KB Output is correct
29 Correct 433 ms 138716 KB Output is correct
30 Correct 895 ms 150716 KB Output is correct
31 Correct 207 ms 111936 KB Output is correct
32 Correct 355 ms 127588 KB Output is correct
33 Correct 735 ms 147488 KB Output is correct
34 Correct 740 ms 147924 KB Output is correct
35 Correct 822 ms 144224 KB Output is correct
36 Correct 828 ms 144248 KB Output is correct
37 Correct 535 ms 146484 KB Output is correct
38 Correct 588 ms 143168 KB Output is correct
39 Correct 585 ms 147864 KB Output is correct
40 Correct 566 ms 147804 KB Output is correct
41 Correct 100 ms 94328 KB Output is correct
42 Correct 914 ms 146232 KB Output is correct
43 Correct 778 ms 140816 KB Output is correct
44 Correct 752 ms 140892 KB Output is correct
45 Correct 846 ms 146556 KB Output is correct
46 Correct 2427 ms 335228 KB Output is correct
47 Correct 2643 ms 330012 KB Output is correct
48 Correct 2471 ms 359960 KB Output is correct
49 Correct 2448 ms 355212 KB Output is correct
50 Correct 5668 ms 335524 KB Output is correct
51 Correct 3885 ms 312716 KB Output is correct
52 Correct 4118 ms 317020 KB Output is correct
53 Correct 4997 ms 330120 KB Output is correct

Subtask #7
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 562 ms 143692 KB Output is correct
2 Correct 546 ms 143604 KB Output is correct
3 Correct 470 ms 138904 KB Output is correct
4 Correct 514 ms 143220 KB Output is correct
5 Correct 102 ms 94412 KB Output is correct
6 Correct 529 ms 142656 KB Output is correct
7 Correct 216 ms 113892 KB Output is correct
8 Correct 339 ms 129764 KB Output is correct
9 Correct 474 ms 143576 KB Output is correct
10 Correct 503 ms 151160 KB Output is correct
11 Correct 413 ms 141968 KB Output is correct
12 Correct 101 ms 94352 KB Output is correct
13 Correct 108 ms 94428 KB Output is correct
14 Correct 103 ms 94532 KB Output is correct
15 Correct 100 ms 94456 KB Output is correct
16 Correct 100 ms 94456 KB Output is correct
17 Correct 103 ms 94456 KB Output is correct
18 Correct 103 ms 94456 KB Output is correct
19 Correct 99 ms 94584 KB Output is correct
20 Correct 101 ms 94444 KB Output is correct
21 Correct 100 ms 94456 KB Output is correct
22 Correct 101 ms 94456 KB Output is correct
23 Correct 103 ms 94584 KB Output is correct
24 Correct 101 ms 94456 KB Output is correct
25 Correct 102 ms 94456 KB Output is correct
26 Correct 99 ms 94456 KB Output is correct
27 Correct 102 ms 94548 KB Output is correct
28 Correct 103 ms 94840 KB Output is correct
29 Correct 103 ms 94840 KB Output is correct
30 Correct 105 ms 94980 KB Output is correct
31 Correct 104 ms 94968 KB Output is correct
32 Correct 104 ms 94968 KB Output is correct
33 Correct 103 ms 94840 KB Output is correct
34 Correct 106 ms 94840 KB Output is correct
35 Correct 562 ms 141384 KB Output is correct
36 Correct 530 ms 141208 KB Output is correct
37 Correct 514 ms 150320 KB Output is correct
38 Correct 562 ms 150272 KB Output is correct
39 Correct 621 ms 146032 KB Output is correct
40 Correct 433 ms 138716 KB Output is correct
41 Correct 895 ms 150716 KB Output is correct
42 Correct 207 ms 111936 KB Output is correct
43 Correct 355 ms 127588 KB Output is correct
44 Correct 735 ms 147488 KB Output is correct
45 Correct 740 ms 147924 KB Output is correct
46 Correct 822 ms 144224 KB Output is correct
47 Correct 828 ms 144248 KB Output is correct
48 Correct 535 ms 146484 KB Output is correct
49 Correct 588 ms 143168 KB Output is correct
50 Correct 585 ms 147864 KB Output is correct
51 Correct 566 ms 147804 KB Output is correct
52 Correct 100 ms 94328 KB Output is correct
53 Correct 914 ms 146232 KB Output is correct
54 Correct 778 ms 140816 KB Output is correct
55 Correct 752 ms 140892 KB Output is correct
56 Correct 846 ms 146556 KB Output is correct
57 Correct 661 ms 164852 KB Output is correct
58 Correct 792 ms 180448 KB Output is correct
59 Correct 779 ms 180088 KB Output is correct
60 Correct 700 ms 168824 KB Output is correct
61 Correct 922 ms 142872 KB Output is correct
62 Correct 101 ms 94456 KB Output is correct
63 Correct 1119 ms 160928 KB Output is correct
64 Correct 814 ms 150260 KB Output is correct
65 Correct 990 ms 155856 KB Output is correct
66 Correct 1109 ms 164928 KB Output is correct

Subtask #8
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 562 ms 143692 KB Output is correct
2 Correct 546 ms 143604 KB Output is correct
3 Correct 470 ms 138904 KB Output is correct
4 Correct 514 ms 143220 KB Output is correct
5 Correct 102 ms 94412 KB Output is correct
6 Correct 529 ms 142656 KB Output is correct
7 Correct 216 ms 113892 KB Output is correct
8 Correct 339 ms 129764 KB Output is correct
9 Correct 474 ms 143576 KB Output is correct
10 Correct 503 ms 151160 KB Output is correct
11 Correct 413 ms 141968 KB Output is correct
12 Correct 101 ms 94352 KB Output is correct
13 Correct 108 ms 94428 KB Output is correct
14 Correct 103 ms 94532 KB Output is correct
15 Correct 100 ms 94456 KB Output is correct
16 Correct 100 ms 94456 KB Output is correct
17 Correct 103 ms 94456 KB Output is correct
18 Correct 103 ms 94456 KB Output is correct
19 Correct 99 ms 94584 KB Output is correct
20 Correct 101 ms 94444 KB Output is correct
21 Correct 100 ms 94456 KB Output is correct
22 Correct 101 ms 94456 KB Output is correct
23 Correct 103 ms 94584 KB Output is correct
24 Correct 101 ms 94456 KB Output is correct
25 Correct 102 ms 94456 KB Output is correct
26 Correct 99 ms 94456 KB Output is correct
27 Correct 102 ms 94548 KB Output is correct
28 Correct 103 ms 94840 KB Output is correct
29 Correct 103 ms 94840 KB Output is correct
30 Correct 105 ms 94980 KB Output is correct
31 Correct 104 ms 94968 KB Output is correct
32 Correct 104 ms 94968 KB Output is correct
33 Correct 103 ms 94840 KB Output is correct
34 Correct 106 ms 94840 KB Output is correct
35 Correct 562 ms 141384 KB Output is correct
36 Correct 530 ms 141208 KB Output is correct
37 Correct 514 ms 150320 KB Output is correct
38 Correct 562 ms 150272 KB Output is correct
39 Correct 621 ms 146032 KB Output is correct
40 Correct 433 ms 138716 KB Output is correct
41 Correct 895 ms 150716 KB Output is correct
42 Correct 207 ms 111936 KB Output is correct
43 Correct 355 ms 127588 KB Output is correct
44 Correct 735 ms 147488 KB Output is correct
45 Correct 740 ms 147924 KB Output is correct
46 Correct 822 ms 144224 KB Output is correct
47 Correct 828 ms 144248 KB Output is correct
48 Correct 535 ms 146484 KB Output is correct
49 Correct 588 ms 143168 KB Output is correct
50 Correct 585 ms 147864 KB Output is correct
51 Correct 566 ms 147804 KB Output is correct
52 Correct 100 ms 94328 KB Output is correct
53 Correct 914 ms 146232 KB Output is correct
54 Correct 778 ms 140816 KB Output is correct
55 Correct 752 ms 140892 KB Output is correct
56 Correct 846 ms 146556 KB Output is correct
57 Correct 2427 ms 335228 KB Output is correct
58 Correct 2643 ms 330012 KB Output is correct
59 Correct 2471 ms 359960 KB Output is correct
60 Correct 2448 ms 355212 KB Output is correct
61 Correct 5668 ms 335524 KB Output is correct
62 Correct 3885 ms 312716 KB Output is correct
63 Correct 4118 ms 317020 KB Output is correct
64 Correct 4997 ms 330120 KB Output is correct
65 Correct 661 ms 164852 KB Output is correct
66 Correct 792 ms 180448 KB Output is correct
67 Correct 779 ms 180088 KB Output is correct
68 Correct 700 ms 168824 KB Output is correct
69 Correct 922 ms 142872 KB Output is correct
70 Correct 101 ms 94456 KB Output is correct
71 Correct 1119 ms 160928 KB Output is correct
72 Correct 814 ms 150260 KB Output is correct
73 Correct 990 ms 155856 KB Output is correct
74 Correct 1109 ms 164928 KB Output is correct
75 Correct 2928 ms 432276 KB Output is correct
76 Correct 3888 ms 501048 KB Output is correct
77 Correct 3428 ms 498284 KB Output is correct
78 Correct 2898 ms 422136 KB Output is correct
79 Correct 7585 ms 412560 KB Output is correct
80 Correct 4761 ms 365464 KB Output is correct
81 Correct 5487 ms 374208 KB Output is correct
82 Correct 6776 ms 400508 KB Output is correct
83 Correct 6733 ms 414884 KB Output is correct