oj.uz

답안 #165838

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
165838 2019-11-29T09:49:32 Z choikiwon Two Dishes (JOI19_dishes) C++17
100 / 100
 7261 ms 500564 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);
}

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 564 ms 152952 KB Output is correct
2 Correct 549 ms 151128 KB Output is correct
3 Correct 471 ms 148192 KB Output is correct
4 Correct 525 ms 152236 KB Output is correct
5 Correct 102 ms 94456 KB Output is correct
6 Correct 526 ms 144080 KB Output is correct
7 Correct 215 ms 113892 KB Output is correct
8 Correct 334 ms 129764 KB Output is correct
9 Correct 476 ms 145368 KB Output is correct
10 Correct 507 ms 152064 KB Output is correct
11 Correct 411 ms 142944 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 99 ms 94456 KB Output is correct
2 Correct 102 ms 94460 KB Output is correct
3 Correct 103 ms 94456 KB Output is correct
4 Correct 101 ms 94400 KB Output is correct
5 Correct 109 ms 94452 KB Output is correct
6 Correct 101 ms 94388 KB Output is correct
7 Correct 102 ms 94456 KB Output is correct
8 Correct 101 ms 94460 KB Output is correct
9 Correct 102 ms 94364 KB Output is correct
10 Correct 101 ms 94456 KB Output is correct
11 Correct 101 ms 94456 KB Output is correct
12 Correct 101 ms 94456 KB Output is correct
13 Correct 100 ms 94448 KB Output is correct
14 Correct 99 ms 94428 KB Output is correct
15 Correct 101 ms 94456 KB Output is correct
16 Correct 156 ms 94456 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 99 ms 94456 KB Output is correct
2 Correct 102 ms 94460 KB Output is correct
3 Correct 103 ms 94456 KB Output is correct
4 Correct 101 ms 94400 KB Output is correct
5 Correct 109 ms 94452 KB Output is correct
6 Correct 101 ms 94388 KB Output is correct
7 Correct 102 ms 94456 KB Output is correct
8 Correct 101 ms 94460 KB Output is correct
9 Correct 102 ms 94364 KB Output is correct
10 Correct 101 ms 94456 KB Output is correct
11 Correct 101 ms 94456 KB Output is correct
12 Correct 101 ms 94456 KB Output is correct
13 Correct 100 ms 94448 KB Output is correct
14 Correct 99 ms 94428 KB Output is correct
15 Correct 101 ms 94456 KB Output is correct
16 Correct 156 ms 94456 KB Output is correct
17 Correct 105 ms 95068 KB Output is correct
18 Correct 104 ms 94912 KB Output is correct
19 Correct 104 ms 95096 KB Output is correct
20 Correct 109 ms 94844 KB Output is correct
21 Correct 104 ms 94968 KB Output is correct
22 Correct 103 ms 94968 KB Output is correct
23 Correct 106 ms 94856 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 99 ms 94456 KB Output is correct
2 Correct 102 ms 94460 KB Output is correct
3 Correct 103 ms 94456 KB Output is correct
4 Correct 101 ms 94400 KB Output is correct
5 Correct 109 ms 94452 KB Output is correct
6 Correct 101 ms 94388 KB Output is correct
7 Correct 102 ms 94456 KB Output is correct
8 Correct 101 ms 94460 KB Output is correct
9 Correct 102 ms 94364 KB Output is correct
10 Correct 101 ms 94456 KB Output is correct
11 Correct 101 ms 94456 KB Output is correct
12 Correct 101 ms 94456 KB Output is correct
13 Correct 100 ms 94448 KB Output is correct
14 Correct 99 ms 94428 KB Output is correct
15 Correct 101 ms 94456 KB Output is correct
16 Correct 156 ms 94456 KB Output is correct
17 Correct 105 ms 95068 KB Output is correct
18 Correct 104 ms 94912 KB Output is correct
19 Correct 104 ms 95096 KB Output is correct
20 Correct 109 ms 94844 KB Output is correct
21 Correct 104 ms 94968 KB Output is correct
22 Correct 103 ms 94968 KB Output is correct
23 Correct 106 ms 94856 KB Output is correct
24 Correct 461 ms 141708 KB Output is correct
25 Correct 522 ms 142268 KB Output is correct
26 Correct 510 ms 144100 KB Output is correct
27 Correct 566 ms 144124 KB Output is correct
28 Correct 621 ms 143792 KB Output is correct
29 Correct 464 ms 146520 KB Output is correct
30 Correct 884 ms 144504 KB Output is correct
31 Correct 205 ms 111912 KB Output is correct
32 Correct 348 ms 127768 KB Output is correct
33 Correct 728 ms 141512 KB Output is correct
34 Correct 718 ms 141680 KB Output is correct
35 Correct 958 ms 144248 KB Output is correct
36 Correct 826 ms 144348 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 99 ms 94456 KB Output is correct
2 Correct 102 ms 94460 KB Output is correct
3 Correct 103 ms 94456 KB Output is correct
4 Correct 101 ms 94400 KB Output is correct
5 Correct 109 ms 94452 KB Output is correct
6 Correct 101 ms 94388 KB Output is correct
7 Correct 102 ms 94456 KB Output is correct
8 Correct 101 ms 94460 KB Output is correct
9 Correct 102 ms 94364 KB Output is correct
10 Correct 101 ms 94456 KB Output is correct
11 Correct 101 ms 94456 KB Output is correct
12 Correct 101 ms 94456 KB Output is correct
13 Correct 100 ms 94448 KB Output is correct
14 Correct 99 ms 94428 KB Output is correct
15 Correct 101 ms 94456 KB Output is correct
16 Correct 156 ms 94456 KB Output is correct
17 Correct 105 ms 95068 KB Output is correct
18 Correct 104 ms 94912 KB Output is correct
19 Correct 104 ms 95096 KB Output is correct
20 Correct 109 ms 94844 KB Output is correct
21 Correct 104 ms 94968 KB Output is correct
22 Correct 103 ms 94968 KB Output is correct
23 Correct 106 ms 94856 KB Output is correct
24 Correct 461 ms 141708 KB Output is correct
25 Correct 522 ms 142268 KB Output is correct
26 Correct 510 ms 144100 KB Output is correct
27 Correct 566 ms 144124 KB Output is correct
28 Correct 621 ms 143792 KB Output is correct
29 Correct 464 ms 146520 KB Output is correct
30 Correct 884 ms 144504 KB Output is correct
31 Correct 205 ms 111912 KB Output is correct
32 Correct 348 ms 127768 KB Output is correct
33 Correct 728 ms 141512 KB Output is correct
34 Correct 718 ms 141680 KB Output is correct
35 Correct 958 ms 144248 KB Output is correct
36 Correct 826 ms 144348 KB Output is correct
37 Correct 556 ms 151656 KB Output is correct
38 Correct 591 ms 152496 KB Output is correct
39 Correct 554 ms 155640 KB Output is correct
40 Correct 547 ms 155740 KB Output is correct
41 Correct 100 ms 94456 KB Output is correct
42 Correct 931 ms 146936 KB Output is correct
43 Correct 818 ms 150256 KB Output is correct
44 Correct 786 ms 150756 KB Output is correct
45 Correct 881 ms 147272 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 99 ms 94456 KB Output is correct
2 Correct 102 ms 94460 KB Output is correct
3 Correct 103 ms 94456 KB Output is correct
4 Correct 101 ms 94400 KB Output is correct
5 Correct 109 ms 94452 KB Output is correct
6 Correct 101 ms 94388 KB Output is correct
7 Correct 102 ms 94456 KB Output is correct
8 Correct 101 ms 94460 KB Output is correct
9 Correct 102 ms 94364 KB Output is correct
10 Correct 101 ms 94456 KB Output is correct
11 Correct 101 ms 94456 KB Output is correct
12 Correct 101 ms 94456 KB Output is correct
13 Correct 100 ms 94448 KB Output is correct
14 Correct 99 ms 94428 KB Output is correct
15 Correct 101 ms 94456 KB Output is correct
16 Correct 156 ms 94456 KB Output is correct
17 Correct 105 ms 95068 KB Output is correct
18 Correct 104 ms 94912 KB Output is correct
19 Correct 104 ms 95096 KB Output is correct
20 Correct 109 ms 94844 KB Output is correct
21 Correct 104 ms 94968 KB Output is correct
22 Correct 103 ms 94968 KB Output is correct
23 Correct 106 ms 94856 KB Output is correct
24 Correct 461 ms 141708 KB Output is correct
25 Correct 522 ms 142268 KB Output is correct
26 Correct 510 ms 144100 KB Output is correct
27 Correct 566 ms 144124 KB Output is correct
28 Correct 621 ms 143792 KB Output is correct
29 Correct 464 ms 146520 KB Output is correct
30 Correct 884 ms 144504 KB Output is correct
31 Correct 205 ms 111912 KB Output is correct
32 Correct 348 ms 127768 KB Output is correct
33 Correct 728 ms 141512 KB Output is correct
34 Correct 718 ms 141680 KB Output is correct
35 Correct 958 ms 144248 KB Output is correct
36 Correct 826 ms 144348 KB Output is correct
37 Correct 556 ms 151656 KB Output is correct
38 Correct 591 ms 152496 KB Output is correct
39 Correct 554 ms 155640 KB Output is correct
40 Correct 547 ms 155740 KB Output is correct
41 Correct 100 ms 94456 KB Output is correct
42 Correct 931 ms 146936 KB Output is correct
43 Correct 818 ms 150256 KB Output is correct
44 Correct 786 ms 150756 KB Output is correct
45 Correct 881 ms 147272 KB Output is correct
46 Correct 2427 ms 329840 KB Output is correct
47 Correct 2666 ms 328300 KB Output is correct
48 Correct 2455 ms 355484 KB Output is correct
49 Correct 2441 ms 358684 KB Output is correct
50 Correct 5719 ms 328552 KB Output is correct
51 Correct 3903 ms 313436 KB Output is correct
52 Correct 3919 ms 313808 KB Output is correct
53 Correct 5044 ms 331884 KB Output is correct

