oj.uz

답안 #520460

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
520460 2022-01-30T05:24:14 Z KoD Diversity (CEOI21_diversity) C++17
64 / 100
 4635 ms 280088 KB 
#include <bits/stdc++.h>

using std::vector;
using std::array;
using std::pair;
using std::tuple;

using i64 = std::int64_t;

constexpr int B = 700;
constexpr int MAX = 300000;

constexpr i64 sum_k(const int n) {
    return (i64)n * (n + 1) / 2;
}
 
constexpr i64 sum_k2(const int n) {
    return (i64)n * (n + 1) * (2 * n + 1) / 6;
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int N, Q;
    std::cin >> N >> Q;
    vector<int> A(N);
    for (auto& x : A) {
        std::cin >> x;
        x -= 1;
    }
    const int G = N / B;
    vector precalc(G, vector<vector<pair<int, int>>>(G + 1));
    for (int lc = 0; lc < G; ++lc) {
        vector<char> appear(MAX);
        vector<int> count(MAX);
        for (int rc = lc + 1; rc <= G; ++rc) {
            vector<int> remove, add;
            for (int i = B * (rc - 1); i < B * rc; ++i) {
                if (!appear[A[i]]) {
                    appear[A[i]] = true;
                    if (count[A[i]] > 0) {
                        remove.push_back(count[A[i]]);
                    }
                    add.push_back(A[i]);
                }
                count[A[i]] += 1;
            }
            for (auto& x : add) {
                appear[x] = false;
                x = count[x];
            }
            std::sort(remove.begin(), remove.end());
            std::sort(add.begin(), add.end());
            const auto& read = precalc[lc][rc - 1];
            auto& write = precalc[lc][rc];
            const int A = read.size(), B = remove.size(), C = add.size();
            int i = 0, j = 0, k = 0;
            while (i < A or k < C) {
                int val = MAX;
                if (i < A) {
                    val = std::min(val, read[i].first);
                }
                if (k < C) {
                    val = std::min(val, add[k]);
                }
                int cnt = 0;
                if (i < A and val == read[i].first) {
                    cnt += read[i].second;
                    i += 1;
                }
                while (j < B and val == remove[j]) {
                    j += 1;
                    cnt -= 1;
                }
                while (k < C and val == add[k]) {
                    k += 1;
                    cnt += 1;
                }
                if (cnt > 0) {
                    write.emplace_back(val, cnt);
                }
            }
        }
    }
    vector<vector<int>> idx(MAX);
    for (int i = 0; i < N; ++i) {
        idx[A[i]].push_back(i);
    }
    const auto range_count = [&](const int l, const int r, const int x) {
        const auto& v = idx[x];
        return std::lower_bound(v.begin(), v.end(), r) - std::lower_bound(v.begin(), v.end(), l);
    };
    vector<char> appear(MAX);
    vector<int> count(MAX);
    while (Q--) {
        int l, r;
        std::cin >> l >> r;
        l -= 1;
        vector<pair<int, int>> list;
        if (l / B == r / B) {
            vector<int> add;
            for (int i = l; i < r; ++i) {
                if (!appear[A[i]]) {
                    appear[A[i]] = true;
                    add.push_back(A[i]);
                }
                count[A[i]] += 1;
            }
            for (const int x : add) {
                appear[x] = false;
                list.emplace_back(count[x], 1);
                count[x] = 0;
            }
            std::sort(list.begin(), list.end());
        } else {
            const int lc = (l + B - 1) / B;
            const int rc = r / B;
            vector<int> remove, add, seen;
            for (int i = l; i < B * lc; ++i) {
                if (!appear[A[i]]) {
                    appear[A[i]] = true;
                    const int tmp = range_count(B * lc, B * rc, A[i]);
                    if (tmp > 0) {
                        remove.push_back(tmp);
                    }
                    add.push_back(range_count(l, r, A[i]));
                    seen.push_back(A[i]);
                }
            } 
            for (int i = B * rc; i < r; ++i) {
                if (!appear[A[i]]) {
                    appear[A[i]] = true;
                    const int tmp = range_count(B * lc, B * rc, A[i]);
                    if (tmp > 0) {
                        remove.push_back(tmp);
                    }
                    add.push_back(range_count(l, r, A[i]));
                    seen.push_back(A[i]);
                }
            } 
            for (const int x : seen) {
                appear[x] = false;
            }
            std::sort(remove.begin(), remove.end());
            std::sort(add.begin(), add.end());
            const auto& read = precalc[lc][rc];
            const int A = read.size(), B = remove.size(), C = add.size();
            int i = 0, j = 0, k = 0;
            while (i < A or k < C) {
                int val = MAX;
                if (i < A) {
                    val = std::min(val, read[i].first);
                }
                if (k < C) {
                    val = std::min(val, add[k]);
                }
                int cnt = 0;
                if (i < A and val == read[i].first) {
                    cnt += read[i].second;
                    i += 1;
                }
                while (j < B and val == remove[j]) {
                    j += 1;
                    cnt -= 1;
                }
                while (k < C and val == add[k]) {
                    k += 1;
                    cnt += 1;
                }
                if (cnt > 0) {
                    list.emplace_back(val, cnt);
                }
            }
        }
        const int len = r - l;
        i64 ans = sum_k(len);
        const auto add_to = [&](const i64 s, const int a, const int n) {
            ans += (n * s + sum_k(n) * a) * len;
            ans -= n * s * s + 2 * s * sum_k(n) * a + sum_k2(n) * a * a;
        };
        int left = 0, right = 0;
        for (const auto& [a, b] : list) {
            if (left > right) {
                std::swap(left, right);
            }
            const int need = std::min(b, (right - left + a - 1) / a);
            const int to_left = need + (b - need) / 2;
            const int to_right = b - to_left;
            add_to(left, a, to_left);
            add_to(right, a, to_right);
            left += a * to_left;
            right += a * to_right;
        }
        ans -= (i64)left * (len - left);
        std::cout << ans << '\n';
    }
    return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8780 KB Output is correct
2 Correct 5 ms 8780 KB Output is correct
3 Correct 4 ms 8780 KB Output is correct
4 Correct 4 ms 8780 KB Output is correct
5 Correct 4 ms 8780 KB Output is correct
6 Correct 4 ms 8780 KB Output is correct
7 Correct 5 ms 8780 KB Output is correct
8 Correct 4 ms 8780 KB Output is correct
9 Correct 4 ms 8780 KB Output is correct
10 Correct 4 ms 8780 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8780 KB Output is correct
2 Correct 5 ms 8848 KB Output is correct
3 Correct 6 ms 10000 KB Output is correct
4 Correct 48 ms 12224 KB Output is correct
5 Correct 155 ms 18660 KB Output is correct
6 Correct 335 ms 29096 KB Output is correct
7 Correct 334 ms 28992 KB Output is correct
8 Correct 334 ms 29188 KB Output is correct
9 Correct 325 ms 28876 KB Output is correct
10 Correct 335 ms 28864 KB Output is correct
11 Correct 331 ms 28924 KB Output is correct
12 Correct 332 ms 29092 KB Output is correct
13 Correct 331 ms 29180 KB Output is correct
14 Correct 327 ms 29220 KB Output is correct
15 Correct 335 ms 28960 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8780 KB Output is correct
2 Correct 5 ms 8848 KB Output is correct
3 Correct 6 ms 10000 KB Output is correct
4 Correct 48 ms 12224 KB Output is correct
5 Correct 155 ms 18660 KB Output is correct
6 Correct 335 ms 29096 KB Output is correct
7 Correct 334 ms 28992 KB Output is correct
8 Correct 334 ms 29188 KB Output is correct
9 Correct 325 ms 28876 KB Output is correct
10 Correct 335 ms 28864 KB Output is correct
11 Correct 331 ms 28924 KB Output is correct
12 Correct 332 ms 29092 KB Output is correct
13 Correct 331 ms 29180 KB Output is correct
14 Correct 327 ms 29220 KB Output is correct
15 Correct 335 ms 28960 KB Output is correct
16 Correct 4 ms 8780 KB Output is correct
17 Correct 4 ms 8848 KB Output is correct
18 Correct 6 ms 10000 KB Output is correct
19 Correct 57 ms 13476 KB Output is correct
20 Correct 189 ms 23780 KB Output is correct
21 Correct 427 ms 40336 KB Output is correct
22 Correct 431 ms 40596 KB Output is correct
23 Correct 431 ms 40532 KB Output is correct
24 Correct 416 ms 40544 KB Output is correct
25 Correct 423 ms 40768 KB Output is correct
26 Correct 429 ms 40452 KB Output is correct
27 Correct 427 ms 40300 KB Output is correct
28 Correct 416 ms 40580 KB Output is correct
29 Correct 416 ms 40580 KB Output is correct
30 Correct 424 ms 40452 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8780 KB Output is correct
2 Correct 5 ms 8848 KB Output is correct
3 Correct 6 ms 10000 KB Output is correct
4 Correct 48 ms 12224 KB Output is correct
5 Correct 155 ms 18660 KB Output is correct
6 Correct 335 ms 29096 KB Output is correct
7 Correct 334 ms 28992 KB Output is correct
8 Correct 334 ms 29188 KB Output is correct
9 Correct 325 ms 28876 KB Output is correct
10 Correct 335 ms 28864 KB Output is correct
11 Correct 331 ms 28924 KB Output is correct
12 Correct 332 ms 29092 KB Output is correct
13 Correct 331 ms 29180 KB Output is correct
14 Correct 327 ms 29220 KB Output is correct
15 Correct 335 ms 28960 KB Output is correct
16 Correct 4 ms 8780 KB Output is correct
17 Correct 4 ms 8848 KB Output is correct
18 Correct 6 ms 10000 KB Output is correct
19 Correct 57 ms 13476 KB Output is correct
20 Correct 189 ms 23780 KB Output is correct
21 Correct 427 ms 40336 KB Output is correct
22 Correct 431 ms 40596 KB Output is correct
23 Correct 431 ms 40532 KB Output is correct
24 Correct 416 ms 40544 KB Output is correct
25 Correct 423 ms 40768 KB Output is correct
26 Correct 429 ms 40452 KB Output is correct
27 Correct 427 ms 40300 KB Output is correct
28 Correct 416 ms 40580 KB Output is correct
29 Correct 416 ms 40580 KB Output is correct
30 Correct 424 ms 40452 KB Output is correct
31 Correct 5 ms 8848 KB Output is correct
32 Correct 5 ms 8848 KB Output is correct
33 Correct 5 ms 8812 KB Output is correct
34 Correct 7 ms 10128 KB Output is correct
35 Correct 9 ms 10000 KB Output is correct
36 Correct 10 ms 10000 KB Output is correct
37 Correct 91 ms 13356 KB Output is correct
38 Correct 109 ms 12424 KB Output is correct
39 Correct 446 ms 24968 KB Output is correct
40 Correct 1866 ms 107496 KB Output is correct
41 Correct 4413 ms 278236 KB Output is correct
42 Correct 4490 ms 276852 KB Output is correct
43 Correct 4285 ms 279388 KB Output is correct
44 Correct 4365 ms 277468 KB Output is correct
45 Correct 4318 ms 278472 KB Output is correct
46 Correct 4394 ms 276832 KB Output is correct
47 Correct 4394 ms 277508 KB Output is correct
48 Correct 4310 ms 277600 KB Output is correct
49 Correct 4372 ms 277420 KB Output is correct
50 Correct 4328 ms 280088 KB Output is correct
51 Correct 4347 ms 277396 KB Output is correct
52 Correct 4368 ms 277096 KB Output is correct
53 Correct 4308 ms 279292 KB Output is correct
54 Correct 4291 ms 277492 KB Output is correct
55 Correct 4360 ms 277496 KB Output is correct
56 Correct 4375 ms 275972 KB Output is correct
57 Correct 4538 ms 274784 KB Output is correct
58 Correct 4635 ms 279132 KB Output is correct
59 Correct 4548 ms 277456 KB Output is correct
60 Correct 4540 ms 277412 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8780 KB Output is correct
2 Correct 5 ms 8780 KB Output is correct
3 Correct 4 ms 8780 KB Output is correct
4 Correct 4 ms 8780 KB Output is correct
5 Correct 4 ms 8780 KB Output is correct
6 Correct 4 ms 8780 KB Output is correct
7 Correct 5 ms 8780 KB Output is correct
8 Correct 4 ms 8780 KB Output is correct
9 Correct 4 ms 8780 KB Output is correct
10 Correct 4 ms 8780 KB Output is correct
11 Correct 4 ms 8780 KB Output is correct
12 Correct 5 ms 8848 KB Output is correct
13 Correct 6 ms 10000 KB Output is correct
14 Correct 48 ms 12224 KB Output is correct
15 Correct 155 ms 18660 KB Output is correct
16 Correct 335 ms 29096 KB Output is correct
17 Correct 334 ms 28992 KB Output is correct
18 Correct 334 ms 29188 KB Output is correct
19 Correct 325 ms 28876 KB Output is correct
20 Correct 335 ms 28864 KB Output is correct
21 Correct 331 ms 28924 KB Output is correct
22 Correct 332 ms 29092 KB Output is correct
23 Correct 331 ms 29180 KB Output is correct
24 Correct 327 ms 29220 KB Output is correct
25 Correct 335 ms 28960 KB Output is correct
26 Correct 4 ms 8780 KB Output is correct
27 Correct 4 ms 8848 KB Output is correct
28 Correct 6 ms 10000 KB Output is correct
29 Correct 57 ms 13476 KB Output is correct
30 Correct 189 ms 23780 KB Output is correct
31 Correct 427 ms 40336 KB Output is correct
32 Correct 431 ms 40596 KB Output is correct
33 Correct 431 ms 40532 KB Output is correct
34 Correct 416 ms 40544 KB Output is correct
35 Correct 423 ms 40768 KB Output is correct
36 Correct 429 ms 40452 KB Output is correct
37 Correct 427 ms 40300 KB Output is correct
38 Correct 416 ms 40580 KB Output is correct
39 Correct 416 ms 40580 KB Output is correct
40 Correct 424 ms 40452 KB Output is correct
41 Correct 5 ms 8848 KB Output is correct
42 Correct 5 ms 8848 KB Output is correct
43 Correct 5 ms 8812 KB Output is correct
44 Correct 7 ms 10128 KB Output is correct
45 Correct 9 ms 10000 KB Output is correct
46 Correct 10 ms 10000 KB Output is correct
47 Correct 91 ms 13356 KB Output is correct
48 Correct 109 ms 12424 KB Output is correct
49 Correct 446 ms 24968 KB Output is correct
50 Correct 1866 ms 107496 KB Output is correct
51 Correct 4413 ms 278236 KB Output is correct
52 Correct 4490 ms 276852 KB Output is correct
53 Correct 4285 ms 279388 KB Output is correct
54 Correct 4365 ms 277468 KB Output is correct
55 Correct 4318 ms 278472 KB Output is correct
56 Correct 4394 ms 276832 KB Output is correct
57 Correct 4394 ms 277508 KB Output is correct
58 Correct 4310 ms 277600 KB Output is correct
59 Correct 4372 ms 277420 KB Output is correct
60 Correct 4328 ms 280088 KB Output is correct
61 Correct 4347 ms 277396 KB Output is correct
62 Correct 4368 ms 277096 KB Output is correct
63 Correct 4308 ms 279292 KB Output is correct
64 Correct 4291 ms 277492 KB Output is correct
65 Correct 4360 ms 277496 KB Output is correct
66 Correct 4375 ms 275972 KB Output is correct
67 Correct 4538 ms 274784 KB Output is correct
68 Correct 4635 ms 279132 KB Output is correct
69 Correct 4548 ms 277456 KB Output is correct
70 Correct 4540 ms 277412 KB Output is correct
71 Correct 126 ms 11732 KB Output is correct
72 Correct 124 ms 11660 KB Output is correct
73 Correct 124 ms 11780 KB Output is correct
74 Correct 124 ms 11652 KB Output is correct
75 Correct 123 ms 11716 KB Output is correct
76 Correct 498 ms 16368 KB Output is correct
77 Correct 497 ms 16324 KB Output is correct
78 Correct 502 ms 16248 KB Output is correct
79 Correct 513 ms 16364 KB Output is correct
80 Correct 495 ms 16200 KB Output is correct
81 Correct 2089 ms 36572 KB Output is correct
82 Correct 2079 ms 36352 KB Output is correct
83 Correct 2115 ms 36580 KB Output is correct
84 Correct 2059 ms 36232 KB Output is correct
85 Correct 2078 ms 37968 KB Output is correct
86 Correct 1903 ms 27784 KB Output is correct
87 Correct 1883 ms 28060 KB Output is correct
88 Correct 1848 ms 26564 KB Output is correct
89 Correct 1873 ms 27612 KB Output is correct
90 Correct 1859 ms 27012 KB Output is correct
91 Correct 3305 ms 31984 KB Output is correct
92 Correct 3248 ms 31668 KB Output is correct
93 Correct 3288 ms 31940 KB Output is correct
94 Correct 3296 ms 30796 KB Output is correct
95 Correct 3281 ms 31748 KB Output is correct
96 Correct 2518 ms 28064 KB Output is correct
97 Correct 2506 ms 28360 KB Output is correct
98 Correct 2465 ms 28300 KB Output is correct
99 Correct 2518 ms 28096 KB Output is correct
100 Correct 2540 ms 28084 KB Output is correct
101 Correct 2539 ms 28180 KB Output is correct
102 Correct 2505 ms 27980 KB Output is correct
103 Correct 2568 ms 28348 KB Output is correct
104 Correct 2585 ms 28372 KB Output is correct
105 Correct 2522 ms 28384 KB Output is correct
106 Correct 2053 ms 27880 KB Output is correct
107 Correct 2100 ms 27832 KB Output is correct
108 Correct 2103 ms 27992 KB Output is correct
109 Correct 2071 ms 27912 KB Output is correct
110 Correct 2086 ms 27636 KB Output is correct
111 Correct 2084 ms 27800 KB Output is correct
112 Correct 2091 ms 27652 KB Output is correct
113 Correct 2097 ms 27872 KB Output is correct
114 Correct 2087 ms 28016 KB Output is correct
115 Correct 2049 ms 27768 KB Output is correct

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8780 KB Output is correct
2 Correct 5 ms 8780 KB Output is correct
3 Correct 4 ms 8780 KB Output is correct
4 Correct 4 ms 8780 KB Output is correct
5 Correct 4 ms 8780 KB Output is correct
6 Correct 4 ms 8780 KB Output is correct
7 Correct 5 ms 8780 KB Output is correct
8 Correct 4 ms 8780 KB Output is correct
9 Correct 4 ms 8780 KB Output is correct
10 Correct 4 ms 8780 KB Output is correct
11 Correct 4 ms 8780 KB Output is correct
12 Correct 5 ms 8848 KB Output is correct
13 Correct 6 ms 10000 KB Output is correct
14 Correct 48 ms 12224 KB Output is correct
15 Correct 155 ms 18660 KB Output is correct
16 Correct 335 ms 29096 KB Output is correct
17 Correct 334 ms 28992 KB Output is correct
18 Correct 334 ms 29188 KB Output is correct
19 Correct 325 ms 28876 KB Output is correct
20 Correct 335 ms 28864 KB Output is correct
21 Correct 331 ms 28924 KB Output is correct
22 Correct 332 ms 29092 KB Output is correct
23 Correct 331 ms 29180 KB Output is correct
24 Correct 327 ms 29220 KB Output is correct
25 Correct 335 ms 28960 KB Output is correct
26 Correct 4 ms 8780 KB Output is correct
27 Correct 4 ms 8848 KB Output is correct
28 Correct 6 ms 10000 KB Output is correct
29 Correct 57 ms 13476 KB Output is correct
30 Correct 189 ms 23780 KB Output is correct
31 Correct 427 ms 40336 KB Output is correct
32 Correct 431 ms 40596 KB Output is correct
33 Correct 431 ms 40532 KB Output is correct
34 Correct 416 ms 40544 KB Output is correct
35 Correct 423 ms 40768 KB Output is correct
36 Correct 429 ms 40452 KB Output is correct
37 Correct 427 ms 40300 KB Output is correct
38 Correct 416 ms 40580 KB Output is correct
39 Correct 416 ms 40580 KB Output is correct
40 Correct 424 ms 40452 KB Output is correct
41 Correct 5 ms 8848 KB Output is correct
42 Correct 5 ms 8848 KB Output is correct
43 Correct 5 ms 8812 KB Output is correct
44 Correct 7 ms 10128 KB Output is correct
45 Correct 9 ms 10000 KB Output is correct
46 Correct 10 ms 10000 KB Output is correct
47 Correct 91 ms 13356 KB Output is correct
48 Correct 109 ms 12424 KB Output is correct
49 Correct 446 ms 24968 KB Output is correct
50 Correct 1866 ms 107496 KB Output is correct
51 Correct 4413 ms 278236 KB Output is correct
52 Correct 4490 ms 276852 KB Output is correct
53 Correct 4285 ms 279388 KB Output is correct
54 Correct 4365 ms 277468 KB Output is correct
55 Correct 4318 ms 278472 KB Output is correct
56 Correct 4394 ms 276832 KB Output is correct
57 Correct 4394 ms 277508 KB Output is correct
58 Correct 4310 ms 277600 KB Output is correct
59 Correct 4372 ms 277420 KB Output is correct
60 Correct 4328 ms 280088 KB Output is correct
61 Correct 4347 ms 277396 KB Output is correct
62 Correct 4368 ms 277096 KB Output is correct
63 Correct 4308 ms 279292 KB Output is correct
64 Correct 4291 ms 277492 KB Output is correct
65 Correct 4360 ms 277496 KB Output is correct
66 Correct 4375 ms 275972 KB Output is correct
67 Correct 4538 ms 274784 KB Output is correct
68 Correct 4635 ms 279132 KB Output is correct
69 Correct 4548 ms 277456 KB Output is correct
70 Correct 4540 ms 277412 KB Output is correct
71 Correct 126 ms 11732 KB Output is correct
72 Correct 124 ms 11660 KB Output is correct
73 Correct 124 ms 11780 KB Output is correct
74 Correct 124 ms 11652 KB Output is correct
75 Correct 123 ms 11716 KB Output is correct
76 Correct 498 ms 16368 KB Output is correct
77 Correct 497 ms 16324 KB Output is correct
78 Correct 502 ms 16248 KB Output is correct
79 Correct 513 ms 16364 KB Output is correct
80 Correct 495 ms 16200 KB Output is correct
81 Correct 2089 ms 36572 KB Output is correct
82 Correct 2079 ms 36352 KB Output is correct
83 Correct 2115 ms 36580 KB Output is correct
84 Correct 2059 ms 36232 KB Output is correct
85 Correct 2078 ms 37968 KB Output is correct
86 Correct 1903 ms 27784 KB Output is correct
87 Correct 1883 ms 28060 KB Output is correct
88 Correct 1848 ms 26564 KB Output is correct
89 Correct 1873 ms 27612 KB Output is correct
90 Correct 1859 ms 27012 KB Output is correct
91 Correct 3305 ms 31984 KB Output is correct
92 Correct 3248 ms 31668 KB Output is correct
93 Correct 3288 ms 31940 KB Output is correct
94 Correct 3296 ms 30796 KB Output is correct
95 Correct 3281 ms 31748 KB Output is correct
96 Correct 2518 ms 28064 KB Output is correct
97 Correct 2506 ms 28360 KB Output is correct
98 Correct 2465 ms 28300 KB Output is correct
99 Correct 2518 ms 28096 KB Output is correct
100 Correct 2540 ms 28084 KB Output is correct
101 Correct 2539 ms 28180 KB Output is correct
102 Correct 2505 ms 27980 KB Output is correct
103 Correct 2568 ms 28348 KB Output is correct
104 Correct 2585 ms 28372 KB Output is correct
105 Correct 2522 ms 28384 KB Output is correct
106 Correct 2053 ms 27880 KB Output is correct
107 Correct 2100 ms 27832 KB Output is correct
108 Correct 2103 ms 27992 KB Output is correct
109 Correct 2071 ms 27912 KB Output is correct
110 Correct 2086 ms 27636 KB Output is correct
111 Correct 2084 ms 27800 KB Output is correct
112 Correct 2091 ms 27652 KB Output is correct
113 Correct 2097 ms 27872 KB Output is correct
114 Correct 2087 ms 28016 KB Output is correct
115 Correct 2049 ms 27768 KB Output is correct
116 Runtime error 19 ms 20240 KB Execution killed with signal 11
117 Halted 0 ms 0 KB -