oj.uz

답안 #157268

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
157268 2019-10-10T09:44:11 Z atoiz Two Dishes (JOI19_dishes) C++14
100 / 100
 7024 ms 227088 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <numeric>
#include <tuple>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
#include <queue>
#include <ios>
#include <iomanip>
#include <random>
#include <chrono>

using namespace std;
using ll = long long;

#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORA(i, a) for (auto &i : a)
#define FORB(i, a, b) for (int i = a; i >= b; --i)
#define SZ(a) ((int) a.size());
#define ALL(a) begin(a), end(a)

const int MAXN = 1000007;
const ll INF = 1e16;
int N, M;
ll A[MAXN], B[MAXN], S[MAXN], T[MAXN], P[MAXN], Q[MAXN];
vector<int> ids[MAXN];
//
// ll lazy[MAXN << 2], tree[MAXN << 2];
//
// void push(int root, int lo, int hi)
// {
//     if (lo < hi) {
//         tree[root << 1] = max(tree[root], tree[root << 1] + lazy[root]);
//         tree[root << 1 | 1] = max(tree[root], tree[root << 1 | 1] + lazy[root]);
//         lazy[root << 1] += lazy[root];
//         lazy[root << 1 | 1] += lazy[root];
//     } else tree[root] = -INF;
//     lazy[root] = 0;
// }
//
// void add(int l, int r, ll x, int root = 1, int lo = 0, int hi = M)
// {
//     // FOR(i, l, r) tree[i] += x;
//     // return;
//     if (r < lo || hi < l) return;
//     push(root, lo, hi);
//     if (l <= lo && hi <= r) {
//         lazy[root] += x;
//         tree[root] += x;
//         return;
//     }
//
//     int mid = (lo + hi) >> 1;
//     add(l, r, x, root << 1, lo, mid);
//     add(l, r, x, root << 1 | 1, mid + 1, hi);
// }
//
// void upd(int l, int r, ll x, int root = 1, int lo = 0, int hi = M)
// {
//     // FOR(i, l, r) tree[i] = max(tree[i], x);
//     // return;
//     if (r < lo || hi < l) return;
//     push(root, lo, hi);
//     if (l <= lo && hi <= r) {
//         tree[root] = max(tree[root], x);
//         return;
//     }
//
//     int mid = (lo + hi) >> 1;
//     upd(l, r, x, root << 1, lo, mid);
//     upd(l, r, x, root << 1 | 1, mid + 1, hi);
// }
//
// ll get(int id, int root = 1, int lo = 0, int hi = M)
// {
//     // return tree[id];
//     push(root, lo, hi);
//     if (lo == hi) return tree[root];
//
//     int mid = (lo + hi) >> 1;
//     if (id <= mid) return max(tree[root], get(id, root << 1, lo, mid));
//     return max(tree[root], get(id, root << 1 | 1, mid + 1, hi));
// }

ll cur_max[MAXN << 2], lazy[MAXN << 2], tree[MAXN << 2];
void push(int root, int lo, int hi)
{
    if (lo < hi) {
        tree[root << 1] = max(tree[root << 1] + lazy[root], tree[root]);
        tree[root << 1 | 1] = max(tree[root << 1 | 1] + lazy[root], tree[root]);
        cur_max[root << 1] = max(cur_max[root << 1] + lazy[root], tree[root << 1]);
        cur_max[root << 1 | 1] = max(cur_max[root << 1 | 1] + lazy[root], tree[root << 1 | 1]);
        lazy[root << 1] += lazy[root];
        lazy[root << 1 | 1] += lazy[root];
    }
    tree[root] = -INF;
    lazy[root] = 0;
}

void add(int l, int r, ll x, int root = 1, int lo = 0, int hi = M)
{
    // if (root == 1) cerr << "Add " << l << ' ' << r << ' ' << x << endl;
    if (r < lo || hi < l) return;
    push(root, lo, hi);
    if (l <= lo && hi <= r) {
        cur_max[root] += x;
        lazy[root] += x;
        tree[root] += x;
        return;
    }

    int mid = (lo + hi) >> 1;
    add(l, r, x, root << 1, lo, mid);
    add(l, r, x, root << 1 | 1, mid + 1, hi);
    cur_max[root] = max(tree[root], max(cur_max[root << 1], cur_max[root << 1 | 1]));
}