Subtask #7
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 564 ms 152952 KB Output is correct
2 Correct 549 ms 151128 KB Output is correct
3 Correct 471 ms 148192 KB Output is correct
4 Correct 525 ms 152236 KB Output is correct
5 Correct 102 ms 94456 KB Output is correct
6 Correct 526 ms 144080 KB Output is correct
7 Correct 215 ms 113892 KB Output is correct
8 Correct 334 ms 129764 KB Output is correct
9 Correct 476 ms 145368 KB Output is correct
10 Correct 507 ms 152064 KB Output is correct
11 Correct 411 ms 142944 KB Output is correct
12 Correct 99 ms 94456 KB Output is correct
13 Correct 102 ms 94460 KB Output is correct
14 Correct 103 ms 94456 KB Output is correct
15 Correct 101 ms 94400 KB Output is correct
16 Correct 109 ms 94452 KB Output is correct
17 Correct 101 ms 94388 KB Output is correct
18 Correct 102 ms 94456 KB Output is correct
19 Correct 101 ms 94460 KB Output is correct
20 Correct 102 ms 94364 KB Output is correct
21 Correct 101 ms 94456 KB Output is correct
22 Correct 101 ms 94456 KB Output is correct
23 Correct 101 ms 94456 KB Output is correct
24 Correct 100 ms 94448 KB Output is correct
25 Correct 99 ms 94428 KB Output is correct
26 Correct 101 ms 94456 KB Output is correct
27 Correct 156 ms 94456 KB Output is correct
28 Correct 105 ms 95068 KB Output is correct
29 Correct 104 ms 94912 KB Output is correct
30 Correct 104 ms 95096 KB Output is correct
31 Correct 109 ms 94844 KB Output is correct
32 Correct 104 ms 94968 KB Output is correct
33 Correct 103 ms 94968 KB Output is correct
34 Correct 106 ms 94856 KB Output is correct
35 Correct 461 ms 141708 KB Output is correct
36 Correct 522 ms 142268 KB Output is correct
37 Correct 510 ms 144100 KB Output is correct
38 Correct 566 ms 144124 KB Output is correct
39 Correct 621 ms 143792 KB Output is correct
40 Correct 464 ms 146520 KB Output is correct
41 Correct 884 ms 144504 KB Output is correct
42 Correct 205 ms 111912 KB Output is correct
43 Correct 348 ms 127768 KB Output is correct
44 Correct 728 ms 141512 KB Output is correct
45 Correct 718 ms 141680 KB Output is correct
46 Correct 958 ms 144248 KB Output is correct
47 Correct 826 ms 144348 KB Output is correct
48 Correct 556 ms 151656 KB Output is correct
49 Correct 591 ms 152496 KB Output is correct
50 Correct 554 ms 155640 KB Output is correct
51 Correct 547 ms 155740 KB Output is correct
52 Correct 100 ms 94456 KB Output is correct
53 Correct 931 ms 146936 KB Output is correct
54 Correct 818 ms 150256 KB Output is correct
55 Correct 786 ms 150756 KB Output is correct
56 Correct 881 ms 147272 KB Output is correct
57 Correct 628 ms 164600 KB Output is correct
58 Correct 798 ms 180156 KB Output is correct
59 Correct 731 ms 181208 KB Output is correct
60 Correct 636 ms 164088 KB Output is correct
61 Correct 901 ms 150776 KB Output is correct
62 Correct 102 ms 94456 KB Output is correct
63 Correct 1136 ms 161288 KB Output is correct
64 Correct 816 ms 154692 KB Output is correct
65 Correct 986 ms 162904 KB Output is correct
66 Correct 1118 ms 162468 KB Output is correct

