oj.uz

Submission #697547

# Submission time Handle Problem Language Result Execution time Memory
697547 2023-02-10T10:00:44 Z piOOE Diversity (CEOI21_diversity) C++17
64 / 100
 7000 ms 14692 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{};
    ll S = 0;

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

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

    inline void rangeAdd(int l, int r, ll v) {
        add(r, -v, (r - 1) * v);
        add(l, v, (l - 1) * -v);
//        if (l == 0) {
//        } else {
//            S += v;
//            add(l, v, (l - 1) * -v);
//        }
    }

    inline 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;
    }

    inline ll rangeSum(int l, int r) {
        return sum(r - 1) - sum(l - 1) + (r - l) * S;
    }
} 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 = 1400;

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 modify = [&](int i, int x) {
        ans += x * len;

        len += x;

        ans -= eval(i);

        int p = pos[i];
        int start = (x == -1 ? head[cnt[i]] : head[cnt[i] + 1] - 1);

        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 += x * t[side][side ^ 1].rangeSum(s + 1, siz[side]);
        t[side][side].rangeAdd(s + 1, siz[side], x);

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

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

        if (x == -1) {
            head[cnt[i]] = p + 1;
            cnt[i] -= 1;
        } else {
            cnt[i] += 1;
            head[cnt[i]] = p;
        }

        ans += eval(i);
    };

    int lx = 0, rx = 0;

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

        while (lx > l) {
            modify(a[--lx], 1);
        }

        while (lx < l) {
            modify(a[lx++], -1);
        }

        while (rx > r) {
            modify(a[--rx], -1);
        }

        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:13:20: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   13 |     void init(int x) {
      |                    ^
diversity.cpp:18:39: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   18 |     inline void add(int i, ll v, ll vv) {
      |                                       ^
diversity.cpp:25:44: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   25 |     inline void rangeAdd(int l, int r, ll v) {
      |                                            ^
diversity.cpp:35:24: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   35 |     inline ll sum(int i) {
      |                        ^
diversity.cpp:45:36: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   45 |     inline ll rangeSum(int l, int r) {
      |                                    ^
diversity.cpp:53:31: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   53 |     bool operator<(Query oth) const {
      |                               ^~~~~
diversity.cpp:64:10: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   64 | int main() {
      |          ^
diversity.cpp: In function 'int main()':
diversity.cpp:121:26: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
  121 |     auto eval = [&](int i) {
      |                          ^
diversity.cpp:125:35: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
  125 |     auto modify = [&](int i, int x) {
      |                                   ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 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 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 432 KB Output is correct
4 Correct 17 ms 1492 KB Output is correct
5 Correct 26 ms 2672 KB Output is correct
6 Correct 41 ms 3820 KB Output is correct
7 Correct 36 ms 3812 KB Output is correct
8 Correct 40 ms 3808 KB Output is correct
9 Correct 43 ms 3824 KB Output is correct
10 Correct 40 ms 3840 KB Output is correct
11 Correct 43 ms 3832 KB Output is correct
12 Correct 43 ms 3808 KB Output is correct
13 Correct 51 ms 3804 KB Output is correct
14 Correct 42 ms 3796 KB Output is correct
15 Correct 41 ms 3792 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 432 KB Output is correct
4 Correct 17 ms 1492 KB Output is correct
5 Correct 26 ms 2672 KB Output is correct
6 Correct 41 ms 3820 KB Output is correct
7 Correct 36 ms 3812 KB Output is correct
8 Correct 40 ms 3808 KB Output is correct
9 Correct 43 ms 3824 KB Output is correct
10 Correct 40 ms 3840 KB Output is correct
11 Correct 43 ms 3832 KB Output is correct
12 Correct 43 ms 3808 KB Output is correct
13 Correct 51 ms 3804 KB Output is correct
14 Correct 42 ms 3796 KB Output is correct
15 Correct 41 ms 3792 KB Output is correct
16 Correct 1 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 1436 KB Output is correct
20 Correct 32 ms 2652 KB Output is correct
21 Correct 45 ms 3788 KB Output is correct
22 Correct 56 ms 3812 KB Output is correct
23 Correct 47 ms 3816 KB Output is correct
24 Correct 50 ms 3836 KB Output is correct
25 Correct 48 ms 3796 KB Output is correct
26 Correct 48 ms 3812 KB Output is correct
27 Correct 48 ms 3808 KB Output is correct
28 Correct 46 ms 3812 KB Output is correct
29 Correct 51 ms 3788 KB Output is correct
30 Correct 52 ms 3948 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 432 KB Output is correct
4 Correct 17 ms 1492 KB Output is correct
5 Correct 26 ms 2672 KB Output is correct
6 Correct 41 ms 3820 KB Output is correct
7 Correct 36 ms 3812 KB Output is correct
8 Correct 40 ms 3808 KB Output is correct
9 Correct 43 ms 3824 KB Output is correct
10 Correct 40 ms 3840 KB Output is correct
11 Correct 43 ms 3832 KB Output is correct
12 Correct 43 ms 3808 KB Output is correct
13 Correct 51 ms 3804 KB Output is correct
14 Correct 42 ms 3796 KB Output is correct
15 Correct 41 ms 3792 KB Output is correct
16 Correct 1 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 1436 KB Output is correct
20 Correct 32 ms 2652 KB Output is correct
21 Correct 45 ms 3788 KB Output is correct
22 Correct 56 ms 3812 KB Output is correct
23 Correct 47 ms 3816 KB Output is correct
24 Correct 50 ms 3836 KB Output is correct
25 Correct 48 ms 3796 KB Output is correct
26 Correct 48 ms 3812 KB Output is correct
27 Correct 48 ms 3808 KB Output is correct
28 Correct 46 ms 3812 KB Output is correct
29 Correct 51 ms 3788 KB Output is correct
30 Correct 52 ms 3948 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 3 ms 340 KB Output is correct
35 Correct 3 ms 340 KB Output is correct
36 Correct 3 ms 468 KB Output is correct
37 Correct 12 ms 848 KB Output is correct
38 Correct 14 ms 904 KB Output is correct
39 Correct 25 ms 1492 KB Output is correct
40 Correct 56 ms 2644 KB Output is correct
41 Correct 78 ms 3884 KB Output is correct
42 Correct 75 ms 3808 KB Output is correct
43 Correct 75 ms 3936 KB Output is correct
44 Correct 74 ms 3812 KB Output is correct
45 Correct 77 ms 3880 KB Output is correct
46 Correct 79 ms 3788 KB Output is correct
47 Correct 75 ms 3876 KB Output is correct
48 Correct 81 ms 3872 KB Output is correct
49 Correct 77 ms 3824 KB Output is correct
50 Correct 75 ms 3944 KB Output is correct
51 Correct 75 ms 3872 KB Output is correct
52 Correct 78 ms 3932 KB Output is correct
53 Correct 77 ms 3788 KB Output is correct
54 Correct 85 ms 3812 KB Output is correct
55 Correct 77 ms 3796 KB Output is correct
56 Correct 74 ms 3788 KB Output is correct
57 Correct 75 ms 3876 KB Output is correct
58 Correct 73 ms 3816 KB Output is correct
59 Correct 89 ms 3812 KB Output is correct
60 Correct 80 ms 3788 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 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 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 3 ms 432 KB Output is correct
14 Correct 17 ms 1492 KB Output is correct
15 Correct 26 ms 2672 KB Output is correct
16 Correct 41 ms 3820 KB Output is correct
17 Correct 36 ms 3812 KB Output is correct
18 Correct 40 ms 3808 KB Output is correct
19 Correct 43 ms 3824 KB Output is correct
20 Correct 40 ms 3840 KB Output is correct
21 Correct 43 ms 3832 KB Output is correct
22 Correct 43 ms 3808 KB Output is correct
23 Correct 51 ms 3804 KB Output is correct
24 Correct 42 ms 3796 KB Output is correct
25 Correct 41 ms 3792 KB Output is correct
26 Correct 1 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 1436 KB Output is correct
30 Correct 32 ms 2652 KB Output is correct
31 Correct 45 ms 3788 KB Output is correct
32 Correct 56 ms 3812 KB Output is correct
33 Correct 47 ms 3816 KB Output is correct
34 Correct 50 ms 3836 KB Output is correct
35 Correct 48 ms 3796 KB Output is correct
36 Correct 48 ms 3812 KB Output is correct
37 Correct 48 ms 3808 KB Output is correct
38 Correct 46 ms 3812 KB Output is correct
39 Correct 51 ms 3788 KB Output is correct
40 Correct 52 ms 3948 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 3 ms 340 KB Output is correct
45 Correct 3 ms 340 KB Output is correct
46 Correct 3 ms 468 KB Output is correct
47 Correct 12 ms 848 KB Output is correct
48 Correct 14 ms 904 KB Output is correct
49 Correct 25 ms 1492 KB Output is correct
50 Correct 56 ms 2644 KB Output is correct
51 Correct 78 ms 3884 KB Output is correct
52 Correct 75 ms 3808 KB Output is correct
53 Correct 75 ms 3936 KB Output is correct
54 Correct 74 ms 3812 KB Output is correct
55 Correct 77 ms 3880 KB Output is correct
56 Correct 79 ms 3788 KB Output is correct
57 Correct 75 ms 3876 KB Output is correct
58 Correct 81 ms 3872 KB Output is correct
59 Correct 77 ms 3824 KB Output is correct
60 Correct 75 ms 3944 KB Output is correct
61 Correct 75 ms 3872 KB Output is correct
62 Correct 78 ms 3932 KB Output is correct
63 Correct 77 ms 3788 KB Output is correct
64 Correct 85 ms 3812 KB Output is correct
65 Correct 77 ms 3796 KB Output is correct
66 Correct 74 ms 3788 KB Output is correct
67 Correct 75 ms 3876 KB Output is correct
68 Correct 73 ms 3816 KB Output is correct
69 Correct 89 ms 3812 KB Output is correct
70 Correct 80 ms 3788 KB Output is correct
71 Correct 14 ms 980 KB Output is correct
72 Correct 14 ms 980 KB Output is correct
73 Correct 14 ms 988 KB Output is correct
74 Correct 15 ms 980 KB Output is correct
75 Correct 15 ms 980 KB Output is correct
76 Correct 31 ms 1604 KB Output is correct
77 Correct 33 ms 1612 KB Output is correct
78 Correct 33 ms 1724 KB Output is correct
79 Correct 37 ms 1632 KB Output is correct
80 Correct 31 ms 1628 KB Output is correct
81 Correct 62 ms 3020 KB Output is correct
82 Correct 62 ms 3048 KB Output is correct
83 Correct 63 ms 3100 KB Output is correct
84 Correct 70 ms 3036 KB Output is correct
85 Correct 65 ms 3160 KB Output is correct
86 Correct 70 ms 3420 KB Output is correct
87 Correct 71 ms 3424 KB Output is correct
88 Correct 68 ms 3404 KB Output is correct
89 Correct 69 ms 3532 KB Output is correct
90 Correct 72 ms 3536 KB Output is correct
91 Correct 204 ms 8156 KB Output is correct
92 Correct 206 ms 8156 KB Output is correct
93 Correct 210 ms 8156 KB Output is correct
94 Correct 210 ms 8272 KB Output is correct
95 Correct 207 ms 8156 KB Output is correct
96 Correct 256 ms 12372 KB Output is correct
97 Correct 261 ms 12516 KB Output is correct
98 Correct 270 ms 12580 KB Output is correct
99 Correct 263 ms 12524 KB Output is correct
100 Correct 271 ms 12476 KB Output is correct
101 Correct 272 ms 12380 KB Output is correct
102 Correct 269 ms 12520 KB Output is correct
103 Correct 261 ms 12516 KB Output is correct
104 Correct 255 ms 12476 KB Output is correct
105 Correct 268 ms 12384 KB Output is correct
106 Correct 264 ms 14636 KB Output is correct
107 Correct 270 ms 14640 KB Output is correct
108 Correct 273 ms 14640 KB Output is correct
109 Correct 256 ms 14552 KB Output is correct
110 Correct 278 ms 14552 KB Output is correct
111 Correct 270 ms 14692 KB Output is correct
112 Correct 270 ms 14572 KB Output is correct
113 Correct 261 ms 14568 KB Output is correct
114 Correct 266 ms 14640 KB Output is correct
115 Correct 265 ms 14632 KB Output is correct

Subtask #6
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 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 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 3 ms 432 KB Output is correct
14 Correct 17 ms 1492 KB Output is correct
15 Correct 26 ms 2672 KB Output is correct
16 Correct 41 ms 3820 KB Output is correct
17 Correct 36 ms 3812 KB Output is correct
18 Correct 40 ms 3808 KB Output is correct
19 Correct 43 ms 3824 KB Output is correct
20 Correct 40 ms 3840 KB Output is correct
21 Correct 43 ms 3832 KB Output is correct
22 Correct 43 ms 3808 KB Output is correct
23 Correct 51 ms 3804 KB Output is correct
24 Correct 42 ms 3796 KB Output is correct
25 Correct 41 ms 3792 KB Output is correct
26 Correct 1 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 1436 KB Output is correct
30 Correct 32 ms 2652 KB Output is correct
31 Correct 45 ms 3788 KB Output is correct
32 Correct 56 ms 3812 KB Output is correct
33 Correct 47 ms 3816 KB Output is correct
34 Correct 50 ms 3836 KB Output is correct
35 Correct 48 ms 3796 KB Output is correct
36 Correct 48 ms 3812 KB Output is correct
37 Correct 48 ms 3808 KB Output is correct
38 Correct 46 ms 3812 KB Output is correct
39 Correct 51 ms 3788 KB Output is correct
40 Correct 52 ms 3948 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 3 ms 340 KB Output is correct
45 Correct 3 ms 340 KB Output is correct
46 Correct 3 ms 468 KB Output is correct
47 Correct 12 ms 848 KB Output is correct
48 Correct 14 ms 904 KB Output is correct
49 Correct 25 ms 1492 KB Output is correct
50 Correct 56 ms 2644 KB Output is correct
51 Correct 78 ms 3884 KB Output is correct
52 Correct 75 ms 3808 KB Output is correct
53 Correct 75 ms 3936 KB Output is correct
54 Correct 74 ms 3812 KB Output is correct
55 Correct 77 ms 3880 KB Output is correct
56 Correct 79 ms 3788 KB Output is correct
57 Correct 75 ms 3876 KB Output is correct
58 Correct 81 ms 3872 KB Output is correct
59 Correct 77 ms 3824 KB Output is correct
60 Correct 75 ms 3944 KB Output is correct
61 Correct 75 ms 3872 KB Output is correct
62 Correct 78 ms 3932 KB Output is correct
63 Correct 77 ms 3788 KB Output is correct
64 Correct 85 ms 3812 KB Output is correct
65 Correct 77 ms 3796 KB Output is correct
66 Correct 74 ms 3788 KB Output is correct
67 Correct 75 ms 3876 KB Output is correct
68 Correct 73 ms 3816 KB Output is correct
69 Correct 89 ms 3812 KB Output is correct
70 Correct 80 ms 3788 KB Output is correct
71 Correct 14 ms 980 KB Output is correct
72 Correct 14 ms 980 KB Output is correct
73 Correct 14 ms 988 KB Output is correct
74 Correct 15 ms 980 KB Output is correct
75 Correct 15 ms 980 KB Output is correct
76 Correct 31 ms 1604 KB Output is correct
77 Correct 33 ms 1612 KB Output is correct
78 Correct 33 ms 1724 KB Output is correct
79 Correct 37 ms 1632 KB Output is correct
80 Correct 31 ms 1628 KB Output is correct
81 Correct 62 ms 3020 KB Output is correct
82 Correct 62 ms 3048 KB Output is correct
83 Correct 63 ms 3100 KB Output is correct
84 Correct 70 ms 3036 KB Output is correct
85 Correct 65 ms 3160 KB Output is correct
86 Correct 70 ms 3420 KB Output is correct
87 Correct 71 ms 3424 KB Output is correct
88 Correct 68 ms 3404 KB Output is correct
89 Correct 69 ms 3532 KB Output is correct
90 Correct 72 ms 3536 KB Output is correct
91 Correct 204 ms 8156 KB Output is correct
92 Correct 206 ms 8156 KB Output is correct
93 Correct 210 ms 8156 KB Output is correct
94 Correct 210 ms 8272 KB Output is correct
95 Correct 207 ms 8156 KB Output is correct
96 Correct 256 ms 12372 KB Output is correct
97 Correct 261 ms 12516 KB Output is correct
98 Correct 270 ms 12580 KB Output is correct
99 Correct 263 ms 12524 KB Output is correct
100 Correct 271 ms 12476 KB Output is correct
101 Correct 272 ms 12380 KB Output is correct
102 Correct 269 ms 12520 KB Output is correct
103 Correct 261 ms 12516 KB Output is correct
104 Correct 255 ms 12476 KB Output is correct
105 Correct 268 ms 12384 KB Output is correct
106 Correct 264 ms 14636 KB Output is correct
107 Correct 270 ms 14640 KB Output is correct
108 Correct 273 ms 14640 KB Output is correct
109 Correct 256 ms 14552 KB Output is correct
110 Correct 278 ms 14552 KB Output is correct
111 Correct 270 ms 14692 KB Output is correct
112 Correct 270 ms 14572 KB Output is correct
113 Correct 261 ms 14568 KB Output is correct
114 Correct 266 ms 14640 KB Output is correct
115 Correct 265 ms 14632 KB Output is correct
116 Correct 1180 ms 1996 KB Output is correct
117 Correct 1296 ms 1988 KB Output is correct
118 Correct 1424 ms 2592 KB Output is correct
119 Correct 1814 ms 2616 KB Output is correct
120 Correct 1983 ms 2632 KB Output is correct
121 Correct 2264 ms 3220 KB Output is correct
122 Correct 2428 ms 3276 KB Output is correct
123 Correct 3100 ms 4556 KB Output is correct
124 Correct 3666 ms 4708 KB Output is correct
125 Correct 4000 ms 4920 KB Output is correct
126 Correct 3931 ms 5616 KB Output is correct
127 Correct 3891 ms 5540 KB Output is correct
128 Correct 3842 ms 5628 KB Output is correct
129 Correct 3781 ms 5536 KB Output is correct
130 Correct 3825 ms 5540 KB Output is correct
131 Correct 4022 ms 5668 KB Output is correct
132 Correct 4051 ms 5676 KB Output is correct
133 Correct 4049 ms 5668 KB Output is correct
134 Correct 4073 ms 5676 KB Output is correct
135 Correct 4051 ms 5672 KB Output is correct
136 Correct 4075 ms 5676 KB Output is correct
137 Correct 4075 ms 5668 KB Output is correct
138 Correct 4026 ms 5672 KB Output is correct
139 Correct 4022 ms 5676 KB Output is correct
140 Correct 4067 ms 5668 KB Output is correct
141 Correct 4516 ms 5636 KB Output is correct
142 Correct 4565 ms 5704 KB Output is correct
143 Correct 4586 ms 5692 KB Output is correct
144 Correct 4571 ms 5692 KB Output is correct
145 Correct 4493 ms 5692 KB Output is correct
146 Correct 5254 ms 5836 KB Output is correct
147 Correct 5260 ms 5876 KB Output is correct
148 Correct 5331 ms 5860 KB Output is correct
149 Correct 5347 ms 7920 KB Output is correct
150 Correct 5332 ms 7920 KB Output is correct
151 Correct 5875 ms 8168 KB Output is correct
152 Correct 5796 ms 8164 KB Output is correct
153 Correct 5773 ms 8160 KB Output is correct
154 Correct 5680 ms 8168 KB Output is correct
155 Correct 5692 ms 8164 KB Output is correct
156 Execution timed out 7090 ms 9556 KB Time limit exceeded
157 Halted 0 ms 0 KB -