void upd(int l, int r, ll x, int root = 1, int lo = 0, int hi = M)
{
    // if (root == 1) cerr << "Upd " << l << ' ' << r << ' ' << x << endl;
    if (r < lo || hi < l) return;
    push(root, lo, hi);
    if (l <= lo && hi <= r) {
        tree[root] = max(tree[root], x);
        cur_max[root] = max(cur_max[root], x);
        return;
    }

    int mid = (lo + hi) >> 1;
    upd(l, r, x, root << 1, lo, mid);
    upd(l, r, x, root << 1 | 1, mid + 1, hi);
    cur_max[root] = max(tree[root], max(cur_max[root << 1], cur_max[root << 1 | 1]));
}

ll get(int l, int r, int root = 1, int lo = 0, int hi = M)
{
    ll ans = -INF;
    if (r < lo || hi < l) return ans;
    push(root, lo, hi);
    if (l <= lo && hi <= r) return cur_max[root];

    int mid = (lo + hi) >> 1;
    ans = max(ans, get(l, r, root << 1, lo, mid));
    ans = max(ans, get(l, r, root << 1 | 1, mid + 1, hi));
    // if (root == 1) cerr << "Get " << l << ' ' << r << ": " << ans << endl;
    return ans;
}

ll read()
{
    ll ans = 0; bool pos = 1; register char ch = getchar();
    for (; ch == ' ' || ch == '\n'; ch = getchar());
    if (ch == '-') pos = 0, ch = getchar();
    for (; 47 < ch && ch < 58; ch = getchar()) ans = ans * 10 + ch - 48;
    return (pos ? ans : -ans);
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    N = read(), M = read();
    FOR(i, 1, N) A[i] = A[i - 1] + read(), S[i] = read(), P[i] = read(); A[N + 1] = INF;
    FOR(i, 1, M) B[i] = B[i - 1] + read(), T[i] = read(), Q[i] = read(); B[M + 1] = INF;

    FOR(j, 1, M) ids[upper_bound(A, A + N + 1, T[j] - B[j]) - A].push_back(j);

    FOR(i, 1, N + 1) {
        int j = upper_bound(B, B + M + 1, S[i] - A[i]) - B - 1;
        if (j >= 0) add(0, j, P[i]);

        vector<int> &vec = ids[i];
        FORA(id, vec) add(id, M, Q[id]);

        if (i <= N) {
            if (0 <= j && j < M) vec.insert(lower_bound(vec.begin(), vec.end(), j + 1), j + 1);
            FORA(id, vec) upd(id, M, get(0, id - 1));
        }
        // FOR(id, 1, M) tree[id] = max(tree[id], tree[id - 1]);
        // FOR(j, 0, M) {
        //     cerr << i << ' ' << j << ": " << get(j, j) << endl;
        // }
    }

    cout << get(M, M) << endl;
}

Compilation message

dishes.cpp: In function 'int main()':
dishes.cpp:28:22: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
 #define FOR(i, a, b) for (int i = a; i <= b; ++i)
                      ^
dishes.cpp:174:5: note: in expansion of macro 'FOR'
     FOR(i, 1, N) A[i] = A[i - 1] + read(), S[i] = read(), P[i] = read(); A[N + 1] = INF;
     ^~~
dishes.cpp:174:74: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     FOR(i, 1, N) A[i] = A[i - 1] + read(), S[i] = read(), P[i] = read(); A[N + 1] = INF;
                                                                          ^
dishes.cpp:28:22: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
 #define FOR(i, a, b) for (int i = a; i <= b; ++i)
                      ^
dishes.cpp:175:5: note: in expansion of macro 'FOR'
     FOR(i, 1, M) B[i] = B[i - 1] + read(), T[i] = read(), Q[i] = read(); B[M + 1] = INF;
     ^~~
dishes.cpp:175:74: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     FOR(i, 1, M) B[i] = B[i - 1] + read(), T[i] = read(), Q[i] = read(); B[M + 1] = INF;
                                                                          ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 704 ms 53144 KB Output is correct
