oj.uz

답안 #520461

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
520461 2022-01-30T05:25:47 Z KoD Diversity (CEOI21_diversity) C++17
64 / 100
 2774 ms 144156 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 = 1000;
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 5 ms 8832 KB Output is correct
2 Correct 5 ms 8780 KB Output is correct
3 Correct 4 ms 8780 KB Output is correct
4 Correct 5 ms 8780 KB Output is correct
5 Correct 4 ms 8780 KB Output is correct
6 Correct 5 ms 8780 KB Output is correct
7 Correct 4 ms 8780 KB Output is correct
8 Correct 5 ms 8780 KB Output is correct
9 Correct 5 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 5 ms 8780 KB Output is correct
2 Correct 6 ms 8848 KB Output is correct
3 Correct 6 ms 10000 KB Output is correct
4 Correct 35 ms 11224 KB Output is correct
5 Correct 108 ms 14856 KB Output is correct
6 Correct 230 ms 20272 KB Output is correct
7 Correct 220 ms 20212 KB Output is correct
8 Correct 215 ms 20412 KB Output is correct
9 Correct 217 ms 20112 KB Output is correct
10 Correct 220 ms 20104 KB Output is correct
11 Correct 221 ms 20104 KB Output is correct
12 Correct 211 ms 20268 KB Output is correct
13 Correct 220 ms 20228 KB Output is correct
14 Correct 223 ms 20380 KB Output is correct
15 Correct 221 ms 20100 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8780 KB Output is correct
2 Correct 6 ms 8848 KB Output is correct
3 Correct 6 ms 10000 KB Output is correct
4 Correct 35 ms 11224 KB Output is correct
5 Correct 108 ms 14856 KB Output is correct
6 Correct 230 ms 20272 KB Output is correct
7 Correct 220 ms 20212 KB Output is correct
8 Correct 215 ms 20412 KB Output is correct
9 Correct 217 ms 20112 KB Output is correct
10 Correct 220 ms 20104 KB Output is correct
11 Correct 221 ms 20104 KB Output is correct
12 Correct 211 ms 20268 KB Output is correct
13 Correct 220 ms 20228 KB Output is correct
14 Correct 223 ms 20380 KB Output is correct
15 Correct 221 ms 20100 KB Output is correct
16 Correct 4 ms 8780 KB Output is correct
17 Correct 6 ms 8868 KB Output is correct
18 Correct 8 ms 10000 KB Output is correct
19 Correct 40 ms 11908 KB Output is correct
20 Correct 125 ms 17360 KB Output is correct
21 Correct 271 ms 25876 KB Output is correct
22 Correct 276 ms 26020 KB Output is correct
23 Correct 270 ms 25816 KB Output is correct
24 Correct 271 ms 25972 KB Output is correct
25 Correct 262 ms 25836 KB Output is correct
26 Correct 264 ms 25732 KB Output is correct
27 Correct 266 ms 25728 KB Output is correct
28 Correct 262 ms 26020 KB Output is correct
29 Correct 267 ms 25984 KB Output is correct
30 Correct 279 ms 25928 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8780 KB Output is correct
2 Correct 6 ms 8848 KB Output is correct
3 Correct 6 ms 10000 KB Output is correct
4 Correct 35 ms 11224 KB Output is correct
5 Correct 108 ms 14856 KB Output is correct
6 Correct 230 ms 20272 KB Output is correct
7 Correct 220 ms 20212 KB Output is correct
8 Correct 215 ms 20412 KB Output is correct
9 Correct 217 ms 20112 KB Output is correct
10 Correct 220 ms 20104 KB Output is correct
11 Correct 221 ms 20104 KB Output is correct
12 Correct 211 ms 20268 KB Output is correct
13 Correct 220 ms 20228 KB Output is correct
14 Correct 223 ms 20380 KB Output is correct
15 Correct 221 ms 20100 KB Output is correct
16 Correct 4 ms 8780 KB Output is correct
17 Correct 6 ms 8868 KB Output is correct
18 Correct 8 ms 10000 KB Output is correct
19 Correct 40 ms 11908 KB Output is correct
20 Correct 125 ms 17360 KB Output is correct
21 Correct 271 ms 25876 KB Output is correct
22 Correct 276 ms 26020 KB Output is correct
23 Correct 270 ms 25816 KB Output is correct
24 Correct 271 ms 25972 KB Output is correct
25 Correct 262 ms 25836 KB Output is correct
26 Correct 264 ms 25732 KB Output is correct
27 Correct 266 ms 25728 KB Output is correct
28 Correct 262 ms 26020 KB Output is correct
29 Correct 267 ms 25984 KB Output is correct
30 Correct 279 ms 25928 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 8848 KB Output is correct
34 Correct 7 ms 10000 KB Output is correct
35 Correct 8 ms 10012 KB Output is correct
36 Correct 8 ms 10000 KB Output is correct
37 Correct 55 ms 11764 KB Output is correct
38 Correct 74 ms 11268 KB Output is correct
39 Correct 286 ms 17672 KB Output is correct
40 Correct 1177 ms 58740 KB Output is correct
41 Correct 2725 ms 143312 KB Output is correct
42 Correct 2744 ms 142440 KB Output is correct
43 Correct 2764 ms 143756 KB Output is correct
44 Correct 2774 ms 142756 KB Output is correct
45 Correct 2705 ms 143324 KB Output is correct
46 Correct 2737 ms 142496 KB Output is correct
47 Correct 2724 ms 143068 KB Output is correct
48 Correct 2711 ms 142824 KB Output is correct
49 Correct 2728 ms 142708 KB Output is correct
50 Correct 2667 ms 144156 KB Output is correct
51 Correct 2722 ms 142852 KB Output is correct
52 Correct 2684 ms 142628 KB Output is correct
53 Correct 2680 ms 143732 KB Output is correct
54 Correct 2681 ms 142768 KB Output is correct
55 Correct 2665 ms 143104 KB Output is correct
56 Correct 2685 ms 142048 KB Output is correct
57 Correct 2727 ms 141952 KB Output is correct
58 Correct 2731 ms 143636 KB Output is correct
59 Correct 2688 ms 142752 KB Output is correct
60 Correct 2718 ms 142920 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8832 KB Output is correct
2 Correct 5 ms 8780 KB Output is correct
3 Correct 4 ms 8780 KB Output is correct
4 Correct 5 ms 8780 KB Output is correct
5 Correct 4 ms 8780 KB Output is correct
6 Correct 5 ms 8780 KB Output is correct
7 Correct 4 ms 8780 KB Output is correct
8 Correct 5 ms 8780 KB Output is correct
9 Correct 5 ms 8780 KB Output is correct
10 Correct 4 ms 8780 KB Output is correct
11 Correct 5 ms 8780 KB Output is correct
12 Correct 6 ms 8848 KB Output is correct
13 Correct 6 ms 10000 KB Output is correct
14 Correct 35 ms 11224 KB Output is correct
15 Correct 108 ms 14856 KB Output is correct
16 Correct 230 ms 20272 KB Output is correct
17 Correct 220 ms 20212 KB Output is correct
18 Correct 215 ms 20412 KB Output is correct
19 Correct 217 ms 20112 KB Output is correct
20 Correct 220 ms 20104 KB Output is correct
21 Correct 221 ms 20104 KB Output is correct
22 Correct 211 ms 20268 KB Output is correct
23 Correct 220 ms 20228 KB Output is correct
24 Correct 223 ms 20380 KB Output is correct
25 Correct 221 ms 20100 KB Output is correct
26 Correct 4 ms 8780 KB Output is correct
27 Correct 6 ms 8868 KB Output is correct
28 Correct 8 ms 10000 KB Output is correct
29 Correct 40 ms 11908 KB Output is correct
30 Correct 125 ms 17360 KB Output is correct
31 Correct 271 ms 25876 KB Output is correct
32 Correct 276 ms 26020 KB Output is correct
33 Correct 270 ms 25816 KB Output is correct
34 Correct 271 ms 25972 KB Output is correct
35 Correct 262 ms 25836 KB Output is correct
36 Correct 264 ms 25732 KB Output is correct
37 Correct 266 ms 25728 KB Output is correct
38 Correct 262 ms 26020 KB Output is correct
39 Correct 267 ms 25984 KB Output is correct
40 Correct 279 ms 25928 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 8848 KB Output is correct
44 Correct 7 ms 10000 KB Output is correct
45 Correct 8 ms 10012 KB Output is correct
46 Correct 8 ms 10000 KB Output is correct
47 Correct 55 ms 11764 KB Output is correct
48 Correct 74 ms 11268 KB Output is correct
49 Correct 286 ms 17672 KB Output is correct
50 Correct 1177 ms 58740 KB Output is correct
51 Correct 2725 ms 143312 KB Output is correct
52 Correct 2744 ms 142440 KB Output is correct
53 Correct 2764 ms 143756 KB Output is correct
54 Correct 2774 ms 142756 KB Output is correct
55 Correct 2705 ms 143324 KB Output is correct
56 Correct 2737 ms 142496 KB Output is correct
57 Correct 2724 ms 143068 KB Output is correct
58 Correct 2711 ms 142824 KB Output is correct
59 Correct 2728 ms 142708 KB Output is correct
60 Correct 2667 ms 144156 KB Output is correct
61 Correct 2722 ms 142852 KB Output is correct
62 Correct 2684 ms 142628 KB Output is correct
63 Correct 2680 ms 143732 KB Output is correct
64 Correct 2681 ms 142768 KB Output is correct
65 Correct 2665 ms 143104 KB Output is correct
66 Correct 2685 ms 142048 KB Output is correct
67 Correct 2727 ms 141952 KB Output is correct
68 Correct 2731 ms 143636 KB Output is correct
69 Correct 2688 ms 142752 KB Output is correct
70 Correct 2718 ms 142920 KB Output is correct
71 Correct 82 ms 10940 KB Output is correct
72 Correct 87 ms 10852 KB Output is correct
73 Correct 83 ms 10920 KB Output is correct
74 Correct 83 ms 10884 KB Output is correct
75 Correct 80 ms 10928 KB Output is correct
76 Correct 333 ms 13336 KB Output is correct
77 Correct 342 ms 13372 KB Output is correct
78 Correct 330 ms 13332 KB Output is correct
79 Correct 335 ms 13364 KB Output is correct
80 Correct 334 ms 13312 KB Output is correct
81 Correct 1423 ms 23676 KB Output is correct
82 Correct 1392 ms 23596 KB Output is correct
83 Correct 1392 ms 23636 KB Output is correct
84 Correct 1450 ms 23524 KB Output is correct
85 Correct 1459 ms 24280 KB Output is correct
86 Correct 1313 ms 19456 KB Output is correct
87 Correct 1301 ms 19484 KB Output is correct
88 Correct 1323 ms 18936 KB Output is correct
89 Correct 1296 ms 19424 KB Output is correct
90 Correct 1301 ms 19060 KB Output is correct
91 Correct 2329 ms 22628 KB Output is correct
92 Correct 2341 ms 22544 KB Output is correct
93 Correct 2307 ms 22528 KB Output is correct
94 Correct 2366 ms 22012 KB Output is correct
95 Correct 2320 ms 22520 KB Output is correct
96 Correct 1820 ms 22096 KB Output is correct
97 Correct 1792 ms 22240 KB Output is correct
98 Correct 1761 ms 22100 KB Output is correct
99 Correct 1744 ms 22164 KB Output is correct
100 Correct 1794 ms 22092 KB Output is correct
101 Correct 1700 ms 22188 KB Output is correct
102 Correct 1721 ms 22064 KB Output is correct
103 Correct 1727 ms 22268 KB Output is correct
104 Correct 1705 ms 22440 KB Output is correct
105 Correct 1750 ms 22280 KB Output is correct
106 Correct 1377 ms 22816 KB Output is correct
107 Correct 1384 ms 22740 KB Output is correct
108 Correct 1381 ms 22744 KB Output is correct
109 Correct 1398 ms 22768 KB Output is correct
110 Correct 1400 ms 22632 KB Output is correct
111 Correct 1406 ms 22828 KB Output is correct
112 Correct 1383 ms 22748 KB Output is correct
113 Correct 1396 ms 22808 KB Output is correct
114 Correct 1404 ms 22692 KB Output is correct
115 Correct 1408 ms 22792 KB Output is correct

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8832 KB Output is correct
2 Correct 5 ms 8780 KB Output is correct
3 Correct 4 ms 8780 KB Output is correct
4 Correct 5 ms 8780 KB Output is correct
5 Correct 4 ms 8780 KB Output is correct
6 Correct 5 ms 8780 KB Output is correct
7 Correct 4 ms 8780 KB Output is correct
8 Correct 5 ms 8780 KB Output is correct
9 Correct 5 ms 8780 KB Output is correct
10 Correct 4 ms 8780 KB Output is correct
11 Correct 5 ms 8780 KB Output is correct
12 Correct 6 ms 8848 KB Output is correct
13 Correct 6 ms 10000 KB Output is correct
14 Correct 35 ms 11224 KB Output is correct
15 Correct 108 ms 14856 KB Output is correct
16 Correct 230 ms 20272 KB Output is correct
17 Correct 220 ms 20212 KB Output is correct
18 Correct 215 ms 20412 KB Output is correct
19 Correct 217 ms 20112 KB Output is correct
20 Correct 220 ms 20104 KB Output is correct
21 Correct 221 ms 20104 KB Output is correct
22 Correct 211 ms 20268 KB Output is correct
23 Correct 220 ms 20228 KB Output is correct
24 Correct 223 ms 20380 KB Output is correct
25 Correct 221 ms 20100 KB Output is correct
26 Correct 4 ms 8780 KB Output is correct
27 Correct 6 ms 8868 KB Output is correct
28 Correct 8 ms 10000 KB Output is correct
29 Correct 40 ms 11908 KB Output is correct
30 Correct 125 ms 17360 KB Output is correct
31 Correct 271 ms 25876 KB Output is correct
32 Correct 276 ms 26020 KB Output is correct
33 Correct 270 ms 25816 KB Output is correct
34 Correct 271 ms 25972 KB Output is correct
35 Correct 262 ms 25836 KB Output is correct
36 Correct 264 ms 25732 KB Output is correct
37 Correct 266 ms 25728 KB Output is correct
38 Correct 262 ms 26020 KB Output is correct
39 Correct 267 ms 25984 KB Output is correct
40 Correct 279 ms 25928 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 8848 KB Output is correct
44 Correct 7 ms 10000 KB Output is correct
45 Correct 8 ms 10012 KB Output is correct
46 Correct 8 ms 10000 KB Output is correct
47 Correct 55 ms 11764 KB Output is correct
48 Correct 74 ms 11268 KB Output is correct
49 Correct 286 ms 17672 KB Output is correct
50 Correct 1177 ms 58740 KB Output is correct
51 Correct 2725 ms 143312 KB Output is correct
52 Correct 2744 ms 142440 KB Output is correct
53 Correct 2764 ms 143756 KB Output is correct
54 Correct 2774 ms 142756 KB Output is correct
55 Correct 2705 ms 143324 KB Output is correct
56 Correct 2737 ms 142496 KB Output is correct
57 Correct 2724 ms 143068 KB Output is correct
58 Correct 2711 ms 142824 KB Output is correct
59 Correct 2728 ms 142708 KB Output is correct
60 Correct 2667 ms 144156 KB Output is correct
61 Correct 2722 ms 142852 KB Output is correct
62 Correct 2684 ms 142628 KB Output is correct
63 Correct 2680 ms 143732 KB Output is correct
64 Correct 2681 ms 142768 KB Output is correct
65 Correct 2665 ms 143104 KB Output is correct
66 Correct 2685 ms 142048 KB Output is correct
67 Correct 2727 ms 141952 KB Output is correct
68 Correct 2731 ms 143636 KB Output is correct
69 Correct 2688 ms 142752 KB Output is correct
70 Correct 2718 ms 142920 KB Output is correct
71 Correct 82 ms 10940 KB Output is correct
72 Correct 87 ms 10852 KB Output is correct
73 Correct 83 ms 10920 KB Output is correct
74 Correct 83 ms 10884 KB Output is correct
75 Correct 80 ms 10928 KB Output is correct
76 Correct 333 ms 13336 KB Output is correct
77 Correct 342 ms 13372 KB Output is correct
78 Correct 330 ms 13332 KB Output is correct
79 Correct 335 ms 13364 KB Output is correct
80 Correct 334 ms 13312 KB Output is correct
81 Correct 1423 ms 23676 KB Output is correct
82 Correct 1392 ms 23596 KB Output is correct
83 Correct 1392 ms 23636 KB Output is correct
84 Correct 1450 ms 23524 KB Output is correct
85 Correct 1459 ms 24280 KB Output is correct
86 Correct 1313 ms 19456 KB Output is correct
87 Correct 1301 ms 19484 KB Output is correct
88 Correct 1323 ms 18936 KB Output is correct
89 Correct 1296 ms 19424 KB Output is correct
90 Correct 1301 ms 19060 KB Output is correct
91 Correct 2329 ms 22628 KB Output is correct
92 Correct 2341 ms 22544 KB Output is correct
93 Correct 2307 ms 22528 KB Output is correct
94 Correct 2366 ms 22012 KB Output is correct
95 Correct 2320 ms 22520 KB Output is correct
96 Correct 1820 ms 22096 KB Output is correct
97 Correct 1792 ms 22240 KB Output is correct
98 Correct 1761 ms 22100 KB Output is correct
99 Correct 1744 ms 22164 KB Output is correct
100 Correct 1794 ms 22092 KB Output is correct
101 Correct 1700 ms 22188 KB Output is correct
102 Correct 1721 ms 22064 KB Output is correct
103 Correct 1727 ms 22268 KB Output is correct
104 Correct 1705 ms 22440 KB Output is correct
105 Correct 1750 ms 22280 KB Output is correct
106 Correct 1377 ms 22816 KB Output is correct
107 Correct 1384 ms 22740 KB Output is correct
108 Correct 1381 ms 22744 KB Output is correct
109 Correct 1398 ms 22768 KB Output is correct
110 Correct 1400 ms 22632 KB Output is correct
111 Correct 1406 ms 22828 KB Output is correct
112 Correct 1383 ms 22748 KB Output is correct
113 Correct 1396 ms 22808 KB Output is correct
114 Correct 1404 ms 22692 KB Output is correct
115 Correct 1408 ms 22792 KB Output is correct
116 Runtime error 682 ms 21144 KB Execution killed with signal 11
117 Halted 0 ms 0 KB -