oj.uz

Submission #697532

# Submission time Handle Problem Language Result Execution time Memory
697532 2023-02-10T09:25:23 Z piOOE Diversity (CEOI21_diversity) C++17
64 / 100
 7000 ms 14700 KB 
#pragma GCC optimize("O3, unroll-loops")

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

struct SmartFenwick {
    vector<ll> k, b;
    int n{};

    void init(int x) {
        n = x;
        k.resize(x + 1), b.resize(x + 1);
    }

    void addk(int i, ll v) {
        for (int x = i + 1; x <= n; x += x & -x) {
            k[x] += v;
        }
    }

    void addb(int i, ll v) {
        for (int x = i + 1; x <= n; x += x & -x) {
            b[x] += v;
        }
    }

    void rangeAdd(int l, int r, ll v) {
        addk(l, v);
        addk(r, -v);
        addb(l, (l - 1) * -v);
        addb(r, (r - 1) * v);
    }

    ll sum(int i) {
        ll K = 0, B = 0;

        for (int x = i + 1; x > 0; x -= x & -x) {
            K += k[x], B += b[x];
        }

        return B + K * i;
    }

    ll rangeSum(int l, int r) {
        return sum(r - 1) - sum(l - 1);
    }
} t[2][2]; // (left/right), (L/R)

struct Query {
    int l, r, block, idx;

    bool operator<(Query oth) const {
        if (oth.block != block) {
            return block < oth.block;
        }

        return (block & 1) ? r > oth.r : r < oth.r;
    }
};

constexpr int B = 1000;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, q;
    cin >> n >> q;

    vector<int> a(n);

    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    vector<int> yy = a;
    sort(yy.begin(), yy.end());
    yy.resize(unique(yy.begin(), yy.end()) - yy.begin());

    for (int &x: a) {
        x = lower_bound(yy.begin(), yy.end(), x) - yy.begin();
    }

    const int m = yy.size();

    vector<Query> queries(q);
    vector<ll> answer(q);

    for (int i = 0; i < q; ++i) {
        int l, r;
        cin >> l >> r;
        l -= 1;

        queries[i].l = l, queries[i].r = r, queries[i].block = l / B, queries[i].idx = i;
    }

    sort(queries.begin(), queries.end());

    vector<int> head(n + 1);

    for (int i = 1; i <= n; ++i) {
        head[i] = m;
    }


    vector<int> pos(m), cnt(m), ord(m);
    iota(pos.begin(), pos.end(), 0);
    ord = pos;

    int siz[2]{(m + 1) / 2, m / 2};

    t[0][0].init(siz[0]);
    t[0][1].init(siz[0]);
    t[1][0].init(siz[1]);
    t[1][1].init(siz[1]);

    ll ans = 0;

    int len = 0;

    auto eval = [&](int i) {
        return 1LL * cnt[i] * (len - cnt[i]) + 1LL * (cnt[i] + 1) * cnt[i] / 2;
    };

    auto increase = [&](int i) {
        ans += len;

        len += 1;

        ans -= eval(i);

        int p = pos[i];
        int tail = head[cnt[i] + 1] - 1;

        if (p != tail) {
            int id = ord[tail];
            pos[id] = p;
            ord[p] = id;
            pos[i] = tail;
            ord[tail] = i;
            p = tail;
        }

        int side = p % 2;
        int s = p / 2;

        ans += t[side][side ^ 1].rangeSum(s + 1, siz[side]);
        t[side][side].rangeAdd(s + 1, siz[side], 1);

        t[side][side ^ 1].rangeAdd(0, s, 1);
        ans += t[side][side].rangeSum(0, s);

        ans += t[side ^ 1][side ^ 1].rangeSum(0, siz[side ^ 1]);
        t[side ^ 1][side].rangeAdd(0, siz[side ^ 1], 1);

        cnt[i] += 1;
        head[cnt[i]] = p;

        ans += eval(i);
    };

    auto decrease = [&](int i) {
        ans -= len;

        len -= 1;

        ans -= eval(i);

        int p = pos[i];
        int start = head[cnt[i]];

        if (p != start) {
            int id = ord[start];
            pos[id] = p;
            ord[p] = id;
            pos[i] = start;
            ord[start] = i;
            p = start;
        }

        int side = p % 2;
        int s = p / 2;

        ans -= t[side][side ^ 1].rangeSum(s + 1, siz[side]);
        t[side][side].rangeAdd(s + 1, siz[side], -1);

        t[side][side ^ 1].rangeAdd(0, s, -1);
        ans -= t[side][side].rangeSum(0, s);

        ans -= t[side ^ 1][side ^ 1].rangeSum(0, siz[side ^ 1]);
        t[side ^ 1][side].rangeAdd(0, siz[side ^ 1], -1);

        head[cnt[i]] = p + 1;
        cnt[i] -= 1;

        ans += eval(i);
    };

    int lx = 0, rx = 0;

    for (auto [l, r, bl, i] : queries) {
        while (rx < r) {
            increase(a[rx++]);
        }

        while (lx > l) {
            increase(a[--lx]);
        }

        while (lx < l) {
            decrease(a[lx++]);
        }

        while (rx > r) {
            decrease(a[--rx]);
        }

        answer[i] = ans;
    }

    for (int i = 0; i < q; ++i) {
        cout << answer[i] << '\n';
    }

    return 0;
}