2 Correct 709 ms 54020 KB Output is correct
3 Correct 350 ms 49508 KB Output is correct
4 Correct 562 ms 47872 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 632 ms 52984 KB Output is correct
7 Correct 220 ms 45556 KB Output is correct
8 Correct 137 ms 32092 KB Output is correct
9 Correct 359 ms 49712 KB Output is correct
10 Correct 659 ms 55288 KB Output is correct
11 Correct 266 ms 49988 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23928 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 24 ms 23928 KB Output is correct
4 Correct 26 ms 23932 KB Output is correct
5 Correct 24 ms 23928 KB Output is correct
6 Correct 29 ms 23900 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 24 ms 23880 KB Output is correct
9 Correct 24 ms 23928 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 24 ms 23928 KB Output is correct
12 Correct 24 ms 23928 KB Output is correct
13 Correct 24 ms 23928 KB Output is correct
14 Correct 26 ms 23964 KB Output is correct
15 Correct 24 ms 23928 KB Output is correct
16 Correct 29 ms 23928 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23928 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 24 ms 23928 KB Output is correct
4 Correct 26 ms 23932 KB Output is correct
5 Correct 24 ms 23928 KB Output is correct
6 Correct 29 ms 23900 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 24 ms 23880 KB Output is correct
9 Correct 24 ms 23928 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 24 ms 23928 KB Output is correct
12 Correct 24 ms 23928 KB Output is correct
13 Correct 24 ms 23928 KB Output is correct
14 Correct 26 ms 23964 KB Output is correct
15 Correct 24 ms 23928 KB Output is correct
16 Correct 29 ms 23928 KB Output is correct
17 Correct 27 ms 24244 KB Output is correct
18 Correct 27 ms 24184 KB Output is correct
19 Correct 29 ms 24184 KB Output is correct
20 Correct 28 ms 24184 KB Output is correct
21 Correct 29 ms 24312 KB Output is correct
22 Correct 28 ms 24152 KB Output is correct
23 Correct 33 ms 24172 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23928 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 24 ms 23928 KB Output is correct
4 Correct 26 ms 23932 KB Output is correct
5 Correct 24 ms 23928 KB Output is correct
6 Correct 29 ms 23900 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 24 ms 23880 KB Output is correct
9 Correct 24 ms 23928 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 24 ms 23928 KB Output is correct
12 Correct 24 ms 23928 KB Output is correct
13 Correct 24 ms 23928 KB Output is correct
14 Correct 26 ms 23964 KB Output is correct
15 Correct 24 ms 23928 KB Output is correct
16 Correct 29 ms 23928 KB Output is correct
17 Correct 27 ms 24244 KB Output is correct
18 Correct 27 ms 24184 KB Output is correct
19 Correct 29 ms 24184 KB Output is correct
20 Correct 28 ms 24184 KB Output is correct
21 Correct 29 ms 24312 KB Output is correct
22 Correct 28 ms 24152 KB Output is correct
23 Correct 33 ms 24172 KB Output is correct
24 Correct 549 ms 55708 KB Output is correct
25 Correct 456 ms 49644 KB Output is correct
26 Correct 512 ms 55848 KB Output is correct
27 Correct 475 ms 55008 KB Output is correct
28 Correct 484 ms 51784 KB Output is correct
29 Correct 323 ms 49392 KB Output is correct
30 Correct 1025 ms 55064 KB Output is correct
31 Correct 285 ms 47052 KB Output is correct
32 Correct 128 ms 37068 KB Output is correct
33 Correct 607 ms 53256 KB Output is correct
34 Correct 857 ms 53860 KB Output is correct
35 Correct 947 ms 56252 KB Output is correct
36 Correct 889 ms 56164 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23928 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 24 ms 23928 KB Output is correct
4 Correct 26 ms 23932 KB Output is correct
5 Correct 24 ms 23928 KB Output is correct
6 Correct 29 ms 23900 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 24 ms 23880 KB Output is correct
9 Correct 24 ms 23928 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 24 ms 23928 KB Output is correct
12 Correct 24 ms 23928 KB Output is correct
13 Correct 24 ms 23928 KB Output is correct
14 Correct 26 ms 23964 KB Output is correct
15 Correct 24 ms 23928 KB Output is correct
16 Correct 29 ms 23928 KB Output is correct
17 Correct 27 ms 24244 KB Output is correct
18 Correct 27 ms 24184 KB Output is correct
19 Correct 29 ms 24184 KB Output is correct
20 Correct 28 ms 24184 KB Output is correct
21 Correct 29 ms 24312 KB Output is correct
22 Correct 28 ms 24152 KB Output is correct
23 Correct 33 ms 24172 KB Output is correct
24 Correct 549 ms 55708 KB Output is correct
25 Correct 456 ms 49644 KB Output is correct
26 Correct 512 ms 55848 KB Output is correct
27 Correct 475 ms 55008 KB Output is correct
28 Correct 484 ms 51784 KB Output is correct
29 Correct 323 ms 49392 KB Output is correct
30 Correct 1025 ms 55064 KB Output is correct
31 Correct 285 ms 47052 KB Output is correct
32 Correct 128 ms 37068 KB Output is correct
33 Correct 607 ms 53256 KB Output is correct
34 Correct 857 ms 53860 KB Output is correct
35 Correct 947 ms 56252 KB Output is correct
36 Correct 889 ms 56164 KB Output is correct
37 Correct 552 ms 55328 KB Output is correct
38 Correct 514 ms 54572 KB Output is correct
39 Correct 724 ms 54444 KB Output is correct
40 Correct 719 ms 54212 KB Output is correct
41 Correct 24 ms 23928 KB Output is correct
42 Correct 1038 ms 54620 KB Output is correct
43 Correct 650 ms 52444 KB Output is correct
44 Correct 857 ms 53136 KB Output is correct
45 Correct 981 ms 54548 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23928 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 24 ms 23928 KB Output is correct
4 Correct 26 ms 23932 KB Output is correct
5 Correct 24 ms 23928 KB Output is correct
6 Correct 29 ms 23900 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 24 ms 23880 KB Output is correct
9 Correct 24 ms 23928 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 24 ms 23928 KB Output is correct
12 Correct 24 ms 23928 KB Output is correct
13 Correct 24 ms 23928 KB Output is correct
14 Correct 26 ms 23964 KB Output is correct
15 Correct 24 ms 23928 KB Output is correct
16 Correct 29 ms 23928 KB Output is correct
17 Correct 27 ms 24244 KB Output is correct
18 Correct 27 ms 24184 KB Output is correct
19 Correct 29 ms 24184 KB Output is correct
20 Correct 28 ms 24184 KB Output is correct
21 Correct 29 ms 24312 KB Output is correct
22 Correct 28 ms 24152 KB Output is correct
23 Correct 33 ms 24172 KB Output is correct
24 Correct 549 ms 55708 KB Output is correct
25 Correct 456 ms 49644 KB Output is correct
26 Correct 512 ms 55848 KB Output is correct
27 Correct 475 ms 55008 KB Output is correct
28 Correct 484 ms 51784 KB Output is correct
29 Correct 323 ms 49392 KB Output is correct
30 Correct 1025 ms 55064 KB Output is correct
31 Correct 285 ms 47052 KB Output is correct
32 Correct 128 ms 37068 KB Output is correct
33 Correct 607 ms 53256 KB Output is correct
34 Correct 857 ms 53860 KB Output is correct
35 Correct 947 ms 56252 KB Output is correct
36 Correct 889 ms 56164 KB Output is correct
37 Correct 552 ms 55328 KB Output is correct
38 Correct 514 ms 54572 KB Output is correct
39 Correct 724 ms 54444 KB Output is correct
40 Correct 719 ms 54212 KB Output is correct
41 Correct 24 ms 23928 KB Output is correct
42 Correct 1038 ms 54620 KB Output is correct
43 Correct 650 ms 52444 KB Output is correct
44 Correct 857 ms 53136 KB Output is correct
45 Correct 981 ms 54548 KB Output is correct
46 Correct 2895 ms 160916 KB Output is correct
47 Correct 2671 ms 159504 KB Output is correct
48 Correct 3852 ms 156648 KB Output is correct
49 Correct 3828 ms 156676 KB Output is correct
50 Correct 6581 ms 158088 KB Output is correct
51 Correct 3715 ms 146688 KB Output is correct
52 Correct 4736 ms 147624 KB Output is correct
53 Correct 5988 ms 154112 KB Output is correct

