oj.uz

답안 #697526

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
697526 2023-02-10T09:05:22 Z piOOE Diversity (CEOI21_diversity) C++17
64 / 100
 7000 ms 72512 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

struct SegmentTree {
    vector<ll> t;
    vector<ll> tag;

    int sz;

    void init(vector<int> a) {
        int n = a.size();
        sz = 1 << __lg(n) + !!(n & (n - 1));
        t.resize(sz << 1), tag.resize(sz << 1);

        for (int i = 0; i < n; ++i) {
            t[i + sz] = a[i];
        }
        for (int i = sz - 1; i > 0; --i) {
            t[i] = t[i << 1] + t[i << 1 | 1];
        }
    }

    void rangeAdd(int l, int r, int v, int x, int lx, int rx) {
        if (l >= rx || lx >= r) {
            return;
        }

        if (l <= lx && rx <= r) {
            tag[x] += v;
            t[x] += 1LL * v * (rx - lx);
            return;
        }

        int mid = (lx + rx) / 2;

        rangeAdd(l, r, v, x << 1, lx, mid), rangeAdd(l, r, v, x << 1 | 1, mid, rx);

        t[x] = t[x << 1] + t[x << 1 | 1] + (rx - lx) * tag[x];
    }

    void rangeAdd(int l, int r, int v) {
        rangeAdd(l, r, v, 1, 0, sz);
    }

    ll rangeSum(int l, int r, int x, int lx, int rx) {
        if (l >= rx || lx >= r) {
            return 0;
        }

        if (l <= lx && rx <= r) {
            return t[x];
        }

        int mid = (lx + rx) / 2;

        return rangeSum(l, r, x << 1, lx, mid) + rangeSum(l, r, x << 1 | 1, mid, rx) +
               (min(rx, r) - max(lx, l)) * tag[x];
    }

    ll rangeSum(int l, int r) {
        return rangeSum(l, r, 1, 0, sz);
    }
} 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 = 500;

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

    t[0][0].init(vector(n, 0));
    t[0][1].init(vector(n, 0));
    t[1][0].init(vector(n, 0));
    t[1][1].init(vector(n, 0));

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

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

    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;

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

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

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

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

            ans += t[side ^ 1][1].rangeSum(0, siz[side ^ 1]);
            t[side ^ 1][0].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;

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

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

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

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

            ans -= t[side ^ 1][1].rangeSum(0, siz[side ^ 1]);
            t[side ^ 1][0].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: In member function 'void SegmentTree::init(std::vector<int>)':
diversity.cpp:14:27: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   14 |         sz = 1 << __lg(n) + !!(n & (n - 1));
      |                   ~~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 7 ms 2568 KB Output is correct
