oj.uz

답안 #165832

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
165832 2019-11-29T09:40:18 Z choikiwon Two Dishes (JOI19_dishes) C++17
100 / 100
 7426 ms 509404 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];

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

    //*/

    vector<pii> ord;
    for(int i = 0; i < N; i++) ord.push_back(pii(X[i], -i));
    sort(ord.begin(), ord.end());
    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]);

        //cout << dp[i] << endl;

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

    cout << 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:145:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < adj2[i].size(); j++) {
                        ~~^~~~~~~~~~~~~~~~
dishes.cpp:167: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:114: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:117: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:120: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 587 ms 155784 KB Output is correct
2 Correct 574 ms 154404 KB Output is correct
3 Correct 487 ms 148888 KB Output is correct
4 Correct 537 ms 152824 KB Output is correct
5 Correct 101 ms 94328 KB Output is correct
6 Correct 547 ms 150928 KB Output is correct
7 Correct 222 ms 113844 KB Output is correct
8 Correct 346 ms 129604 KB Output is correct
9 Correct 491 ms 148816 KB Output is correct
10 Correct 536 ms 152136 KB Output is correct
11 Correct 432 ms 143168 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 94328 KB Output is correct
2 Correct 101 ms 94460 KB Output is correct
3 Correct 102 ms 94444 KB Output is correct
4 Correct 102 ms 94328 KB Output is correct
5 Correct 101 ms 94328 KB Output is correct
6 Correct 101 ms 94476 KB Output is correct
7 Correct 101 ms 94328 KB Output is correct
8 Correct 102 ms 94328 KB Output is correct
9 Correct 101 ms 94328 KB Output is correct
10 Correct 102 ms 94328 KB Output is correct
11 Correct 100 ms 94328 KB Output is correct
12 Correct 101 ms 94464 KB Output is correct
13 Correct 100 ms 94328 KB Output is correct
14 Correct 99 ms 94328 KB Output is correct
15 Correct 100 ms 94328 KB Output is correct
16 Correct 101 ms 94404 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 94328 KB Output is correct
2 Correct 101 ms 94460 KB Output is correct
3 Correct 102 ms 94444 KB Output is correct
4 Correct 102 ms 94328 KB Output is correct
5 Correct 101 ms 94328 KB Output is correct
6 Correct 101 ms 94476 KB Output is correct
7 Correct 101 ms 94328 KB Output is correct
8 Correct 102 ms 94328 KB Output is correct
9 Correct 101 ms 94328 KB Output is correct
10 Correct 102 ms 94328 KB Output is correct
11 Correct 100 ms 94328 KB Output is correct
12 Correct 101 ms 94464 KB Output is correct
13 Correct 100 ms 94328 KB Output is correct
14 Correct 99 ms 94328 KB Output is correct
15 Correct 100 ms 94328 KB Output is correct
16 Correct 101 ms 94404 KB Output is correct
17 Correct 103 ms 94880 KB Output is correct
18 Correct 109 ms 94916 KB Output is correct
19 Correct 107 ms 94964 KB Output is correct
20 Correct 105 ms 94968 KB Output is correct
21 Correct 119 ms 94968 KB Output is correct
22 Correct 139 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 101 ms 94328 KB Output is correct
2 Correct 101 ms 94460 KB Output is correct
3 Correct 102 ms 94444 KB Output is correct
4 Correct 102 ms 94328 KB Output is correct
5 Correct 101 ms 94328 KB Output is correct
6 Correct 101 ms 94476 KB Output is correct
7 Correct 101 ms 94328 KB Output is correct
8 Correct 102 ms 94328 KB Output is correct
9 Correct 101 ms 94328 KB Output is correct
10 Correct 102 ms 94328 KB Output is correct
11 Correct 100 ms 94328 KB Output is correct
12 Correct 101 ms 94464 KB Output is correct
13 Correct 100 ms 94328 KB Output is correct
14 Correct 99 ms 94328 KB Output is correct
15 Correct 100 ms 94328 KB Output is correct
16 Correct 101 ms 94404 KB Output is correct
17 Correct 103 ms 94880 KB Output is correct
18 Correct 109 ms 94916 KB Output is correct
19 Correct 107 ms 94964 KB Output is correct
20 Correct 105 ms 94968 KB Output is correct
21 Correct 119 ms 94968 KB Output is correct
22 Correct 139 ms 94840 KB Output is correct
23 Correct 105 ms 94840 KB Output is correct
24 Correct 472 ms 147192 KB Output is correct
25 Correct 690 ms 144832 KB Output is correct
26 Correct 521 ms 150408 KB Output is correct
27 Correct 563 ms 150252 KB Output is correct
28 Correct 654 ms 147756 KB Output is correct
29 Correct 456 ms 146624 KB Output is correct
30 Correct 936 ms 150880 KB Output is correct
31 Correct 219 ms 111760 KB Output is correct
32 Correct 365 ms 127628 KB Output is correct
33 Correct 744 ms 147736 KB Output is correct
34 Correct 813 ms 149612 KB Output is correct
35 Correct 916 ms 144460 KB Output is correct
36 Correct 875 ms 144444 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 94328 KB Output is correct
2 Correct 101 ms 94460 KB Output is correct
3 Correct 102 ms 94444 KB Output is correct
4 Correct 102 ms 94328 KB Output is correct
5 Correct 101 ms 94328 KB Output is correct
6 Correct 101 ms 94476 KB Output is correct
7 Correct 101 ms 94328 KB Output is correct
8 Correct 102 ms 94328 KB Output is correct
9 Correct 101 ms 94328 KB Output is correct
10 Correct 102 ms 94328 KB Output is correct
11 Correct 100 ms 94328 KB Output is correct
12 Correct 101 ms 94464 KB Output is correct
13 Correct 100 ms 94328 KB Output is correct
14 Correct 99 ms 94328 KB Output is correct
15 Correct 100 ms 94328 KB Output is correct
16 Correct 101 ms 94404 KB Output is correct
17 Correct 103 ms 94880 KB Output is correct
18 Correct 109 ms 94916 KB Output is correct
19 Correct 107 ms 94964 KB Output is correct
20 Correct 105 ms 94968 KB Output is correct
21 Correct 119 ms 94968 KB Output is correct
22 Correct 139 ms 94840 KB Output is correct
23 Correct 105 ms 94840 KB Output is correct
24 Correct 472 ms 147192 KB Output is correct
25 Correct 690 ms 144832 KB Output is correct
26 Correct 521 ms 150408 KB Output is correct
27 Correct 563 ms 150252 KB Output is correct
28 Correct 654 ms 147756 KB Output is correct
29 Correct 456 ms 146624 KB Output is correct
30 Correct 936 ms 150880 KB Output is correct
31 Correct 219 ms 111760 KB Output is correct
32 Correct 365 ms 127628 KB Output is correct
33 Correct 744 ms 147736 KB Output is correct
34 Correct 813 ms 149612 KB Output is correct
35 Correct 916 ms 144460 KB Output is correct
36 Correct 875 ms 144444 KB Output is correct
37 Correct 643 ms 153264 KB Output is correct
38 Correct 650 ms 153312 KB Output is correct
39 Correct 569 ms 155604 KB Output is correct
40 Correct 567 ms 155772 KB Output is correct
41 Correct 100 ms 94328 KB Output is correct
42 Correct 977 ms 153568 KB Output is correct
43 Correct 775 ms 150500 KB Output is correct
44 Correct 797 ms 152512 KB Output is correct
45 Correct 895 ms 147488 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 94328 KB Output is correct
2 Correct 101 ms 94460 KB Output is correct
3 Correct 102 ms 94444 KB Output is correct
4 Correct 102 ms 94328 KB Output is correct
5 Correct 101 ms 94328 KB Output is correct
6 Correct 101 ms 94476 KB Output is correct
7 Correct 101 ms 94328 KB Output is correct
8 Correct 102 ms 94328 KB Output is correct
9 Correct 101 ms 94328 KB Output is correct
10 Correct 102 ms 94328 KB Output is correct
11 Correct 100 ms 94328 KB Output is correct
12 Correct 101 ms 94464 KB Output is correct
13 Correct 100 ms 94328 KB Output is correct
14 Correct 99 ms 94328 KB Output is correct
15 Correct 100 ms 94328 KB Output is correct
16 Correct 101 ms 94404 KB Output is correct
17 Correct 103 ms 94880 KB Output is correct
18 Correct 109 ms 94916 KB Output is correct
19 Correct 107 ms 94964 KB Output is correct
20 Correct 105 ms 94968 KB Output is correct
21 Correct 119 ms 94968 KB Output is correct
22 Correct 139 ms 94840 KB Output is correct
23 Correct 105 ms 94840 KB Output is correct
24 Correct 472 ms 147192 KB Output is correct
25 Correct 690 ms 144832 KB Output is correct
26 Correct 521 ms 150408 KB Output is correct
27 Correct 563 ms 150252 KB Output is correct
28 Correct 654 ms 147756 KB Output is correct
29 Correct 456 ms 146624 KB Output is correct
30 Correct 936 ms 150880 KB Output is correct
31 Correct 219 ms 111760 KB Output is correct
32 Correct 365 ms 127628 KB Output is correct
33 Correct 744 ms 147736 KB Output is correct
34 Correct 813 ms 149612 KB Output is correct
35 Correct 916 ms 144460 KB Output is correct
36 Correct 875 ms 144444 KB Output is correct
37 Correct 643 ms 153264 KB Output is correct
38 Correct 650 ms 153312 KB Output is correct
39 Correct 569 ms 155604 KB Output is correct
40 Correct 567 ms 155772 KB Output is correct
41 Correct 100 ms 94328 KB Output is correct
42 Correct 977 ms 153568 KB Output is correct
43 Correct 775 ms 150500 KB Output is correct
44 Correct 797 ms 152512 KB Output is correct
45 Correct 895 ms 147488 KB Output is correct
46 Correct 2910 ms 345948 KB Output is correct
47 Correct 2739 ms 347896 KB Output is correct
48 Correct 2644 ms 362808 KB Output is correct
49 Correct 2515 ms 360340 KB Output is correct
50 Correct 5856 ms 347072 KB Output is correct
51 Correct 3997 ms 327940 KB Output is correct
52 Correct 4149 ms 327456 KB Output is correct
53 Correct 5408 ms 336888 KB Output is correct

Subtask #7
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 587 ms 155784 KB Output is correct
2 Correct 574 ms 154404 KB Output is correct
3 Correct 487 ms 148888 KB Output is correct
4 Correct 537 ms 152824 KB Output is correct
5 Correct 101 ms 94328 KB Output is correct
6 Correct 547 ms 150928 KB Output is correct
7 Correct 222 ms 113844 KB Output is correct
8 Correct 346 ms 129604 KB Output is correct
9 Correct 491 ms 148816 KB Output is correct
10 Correct 536 ms 152136 KB Output is correct
11 Correct 432 ms 143168 KB Output is correct
12 Correct 101 ms 94328 KB Output is correct
13 Correct 101 ms 94460 KB Output is correct
14 Correct 102 ms 94444 KB Output is correct
15 Correct 102 ms 94328 KB Output is correct
16 Correct 101 ms 94328 KB Output is correct
17 Correct 101 ms 94476 KB Output is correct
18 Correct 101 ms 94328 KB Output is correct
19 Correct 102 ms 94328 KB Output is correct
20 Correct 101 ms 94328 KB Output is correct
21 Correct 102 ms 94328 KB Output is correct
22 Correct 100 ms 94328 KB Output is correct
23 Correct 101 ms 94464 KB Output is correct
24 Correct 100 ms 94328 KB Output is correct
25 Correct 99 ms 94328 KB Output is correct
26 Correct 100 ms 94328 KB Output is correct
27 Correct 101 ms 94404 KB Output is correct
28 Correct 103 ms 94880 KB Output is correct
29 Correct 109 ms 94916 KB Output is correct
30 Correct 107 ms 94964 KB Output is correct
31 Correct 105 ms 94968 KB Output is correct
32 Correct 119 ms 94968 KB Output is correct
33 Correct 139 ms 94840 KB Output is correct
34 Correct 105 ms 94840 KB Output is correct
35 Correct 472 ms 147192 KB Output is correct
36 Correct 690 ms 144832 KB Output is correct
37 Correct 521 ms 150408 KB Output is correct
38 Correct 563 ms 150252 KB Output is correct
39 Correct 654 ms 147756 KB Output is correct
40 Correct 456 ms 146624 KB Output is correct
41 Correct 936 ms 150880 KB Output is correct
42 Correct 219 ms 111760 KB Output is correct
43 Correct 365 ms 127628 KB Output is correct
44 Correct 744 ms 147736 KB Output is correct
45 Correct 813 ms 149612 KB Output is correct
46 Correct 916 ms 144460 KB Output is correct
47 Correct 875 ms 144444 KB Output is correct
48 Correct 643 ms 153264 KB Output is correct
49 Correct 650 ms 153312 KB Output is correct
50 Correct 569 ms 155604 KB Output is correct
51 Correct 567 ms 155772 KB Output is correct
52 Correct 100 ms 94328 KB Output is correct
53 Correct 977 ms 153568 KB Output is correct
54 Correct 775 ms 150500 KB Output is correct
55 Correct 797 ms 152512 KB Output is correct
56 Correct 895 ms 147488 KB Output is correct
57 Correct 654 ms 165484 KB Output is correct
58 Correct 839 ms 179620 KB Output is correct
59 Correct 762 ms 180968 KB Output is correct
60 Correct 673 ms 169264 KB Output is correct
61 Correct 946 ms 150056 KB Output is correct
62 Correct 117 ms 94328 KB Output is correct
63 Correct 1179 ms 165428 KB Output is correct
64 Correct 867 ms 158020 KB Output is correct
65 Correct 1060 ms 167968 KB Output is correct
66 Correct 1146 ms 165060 KB Output is correct

Subtask #8
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 587 ms 155784 KB Output is correct
2 Correct 574 ms 154404 KB Output is correct
3 Correct 487 ms 148888 KB Output is correct
4 Correct 537 ms 152824 KB Output is correct
5 Correct 101 ms 94328 KB Output is correct
6 Correct 547 ms 150928 KB Output is correct
7 Correct 222 ms 113844 KB Output is correct
8 Correct 346 ms 129604 KB Output is correct
9 Correct 491 ms 148816 KB Output is correct
10 Correct 536 ms 152136 KB Output is correct
11 Correct 432 ms 143168 KB Output is correct
12 Correct 101 ms 94328 KB Output is correct
13 Correct 101 ms 94460 KB Output is correct
14 Correct 102 ms 94444 KB Output is correct
15 Correct 102 ms 94328 KB Output is correct
16 Correct 101 ms 94328 KB Output is correct
17 Correct 101 ms 94476 KB Output is correct
18 Correct 101 ms 94328 KB Output is correct
19 Correct 102 ms 94328 KB Output is correct
20 Correct 101 ms 94328 KB Output is correct
21 Correct 102 ms 94328 KB Output is correct
22 Correct 100 ms 94328 KB Output is correct
23 Correct 101 ms 94464 KB Output is correct
24 Correct 100 ms 94328 KB Output is correct
25 Correct 99 ms 94328 KB Output is correct
26 Correct 100 ms 94328 KB Output is correct
27 Correct 101 ms 94404 KB Output is correct
28 Correct 103 ms 94880 KB Output is correct
29 Correct 109 ms 94916 KB Output is correct
30 Correct 107 ms 94964 KB Output is correct
31 Correct 105 ms 94968 KB Output is correct
32 Correct 119 ms 94968 KB Output is correct
33 Correct 139 ms 94840 KB Output is correct
34 Correct 105 ms 94840 KB Output is correct
35 Correct 472 ms 147192 KB Output is correct
36 Correct 690 ms 144832 KB Output is correct
37 Correct 521 ms 150408 KB Output is correct
38 Correct 563 ms 150252 KB Output is correct
39 Correct 654 ms 147756 KB Output is correct
40 Correct 456 ms 146624 KB Output is correct
41 Correct 936 ms 150880 KB Output is correct
42 Correct 219 ms 111760 KB Output is correct
43 Correct 365 ms 127628 KB Output is correct
44 Correct 744 ms 147736 KB Output is correct
45 Correct 813 ms 149612 KB Output is correct
46 Correct 916 ms 144460 KB Output is correct
47 Correct 875 ms 144444 KB Output is correct
48 Correct 643 ms 153264 KB Output is correct
49 Correct 650 ms 153312 KB Output is correct
50 Correct 569 ms 155604 KB Output is correct
51 Correct 567 ms 155772 KB Output is correct
52 Correct 100 ms 94328 KB Output is correct
53 Correct 977 ms 153568 KB Output is correct
54 Correct 775 ms 150500 KB Output is correct
55 Correct 797 ms 152512 KB Output is correct
56 Correct 895 ms 147488 KB Output is correct
57 Correct 2910 ms 345948 KB Output is correct
58 Correct 2739 ms 347896 KB Output is correct
59 Correct 2644 ms 362808 KB Output is correct
60 Correct 2515 ms 360340 KB Output is correct
61 Correct 5856 ms 347072 KB Output is correct
62 Correct 3997 ms 327940 KB Output is correct
63 Correct 4149 ms 327456 KB Output is correct
64 Correct 5408 ms 336888 KB Output is correct
65 Correct 654 ms 165484 KB Output is correct
66 Correct 839 ms 179620 KB Output is correct
67 Correct 762 ms 180968 KB Output is correct
68 Correct 673 ms 169264 KB Output is correct
69 Correct 946 ms 150056 KB Output is correct
70 Correct 117 ms 94328 KB Output is correct
71 Correct 1179 ms 165428 KB Output is correct
72 Correct 867 ms 158020 KB Output is correct
73 Correct 1060 ms 167968 KB Output is correct
74 Correct 1146 ms 165060 KB Output is correct
75 Correct 3193 ms 453784 KB Output is correct
76 Correct 3980 ms 509404 KB Output is correct
77 Correct 3573 ms 502360 KB Output is correct
78 Correct 3042 ms 439548 KB Output is correct
79 Correct 7426 ms 425516 KB Output is correct
80 Correct 4747 ms 369924 KB Output is correct
81 Correct 5575 ms 383416 KB Output is correct
82 Correct 6865 ms 401972 KB Output is correct
83 Correct 7108 ms 415396 KB Output is correct