Subtask #7
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 704 ms 53144 KB Output is correct
2 Correct 709 ms 54020 KB Output is correct
3 Correct 350 ms 49508 KB Output is correct
4 Correct 562 ms 47872 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 632 ms 52984 KB Output is correct
7 Correct 220 ms 45556 KB Output is correct
8 Correct 137 ms 32092 KB Output is correct
9 Correct 359 ms 49712 KB Output is correct
10 Correct 659 ms 55288 KB Output is correct
11 Correct 266 ms 49988 KB Output is correct
12 Correct 24 ms 23928 KB Output is correct
13 Correct 24 ms 23928 KB Output is correct
14 Correct 24 ms 23928 KB Output is correct
15 Correct 26 ms 23932 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 29 ms 23900 KB Output is correct
18 Correct 24 ms 23928 KB Output is correct
19 Correct 24 ms 23880 KB Output is correct
20 Correct 24 ms 23928 KB Output is correct
21 Correct 24 ms 23928 KB Output is correct
22 Correct 24 ms 23928 KB Output is correct
23 Correct 24 ms 23928 KB Output is correct
24 Correct 24 ms 23928 KB Output is correct
25 Correct 26 ms 23964 KB Output is correct
26 Correct 24 ms 23928 KB Output is correct
27 Correct 29 ms 23928 KB Output is correct
28 Correct 27 ms 24244 KB Output is correct
29 Correct 27 ms 24184 KB Output is correct
30 Correct 29 ms 24184 KB Output is correct
31 Correct 28 ms 24184 KB Output is correct
32 Correct 29 ms 24312 KB Output is correct
33 Correct 28 ms 24152 KB Output is correct
34 Correct 33 ms 24172 KB Output is correct
35 Correct 549 ms 55708 KB Output is correct
36 Correct 456 ms 49644 KB Output is correct
37 Correct 512 ms 55848 KB Output is correct
38 Correct 475 ms 55008 KB Output is correct
39 Correct 484 ms 51784 KB Output is correct
40 Correct 323 ms 49392 KB Output is correct
41 Correct 1025 ms 55064 KB Output is correct
42 Correct 285 ms 47052 KB Output is correct
43 Correct 128 ms 37068 KB Output is correct
44 Correct 607 ms 53256 KB Output is correct
45 Correct 857 ms 53860 KB Output is correct
46 Correct 947 ms 56252 KB Output is correct
47 Correct 889 ms 56164 KB Output is correct
48 Correct 552 ms 55328 KB Output is correct
49 Correct 514 ms 54572 KB Output is correct
50 Correct 724 ms 54444 KB Output is correct
51 Correct 719 ms 54212 KB Output is correct
52 Correct 24 ms 23928 KB Output is correct
53 Correct 1038 ms 54620 KB Output is correct
54 Correct 650 ms 52444 KB Output is correct
55 Correct 857 ms 53136 KB Output is correct
56 Correct 981 ms 54548 KB Output is correct
57 Correct 562 ms 54756 KB Output is correct
58 Correct 536 ms 65948 KB Output is correct
59 Correct 783 ms 64024 KB Output is correct
60 Correct 755 ms 63864 KB Output is correct
61 Correct 1036 ms 62712 KB Output is correct
62 Correct 23 ms 23928 KB Output is correct
63 Correct 1057 ms 65824 KB Output is correct
64 Correct 650 ms 63564 KB Output is correct
65 Correct 863 ms 64628 KB Output is correct
66 Correct 946 ms 59436 KB Output is correct