Subtask #8
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 564 ms 152952 KB Output is correct
2 Correct 549 ms 151128 KB Output is correct
3 Correct 471 ms 148192 KB Output is correct
4 Correct 525 ms 152236 KB Output is correct
5 Correct 102 ms 94456 KB Output is correct
6 Correct 526 ms 144080 KB Output is correct
7 Correct 215 ms 113892 KB Output is correct
8 Correct 334 ms 129764 KB Output is correct
9 Correct 476 ms 145368 KB Output is correct
10 Correct 507 ms 152064 KB Output is correct
11 Correct 411 ms 142944 KB Output is correct
12 Correct 99 ms 94456 KB Output is correct
13 Correct 102 ms 94460 KB Output is correct
14 Correct 103 ms 94456 KB Output is correct
15 Correct 101 ms 94400 KB Output is correct
16 Correct 109 ms 94452 KB Output is correct
17 Correct 101 ms 94388 KB Output is correct
18 Correct 102 ms 94456 KB Output is correct
19 Correct 101 ms 94460 KB Output is correct
20 Correct 102 ms 94364 KB Output is correct
21 Correct 101 ms 94456 KB Output is correct
22 Correct 101 ms 94456 KB Output is correct
23 Correct 101 ms 94456 KB Output is correct
24 Correct 100 ms 94448 KB Output is correct
25 Correct 99 ms 94428 KB Output is correct
26 Correct 101 ms 94456 KB Output is correct
27 Correct 156 ms 94456 KB Output is correct
28 Correct 105 ms 95068 KB Output is correct
29 Correct 104 ms 94912 KB Output is correct
30 Correct 104 ms 95096 KB Output is correct
31 Correct 109 ms 94844 KB Output is correct
32 Correct 104 ms 94968 KB Output is correct
33 Correct 103 ms 94968 KB Output is correct
34 Correct 106 ms 94856 KB Output is correct
35 Correct 461 ms 141708 KB Output is correct
36 Correct 522 ms 142268 KB Output is correct
37 Correct 510 ms 144100 KB Output is correct
38 Correct 566 ms 144124 KB Output is correct
39 Correct 621 ms 143792 KB Output is correct
40 Correct 464 ms 146520 KB Output is correct
41 Correct 884 ms 144504 KB Output is correct
42 Correct 205 ms 111912 KB Output is correct
43 Correct 348 ms 127768 KB Output is correct
44 Correct 728 ms 141512 KB Output is correct
45 Correct 718 ms 141680 KB Output is correct
46 Correct 958 ms 144248 KB Output is correct
47 Correct 826 ms 144348 KB Output is correct
48 Correct 556 ms 151656 KB Output is correct
49 Correct 591 ms 152496 KB Output is correct
50 Correct 554 ms 155640 KB Output is correct
51 Correct 547 ms 155740 KB Output is correct
52 Correct 100 ms 94456 KB Output is correct
53 Correct 931 ms 146936 KB Output is correct
54 Correct 818 ms 150256 KB Output is correct
55 Correct 786 ms 150756 KB Output is correct
56 Correct 881 ms 147272 KB Output is correct
57 Correct 2427 ms 329840 KB Output is correct
58 Correct 2666 ms 328300 KB Output is correct
59 Correct 2455 ms 355484 KB Output is correct
60 Correct 2441 ms 358684 KB Output is correct
61 Correct 5719 ms 328552 KB Output is correct
62 Correct 3903 ms 313436 KB Output is correct
63 Correct 3919 ms 313808 KB Output is correct
64 Correct 5044 ms 331884 KB Output is correct
65 Correct 628 ms 164600 KB Output is correct
66 Correct 798 ms 180156 KB Output is correct
67 Correct 731 ms 181208 KB Output is correct
68 Correct 636 ms 164088 KB Output is correct
69 Correct 901 ms 150776 KB Output is correct
70 Correct 102 ms 94456 KB Output is correct
71 Correct 1136 ms 161288 KB Output is correct
72 Correct 816 ms 154692 KB Output is correct
73 Correct 986 ms 162904 KB Output is correct
74 Correct 1118 ms 162468 KB Output is correct
75 Correct 2891 ms 431384 KB Output is correct
76 Correct 3843 ms 500564 KB Output is correct
77 Correct 3434 ms 497212 KB Output is correct
78 Correct 2918 ms 424700 KB Output is correct
79 Correct 7261 ms 411532 KB Output is correct
80 Correct 4586 ms 355532 KB Output is correct
81 Correct 5251 ms 366988 KB Output is correct
82 Correct 6749 ms 402976 KB Output is correct
83 Correct 6413 ms 405740 KB Output is correct