oj.uz

답안 #697535

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
697535 2023-02-10T09:28:04 Z piOOE Diversity (CEOI21_diversity) C++17
64 / 100
 7000 ms 14688 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 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].rangeAdd(0, siz[side ^ 1], 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: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:35: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
  127 |     auto modify = [&](int i, int x) {
      |                                   ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 15 ms 1492 KB Output is correct
5 Correct 26 ms 2692 KB Output is correct
6 Correct 51 ms 3804 KB Output is correct
7 Correct 44 ms 3796 KB Output is correct
8 Correct 50 ms 3824 KB Output is correct
9 Correct 46 ms 3796 KB Output is correct
10 Correct 52 ms 3804 KB Output is correct
11 Correct 47 ms 3800 KB Output is correct
12 Correct 48 ms 3840 KB Output is correct
13 Correct 47 ms 3828 KB Output is correct
14 Correct 68 ms 3832 KB Output is correct
15 Correct 64 ms 3796 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 15 ms 1492 KB Output is correct
5 Correct 26 ms 2692 KB Output is correct
6 Correct 51 ms 3804 KB Output is correct
7 Correct 44 ms 3796 KB Output is correct
8 Correct 50 ms 3824 KB Output is correct
9 Correct 46 ms 3796 KB Output is correct
10 Correct 52 ms 3804 KB Output is correct
11 Correct 47 ms 3800 KB Output is correct
12 Correct 48 ms 3840 KB Output is correct
13 Correct 47 ms 3828 KB Output is correct
14 Correct 68 ms 3832 KB Output is correct
15 Correct 64 ms 3796 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 18 ms 1496 KB Output is correct
20 Correct 44 ms 2652 KB Output is correct
21 Correct 60 ms 3824 KB Output is correct
22 Correct 56 ms 3828 KB Output is correct
23 Correct 52 ms 3836 KB Output is correct
24 Correct 50 ms 3788 KB Output is correct
25 Correct 55 ms 3836 KB Output is correct
26 Correct 58 ms 3836 KB Output is correct
27 Correct 61 ms 3800 KB Output is correct
28 Correct 52 ms 3788 KB Output is correct
29 Correct 53 ms 3788 KB Output is correct
30 Correct 51 ms 3820 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 15 ms 1492 KB Output is correct
5 Correct 26 ms 2692 KB Output is correct
6 Correct 51 ms 3804 KB Output is correct
7 Correct 44 ms 3796 KB Output is correct
8 Correct 50 ms 3824 KB Output is correct
9 Correct 46 ms 3796 KB Output is correct
10 Correct 52 ms 3804 KB Output is correct
11 Correct 47 ms 3800 KB Output is correct
12 Correct 48 ms 3840 KB Output is correct
13 Correct 47 ms 3828 KB Output is correct
14 Correct 68 ms 3832 KB Output is correct
15 Correct 64 ms 3796 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 18 ms 1496 KB Output is correct
20 Correct 44 ms 2652 KB Output is correct
21 Correct 60 ms 3824 KB Output is correct
22 Correct 56 ms 3828 KB Output is correct
23 Correct 52 ms 3836 KB Output is correct
24 Correct 50 ms 3788 KB Output is correct
25 Correct 55 ms 3836 KB Output is correct
26 Correct 58 ms 3836 KB Output is correct
27 Correct 61 ms 3800 KB Output is correct
28 Correct 52 ms 3788 KB Output is correct
29 Correct 53 ms 3788 KB Output is correct
30 Correct 51 ms 3820 KB Output is correct
31 Correct 1 ms 340 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 4 ms 468 KB Output is correct
37 Correct 15 ms 908 KB Output is correct
38 Correct 15 ms 852 KB Output is correct
39 Correct 32 ms 1504 KB Output is correct
40 Correct 57 ms 2648 KB Output is correct
41 Correct 87 ms 3812 KB Output is correct
42 Correct 89 ms 3812 KB Output is correct
43 Correct 88 ms 3800 KB Output is correct
44 Correct 93 ms 3876 KB Output is correct
45 Correct 83 ms 3816 KB Output is correct
46 Correct 84 ms 3880 KB Output is correct
47 Correct 92 ms 3880 KB Output is correct
48 Correct 87 ms 3816 KB Output is correct
49 Correct 85 ms 3788 KB Output is correct
50 Correct 87 ms 3788 KB Output is correct
51 Correct 86 ms 3808 KB Output is correct
52 Correct 89 ms 3788 KB Output is correct
53 Correct 100 ms 3792 KB Output is correct
54 Correct 87 ms 3812 KB Output is correct
55 Correct 87 ms 3812 KB Output is correct
56 Correct 89 ms 3804 KB Output is correct
57 Correct 85 ms 3788 KB Output is correct
58 Correct 93 ms 3932 KB Output is correct
59 Correct 98 ms 3812 KB Output is correct
60 Correct 89 ms 3876 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 15 ms 1492 KB Output is correct
15 Correct 26 ms 2692 KB Output is correct
16 Correct 51 ms 3804 KB Output is correct
17 Correct 44 ms 3796 KB Output is correct
18 Correct 50 ms 3824 KB Output is correct
19 Correct 46 ms 3796 KB Output is correct
20 Correct 52 ms 3804 KB Output is correct
21 Correct 47 ms 3800 KB Output is correct
22 Correct 48 ms 3840 KB Output is correct
23 Correct 47 ms 3828 KB Output is correct
24 Correct 68 ms 3832 KB Output is correct
25 Correct 64 ms 3796 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 18 ms 1496 KB Output is correct
30 Correct 44 ms 2652 KB Output is correct
31 Correct 60 ms 3824 KB Output is correct
32 Correct 56 ms 3828 KB Output is correct
33 Correct 52 ms 3836 KB Output is correct
34 Correct 50 ms 3788 KB Output is correct
35 Correct 55 ms 3836 KB Output is correct
36 Correct 58 ms 3836 KB Output is correct
37 Correct 61 ms 3800 KB Output is correct
38 Correct 52 ms 3788 KB Output is correct
39 Correct 53 ms 3788 KB Output is correct
40 Correct 51 ms 3820 KB Output is correct
41 Correct 1 ms 340 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 4 ms 468 KB Output is correct
47 Correct 15 ms 908 KB Output is correct
48 Correct 15 ms 852 KB Output is correct
49 Correct 32 ms 1504 KB Output is correct
50 Correct 57 ms 2648 KB Output is correct
51 Correct 87 ms 3812 KB Output is correct
52 Correct 89 ms 3812 KB Output is correct
53 Correct 88 ms 3800 KB Output is correct
54 Correct 93 ms 3876 KB Output is correct
55 Correct 83 ms 3816 KB Output is correct
56 Correct 84 ms 3880 KB Output is correct
57 Correct 92 ms 3880 KB Output is correct
58 Correct 87 ms 3816 KB Output is correct
59 Correct 85 ms 3788 KB Output is correct
60 Correct 87 ms 3788 KB Output is correct
61 Correct 86 ms 3808 KB Output is correct
62 Correct 89 ms 3788 KB Output is correct
63 Correct 100 ms 3792 KB Output is correct
64 Correct 87 ms 3812 KB Output is correct
65 Correct 87 ms 3812 KB Output is correct
66 Correct 89 ms 3804 KB Output is correct
67 Correct 85 ms 3788 KB Output is correct
68 Correct 93 ms 3932 KB Output is correct
69 Correct 98 ms 3812 KB Output is correct
70 Correct 89 ms 3876 KB Output is correct
71 Correct 16 ms 980 KB Output is correct
72 Correct 17 ms 980 KB Output is correct
73 Correct 16 ms 980 KB Output is correct
74 Correct 16 ms 980 KB Output is correct
75 Correct 18 ms 916 KB Output is correct
76 Correct 43 ms 1632 KB Output is correct
77 Correct 35 ms 1628 KB Output is correct
78 Correct 36 ms 1620 KB Output is correct
79 Correct 34 ms 1620 KB Output is correct
80 Correct 36 ms 1632 KB Output is correct
81 Correct 69 ms 3032 KB Output is correct
82 Correct 80 ms 3036 KB Output is correct
83 Correct 78 ms 3092 KB Output is correct
84 Correct 82 ms 3096 KB Output is correct
85 Correct 86 ms 3096 KB Output is correct
86 Correct 83 ms 3532 KB Output is correct
87 Correct 86 ms 3416 KB Output is correct
88 Correct 85 ms 3536 KB Output is correct
89 Correct 96 ms 3404 KB Output is correct
90 Correct 81 ms 3528 KB Output is correct
91 Correct 189 ms 8040 KB Output is correct
92 Correct 190 ms 8140 KB Output is correct
93 Correct 190 ms 8156 KB Output is correct
94 Correct 199 ms 8156 KB Output is correct
95 Correct 184 ms 8024 KB Output is correct
96 Correct 242 ms 12364 KB Output is correct
97 Correct 229 ms 12480 KB Output is correct
98 Correct 219 ms 12480 KB Output is correct
99 Correct 227 ms 12388 KB Output is correct
100 Correct 234 ms 12480 KB Output is correct
101 Correct 226 ms 12472 KB Output is correct
102 Correct 235 ms 12376 KB Output is correct
103 Correct 220 ms 12492 KB Output is correct
104 Correct 235 ms 12476 KB Output is correct
105 Correct 228 ms 12372 KB Output is correct
106 Correct 247 ms 14636 KB Output is correct
107 Correct 228 ms 14680 KB Output is correct
108 Correct 235 ms 14576 KB Output is correct
109 Correct 235 ms 14688 KB Output is correct
110 Correct 245 ms 14540 KB Output is correct
111 Correct 234 ms 14636 KB Output is correct
112 Correct 241 ms 14636 KB Output is correct
113 Correct 228 ms 14640 KB Output is correct
114 Correct 229 ms 14640 KB Output is correct
115 Correct 231 ms 14564 KB Output is correct

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 15 ms 1492 KB Output is correct
15 Correct 26 ms 2692 KB Output is correct
16 Correct 51 ms 3804 KB Output is correct
17 Correct 44 ms 3796 KB Output is correct
18 Correct 50 ms 3824 KB Output is correct
19 Correct 46 ms 3796 KB Output is correct
20 Correct 52 ms 3804 KB Output is correct
21 Correct 47 ms 3800 KB Output is correct
22 Correct 48 ms 3840 KB Output is correct
23 Correct 47 ms 3828 KB Output is correct
24 Correct 68 ms 3832 KB Output is correct
25 Correct 64 ms 3796 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 18 ms 1496 KB Output is correct
30 Correct 44 ms 2652 KB Output is correct
31 Correct 60 ms 3824 KB Output is correct
32 Correct 56 ms 3828 KB Output is correct
33 Correct 52 ms 3836 KB Output is correct
34 Correct 50 ms 3788 KB Output is correct
35 Correct 55 ms 3836 KB Output is correct
36 Correct 58 ms 3836 KB Output is correct
37 Correct 61 ms 3800 KB Output is correct
38 Correct 52 ms 3788 KB Output is correct
39 Correct 53 ms 3788 KB Output is correct
40 Correct 51 ms 3820 KB Output is correct
41 Correct 1 ms 340 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 4 ms 468 KB Output is correct
47 Correct 15 ms 908 KB Output is correct
48 Correct 15 ms 852 KB Output is correct
49 Correct 32 ms 1504 KB Output is correct
50 Correct 57 ms 2648 KB Output is correct
51 Correct 87 ms 3812 KB Output is correct
52 Correct 89 ms 3812 KB Output is correct
53 Correct 88 ms 3800 KB Output is correct
54 Correct 93 ms 3876 KB Output is correct
55 Correct 83 ms 3816 KB Output is correct
56 Correct 84 ms 3880 KB Output is correct
57 Correct 92 ms 3880 KB Output is correct
58 Correct 87 ms 3816 KB Output is correct
59 Correct 85 ms 3788 KB Output is correct
60 Correct 87 ms 3788 KB Output is correct
61 Correct 86 ms 3808 KB Output is correct
62 Correct 89 ms 3788 KB Output is correct
63 Correct 100 ms 3792 KB Output is correct
64 Correct 87 ms 3812 KB Output is correct
65 Correct 87 ms 3812 KB Output is correct
66 Correct 89 ms 3804 KB Output is correct
67 Correct 85 ms 3788 KB Output is correct
68 Correct 93 ms 3932 KB Output is correct
69 Correct 98 ms 3812 KB Output is correct
70 Correct 89 ms 3876 KB Output is correct
71 Correct 16 ms 980 KB Output is correct
72 Correct 17 ms 980 KB Output is correct
73 Correct 16 ms 980 KB Output is correct
74 Correct 16 ms 980 KB Output is correct
75 Correct 18 ms 916 KB Output is correct
76 Correct 43 ms 1632 KB Output is correct
77 Correct 35 ms 1628 KB Output is correct
78 Correct 36 ms 1620 KB Output is correct
79 Correct 34 ms 1620 KB Output is correct
80 Correct 36 ms 1632 KB Output is correct
81 Correct 69 ms 3032 KB Output is correct
82 Correct 80 ms 3036 KB Output is correct
83 Correct 78 ms 3092 KB Output is correct
84 Correct 82 ms 3096 KB Output is correct
85 Correct 86 ms 3096 KB Output is correct
86 Correct 83 ms 3532 KB Output is correct
87 Correct 86 ms 3416 KB Output is correct
88 Correct 85 ms 3536 KB Output is correct
89 Correct 96 ms 3404 KB Output is correct
90 Correct 81 ms 3528 KB Output is correct
91 Correct 189 ms 8040 KB Output is correct
92 Correct 190 ms 8140 KB Output is correct
93 Correct 190 ms 8156 KB Output is correct
94 Correct 199 ms 8156 KB Output is correct
95 Correct 184 ms 8024 KB Output is correct
96 Correct 242 ms 12364 KB Output is correct
97 Correct 229 ms 12480 KB Output is correct
98 Correct 219 ms 12480 KB Output is correct
99 Correct 227 ms 12388 KB Output is correct
100 Correct 234 ms 12480 KB Output is correct
101 Correct 226 ms 12472 KB Output is correct
102 Correct 235 ms 12376 KB Output is correct
103 Correct 220 ms 12492 KB Output is correct
104 Correct 235 ms 12476 KB Output is correct
105 Correct 228 ms 12372 KB Output is correct
106 Correct 247 ms 14636 KB Output is correct
107 Correct 228 ms 14680 KB Output is correct
108 Correct 235 ms 14576 KB Output is correct
109 Correct 235 ms 14688 KB Output is correct
110 Correct 245 ms 14540 KB Output is correct
111 Correct 234 ms 14636 KB Output is correct
112 Correct 241 ms 14636 KB Output is correct
113 Correct 228 ms 14640 KB Output is correct
114 Correct 229 ms 14640 KB Output is correct
115 Correct 231 ms 14564 KB Output is correct
116 Correct 1037 ms 2000 KB Output is correct
117 Correct 1206 ms 1996 KB Output is correct
118 Correct 1278 ms 2592 KB Output is correct
119 Correct 1668 ms 2616 KB Output is correct
120 Correct 1881 ms 2636 KB Output is correct
121 Correct 2248 ms 3220 KB Output is correct
122 Correct 2420 ms 3268 KB Output is correct
123 Correct 3713 ms 4536 KB Output is correct
124 Correct 4584 ms 4708 KB Output is correct
125 Correct 4982 ms 4912 KB Output is correct
126 Correct 5295 ms 5536 KB Output is correct
127 Correct 5294 ms 5580 KB Output is correct
128 Correct 5305 ms 5536 KB Output is correct
129 Correct 5300 ms 5536 KB Output is correct
130 Correct 5400 ms 5536 KB Output is correct
131 Correct 5464 ms 5560 KB Output is correct
132 Correct 5508 ms 5668 KB Output is correct
133 Correct 5462 ms 5672 KB Output is correct
134 Correct 5490 ms 5668 KB Output is correct
135 Correct 5463 ms 5636 KB Output is correct
136 Correct 5657 ms 5680 KB Output is correct
137 Correct 6042 ms 5668 KB Output is correct
138 Correct 6054 ms 5672 KB Output is correct
139 Correct 5869 ms 5668 KB Output is correct
140 Correct 5839 ms 5668 KB Output is correct
141 Correct 6582 ms 5696 KB Output is correct
142 Correct 6681 ms 5700 KB Output is correct
143 Correct 6497 ms 5696 KB Output is correct
144 Correct 6690 ms 5696 KB Output is correct
145 Correct 6266 ms 5696 KB Output is correct
146 Execution timed out 7058 ms 5212 KB Time limit exceeded
147 Halted 0 ms 0 KB -