Subtask #8
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 704 ms 53144 KB Output is correct
2 Correct 709 ms 54020 KB Output is correct
3 Correct 350 ms 49508 KB Output is correct
4 Correct 562 ms 47872 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 632 ms 52984 KB Output is correct
7 Correct 220 ms 45556 KB Output is correct
8 Correct 137 ms 32092 KB Output is correct
9 Correct 359 ms 49712 KB Output is correct
10 Correct 659 ms 55288 KB Output is correct
11 Correct 266 ms 49988 KB Output is correct
12 Correct 24 ms 23928 KB Output is correct
13 Correct 24 ms 23928 KB Output is correct
14 Correct 24 ms 23928 KB Output is correct
15 Correct 26 ms 23932 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 29 ms 23900 KB Output is correct
18 Correct 24 ms 23928 KB Output is correct
19 Correct 24 ms 23880 KB Output is correct
20 Correct 24 ms 23928 KB Output is correct
21 Correct 24 ms 23928 KB Output is correct
22 Correct 24 ms 23928 KB Output is correct
23 Correct 24 ms 23928 KB Output is correct
24 Correct 24 ms 23928 KB Output is correct
25 Correct 26 ms 23964 KB Output is correct
26 Correct 24 ms 23928 KB Output is correct
27 Correct 29 ms 23928 KB Output is correct
28 Correct 27 ms 24244 KB Output is correct
29 Correct 27 ms 24184 KB Output is correct
30 Correct 29 ms 24184 KB Output is correct
31 Correct 28 ms 24184 KB Output is correct
32 Correct 29 ms 24312 KB Output is correct
33 Correct 28 ms 24152 KB Output is correct
34 Correct 33 ms 24172 KB Output is correct
35 Correct 549 ms 55708 KB Output is correct
36 Correct 456 ms 49644 KB Output is correct
37 Correct 512 ms 55848 KB Output is correct
38 Correct 475 ms 55008 KB Output is correct
39 Correct 484 ms 51784 KB Output is correct
40 Correct 323 ms 49392 KB Output is correct
41 Correct 1025 ms 55064 KB Output is correct
42 Correct 285 ms 47052 KB Output is correct
43 Correct 128 ms 37068 KB Output is correct
44 Correct 607 ms 53256 KB Output is correct
45 Correct 857 ms 53860 KB Output is correct
46 Correct 947 ms 56252 KB Output is correct
47 Correct 889 ms 56164 KB Output is correct
48 Correct 552 ms 55328 KB Output is correct
49 Correct 514 ms 54572 KB Output is correct
50 Correct 724 ms 54444 KB Output is correct
51 Correct 719 ms 54212 KB Output is correct
52 Correct 24 ms 23928 KB Output is correct
53 Correct 1038 ms 54620 KB Output is correct
54 Correct 650 ms 52444 KB Output is correct
55 Correct 857 ms 53136 KB Output is correct
56 Correct 981 ms 54548 KB Output is correct
57 Correct 2895 ms 160916 KB Output is correct
58 Correct 2671 ms 159504 KB Output is correct
59 Correct 3852 ms 156648 KB Output is correct
60 Correct 3828 ms 156676 KB Output is correct
61 Correct 6581 ms 158088 KB Output is correct
62 Correct 3715 ms 146688 KB Output is correct
63 Correct 4736 ms 147624 KB Output is correct
64 Correct 5988 ms 154112 KB Output is correct
65 Correct 562 ms 54756 KB Output is correct
66 Correct 536 ms 65948 KB Output is correct
67 Correct 783 ms 64024 KB Output is correct
68 Correct 755 ms 63864 KB Output is correct
69 Correct 1036 ms 62712 KB Output is correct
70 Correct 23 ms 23928 KB Output is correct
71 Correct 1057 ms 65824 KB Output is correct
72 Correct 650 ms 63564 KB Output is correct
73 Correct 863 ms 64628 KB Output is correct
74 Correct 946 ms 59436 KB Output is correct
75 Correct 2943 ms 227088 KB Output is correct
76 Correct 2737 ms 222216 KB Output is correct
77 Correct 3890 ms 210204 KB Output is correct
78 Correct 3879 ms 210060 KB Output is correct
79 Correct 7024 ms 219732 KB Output is correct
80 Correct 3756 ms 208860 KB Output is correct
81 Correct 4854 ms 211280 KB Output is correct
82 Correct 6114 ms 189000 KB Output is correct
83 Correct 6150 ms 209516 KB Output is correct