oj.uz

Submission #157526

# Submission time Handle Problem Language Result Execution time Memory
157526 2019-10-12T08:04:09 Z atoiz Two Dishes (JOI19_dishes) C++14
100 / 100
 6743 ms 191160 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(id - 1, 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:26: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     #define FOR(i, a, b) for (int i = a; i <= b; ++i)
                          ^
dishes.cpp:174:9: 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:78: 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:26: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     #define FOR(i, a, b) for (int i = a; i <= b; ++i)
                          ^
dishes.cpp:175:9: 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:78: 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

# Verdict Execution time Memory Grader output
1 Correct 710 ms 63784 KB Output is correct
2 Correct 698 ms 65000 KB Output is correct
3 Correct 372 ms 59884 KB Output is correct
4 Correct 553 ms 58696 KB Output is correct
5 Correct 29 ms 23928 KB Output is correct
6 Correct 646 ms 63356 KB Output is correct
7 Correct 219 ms 47536 KB Output is correct
8 Correct 137 ms 35532 KB Output is correct
9 Correct 366 ms 60860 KB Output is correct
10 Correct 640 ms 59220 KB Output is correct
11 Correct 268 ms 54252 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 23928 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 24 ms 24056 KB Output is correct
4 Correct 24 ms 23932 KB Output is correct
5 Correct 24 ms 23928 KB Output is correct
6 Correct 24 ms 23928 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 24 ms 23928 KB Output is correct
9 Correct 23 ms 23928 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 23 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 24 ms 23928 KB Output is correct
15 Correct 24 ms 23928 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 23928 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 24 ms 24056 KB Output is correct
4 Correct 24 ms 23932 KB Output is correct
5 Correct 24 ms 23928 KB Output is correct
6 Correct 24 ms 23928 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 24 ms 23928 KB Output is correct
9 Correct 23 ms 23928 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 23 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 24 ms 23928 KB Output is correct
15 Correct 24 ms 23928 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 28 ms 24264 KB Output is correct
18 Correct 28 ms 24296 KB Output is correct
19 Correct 29 ms 24184 KB Output is correct
20 Correct 31 ms 24184 KB Output is correct
21 Correct 29 ms 24184 KB Output is correct
22 Correct 32 ms 24184 KB Output is correct
23 Correct 28 ms 24184 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 23928 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 24 ms 24056 KB Output is correct
4 Correct 24 ms 23932 KB Output is correct
5 Correct 24 ms 23928 KB Output is correct
6 Correct 24 ms 23928 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 24 ms 23928 KB Output is correct
9 Correct 23 ms 23928 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 23 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 24 ms 23928 KB Output is correct
15 Correct 24 ms 23928 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 28 ms 24264 KB Output is correct
18 Correct 28 ms 24296 KB Output is correct
19 Correct 29 ms 24184 KB Output is correct
20 Correct 31 ms 24184 KB Output is correct
21 Correct 29 ms 24184 KB Output is correct
22 Correct 32 ms 24184 KB Output is correct
23 Correct 28 ms 24184 KB Output is correct
24 Correct 539 ms 63200 KB Output is correct
25 Correct 452 ms 57176 KB Output is correct
26 Correct 506 ms 63340 KB Output is correct
27 Correct 479 ms 62612 KB Output is correct
28 Correct 488 ms 59596 KB Output is correct
29 Correct 321 ms 57780 KB Output is correct
30 Correct 1000 ms 62576 KB Output is correct
31 Correct 283 ms 47152 KB Output is correct
32 Correct 127 ms 36984 KB Output is correct
33 Correct 615 ms 60612 KB Output is correct
34 Correct 849 ms 61568 KB Output is correct
35 Correct 1006 ms 56164 KB Output is correct
36 Correct 966 ms 56184 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 23928 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 24 ms 24056 KB Output is correct
4 Correct 24 ms 23932 KB Output is correct
5 Correct 24 ms 23928 KB Output is correct
6 Correct 24 ms 23928 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 24 ms 23928 KB Output is correct
9 Correct 23 ms 23928 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 23 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 24 ms 23928 KB Output is correct
15 Correct 24 ms 23928 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 28 ms 24264 KB Output is correct
18 Correct 28 ms 24296 KB Output is correct
19 Correct 29 ms 24184 KB Output is correct
20 Correct 31 ms 24184 KB Output is correct
21 Correct 29 ms 24184 KB Output is correct
22 Correct 32 ms 24184 KB Output is correct
23 Correct 28 ms 24184 KB Output is correct
24 Correct 539 ms 63200 KB Output is correct
25 Correct 452 ms 57176 KB Output is correct
26 Correct 506 ms 63340 KB Output is correct
27 Correct 479 ms 62612 KB Output is correct
28 Correct 488 ms 59596 KB Output is correct
29 Correct 321 ms 57780 KB Output is correct
30 Correct 1000 ms 62576 KB Output is correct
31 Correct 283 ms 47152 KB Output is correct
32 Correct 127 ms 36984 KB Output is correct
33 Correct 615 ms 60612 KB Output is correct
34 Correct 849 ms 61568 KB Output is correct
35 Correct 1006 ms 56164 KB Output is correct
36 Correct 966 ms 56184 KB Output is correct
37 Correct 546 ms 66380 KB Output is correct
38 Correct 507 ms 65632 KB Output is correct
39 Correct 695 ms 62872 KB Output is correct
40 Correct 694 ms 62880 KB Output is correct
41 Correct 24 ms 23928 KB Output is correct
42 Correct 1042 ms 65728 KB Output is correct
43 Correct 715 ms 63508 KB Output is correct
44 Correct 851 ms 64604 KB Output is correct
45 Correct 954 ms 59268 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 23928 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 24 ms 24056 KB Output is correct
4 Correct 24 ms 23932 KB Output is correct
5 Correct 24 ms 23928 KB Output is correct
6 Correct 24 ms 23928 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 24 ms 23928 KB Output is correct
9 Correct 23 ms 23928 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 23 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 24 ms 23928 KB Output is correct
15 Correct 24 ms 23928 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 28 ms 24264 KB Output is correct
18 Correct 28 ms 24296 KB Output is correct
19 Correct 29 ms 24184 KB Output is correct
20 Correct 31 ms 24184 KB Output is correct
21 Correct 29 ms 24184 KB Output is correct
22 Correct 32 ms 24184 KB Output is correct
23 Correct 28 ms 24184 KB Output is correct
24 Correct 539 ms 63200 KB Output is correct
25 Correct 452 ms 57176 KB Output is correct
26 Correct 506 ms 63340 KB Output is correct
27 Correct 479 ms 62612 KB Output is correct
28 Correct 488 ms 59596 KB Output is correct
29 Correct 321 ms 57780 KB Output is correct
30 Correct 1000 ms 62576 KB Output is correct
31 Correct 283 ms 47152 KB Output is correct
32 Correct 127 ms 36984 KB Output is correct
33 Correct 615 ms 60612 KB Output is correct
34 Correct 849 ms 61568 KB Output is correct
35 Correct 1006 ms 56164 KB Output is correct
36 Correct 966 ms 56184 KB Output is correct
37 Correct 546 ms 66380 KB Output is correct
38 Correct 507 ms 65632 KB Output is correct
39 Correct 695 ms 62872 KB Output is correct
40 Correct 694 ms 62880 KB Output is correct
41 Correct 24 ms 23928 KB Output is correct
42 Correct 1042 ms 65728 KB Output is correct
43 Correct 715 ms 63508 KB Output is correct
44 Correct 851 ms 64604 KB Output is correct
45 Correct 954 ms 59268 KB Output is correct
46 Correct 2835 ms 191160 KB Output is correct
47 Correct 2613 ms 184840 KB Output is correct
48 Correct 3708 ms 181480 KB Output is correct
49 Correct 3704 ms 181360 KB Output is correct
50 Correct 6743 ms 188984 KB Output is correct
51 Correct 3816 ms 176576 KB Output is correct
52 Correct 4760 ms 177612 KB Output is correct
53 Correct 5969 ms 171968 KB Output is correct

Subtask #7
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 710 ms 63784 KB Output is correct
2 Correct 698 ms 65000 KB Output is correct
3 Correct 372 ms 59884 KB Output is correct
4 Correct 553 ms 58696 KB Output is correct
5 Correct 29 ms 23928 KB Output is correct
6 Correct 646 ms 63356 KB Output is correct
7 Correct 219 ms 47536 KB Output is correct
8 Correct 137 ms 35532 KB Output is correct
9 Correct 366 ms 60860 KB Output is correct
10 Correct 640 ms 59220 KB Output is correct
11 Correct 268 ms 54252 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 24056 KB Output is correct
15 Correct 24 ms 23932 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 24 ms 23928 KB Output is correct
18 Correct 24 ms 23928 KB Output is correct
19 Correct 24 ms 23928 KB Output is correct
20 Correct 23 ms 23928 KB Output is correct
21 Correct 24 ms 23928 KB Output is correct
22 Correct 23 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 24 ms 23928 KB Output is correct
26 Correct 24 ms 23928 KB Output is correct
27 Correct 24 ms 23928 KB Output is correct
28 Correct 28 ms 24264 KB Output is correct
29 Correct 28 ms 24296 KB Output is correct
30 Correct 29 ms 24184 KB Output is correct
31 Correct 31 ms 24184 KB Output is correct
32 Correct 29 ms 24184 KB Output is correct
33 Correct 32 ms 24184 KB Output is correct
34 Correct 28 ms 24184 KB Output is correct
35 Correct 539 ms 63200 KB Output is correct
36 Correct 452 ms 57176 KB Output is correct
37 Correct 506 ms 63340 KB Output is correct
38 Correct 479 ms 62612 KB Output is correct
39 Correct 488 ms 59596 KB Output is correct
40 Correct 321 ms 57780 KB Output is correct
41 Correct 1000 ms 62576 KB Output is correct
42 Correct 283 ms 47152 KB Output is correct
43 Correct 127 ms 36984 KB Output is correct
44 Correct 615 ms 60612 KB Output is correct
45 Correct 849 ms 61568 KB Output is correct
46 Correct 1006 ms 56164 KB Output is correct
47 Correct 966 ms 56184 KB Output is correct
48 Correct 546 ms 66380 KB Output is correct
49 Correct 507 ms 65632 KB Output is correct
50 Correct 695 ms 62872 KB Output is correct
51 Correct 694 ms 62880 KB Output is correct
52 Correct 24 ms 23928 KB Output is correct
53 Correct 1042 ms 65728 KB Output is correct
54 Correct 715 ms 63508 KB Output is correct
55 Correct 851 ms 64604 KB Output is correct
56 Correct 954 ms 59268 KB Output is correct
57 Correct 557 ms 66732 KB Output is correct
58 Correct 519 ms 66104 KB Output is correct
59 Correct 712 ms 63992 KB Output is correct
60 Correct 711 ms 63780 KB Output is correct
61 Correct 1020 ms 62620 KB Output is correct
62 Correct 23 ms 23928 KB Output is correct
63 Correct 1047 ms 65936 KB Output is correct
64 Correct 642 ms 63512 KB Output is correct
65 Correct 873 ms 64664 KB Output is correct
66 Correct 926 ms 59524 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 710 ms 63784 KB Output is correct
2 Correct 698 ms 65000 KB Output is correct
3 Correct 372 ms 59884 KB Output is correct
4 Correct 553 ms 58696 KB Output is correct
5 Correct 29 ms 23928 KB Output is correct
6 Correct 646 ms 63356 KB Output is correct
7 Correct 219 ms 47536 KB Output is correct
8 Correct 137 ms 35532 KB Output is correct
9 Correct 366 ms 60860 KB Output is correct
10 Correct 640 ms 59220 KB Output is correct
11 Correct 268 ms 54252 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 24056 KB Output is correct
15 Correct 24 ms 23932 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 24 ms 23928 KB Output is correct
18 Correct 24 ms 23928 KB Output is correct
19 Correct 24 ms 23928 KB Output is correct
20 Correct 23 ms 23928 KB Output is correct
21 Correct 24 ms 23928 KB Output is correct
22 Correct 23 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 24 ms 23928 KB Output is correct
26 Correct 24 ms 23928 KB Output is correct
27 Correct 24 ms 23928 KB Output is correct
28 Correct 28 ms 24264 KB Output is correct
29 Correct 28 ms 24296 KB Output is correct
30 Correct 29 ms 24184 KB Output is correct
31 Correct 31 ms 24184 KB Output is correct
32 Correct 29 ms 24184 KB Output is correct
33 Correct 32 ms 24184 KB Output is correct
34 Correct 28 ms 24184 KB Output is correct
35 Correct 539 ms 63200 KB Output is correct
36 Correct 452 ms 57176 KB Output is correct
37 Correct 506 ms 63340 KB Output is correct
38 Correct 479 ms 62612 KB Output is correct
39 Correct 488 ms 59596 KB Output is correct
40 Correct 321 ms 57780 KB Output is correct
41 Correct 1000 ms 62576 KB Output is correct
42 Correct 283 ms 47152 KB Output is correct
43 Correct 127 ms 36984 KB Output is correct
44 Correct 615 ms 60612 KB Output is correct
45 Correct 849 ms 61568 KB Output is correct
46 Correct 1006 ms 56164 KB Output is correct
47 Correct 966 ms 56184 KB Output is correct
48 Correct 546 ms 66380 KB Output is correct
49 Correct 507 ms 65632 KB Output is correct
50 Correct 695 ms 62872 KB Output is correct
51 Correct 694 ms 62880 KB Output is correct
52 Correct 24 ms 23928 KB Output is correct
53 Correct 1042 ms 65728 KB Output is correct
54 Correct 715 ms 63508 KB Output is correct
55 Correct 851 ms 64604 KB Output is correct
56 Correct 954 ms 59268 KB Output is correct
57 Correct 2835 ms 191160 KB Output is correct
58 Correct 2613 ms 184840 KB Output is correct
59 Correct 3708 ms 181480 KB Output is correct
60 Correct 3704 ms 181360 KB Output is correct
61 Correct 6743 ms 188984 KB Output is correct
62 Correct 3816 ms 176576 KB Output is correct
63 Correct 4760 ms 177612 KB Output is correct
64 Correct 5969 ms 171968 KB Output is correct
65 Correct 557 ms 66732 KB Output is correct
66 Correct 519 ms 66104 KB Output is correct
67 Correct 712 ms 63992 KB Output is correct
68 Correct 711 ms 63780 KB Output is correct
69 Correct 1020 ms 62620 KB Output is correct
70 Correct 23 ms 23928 KB Output is correct
71 Correct 1047 ms 65936 KB Output is correct
72 Correct 642 ms 63512 KB Output is correct
73 Correct 873 ms 64664 KB Output is correct
74 Correct 926 ms 59524 KB Output is correct
75 Correct 2896 ms 190408 KB Output is correct
76 Correct 2676 ms 181132 KB Output is correct
77 Correct 3753 ms 179720 KB Output is correct
78 Correct 3785 ms 179668 KB Output is correct
79 Correct 6722 ms 185200 KB Output is correct
80 Correct 3672 ms 172364 KB Output is correct
81 Correct 4854 ms 175356 KB Output is correct
82 Correct 6064 ms 169664 KB Output is correct
83 Correct 6018 ms 177408 KB Output is correct