oj.uz

답안 #165843

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
165843 2019-11-29T10:06:31 Z choikiwon Two Dishes (JOI19_dishes) C++17
100 / 100
 7157 ms 502812 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;

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

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() {
    //scanf("%d %d", &N, &M);

    N = getInt();
    M = getInt();

    for(int i = 0; i < N; i++) {
        //scanf("%lld %lld %lld", &A[i], &S[i], &P[i]);

        A[i] = getInt();
        S[i] = getInt();
        P[i] = getInt();
    }
    for(int i = 0; i < M; i++) {
        //scanf("%lld %lld %lld", &B[i], &T[i], &Q[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.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:177:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < adj2[i].size(); j++) {
                        ~~^~~~~~~~~~~~~~~~
dishes.cpp:202:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < adj1[i].size(); j++) {
                        ~~^~~~~~~~~~~~~~~~
dishes.cpp:250: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

# 결과 실행 시간 메모리 Grader output
1 Correct 576 ms 144960 KB Output is correct
2 Correct 567 ms 146424 KB Output is correct
3 Correct 537 ms 137820 KB Output is correct
4 Correct 533 ms 142856 KB Output is correct
5 Correct 112 ms 94456 KB Output is correct
6 Correct 551 ms 143820 KB Output is correct
7 Correct 223 ms 111076 KB Output is correct
8 Correct 347 ms 126820 KB Output is correct
9 Correct 486 ms 141660 KB Output is correct
10 Correct 493 ms 150236 KB Output is correct
11 Correct 395 ms 141404 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 100 ms 94456 KB Output is correct
2 Correct 105 ms 94456 KB Output is correct
3 Correct 107 ms 94524 KB Output is correct
4 Correct 100 ms 94456 KB Output is correct
5 Correct 104 ms 94528 KB Output is correct
6 Correct 101 ms 94456 KB Output is correct
7 Correct 102 ms 94456 KB Output is correct
8 Correct 103 ms 94584 KB Output is correct
9 Correct 108 ms 94460 KB Output is correct
10 Correct 101 ms 94456 KB Output is correct
11 Correct 100 ms 94456 KB Output is correct
12 Correct 101 ms 94456 KB Output is correct
13 Correct 102 ms 94528 KB Output is correct
14 Correct 103 ms 94548 KB Output is correct
15 Correct 115 ms 94456 KB Output is correct
16 Correct 101 ms 94584 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 100 ms 94456 KB Output is correct
2 Correct 105 ms 94456 KB Output is correct
3 Correct 107 ms 94524 KB Output is correct
4 Correct 100 ms 94456 KB Output is correct
5 Correct 104 ms 94528 KB Output is correct
6 Correct 101 ms 94456 KB Output is correct
7 Correct 102 ms 94456 KB Output is correct
8 Correct 103 ms 94584 KB Output is correct
9 Correct 108 ms 94460 KB Output is correct
10 Correct 101 ms 94456 KB Output is correct
11 Correct 100 ms 94456 KB Output is correct
12 Correct 101 ms 94456 KB Output is correct
13 Correct 102 ms 94528 KB Output is correct
14 Correct 103 ms 94548 KB Output is correct
15 Correct 115 ms 94456 KB Output is correct
16 Correct 101 ms 94584 KB Output is correct
17 Correct 104 ms 94960 KB Output is correct
18 Correct 107 ms 94928 KB Output is correct
19 Correct 106 ms 95096 KB Output is correct
20 Correct 105 ms 94968 KB Output is correct
21 Correct 108 ms 94968 KB Output is correct
22 Correct 108 ms 94840 KB Output is correct
23 Correct 105 ms 94840 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 100 ms 94456 KB Output is correct
2 Correct 105 ms 94456 KB Output is correct
3 Correct 107 ms 94524 KB Output is correct
4 Correct 100 ms 94456 KB Output is correct
5 Correct 104 ms 94528 KB Output is correct
6 Correct 101 ms 94456 KB Output is correct
7 Correct 102 ms 94456 KB Output is correct
8 Correct 103 ms 94584 KB Output is correct
9 Correct 108 ms 94460 KB Output is correct
10 Correct 101 ms 94456 KB Output is correct
11 Correct 100 ms 94456 KB Output is correct
12 Correct 101 ms 94456 KB Output is correct
13 Correct 102 ms 94528 KB Output is correct
14 Correct 103 ms 94548 KB Output is correct
15 Correct 115 ms 94456 KB Output is correct
16 Correct 101 ms 94584 KB Output is correct
17 Correct 104 ms 94960 KB Output is correct
18 Correct 107 ms 94928 KB Output is correct
19 Correct 106 ms 95096 KB Output is correct
20 Correct 105 ms 94968 KB Output is correct
21 Correct 108 ms 94968 KB Output is correct
22 Correct 108 ms 94840 KB Output is correct
23 Correct 105 ms 94840 KB Output is correct
24 Correct 451 ms 141200 KB Output is correct
25 Correct 502 ms 144632 KB Output is correct
26 Correct 487 ms 141744 KB Output is correct
27 Correct 530 ms 141820 KB Output is correct
28 Correct 586 ms 141544 KB Output is correct
29 Correct 448 ms 141684 KB Output is correct
30 Correct 887 ms 142088 KB Output is correct
31 Correct 198 ms 111920 KB Output is correct
32 Correct 346 ms 127752 KB Output is correct
33 Correct 678 ms 139120 KB Output is correct
34 Correct 723 ms 139424 KB Output is correct
35 Correct 783 ms 144292 KB Output is correct
36 Correct 802 ms 143096 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 100 ms 94456 KB Output is correct
2 Correct 105 ms 94456 KB Output is correct
3 Correct 107 ms 94524 KB Output is correct
4 Correct 100 ms 94456 KB Output is correct
5 Correct 104 ms 94528 KB Output is correct
6 Correct 101 ms 94456 KB Output is correct
7 Correct 102 ms 94456 KB Output is correct
8 Correct 103 ms 94584 KB Output is correct
9 Correct 108 ms 94460 KB Output is correct
10 Correct 101 ms 94456 KB Output is correct
11 Correct 100 ms 94456 KB Output is correct
12 Correct 101 ms 94456 KB Output is correct
13 Correct 102 ms 94528 KB Output is correct
14 Correct 103 ms 94548 KB Output is correct
15 Correct 115 ms 94456 KB Output is correct
16 Correct 101 ms 94584 KB Output is correct
17 Correct 104 ms 94960 KB Output is correct
18 Correct 107 ms 94928 KB Output is correct
19 Correct 106 ms 95096 KB Output is correct
20 Correct 105 ms 94968 KB Output is correct
21 Correct 108 ms 94968 KB Output is correct
22 Correct 108 ms 94840 KB Output is correct
23 Correct 105 ms 94840 KB Output is correct
24 Correct 451 ms 141200 KB Output is correct
25 Correct 502 ms 144632 KB Output is correct
26 Correct 487 ms 141744 KB Output is correct
27 Correct 530 ms 141820 KB Output is correct
28 Correct 586 ms 141544 KB Output is correct
29 Correct 448 ms 141684 KB Output is correct
30 Correct 887 ms 142088 KB Output is correct
31 Correct 198 ms 111920 KB Output is correct
32 Correct 346 ms 127752 KB Output is correct
33 Correct 678 ms 139120 KB Output is correct
34 Correct 723 ms 139424 KB Output is correct
35 Correct 783 ms 144292 KB Output is correct
36 Correct 802 ms 143096 KB Output is correct
37 Correct 544 ms 148792 KB Output is correct
38 Correct 596 ms 147532 KB Output is correct
39 Correct 547 ms 150520 KB Output is correct
40 Correct 538 ms 150460 KB Output is correct
41 Correct 102 ms 94328 KB Output is correct
42 Correct 931 ms 148188 KB Output is correct
43 Correct 736 ms 143068 KB Output is correct
44 Correct 743 ms 142828 KB Output is correct
45 Correct 839 ms 147320 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 100 ms 94456 KB Output is correct
2 Correct 105 ms 94456 KB Output is correct
3 Correct 107 ms 94524 KB Output is correct
4 Correct 100 ms 94456 KB Output is correct
5 Correct 104 ms 94528 KB Output is correct
6 Correct 101 ms 94456 KB Output is correct
7 Correct 102 ms 94456 KB Output is correct
8 Correct 103 ms 94584 KB Output is correct
9 Correct 108 ms 94460 KB Output is correct
10 Correct 101 ms 94456 KB Output is correct
11 Correct 100 ms 94456 KB Output is correct
12 Correct 101 ms 94456 KB Output is correct
13 Correct 102 ms 94528 KB Output is correct
14 Correct 103 ms 94548 KB Output is correct
15 Correct 115 ms 94456 KB Output is correct
16 Correct 101 ms 94584 KB Output is correct
17 Correct 104 ms 94960 KB Output is correct
18 Correct 107 ms 94928 KB Output is correct
19 Correct 106 ms 95096 KB Output is correct
20 Correct 105 ms 94968 KB Output is correct
21 Correct 108 ms 94968 KB Output is correct
22 Correct 108 ms 94840 KB Output is correct
23 Correct 105 ms 94840 KB Output is correct
24 Correct 451 ms 141200 KB Output is correct
25 Correct 502 ms 144632 KB Output is correct
26 Correct 487 ms 141744 KB Output is correct
27 Correct 530 ms 141820 KB Output is correct
28 Correct 586 ms 141544 KB Output is correct
29 Correct 448 ms 141684 KB Output is correct
30 Correct 887 ms 142088 KB Output is correct
31 Correct 198 ms 111920 KB Output is correct
32 Correct 346 ms 127752 KB Output is correct
33 Correct 678 ms 139120 KB Output is correct
34 Correct 723 ms 139424 KB Output is correct
35 Correct 783 ms 144292 KB Output is correct
36 Correct 802 ms 143096 KB Output is correct
37 Correct 544 ms 148792 KB Output is correct
38 Correct 596 ms 147532 KB Output is correct
39 Correct 547 ms 150520 KB Output is correct
40 Correct 538 ms 150460 KB Output is correct
41 Correct 102 ms 94328 KB Output is correct
42 Correct 931 ms 148188 KB Output is correct
43 Correct 736 ms 143068 KB Output is correct
44 Correct 743 ms 142828 KB Output is correct
45 Correct 839 ms 147320 KB Output is correct
46 Correct 2344 ms 326448 KB Output is correct
47 Correct 2727 ms 328116 KB Output is correct
48 Correct 2407 ms 351956 KB Output is correct
49 Correct 2397 ms 347384 KB Output is correct
50 Correct 5596 ms 331352 KB Output is correct
51 Correct 3833 ms 305144 KB Output is correct
52 Correct 3980 ms 309780 KB Output is correct
53 Correct 4907 ms 325052 KB Output is correct

Subtask #7
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 576 ms 144960 KB Output is correct
2 Correct 567 ms 146424 KB Output is correct
3 Correct 537 ms 137820 KB Output is correct
4 Correct 533 ms 142856 KB Output is correct
5 Correct 112 ms 94456 KB Output is correct
6 Correct 551 ms 143820 KB Output is correct
7 Correct 223 ms 111076 KB Output is correct
8 Correct 347 ms 126820 KB Output is correct
9 Correct 486 ms 141660 KB Output is correct
10 Correct 493 ms 150236 KB Output is correct
11 Correct 395 ms 141404 KB Output is correct
12 Correct 100 ms 94456 KB Output is correct
13 Correct 105 ms 94456 KB Output is correct
14 Correct 107 ms 94524 KB Output is correct
15 Correct 100 ms 94456 KB Output is correct
16 Correct 104 ms 94528 KB Output is correct
17 Correct 101 ms 94456 KB Output is correct
18 Correct 102 ms 94456 KB Output is correct
19 Correct 103 ms 94584 KB Output is correct
20 Correct 108 ms 94460 KB Output is correct
21 Correct 101 ms 94456 KB Output is correct
22 Correct 100 ms 94456 KB Output is correct
23 Correct 101 ms 94456 KB Output is correct
24 Correct 102 ms 94528 KB Output is correct
25 Correct 103 ms 94548 KB Output is correct
26 Correct 115 ms 94456 KB Output is correct
27 Correct 101 ms 94584 KB Output is correct
28 Correct 104 ms 94960 KB Output is correct
29 Correct 107 ms 94928 KB Output is correct
30 Correct 106 ms 95096 KB Output is correct
31 Correct 105 ms 94968 KB Output is correct
32 Correct 108 ms 94968 KB Output is correct
33 Correct 108 ms 94840 KB Output is correct
34 Correct 105 ms 94840 KB Output is correct
35 Correct 451 ms 141200 KB Output is correct
36 Correct 502 ms 144632 KB Output is correct
37 Correct 487 ms 141744 KB Output is correct
38 Correct 530 ms 141820 KB Output is correct
39 Correct 586 ms 141544 KB Output is correct
40 Correct 448 ms 141684 KB Output is correct
41 Correct 887 ms 142088 KB Output is correct
42 Correct 198 ms 111920 KB Output is correct
43 Correct 346 ms 127752 KB Output is correct
44 Correct 678 ms 139120 KB Output is correct
45 Correct 723 ms 139424 KB Output is correct
46 Correct 783 ms 144292 KB Output is correct
47 Correct 802 ms 143096 KB Output is correct
48 Correct 544 ms 148792 KB Output is correct
49 Correct 596 ms 147532 KB Output is correct
50 Correct 547 ms 150520 KB Output is correct
51 Correct 538 ms 150460 KB Output is correct
52 Correct 102 ms 94328 KB Output is correct
53 Correct 931 ms 148188 KB Output is correct
54 Correct 736 ms 143068 KB Output is correct
55 Correct 743 ms 142828 KB Output is correct
56 Correct 839 ms 147320 KB Output is correct
57 Correct 640 ms 164824 KB Output is correct
58 Correct 822 ms 175952 KB Output is correct
59 Correct 744 ms 178936 KB Output is correct
60 Correct 641 ms 165404 KB Output is correct
61 Correct 893 ms 145016 KB Output is correct
62 Correct 101 ms 94456 KB Output is correct
63 Correct 1124 ms 157808 KB Output is correct
64 Correct 845 ms 147756 KB Output is correct
65 Correct 973 ms 156012 KB Output is correct
66 Correct 1082 ms 163428 KB Output is correct

Subtask #8
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 576 ms 144960 KB Output is correct
2 Correct 567 ms 146424 KB Output is correct
3 Correct 537 ms 137820 KB Output is correct
4 Correct 533 ms 142856 KB Output is correct
5 Correct 112 ms 94456 KB Output is correct
6 Correct 551 ms 143820 KB Output is correct
7 Correct 223 ms 111076 KB Output is correct
8 Correct 347 ms 126820 KB Output is correct
9 Correct 486 ms 141660 KB Output is correct
10 Correct 493 ms 150236 KB Output is correct
11 Correct 395 ms 141404 KB Output is correct
12 Correct 100 ms 94456 KB Output is correct
13 Correct 105 ms 94456 KB Output is correct
14 Correct 107 ms 94524 KB Output is correct
15 Correct 100 ms 94456 KB Output is correct
16 Correct 104 ms 94528 KB Output is correct
17 Correct 101 ms 94456 KB Output is correct
18 Correct 102 ms 94456 KB Output is correct
19 Correct 103 ms 94584 KB Output is correct
20 Correct 108 ms 94460 KB Output is correct
21 Correct 101 ms 94456 KB Output is correct
22 Correct 100 ms 94456 KB Output is correct
23 Correct 101 ms 94456 KB Output is correct
24 Correct 102 ms 94528 KB Output is correct
25 Correct 103 ms 94548 KB Output is correct
26 Correct 115 ms 94456 KB Output is correct
27 Correct 101 ms 94584 KB Output is correct
28 Correct 104 ms 94960 KB Output is correct
29 Correct 107 ms 94928 KB Output is correct
30 Correct 106 ms 95096 KB Output is correct
31 Correct 105 ms 94968 KB Output is correct
32 Correct 108 ms 94968 KB Output is correct
33 Correct 108 ms 94840 KB Output is correct
34 Correct 105 ms 94840 KB Output is correct
35 Correct 451 ms 141200 KB Output is correct
36 Correct 502 ms 144632 KB Output is correct
37 Correct 487 ms 141744 KB Output is correct
38 Correct 530 ms 141820 KB Output is correct
39 Correct 586 ms 141544 KB Output is correct
40 Correct 448 ms 141684 KB Output is correct
41 Correct 887 ms 142088 KB Output is correct
42 Correct 198 ms 111920 KB Output is correct
43 Correct 346 ms 127752 KB Output is correct
44 Correct 678 ms 139120 KB Output is correct
45 Correct 723 ms 139424 KB Output is correct
46 Correct 783 ms 144292 KB Output is correct
47 Correct 802 ms 143096 KB Output is correct
48 Correct 544 ms 148792 KB Output is correct
49 Correct 596 ms 147532 KB Output is correct
50 Correct 547 ms 150520 KB Output is correct
51 Correct 538 ms 150460 KB Output is correct
52 Correct 102 ms 94328 KB Output is correct
53 Correct 931 ms 148188 KB Output is correct
54 Correct 736 ms 143068 KB Output is correct
55 Correct 743 ms 142828 KB Output is correct
56 Correct 839 ms 147320 KB Output is correct
57 Correct 2344 ms 326448 KB Output is correct
58 Correct 2727 ms 328116 KB Output is correct
59 Correct 2407 ms 351956 KB Output is correct
60 Correct 2397 ms 347384 KB Output is correct
61 Correct 5596 ms 331352 KB Output is correct
62 Correct 3833 ms 305144 KB Output is correct
63 Correct 3980 ms 309780 KB Output is correct
64 Correct 4907 ms 325052 KB Output is correct
65 Correct 640 ms 164824 KB Output is correct
66 Correct 822 ms 175952 KB Output is correct
67 Correct 744 ms 178936 KB Output is correct
68 Correct 641 ms 165404 KB Output is correct
69 Correct 893 ms 145016 KB Output is correct
70 Correct 101 ms 94456 KB Output is correct
71 Correct 1124 ms 157808 KB Output is correct
72 Correct 845 ms 147756 KB Output is correct
73 Correct 973 ms 156012 KB Output is correct
74 Correct 1082 ms 163428 KB Output is correct
75 Correct 2878 ms 426632 KB Output is correct
76 Correct 3804 ms 502812 KB Output is correct
77 Correct 3432 ms 499564 KB Output is correct
78 Correct 2866 ms 418976 KB Output is correct
79 Correct 7157 ms 410048 KB Output is correct
80 Correct 4542 ms 355172 KB Output is correct
81 Correct 5291 ms 369600 KB Output is correct
82 Correct 6530 ms 400768 KB Output is correct
83 Correct 6364 ms 404588 KB Output is correct