4 Correct 88 ms 18336 KB Output is correct
5 Correct 181 ms 36180 KB Output is correct
6 Correct 340 ms 70800 KB Output is correct
7 Correct 314 ms 70708 KB Output is correct
8 Correct 345 ms 70748 KB Output is correct
9 Correct 319 ms 70768 KB Output is correct
10 Correct 320 ms 70716 KB Output is correct
11 Correct 320 ms 70600 KB Output is correct
12 Correct 299 ms 70712 KB Output is correct
13 Correct 314 ms 70700 KB Output is correct
14 Correct 323 ms 70704 KB Output is correct
15 Correct 314 ms 70712 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 7 ms 2568 KB Output is correct
4 Correct 88 ms 18336 KB Output is correct
5 Correct 181 ms 36180 KB Output is correct
6 Correct 340 ms 70800 KB Output is correct
7 Correct 314 ms 70708 KB Output is correct
8 Correct 345 ms 70748 KB Output is correct
9 Correct 319 ms 70768 KB Output is correct
10 Correct 320 ms 70716 KB Output is correct
11 Correct 320 ms 70600 KB Output is correct
12 Correct 299 ms 70712 KB Output is correct
13 Correct 314 ms 70700 KB Output is correct
14 Correct 323 ms 70704 KB Output is correct
15 Correct 314 ms 70712 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 9 ms 2516 KB Output is correct
19 Correct 88 ms 18332 KB Output is correct
20 Correct 188 ms 36312 KB Output is correct
21 Correct 333 ms 70840 KB Output is correct
22 Correct 335 ms 70608 KB Output is correct
23 Correct 331 ms 70704 KB Output is correct
24 Correct 340 ms 70708 KB Output is correct
25 Correct 321 ms 70584 KB Output is correct
26 Correct 315 ms 70600 KB Output is correct
27 Correct 324 ms 70664 KB Output is correct
28 Correct 326 ms 70736 KB Output is correct
29 Correct 305 ms 70712 KB Output is correct
30 Correct 308 ms 70712 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 7 ms 2568 KB Output is correct
4 Correct 88 ms 18336 KB Output is correct
5 Correct 181 ms 36180 KB Output is correct
6 Correct 340 ms 70800 KB Output is correct
7 Correct 314 ms 70708 KB Output is correct
8 Correct 345 ms 70748 KB Output is correct
9 Correct 319 ms 70768 KB Output is correct
10 Correct 320 ms 70716 KB Output is correct
11 Correct 320 ms 70600 KB Output is correct
12 Correct 299 ms 70712 KB Output is correct
13 Correct 314 ms 70700 KB Output is correct
14 Correct 323 ms 70704 KB Output is correct
15 Correct 314 ms 70712 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 9 ms 2516 KB Output is correct
19 Correct 88 ms 18332 KB Output is correct
20 Correct 188 ms 36312 KB Output is correct
21 Correct 333 ms 70840 KB Output is correct
22 Correct 335 ms 70608 KB Output is correct
23 Correct 331 ms 70704 KB Output is correct
24 Correct 340 ms 70708 KB Output is correct
25 Correct 321 ms 70584 KB Output is correct
26 Correct 315 ms 70600 KB Output is correct
27 Correct 324 ms 70664 KB Output is correct
28 Correct 326 ms 70736 KB Output is correct
29 Correct 305 ms 70712 KB Output is correct
30 Correct 308 ms 70712 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 9 ms 2536 KB Output is correct
35 Correct 10 ms 2516 KB Output is correct
36 Correct 10 ms 2516 KB Output is correct
37 Correct 50 ms 9232 KB Output is correct
38 Correct 55 ms 9340 KB Output is correct
39 Correct 107 ms 18252 KB Output is correct
40 Correct 233 ms 36428 KB Output is correct
41 Correct 373 ms 70620 KB Output is correct
42 Correct 362 ms 70732 KB Output is correct
43 Correct 375 ms 70584 KB Output is correct
44 Correct 364 ms 70704 KB Output is correct
45 Correct 371 ms 70616 KB Output is correct
46 Correct 366 ms 70708 KB Output is correct
47 Correct 368 ms 70708 KB Output is correct
48 Correct 371 ms 70748 KB Output is correct
49 Correct 398 ms 70604 KB Output is correct
50 Correct 378 ms 70708 KB Output is correct
51 Correct 363 ms 70704 KB Output is correct
52 Correct 374 ms 70712 KB Output is correct
53 Correct 353 ms 70584 KB Output is correct
54 Correct 362 ms 70740 KB Output is correct
55 Correct 355 ms 70740 KB Output is correct
56 Correct 368 ms 70736 KB Output is correct
57 Correct 357 ms 70800 KB Output is correct
58 Correct 368 ms 70712 KB Output is correct
59 Correct 369 ms 70708 KB Output is correct
60 Correct 388 ms 70712 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 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 1 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 1 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 2 ms 340 KB Output is correct
13 Correct 7 ms 2568 KB Output is correct
14 Correct 88 ms 18336 KB Output is correct
15 Correct 181 ms 36180 KB Output is correct
16 Correct 340 ms 70800 KB Output is correct
17 Correct 314 ms 70708 KB Output is correct
18 Correct 345 ms 70748 KB Output is correct
19 Correct 319 ms 70768 KB Output is correct
20 Correct 320 ms 70716 KB Output is correct
21 Correct 320 ms 70600 KB Output is correct
22 Correct 299 ms 70712 KB Output is correct
23 Correct 314 ms 70700 KB Output is correct
24 Correct 323 ms 70704 KB Output is correct
25 Correct 314 ms 70712 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 464 KB Output is correct
28 Correct 9 ms 2516 KB Output is correct
29 Correct 88 ms 18332 KB Output is correct
30 Correct 188 ms 36312 KB Output is correct
31 Correct 333 ms 70840 KB Output is correct
32 Correct 335 ms 70608 KB Output is correct
33 Correct 331 ms 70704 KB Output is correct
34 Correct 340 ms 70708 KB Output is correct
35 Correct 321 ms 70584 KB Output is correct
36 Correct 315 ms 70600 KB Output is correct
37 Correct 324 ms 70664 KB Output is correct
38 Correct 326 ms 70736 KB Output is correct
39 Correct 305 ms 70712 KB Output is correct
40 Correct 308 ms 70712 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 2 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 9 ms 2536 KB Output is correct
45 Correct 10 ms 2516 KB Output is correct
46 Correct 10 ms 2516 KB Output is correct
47 Correct 50 ms 9232 KB Output is correct
48 Correct 55 ms 9340 KB Output is correct
49 Correct 107 ms 18252 KB Output is correct
50 Correct 233 ms 36428 KB Output is correct
51 Correct 373 ms 70620 KB Output is correct
52 Correct 362 ms 70732 KB Output is correct
53 Correct 375 ms 70584 KB Output is correct
54 Correct 364 ms 70704 KB Output is correct
55 Correct 371 ms 70616 KB Output is correct
56 Correct 366 ms 70708 KB Output is correct
57 Correct 368 ms 70708 KB Output is correct
58 Correct 371 ms 70748 KB Output is correct
59 Correct 398 ms 70604 KB Output is correct
60 Correct 378 ms 70708 KB Output is correct
61 Correct 363 ms 70704 KB Output is correct
62 Correct 374 ms 70712 KB Output is correct
63 Correct 353 ms 70584 KB Output is correct
64 Correct 362 ms 70740 KB Output is correct
65 Correct 355 ms 70740 KB Output is correct
66 Correct 368 ms 70736 KB Output is correct
67 Correct 357 ms 70800 KB Output is correct
68 Correct 368 ms 70712 KB Output is correct
69 Correct 369 ms 70708 KB Output is correct
70 Correct 388 ms 70712 KB Output is correct
71 Correct 62 ms 9332 KB Output is correct
72 Correct 54 ms 9232 KB Output is correct
73 Correct 59 ms 9336 KB Output is correct
74 Correct 55 ms 9340 KB Output is correct
75 Correct 55 ms 9232 KB Output is correct
76 Correct 126 ms 18296 KB Output is correct
77 Correct 119 ms 18332 KB Output is correct
78 Correct 121 ms 18240 KB Output is correct
79 Correct 119 ms 18332 KB Output is correct
80 Correct 118 ms 18256 KB Output is correct
81 Correct 259 ms 36404 KB Output is correct
82 Correct 250 ms 36264 KB Output is correct
83 Correct 257 ms 36324 KB Output is correct
84 Correct 283 ms 36388 KB Output is correct
85 Correct 249 ms 36312 KB Output is correct
86 Correct 258 ms 36292 KB Output is correct
87 Correct 265 ms 36412 KB Output is correct
88 Correct 249 ms 36308 KB Output is correct
89 Correct 257 ms 36324 KB Output is correct
90 Correct 252 ms 36312 KB Output is correct
91 Correct 426 ms 70700 KB Output is correct
92 Correct 410 ms 70748 KB Output is correct
93 Correct 414 ms 70712 KB Output is correct
94 Correct 427 ms 70584 KB Output is correct
95 Correct 454 ms 70704 KB Output is correct
96 Correct 428 ms 71864 KB Output is correct
97 Correct 430 ms 71880 KB Output is correct
98 Correct 418 ms 71880 KB Output is correct
99 Correct 424 ms 71908 KB Output is correct
100 Correct 413 ms 71864 KB Output is correct
101 Correct 475 ms 71920 KB Output is correct
102 Correct 408 ms 71880 KB Output is correct
103 Correct 426 ms 71760 KB Output is correct
104 Correct 422 ms 71884 KB Output is correct
105 Correct 470 ms 71860 KB Output is correct
106 Correct 419 ms 72396 KB Output is correct
107 Correct 441 ms 72512 KB Output is correct
108 Correct 479 ms 72472 KB Output is correct
109 Correct 436 ms 72376 KB Output is correct
110 Correct 438 ms 72476 KB Output is correct
111 Correct 442 ms 72464 KB Output is correct
112 Correct 449 ms 72468 KB Output is correct
113 Correct 452 ms 72400 KB Output is correct
114 Correct 446 ms 72464 KB Output is correct
115 Correct 445 ms 72480 KB Output is correct

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 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 1 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 1 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 2 ms 340 KB Output is correct
13 Correct 7 ms 2568 KB Output is correct
14 Correct 88 ms 18336 KB Output is correct
15 Correct 181 ms 36180 KB Output is correct
16 Correct 340 ms 70800 KB Output is correct
17 Correct 314 ms 70708 KB Output is correct
18 Correct 345 ms 70748 KB Output is correct
19 Correct 319 ms 70768 KB Output is correct
20 Correct 320 ms 70716 KB Output is correct
21 Correct 320 ms 70600 KB Output is correct
22 Correct 299 ms 70712 KB Output is correct
23 Correct 314 ms 70700 KB Output is correct
24 Correct 323 ms 70704 KB Output is correct
25 Correct 314 ms 70712 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 464 KB Output is correct
28 Correct 9 ms 2516 KB Output is correct
29 Correct 88 ms 18332 KB Output is correct
30 Correct 188 ms 36312 KB Output is correct
31 Correct 333 ms 70840 KB Output is correct
32 Correct 335 ms 70608 KB Output is correct
33 Correct 331 ms 70704 KB Output is correct
34 Correct 340 ms 70708 KB Output is correct
35 Correct 321 ms 70584 KB Output is correct
36 Correct 315 ms 70600 KB Output is correct
37 Correct 324 ms 70664 KB Output is correct
38 Correct 326 ms 70736 KB Output is correct
39 Correct 305 ms 70712 KB Output is correct
40 Correct 308 ms 70712 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 2 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 9 ms 2536 KB Output is correct
45 Correct 10 ms 2516 KB Output is correct
46 Correct 10 ms 2516 KB Output is correct
47 Correct 50 ms 9232 KB Output is correct
48 Correct 55 ms 9340 KB Output is correct
49 Correct 107 ms 18252 KB Output is correct
50 Correct 233 ms 36428 KB Output is correct
51 Correct 373 ms 70620 KB Output is correct
52 Correct 362 ms 70732 KB Output is correct
53 Correct 375 ms 70584 KB Output is correct
54 Correct 364 ms 70704 KB Output is correct
55 Correct 371 ms 70616 KB Output is correct
56 Correct 366 ms 70708 KB Output is correct
57 Correct 368 ms 70708 KB Output is correct
58 Correct 371 ms 70748 KB Output is correct
59 Correct 398 ms 70604 KB Output is correct
60 Correct 378 ms 70708 KB Output is correct
61 Correct 363 ms 70704 KB Output is correct
62 Correct 374 ms 70712 KB Output is correct
63 Correct 353 ms 70584 KB Output is correct
64 Correct 362 ms 70740 KB Output is correct
65 Correct 355 ms 70740 KB Output is correct
66 Correct 368 ms 70736 KB Output is correct
67 Correct 357 ms 70800 KB Output is correct
68 Correct 368 ms 70712 KB Output is correct
69 Correct 369 ms 70708 KB Output is correct
70 Correct 388 ms 70712 KB Output is correct
71 Correct 62 ms 9332 KB Output is correct
72 Correct 54 ms 9232 KB Output is correct
73 Correct 59 ms 9336 KB Output is correct
74 Correct 55 ms 9340 KB Output is correct
75 Correct 55 ms 9232 KB Output is correct
76 Correct 126 ms 18296 KB Output is correct
77 Correct 119 ms 18332 KB Output is correct
78 Correct 121 ms 18240 KB Output is correct
79 Correct 119 ms 18332 KB Output is correct
80 Correct 118 ms 18256 KB Output is correct
81 Correct 259 ms 36404 KB Output is correct
82 Correct 250 ms 36264 KB Output is correct
83 Correct 257 ms 36324 KB Output is correct
84 Correct 283 ms 36388 KB Output is correct
85 Correct 249 ms 36312 KB Output is correct
86 Correct 258 ms 36292 KB Output is correct
87 Correct 265 ms 36412 KB Output is correct
88 Correct 249 ms 36308 KB Output is correct
89 Correct 257 ms 36324 KB Output is correct
90 Correct 252 ms 36312 KB Output is correct
91 Correct 426 ms 70700 KB Output is correct
92 Correct 410 ms 70748 KB Output is correct
93 Correct 414 ms 70712 KB Output is correct
94 Correct 427 ms 70584 KB Output is correct
95 Correct 454 ms 70704 KB Output is correct
96 Correct 428 ms 71864 KB Output is correct
97 Correct 430 ms 71880 KB Output is correct
98 Correct 418 ms 71880 KB Output is correct
99 Correct 424 ms 71908 KB Output is correct
100 Correct 413 ms 71864 KB Output is correct
101 Correct 475 ms 71920 KB Output is correct
102 Correct 408 ms 71880 KB Output is correct
103 Correct 426 ms 71760 KB Output is correct
104 Correct 422 ms 71884 KB Output is correct
105 Correct 470 ms 71860 KB Output is correct
106 Correct 419 ms 72396 KB Output is correct
107 Correct 441 ms 72512 KB Output is correct
108 Correct 479 ms 72472 KB Output is correct
109 Correct 436 ms 72376 KB Output is correct
110 Correct 438 ms 72476 KB Output is correct
111 Correct 442 ms 72464 KB Output is correct
112 Correct 449 ms 72468 KB Output is correct
113 Correct 452 ms 72400 KB Output is correct
114 Correct 446 ms 72464 KB Output is correct
115 Correct 445 ms 72480 KB Output is correct
116 Correct 5452 ms 4116 KB Output is correct
117 Correct 5221 ms 4620 KB Output is correct
118 Execution timed out 7054 ms 11144 KB Time limit exceeded
119 Halted 0 ms 0 KB -