Compilation message

diversity.cpp:1:40: warning: bad option '-f unroll-loops' to pragma 'optimize' [-Wpragmas]
    1 | #pragma GCC optimize("O3, unroll-loops")
      |                                        ^
diversity.cpp:12:20: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   12 |     void init(int x) {
      |                    ^
diversity.cpp:17:26: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   17 |     void addk(int i, ll v) {
      |                          ^
diversity.cpp:23:26: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   23 |     void addb(int i, ll v) {
      |                          ^
diversity.cpp:29:37: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   29 |     void rangeAdd(int l, int r, ll v) {
      |                                     ^
diversity.cpp:36:17: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   36 |     ll sum(int i) {
      |                 ^
diversity.cpp:46:29: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   46 |     ll rangeSum(int l, int r) {
      |                             ^
diversity.cpp:54:31: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   54 |     bool operator<(Query oth) const {
      |                               ^~~~~
diversity.cpp:65:10: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   65 | int main() {
      |          ^
diversity.cpp: In function 'int main()':
diversity.cpp:123:26: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
  123 |     auto eval = [&](int i) {
      |                          ^
diversity.cpp:127:30: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
  127 |     auto increase = [&](int i) {
      |                              ^
diversity.cpp:164:30: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
  164 |     auto decrease = [&](int i) {
      |                              ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 15 ms 1420 KB Output is correct
5 Correct 28 ms 2668 KB Output is correct
6 Correct 44 ms 3816 KB Output is correct
7 Correct 38 ms 3804 KB Output is correct
8 Correct 42 ms 3828 KB Output is correct
9 Correct 42 ms 3836 KB Output is correct
10 Correct 41 ms 3836 KB Output is correct
11 Correct 42 ms 3816 KB Output is correct
12 Correct 43 ms 3816 KB Output is correct
13 Correct 45 ms 3816 KB Output is correct
14 Correct 50 ms 3796 KB Output is correct
15 Correct 42 ms 3840 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 15 ms 1420 KB Output is correct
5 Correct 28 ms 2668 KB Output is correct
6 Correct 44 ms 3816 KB Output is correct
7 Correct 38 ms 3804 KB Output is correct
8 Correct 42 ms 3828 KB Output is correct
9 Correct 42 ms 3836 KB Output is correct
10 Correct 41 ms 3836 KB Output is correct
11 Correct 42 ms 3816 KB Output is correct
12 Correct 43 ms 3816 KB Output is correct
13 Correct 45 ms 3816 KB Output is correct
14 Correct 50 ms 3796 KB Output is correct
15 Correct 42 ms 3840 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 15 ms 1496 KB Output is correct
20 Correct 34 ms 2644 KB Output is correct
21 Correct 47 ms 3816 KB Output is correct
22 Correct 53 ms 3788 KB Output is correct
23 Correct 53 ms 3808 KB Output is correct
24 Correct 51 ms 3820 KB Output is correct
25 Correct 50 ms 3832 KB Output is correct
26 Correct 50 ms 3788 KB Output is correct
27 Correct 49 ms 3812 KB Output is correct
28 Correct 47 ms 3812 KB Output is correct
29 Correct 49 ms 3788 KB Output is correct
30 Correct 50 ms 3788 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 15 ms 1420 KB Output is correct
5 Correct 28 ms 2668 KB Output is correct
6 Correct 44 ms 3816 KB Output is correct
7 Correct 38 ms 3804 KB Output is correct
8 Correct 42 ms 3828 KB Output is correct
9 Correct 42 ms 3836 KB Output is correct
10 Correct 41 ms 3836 KB Output is correct
11 Correct 42 ms 3816 KB Output is correct
12 Correct 43 ms 3816 KB Output is correct
13 Correct 45 ms 3816 KB Output is correct
14 Correct 50 ms 3796 KB Output is correct
15 Correct 42 ms 3840 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 15 ms 1496 KB Output is correct
20 Correct 34 ms 2644 KB Output is correct
21 Correct 47 ms 3816 KB Output is correct
22 Correct 53 ms 3788 KB Output is correct
23 Correct 53 ms 3808 KB Output is correct
24 Correct 51 ms 3820 KB Output is correct
25 Correct 50 ms 3832 KB Output is correct
26 Correct 50 ms 3788 KB Output is correct
27 Correct 49 ms 3812 KB Output is correct
28 Correct 47 ms 3812 KB Output is correct
29 Correct 49 ms 3788 KB Output is correct
30 Correct 50 ms 3788 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 4 ms 340 KB Output is correct
36 Correct 3 ms 468 KB Output is correct
37 Correct 14 ms 852 KB Output is correct
38 Correct 14 ms 852 KB Output is correct
39 Correct 27 ms 1496 KB Output is correct
40 Correct 53 ms 2664 KB Output is correct
41 Correct 81 ms 3880 KB Output is correct
42 Correct 91 ms 3816 KB Output is correct
43 Correct 83 ms 3808 KB Output is correct
44 Correct 80 ms 3800 KB Output is correct
45 Correct 79 ms 3820 KB Output is correct
46 Correct 81 ms 3884 KB Output is correct
47 Correct 78 ms 3884 KB Output is correct
48 Correct 83 ms 3808 KB Output is correct
49 Correct 84 ms 3808 KB Output is correct
50 Correct 80 ms 3880 KB Output is correct
51 Correct 79 ms 3876 KB Output is correct
52 Correct 80 ms 3816 KB Output is correct
53 Correct 85 ms 3880 KB Output is correct
54 Correct 82 ms 3820 KB Output is correct
55 Correct 82 ms 3932 KB Output is correct
56 Correct 79 ms 3824 KB Output is correct
57 Correct 80 ms 3880 KB Output is correct
58 Correct 80 ms 3808 KB Output is correct
59 Correct 103 ms 3876 KB Output is correct
60 Correct 92 ms 3812 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 15 ms 1420 KB Output is correct
15 Correct 28 ms 2668 KB Output is correct
16 Correct 44 ms 3816 KB Output is correct
17 Correct 38 ms 3804 KB Output is correct
18 Correct 42 ms 3828 KB Output is correct
19 Correct 42 ms 3836 KB Output is correct
20 Correct 41 ms 3836 KB Output is correct
21 Correct 42 ms 3816 KB Output is correct
22 Correct 43 ms 3816 KB Output is correct
23 Correct 45 ms 3816 KB Output is correct
24 Correct 50 ms 3796 KB Output is correct
25 Correct 42 ms 3840 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 15 ms 1496 KB Output is correct
30 Correct 34 ms 2644 KB Output is correct
31 Correct 47 ms 3816 KB Output is correct
32 Correct 53 ms 3788 KB Output is correct
33 Correct 53 ms 3808 KB Output is correct
34 Correct 51 ms 3820 KB Output is correct
35 Correct 50 ms 3832 KB Output is correct
36 Correct 50 ms 3788 KB Output is correct
37 Correct 49 ms 3812 KB Output is correct
38 Correct 47 ms 3812 KB Output is correct
39 Correct 49 ms 3788 KB Output is correct
40 Correct 50 ms 3788 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 2 ms 340 KB Output is correct
45 Correct 4 ms 340 KB Output is correct
46 Correct 3 ms 468 KB Output is correct
47 Correct 14 ms 852 KB Output is correct
48 Correct 14 ms 852 KB Output is correct
49 Correct 27 ms 1496 KB Output is correct
50 Correct 53 ms 2664 KB Output is correct
51 Correct 81 ms 3880 KB Output is correct
52 Correct 91 ms 3816 KB Output is correct
53 Correct 83 ms 3808 KB Output is correct
54 Correct 80 ms 3800 KB Output is correct
55 Correct 79 ms 3820 KB Output is correct
56 Correct 81 ms 3884 KB Output is correct
57 Correct 78 ms 3884 KB Output is correct
58 Correct 83 ms 3808 KB Output is correct
59 Correct 84 ms 3808 KB Output is correct
60 Correct 80 ms 3880 KB Output is correct
61 Correct 79 ms 3876 KB Output is correct
62 Correct 80 ms 3816 KB Output is correct
63 Correct 85 ms 3880 KB Output is correct
64 Correct 82 ms 3820 KB Output is correct
65 Correct 82 ms 3932 KB Output is correct
66 Correct 79 ms 3824 KB Output is correct
67 Correct 80 ms 3880 KB Output is correct
68 Correct 80 ms 3808 KB Output is correct
69 Correct 103 ms 3876 KB Output is correct
70 Correct 92 ms 3812 KB Output is correct
71 Correct 17 ms 1012 KB Output is correct
72 Correct 17 ms 976 KB Output is correct
73 Correct 20 ms 980 KB Output is correct
74 Correct 21 ms 980 KB Output is correct
75 Correct 21 ms 912 KB Output is correct
76 Correct 40 ms 1640 KB Output is correct
77 Correct 40 ms 1624 KB Output is correct
78 Correct 34 ms 1704 KB Output is correct
79 Correct 32 ms 1620 KB Output is correct
80 Correct 32 ms 1620 KB Output is correct
81 Correct 69 ms 3036 KB Output is correct
82 Correct 106 ms 3032 KB Output is correct
83 Correct 83 ms 3104 KB Output is correct
84 Correct 78 ms 3020 KB Output is correct
85 Correct 82 ms 3032 KB Output is correct
86 Correct 78 ms 3432 KB Output is correct
87 Correct 77 ms 3420 KB Output is correct
88 Correct 85 ms 3536 KB Output is correct
89 Correct 83 ms 3416 KB Output is correct
90 Correct 102 ms 3420 KB Output is correct
91 Correct 192 ms 8156 KB Output is correct
92 Correct 188 ms 8052 KB Output is correct
93 Correct 219 ms 8040 KB Output is correct
94 Correct 202 ms 8152 KB Output is correct
95 Correct 189 ms 8152 KB Output is correct
96 Correct 270 ms 12476 KB Output is correct
97 Correct 243 ms 12476 KB Output is correct
98 Correct 235 ms 12464 KB Output is correct
99 Correct 285 ms 12384 KB Output is correct
100 Correct 226 ms 12484 KB Output is correct
101 Correct 250 ms 12392 KB Output is correct
102 Correct 251 ms 12472 KB Output is correct
103 Correct 239 ms 12476 KB Output is correct
104 Correct 241 ms 12400 KB Output is correct
105 Correct 249 ms 12364 KB Output is correct
106 Correct 244 ms 14560 KB Output is correct
107 Correct 277 ms 14700 KB Output is correct
108 Correct 244 ms 14572 KB Output is correct
109 Correct 267 ms 14540 KB Output is correct
110 Correct 241 ms 14692 KB Output is correct
111 Correct 223 ms 14636 KB Output is correct
112 Correct 244 ms 14580 KB Output is correct
113 Correct 269 ms 14640 KB Output is correct
114 Correct 232 ms 14568 KB Output is correct
115 Correct 249 ms 14560 KB Output is correct

Subtask #6
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 15 ms 1420 KB Output is correct
15 Correct 28 ms 2668 KB Output is correct
16 Correct 44 ms 3816 KB Output is correct
17 Correct 38 ms 3804 KB Output is correct
18 Correct 42 ms 3828 KB Output is correct
19 Correct 42 ms 3836 KB Output is correct
20 Correct 41 ms 3836 KB Output is correct
21 Correct 42 ms 3816 KB Output is correct
22 Correct 43 ms 3816 KB Output is correct
23 Correct 45 ms 3816 KB Output is correct
24 Correct 50 ms 3796 KB Output is correct
25 Correct 42 ms 3840 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 15 ms 1496 KB Output is correct
30 Correct 34 ms 2644 KB Output is correct
31 Correct 47 ms 3816 KB Output is correct
32 Correct 53 ms 3788 KB Output is correct
33 Correct 53 ms 3808 KB Output is correct
34 Correct 51 ms 3820 KB Output is correct
35 Correct 50 ms 3832 KB Output is correct
36 Correct 50 ms 3788 KB Output is correct
37 Correct 49 ms 3812 KB Output is correct
38 Correct 47 ms 3812 KB Output is correct
39 Correct 49 ms 3788 KB Output is correct
40 Correct 50 ms 3788 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 2 ms 340 KB Output is correct
45 Correct 4 ms 340 KB Output is correct
46 Correct 3 ms 468 KB Output is correct
47 Correct 14 ms 852 KB Output is correct
48 Correct 14 ms 852 KB Output is correct
49 Correct 27 ms 1496 KB Output is correct
50 Correct 53 ms 2664 KB Output is correct
51 Correct 81 ms 3880 KB Output is correct
52 Correct 91 ms 3816 KB Output is correct
53 Correct 83 ms 3808 KB Output is correct
54 Correct 80 ms 3800 KB Output is correct
55 Correct 79 ms 3820 KB Output is correct
56 Correct 81 ms 3884 KB Output is correct
57 Correct 78 ms 3884 KB Output is correct
58 Correct 83 ms 3808 KB Output is correct
59 Correct 84 ms 3808 KB Output is correct
60 Correct 80 ms 3880 KB Output is correct
61 Correct 79 ms 3876 KB Output is correct
62 Correct 80 ms 3816 KB Output is correct
63 Correct 85 ms 3880 KB Output is correct
64 Correct 82 ms 3820 KB Output is correct
65 Correct 82 ms 3932 KB Output is correct
66 Correct 79 ms 3824 KB Output is correct
67 Correct 80 ms 3880 KB Output is correct
68 Correct 80 ms 3808 KB Output is correct
69 Correct 103 ms 3876 KB Output is correct
70 Correct 92 ms 3812 KB Output is correct
71 Correct 17 ms 1012 KB Output is correct
72 Correct 17 ms 976 KB Output is correct
73 Correct 20 ms 980 KB Output is correct
74 Correct 21 ms 980 KB Output is correct
75 Correct 21 ms 912 KB Output is correct
76 Correct 40 ms 1640 KB Output is correct
77 Correct 40 ms 1624 KB Output is correct
78 Correct 34 ms 1704 KB Output is correct
79 Correct 32 ms 1620 KB Output is correct
80 Correct 32 ms 1620 KB Output is correct
81 Correct 69 ms 3036 KB Output is correct
82 Correct 106 ms 3032 KB Output is correct
83 Correct 83 ms 3104 KB Output is correct
84 Correct 78 ms 3020 KB Output is correct
85 Correct 82 ms 3032 KB Output is correct
86 Correct 78 ms 3432 KB Output is correct
87 Correct 77 ms 3420 KB Output is correct
88 Correct 85 ms 3536 KB Output is correct
89 Correct 83 ms 3416 KB Output is correct
90 Correct 102 ms 3420 KB Output is correct
91 Correct 192 ms 8156 KB Output is correct
92 Correct 188 ms 8052 KB Output is correct
93 Correct 219 ms 8040 KB Output is correct
94 Correct 202 ms 8152 KB Output is correct
95 Correct 189 ms 8152 KB Output is correct
96 Correct 270 ms 12476 KB Output is correct
97 Correct 243 ms 12476 KB Output is correct
98 Correct 235 ms 12464 KB Output is correct
99 Correct 285 ms 12384 KB Output is correct
100 Correct 226 ms 12484 KB Output is correct
101 Correct 250 ms 12392 KB Output is correct
102 Correct 251 ms 12472 KB Output is correct
103 Correct 239 ms 12476 KB Output is correct
104 Correct 241 ms 12400 KB Output is correct
105 Correct 249 ms 12364 KB Output is correct
106 Correct 244 ms 14560 KB Output is correct
107 Correct 277 ms 14700 KB Output is correct
108 Correct 244 ms 14572 KB Output is correct
109 Correct 267 ms 14540 KB Output is correct
110 Correct 241 ms 14692 KB Output is correct
111 Correct 223 ms 14636 KB Output is correct
112 Correct 244 ms 14580 KB Output is correct
113 Correct 269 ms 14640 KB Output is correct
114 Correct 232 ms 14568 KB Output is correct
115 Correct 249 ms 14560 KB Output is correct
116 Correct 1055 ms 2000 KB Output is correct
117 Correct 1160 ms 2008 KB Output is correct
118 Correct 1319 ms 2596 KB Output is correct
119 Correct 1679 ms 2660 KB Output is correct
120 Correct 1841 ms 2656 KB Output is correct
121 Correct 2228 ms 3224 KB Output is correct
122 Correct 2419 ms 3268 KB Output is correct
123 Correct 3789 ms 4532 KB Output is correct
124 Correct 4688 ms 4700 KB Output is correct
125 Correct 5086 ms 4920 KB Output is correct
126 Correct 5427 ms 5532 KB Output is correct
127 Correct 5434 ms 5532 KB Output is correct
128 Correct 5390 ms 5536 KB Output is correct
129 Correct 5377 ms 5532 KB Output is correct
130 Correct 5610 ms 5532 KB Output is correct
131 Correct 6015 ms 5668 KB Output is correct
132 Correct 5794 ms 5676 KB Output is correct
133 Correct 5580 ms 5672 KB Output is correct
134 Correct 5652 ms 5676 KB Output is correct
135 Correct 5591 ms 5564 KB Output is correct
136 Correct 5602 ms 5672 KB Output is correct
137 Correct 5613 ms 5672 KB Output is correct
138 Correct 5586 ms 5668 KB Output is correct
139 Correct 5598 ms 5676 KB Output is correct
140 Correct 5670 ms 5672 KB Output is correct
141 Correct 6352 ms 5700 KB Output is correct
142 Correct 6267 ms 5704 KB Output is correct
143 Correct 6521 ms 5720 KB Output is correct
144 Correct 6417 ms 5696 KB Output is correct
145 Correct 6982 ms 5700 KB Output is correct
146 Execution timed out 7031 ms 5216 KB Time limit exceeded
147 Halted 0 ms 0 KB -