oj.uz

Submission #752651

# Submission time Handle Problem Language Result Execution time Memory
752651 2023-06-03T11:18:40 Z 이동현(#9968) Diversity (CEOI21_diversity) C++17
64 / 100
 1039 ms 16824 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define int long long
#define mi(x, y) (x = min(x, y))
#define ma(x, y) (x = max(x, y))
using namespace std;

const int NS = (int)3e5 + 4, TS = 150014, QS = 50004;
int n, q;
int t1[TS], t2[TS], t3[TS], t4[TS];
int a[NS];
int stkn;
int fir[NS], ed[NS], cnt[NS], pos[NS], stk[NS];
int B, out[QS];

struct Data{
    int l, r, id;
    Data(){}
    bool operator<(const Data&R)const{
        return (l / B < R.l / B) || (l / B == R.l / B && r < R.r);
    }
}que[QS];

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    memset(ed, -1, sizeof(ed));
    int n, q;
    cin >> n >> q;
    for(int i = 1; i <= n; ++i){
        cin >> a[i];
    }
    for(int i = 1; i <= q; ++i){
        cin >> que[i].l >> que[i].r;
        que[i].id = i;
    }

    B = 1300;
    sort(que + 1, que + q + 1);
    int l = 1, r = 0;
    int ans = 0, szans = 0;
    auto upd = [&](int p, int v, int osz){
        --p;
        //cout << p << ' ' << v << ' ' << osz << endl;
        //cout << fir[2] << ' ' << fir[3] << endl;

        szans += (osz + (v > 0 ? v : 0)) * v;
        ans += (osz + (v > 0 ? v : 0)) * v;
        if(p % 2){
            int t1a = 0, t2a = 0, t3a = 0, t4a = 0;
            int t1p = 0, t2p = 0;
            for(int i = TS - 1; i > 0; i -= (i & -i)){
                t1a += t1[i], t2a += t2[i], t3a += t3[i], t4a += t4[i];
            }
            for(int i = p / 2 + 1; i > 0; i -= (i & -i)){
                t1p += t1[i], t2p += t2[i];
            }
            t1a -= osz, t1p -= osz, t2a -= osz * (p / 2), t2p -= osz * (p / 2);

            szans += v * (t3a + t1a);
            //cout << ans << ' ' << szans << ' ' << t3a << ' ' << t4a << endl;
            ans += 2 * v * t3a + (p / 2) * v * t3a + t4a * v;
            ans += v * t1a + ((p / 2) * v * t1p - t2p * v) - ((p / 2) * v * (t1a - t1p) - (t2a - t2p) * v);

            for(int i = p / 2 + 1; i < TS; i += (i & -i)){
                t1[i] += v;
                t2[i] += v * (p / 2);
            }
        }
        else{
            int t1a = 0, t2a = 0, t3a = 0, t4a = 0;
            int t3p = 0, t4p = 0;
            for(int i = TS - 1; i > 0; i -= (i & -i)){
                t1a += t1[i], t2a += t2[i], t3a += t3[i], t4a += t4[i];
            }
            for(int i = p / 2 + 1; i > 0; i -= (i & -i)){
                t3p += t3[i], t4p += t4[i];
            }
            t3a -= osz, t3p -= osz, t4a -= osz * (p / 2), t4p -= osz * (p / 2);

            //cout << "SDF" << ' ' << t1a << ' ' << t2a << ' ' << t3a << ' ' << t4a << ' ' << t3p << ' ' << t4p << endl;

            szans += v * (t1a + t3a);
            ans += 2 * v * t1a + (p / 2) * v * t1a + t2a * v;
            ans += v * t3a + ((p / 2) * v * t3p - t4p * v) - ((p / 2) * v * (t3a - t3p) - (t4a - t4p) * v);

            for(int i = p / 2 + 1; i < TS; i += (i & -i)){
                t3[i] += v;
                t4[i] += v * (p / 2);
            }
        }

        //cout << ans << ' ' << szans << endl;
    };
    auto add = [&](int val){
        if(!cnt[val]) pos[val] = ++stkn, stk[stkn] = val;
        int ch1 = pos[val], osz = cnt[val];
        if(cnt[val] && stk[fir[cnt[val]]] != val){
            int nxt = stk[fir[cnt[val]]];
            ch1 = pos[nxt];
            swap(stk[pos[val]], stk[pos[nxt]]);
            swap(pos[val], pos[nxt]);
        }
        ++fir[cnt[val]];
        ++cnt[val];
        if(fir[cnt[val]] > ed[cnt[val]]) fir[cnt[val]] = ed[cnt[val]] = pos[val];
        else ++ed[cnt[val]];

        upd(ch1, 1, osz);
    };
    auto del = [&](int val){
        int ch1 = pos[val], osz = cnt[val];
        if(stk[ed[cnt[val]]] != val){
            int nxt = stk[ed[cnt[val]]];
            ch1 = pos[nxt];
            swap(stk[pos[val]], stk[pos[nxt]]);
            swap(pos[val], pos[nxt]);
        }
        --ed[cnt[val]];
        ++cnt[val];
        if(fir[cnt[val]] > ed[cnt[val]]) fir[cnt[val]] = ed[cnt[val]] = pos[val];
        else --fir[cnt[val]];

        upd(ch1, -1, osz);

        if(!cnt[val]) stk[stkn] = 0, --stkn, pos[val] = 0;
    };
    for(int i = 1; i <= q; ++i){
        while(r < que[i].r){
            ++r;
            add(a[r]);
        }
        while(l > que[i].l){
            --l;
            add(a[l]);
        }
        while(r > que[i].r){
            del(a[r]);
            --r;
        }
        while(l < que[i].l){
            del(a[l]);
            ++l;
        }

        out[que[i].id] = ans - szans * stkn + stkn * (que[i].r - que[i].l + 1) * (que[i].r - que[i].l + 2) / 2;
    }

    for(int i = 1; i <= q; ++i){
        cout << out[i] << '\n';
    }
    
    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2772 KB Output is correct
2 Correct 1 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2812 KB Output is correct
6 Correct 1 ms 2772 KB Output is correct
7 Correct 2 ms 2816 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 2 ms 2900 KB Output is correct
3 Correct 4 ms 2900 KB Output is correct
4 Correct 25 ms 3980 KB Output is correct
5 Correct 43 ms 5412 KB Output is correct
6 Correct 65 ms 6256 KB Output is correct
7 Correct 65 ms 6988 KB Output is correct
8 Correct 58 ms 6228 KB Output is correct
9 Correct 61 ms 6152 KB Output is correct
10 Correct 59 ms 6624 KB Output is correct
11 Correct 72 ms 6380 KB Output is correct
12 Correct 62 ms 6192 KB Output is correct
13 Correct 63 ms 6160 KB Output is correct
14 Correct 59 ms 6416 KB Output is correct
15 Correct 63 ms 6280 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 2 ms 2900 KB Output is correct
3 Correct 4 ms 2900 KB Output is correct
4 Correct 25 ms 3980 KB Output is correct
5 Correct 43 ms 5412 KB Output is correct
6 Correct 65 ms 6256 KB Output is correct
7 Correct 65 ms 6988 KB Output is correct
8 Correct 58 ms 6228 KB Output is correct
9 Correct 61 ms 6152 KB Output is correct
10 Correct 59 ms 6624 KB Output is correct
11 Correct 72 ms 6380 KB Output is correct
12 Correct 62 ms 6192 KB Output is correct
13 Correct 63 ms 6160 KB Output is correct
14 Correct 59 ms 6416 KB Output is correct
15 Correct 63 ms 6280 KB Output is correct
16 Correct 2 ms 2820 KB Output is correct
17 Correct 2 ms 2900 KB Output is correct
18 Correct 4 ms 3012 KB Output is correct
19 Correct 23 ms 4024 KB Output is correct
20 Correct 51 ms 5096 KB Output is correct
21 Correct 61 ms 6448 KB Output is correct
22 Correct 74 ms 6208 KB Output is correct
23 Correct 72 ms 6380 KB Output is correct
24 Correct 68 ms 6212 KB Output is correct
25 Correct 63 ms 6372 KB Output is correct
26 Correct 70 ms 6276 KB Output is correct
27 Correct 60 ms 6348 KB Output is correct
28 Correct 64 ms 6516 KB Output is correct
29 Correct 62 ms 6228 KB Output is correct
30 Correct 60 ms 6332 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 2 ms 2900 KB Output is correct
3 Correct 4 ms 2900 KB Output is correct
4 Correct 25 ms 3980 KB Output is correct
5 Correct 43 ms 5412 KB Output is correct
6 Correct 65 ms 6256 KB Output is correct
7 Correct 65 ms 6988 KB Output is correct
8 Correct 58 ms 6228 KB Output is correct
9 Correct 61 ms 6152 KB Output is correct
10 Correct 59 ms 6624 KB Output is correct
11 Correct 72 ms 6380 KB Output is correct
12 Correct 62 ms 6192 KB Output is correct
13 Correct 63 ms 6160 KB Output is correct
14 Correct 59 ms 6416 KB Output is correct
15 Correct 63 ms 6280 KB Output is correct
16 Correct 2 ms 2820 KB Output is correct
17 Correct 2 ms 2900 KB Output is correct
18 Correct 4 ms 3012 KB Output is correct
19 Correct 23 ms 4024 KB Output is correct
20 Correct 51 ms 5096 KB Output is correct
21 Correct 61 ms 6448 KB Output is correct
22 Correct 74 ms 6208 KB Output is correct
23 Correct 72 ms 6380 KB Output is correct
24 Correct 68 ms 6212 KB Output is correct
25 Correct 63 ms 6372 KB Output is correct
26 Correct 70 ms 6276 KB Output is correct
27 Correct 60 ms 6348 KB Output is correct
28 Correct 64 ms 6516 KB Output is correct
29 Correct 62 ms 6228 KB Output is correct
30 Correct 60 ms 6332 KB Output is correct
31 Correct 2 ms 2812 KB Output is correct
32 Correct 2 ms 2900 KB Output is correct
33 Correct 2 ms 2900 KB Output is correct
34 Correct 4 ms 2956 KB Output is correct
35 Correct 4 ms 2900 KB Output is correct
36 Correct 4 ms 3028 KB Output is correct
37 Correct 14 ms 3464 KB Output is correct
38 Correct 12 ms 3412 KB Output is correct
39 Correct 24 ms 3976 KB Output is correct
40 Correct 52 ms 5228 KB Output is correct
41 Correct 69 ms 6272 KB Output is correct
42 Correct 67 ms 6388 KB Output is correct
43 Correct 64 ms 6404 KB Output is correct
44 Correct 88 ms 6384 KB Output is correct
45 Correct 81 ms 6376 KB Output is correct
46 Correct 63 ms 6392 KB Output is correct
47 Correct 60 ms 6284 KB Output is correct
48 Correct 63 ms 6388 KB Output is correct
49 Correct 66 ms 6356 KB Output is correct
50 Correct 79 ms 6280 KB Output is correct
51 Correct 62 ms 6348 KB Output is correct
52 Correct 60 ms 6384 KB Output is correct
53 Correct 73 ms 6380 KB Output is correct
54 Correct 65 ms 6348 KB Output is correct
55 Correct 62 ms 6392 KB Output is correct
56 Correct 67 ms 6392 KB Output is correct
57 Correct 67 ms 6376 KB Output is correct
58 Correct 71 ms 6376 KB Output is correct
59 Correct 64 ms 6384 KB Output is correct
60 Correct 65 ms 6388 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2772 KB Output is correct
2 Correct 1 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2812 KB Output is correct
6 Correct 1 ms 2772 KB Output is correct
7 Correct 2 ms 2816 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2900 KB Output is correct
13 Correct 4 ms 2900 KB Output is correct
14 Correct 25 ms 3980 KB Output is correct
15 Correct 43 ms 5412 KB Output is correct
16 Correct 65 ms 6256 KB Output is correct
17 Correct 65 ms 6988 KB Output is correct
18 Correct 58 ms 6228 KB Output is correct
19 Correct 61 ms 6152 KB Output is correct
20 Correct 59 ms 6624 KB Output is correct
21 Correct 72 ms 6380 KB Output is correct
22 Correct 62 ms 6192 KB Output is correct
23 Correct 63 ms 6160 KB Output is correct
24 Correct 59 ms 6416 KB Output is correct
25 Correct 63 ms 6280 KB Output is correct
26 Correct 2 ms 2820 KB Output is correct
27 Correct 2 ms 2900 KB Output is correct
28 Correct 4 ms 3012 KB Output is correct
29 Correct 23 ms 4024 KB Output is correct
30 Correct 51 ms 5096 KB Output is correct
31 Correct 61 ms 6448 KB Output is correct
32 Correct 74 ms 6208 KB Output is correct
33 Correct 72 ms 6380 KB Output is correct
34 Correct 68 ms 6212 KB Output is correct
35 Correct 63 ms 6372 KB Output is correct
36 Correct 70 ms 6276 KB Output is correct
37 Correct 60 ms 6348 KB Output is correct
38 Correct 64 ms 6516 KB Output is correct
39 Correct 62 ms 6228 KB Output is correct
40 Correct 60 ms 6332 KB Output is correct
41 Correct 2 ms 2812 KB Output is correct
42 Correct 2 ms 2900 KB Output is correct
43 Correct 2 ms 2900 KB Output is correct
44 Correct 4 ms 2956 KB Output is correct
45 Correct 4 ms 2900 KB Output is correct
46 Correct 4 ms 3028 KB Output is correct
47 Correct 14 ms 3464 KB Output is correct
48 Correct 12 ms 3412 KB Output is correct
49 Correct 24 ms 3976 KB Output is correct
50 Correct 52 ms 5228 KB Output is correct
51 Correct 69 ms 6272 KB Output is correct
52 Correct 67 ms 6388 KB Output is correct
53 Correct 64 ms 6404 KB Output is correct
54 Correct 88 ms 6384 KB Output is correct
55 Correct 81 ms 6376 KB Output is correct
56 Correct 63 ms 6392 KB Output is correct
57 Correct 60 ms 6284 KB Output is correct
58 Correct 63 ms 6388 KB Output is correct
59 Correct 66 ms 6356 KB Output is correct
60 Correct 79 ms 6280 KB Output is correct
61 Correct 62 ms 6348 KB Output is correct
62 Correct 60 ms 6384 KB Output is correct
63 Correct 73 ms 6380 KB Output is correct
64 Correct 65 ms 6348 KB Output is correct
65 Correct 62 ms 6392 KB Output is correct
66 Correct 67 ms 6392 KB Output is correct
67 Correct 67 ms 6376 KB Output is correct
68 Correct 71 ms 6376 KB Output is correct
69 Correct 64 ms 6384 KB Output is correct
70 Correct 65 ms 6388 KB Output is correct
71 Correct 12 ms 3548 KB Output is correct
72 Correct 15 ms 3552 KB Output is correct
73 Correct 13 ms 3540 KB Output is correct
74 Correct 12 ms 3548 KB Output is correct
75 Correct 12 ms 3460 KB Output is correct
76 Correct 22 ms 4224 KB Output is correct
77 Correct 23 ms 4284 KB Output is correct
78 Correct 24 ms 4264 KB Output is correct
79 Correct 27 ms 4252 KB Output is correct
80 Correct 32 ms 4232 KB Output is correct
81 Correct 48 ms 5660 KB Output is correct
82 Correct 42 ms 5708 KB Output is correct
83 Correct 59 ms 5652 KB Output is correct
84 Correct 43 ms 5748 KB Output is correct
85 Correct 49 ms 5748 KB Output is correct
86 Correct 57 ms 6224 KB Output is correct
87 Correct 44 ms 6228 KB Output is correct
88 Correct 58 ms 6204 KB Output is correct
89 Correct 51 ms 6140 KB Output is correct
90 Correct 45 ms 6220 KB Output is correct
91 Correct 64 ms 10692 KB Output is correct
92 Correct 72 ms 10700 KB Output is correct
93 Correct 78 ms 10756 KB Output is correct
94 Correct 90 ms 10844 KB Output is correct
95 Correct 68 ms 10756 KB Output is correct
96 Correct 79 ms 14848 KB Output is correct
97 Correct 73 ms 14840 KB Output is correct
98 Correct 76 ms 14836 KB Output is correct
99 Correct 68 ms 14792 KB Output is correct
100 Correct 80 ms 14736 KB Output is correct
101 Correct 69 ms 14820 KB Output is correct
102 Correct 74 ms 14852 KB Output is correct
103 Correct 89 ms 14780 KB Output is correct
104 Correct 85 ms 14828 KB Output is correct
105 Correct 80 ms 14824 KB Output is correct
106 Correct 85 ms 16748 KB Output is correct
107 Correct 75 ms 16808 KB Output is correct
108 Correct 68 ms 16716 KB Output is correct
109 Correct 80 ms 16764 KB Output is correct
110 Correct 93 ms 16776 KB Output is correct
111 Correct 69 ms 16716 KB Output is correct
112 Correct 72 ms 16716 KB Output is correct
113 Correct 66 ms 16744 KB Output is correct
114 Correct 82 ms 16824 KB Output is correct
115 Correct 77 ms 16816 KB Output is correct

Subtask #6
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2772 KB Output is correct
2 Correct 1 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2812 KB Output is correct
6 Correct 1 ms 2772 KB Output is correct
7 Correct 2 ms 2816 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2900 KB Output is correct
13 Correct 4 ms 2900 KB Output is correct
14 Correct 25 ms 3980 KB Output is correct
15 Correct 43 ms 5412 KB Output is correct
16 Correct 65 ms 6256 KB Output is correct
17 Correct 65 ms 6988 KB Output is correct
18 Correct 58 ms 6228 KB Output is correct
19 Correct 61 ms 6152 KB Output is correct
20 Correct 59 ms 6624 KB Output is correct
21 Correct 72 ms 6380 KB Output is correct
22 Correct 62 ms 6192 KB Output is correct
23 Correct 63 ms 6160 KB Output is correct
24 Correct 59 ms 6416 KB Output is correct
25 Correct 63 ms 6280 KB Output is correct
26 Correct 2 ms 2820 KB Output is correct
27 Correct 2 ms 2900 KB Output is correct
28 Correct 4 ms 3012 KB Output is correct
29 Correct 23 ms 4024 KB Output is correct
30 Correct 51 ms 5096 KB Output is correct
31 Correct 61 ms 6448 KB Output is correct
32 Correct 74 ms 6208 KB Output is correct
33 Correct 72 ms 6380 KB Output is correct
34 Correct 68 ms 6212 KB Output is correct
35 Correct 63 ms 6372 KB Output is correct
36 Correct 70 ms 6276 KB Output is correct
37 Correct 60 ms 6348 KB Output is correct
38 Correct 64 ms 6516 KB Output is correct
39 Correct 62 ms 6228 KB Output is correct
40 Correct 60 ms 6332 KB Output is correct
41 Correct 2 ms 2812 KB Output is correct
42 Correct 2 ms 2900 KB Output is correct
43 Correct 2 ms 2900 KB Output is correct
44 Correct 4 ms 2956 KB Output is correct
45 Correct 4 ms 2900 KB Output is correct
46 Correct 4 ms 3028 KB Output is correct
47 Correct 14 ms 3464 KB Output is correct
48 Correct 12 ms 3412 KB Output is correct
49 Correct 24 ms 3976 KB Output is correct
50 Correct 52 ms 5228 KB Output is correct
51 Correct 69 ms 6272 KB Output is correct
52 Correct 67 ms 6388 KB Output is correct
53 Correct 64 ms 6404 KB Output is correct
54 Correct 88 ms 6384 KB Output is correct
55 Correct 81 ms 6376 KB Output is correct
56 Correct 63 ms 6392 KB Output is correct
57 Correct 60 ms 6284 KB Output is correct
58 Correct 63 ms 6388 KB Output is correct
59 Correct 66 ms 6356 KB Output is correct
60 Correct 79 ms 6280 KB Output is correct
61 Correct 62 ms 6348 KB Output is correct
62 Correct 60 ms 6384 KB Output is correct
63 Correct 73 ms 6380 KB Output is correct
64 Correct 65 ms 6348 KB Output is correct
65 Correct 62 ms 6392 KB Output is correct
66 Correct 67 ms 6392 KB Output is correct
67 Correct 67 ms 6376 KB Output is correct
68 Correct 71 ms 6376 KB Output is correct
69 Correct 64 ms 6384 KB Output is correct
70 Correct 65 ms 6388 KB Output is correct
71 Correct 12 ms 3548 KB Output is correct
72 Correct 15 ms 3552 KB Output is correct
73 Correct 13 ms 3540 KB Output is correct
74 Correct 12 ms 3548 KB Output is correct
75 Correct 12 ms 3460 KB Output is correct
76 Correct 22 ms 4224 KB Output is correct
77 Correct 23 ms 4284 KB Output is correct
78 Correct 24 ms 4264 KB Output is correct
79 Correct 27 ms 4252 KB Output is correct
80 Correct 32 ms 4232 KB Output is correct
81 Correct 48 ms 5660 KB Output is correct
82 Correct 42 ms 5708 KB Output is correct
83 Correct 59 ms 5652 KB Output is correct
84 Correct 43 ms 5748 KB Output is correct
85 Correct 49 ms 5748 KB Output is correct
86 Correct 57 ms 6224 KB Output is correct
87 Correct 44 ms 6228 KB Output is correct
88 Correct 58 ms 6204 KB Output is correct
89 Correct 51 ms 6140 KB Output is correct
90 Correct 45 ms 6220 KB Output is correct
91 Correct 64 ms 10692 KB Output is correct
92 Correct 72 ms 10700 KB Output is correct
93 Correct 78 ms 10756 KB Output is correct
94 Correct 90 ms 10844 KB Output is correct
95 Correct 68 ms 10756 KB Output is correct
96 Correct 79 ms 14848 KB Output is correct
97 Correct 73 ms 14840 KB Output is correct
98 Correct 76 ms 14836 KB Output is correct
99 Correct 68 ms 14792 KB Output is correct
100 Correct 80 ms 14736 KB Output is correct
101 Correct 69 ms 14820 KB Output is correct
102 Correct 74 ms 14852 KB Output is correct
103 Correct 89 ms 14780 KB Output is correct
104 Correct 85 ms 14828 KB Output is correct
105 Correct 80 ms 14824 KB Output is correct
106 Correct 85 ms 16748 KB Output is correct
107 Correct 75 ms 16808 KB Output is correct
108 Correct 68 ms 16716 KB Output is correct
109 Correct 80 ms 16764 KB Output is correct
110 Correct 93 ms 16776 KB Output is correct
111 Correct 69 ms 16716 KB Output is correct
112 Correct 72 ms 16716 KB Output is correct
113 Correct 66 ms 16744 KB Output is correct
114 Correct 82 ms 16824 KB Output is correct
115 Correct 77 ms 16816 KB Output is correct
116 Runtime error 1039 ms 15352 KB Execution killed with signal 11
117 Halted 0 ms 0 KB -