oj.uz

답안 #752652

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
752652 2023-06-03T11:21:04 Z 이동현(#9968) Diversity (CEOI21_diversity) C++17
64 / 100
 964 ms 14888 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(cnt[val] && 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

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 21 ms 3816 KB Output is correct
5 Correct 40 ms 4944 KB Output is correct
6 Correct 59 ms 5596 KB Output is correct
7 Correct 57 ms 6364 KB Output is correct
8 Correct 60 ms 5604 KB Output is correct
9 Correct 59 ms 5612 KB Output is correct
10 Correct 59 ms 5872 KB Output is correct
11 Correct 61 ms 5708 KB Output is correct
12 Correct 65 ms 5608 KB Output is correct
13 Correct 59 ms 5492 KB Output is correct
14 Correct 59 ms 5712 KB Output is correct
15 Correct 66 ms 5636 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 21 ms 3816 KB Output is correct
5 Correct 40 ms 4944 KB Output is correct
6 Correct 59 ms 5596 KB Output is correct
7 Correct 57 ms 6364 KB Output is correct
8 Correct 60 ms 5604 KB Output is correct
9 Correct 59 ms 5612 KB Output is correct
10 Correct 59 ms 5872 KB Output is correct
11 Correct 61 ms 5708 KB Output is correct
12 Correct 65 ms 5608 KB Output is correct
13 Correct 59 ms 5492 KB Output is correct
14 Correct 59 ms 5712 KB Output is correct
15 Correct 66 ms 5636 KB Output is correct
16 Correct 2 ms 2772 KB Output is correct
17 Correct 1 ms 2900 KB Output is correct
18 Correct 5 ms 2900 KB Output is correct
19 Correct 22 ms 3808 KB Output is correct
20 Correct 40 ms 4564 KB Output is correct
21 Correct 64 ms 5676 KB Output is correct
22 Correct 63 ms 5448 KB Output is correct
23 Correct 68 ms 5500 KB Output is correct
24 Correct 62 ms 5380 KB Output is correct
25 Correct 60 ms 5452 KB Output is correct
26 Correct 61 ms 5524 KB Output is correct
27 Correct 61 ms 5512 KB Output is correct
28 Correct 61 ms 5716 KB Output is correct
29 Correct 59 ms 5452 KB Output is correct
30 Correct 61 ms 5524 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 21 ms 3816 KB Output is correct
5 Correct 40 ms 4944 KB Output is correct
6 Correct 59 ms 5596 KB Output is correct
7 Correct 57 ms 6364 KB Output is correct
8 Correct 60 ms 5604 KB Output is correct
9 Correct 59 ms 5612 KB Output is correct
10 Correct 59 ms 5872 KB Output is correct
11 Correct 61 ms 5708 KB Output is correct
12 Correct 65 ms 5608 KB Output is correct
13 Correct 59 ms 5492 KB Output is correct
14 Correct 59 ms 5712 KB Output is correct
15 Correct 66 ms 5636 KB Output is correct
16 Correct 2 ms 2772 KB Output is correct
17 Correct 1 ms 2900 KB Output is correct
18 Correct 5 ms 2900 KB Output is correct
19 Correct 22 ms 3808 KB Output is correct
20 Correct 40 ms 4564 KB Output is correct
21 Correct 64 ms 5676 KB Output is correct
22 Correct 63 ms 5448 KB Output is correct
23 Correct 68 ms 5500 KB Output is correct
24 Correct 62 ms 5380 KB Output is correct
25 Correct 60 ms 5452 KB Output is correct
26 Correct 61 ms 5524 KB Output is correct
27 Correct 61 ms 5512 KB Output is correct
28 Correct 61 ms 5716 KB Output is correct
29 Correct 59 ms 5452 KB Output is correct
30 Correct 61 ms 5524 KB Output is correct
31 Correct 2 ms 2900 KB Output is correct
32 Correct 2 ms 2900 KB Output is correct
33 Correct 2 ms 2900 KB Output is correct
34 Correct 3 ms 2900 KB Output is correct
35 Correct 3 ms 2900 KB Output is correct
36 Correct 4 ms 2912 KB Output is correct
37 Correct 13 ms 3288 KB Output is correct
38 Correct 12 ms 3308 KB Output is correct
39 Correct 21 ms 3588 KB Output is correct
40 Correct 40 ms 4476 KB Output is correct
41 Correct 63 ms 5244 KB Output is correct
42 Correct 60 ms 5264 KB Output is correct
43 Correct 64 ms 5324 KB Output is correct
44 Correct 61 ms 5236 KB Output is correct
45 Correct 63 ms 5232 KB Output is correct
46 Correct 59 ms 5240 KB Output is correct
47 Correct 61 ms 5204 KB Output is correct
48 Correct 61 ms 5248 KB Output is correct
49 Correct 63 ms 5184 KB Output is correct
50 Correct 67 ms 5192 KB Output is correct
51 Correct 61 ms 5244 KB Output is correct
52 Correct 63 ms 5256 KB Output is correct
53 Correct 59 ms 5196 KB Output is correct
54 Correct 60 ms 5244 KB Output is correct
55 Correct 60 ms 5236 KB Output is correct
56 Correct 64 ms 5248 KB Output is correct
57 Correct 62 ms 5240 KB Output is correct
58 Correct 61 ms 5172 KB Output is correct
59 Correct 60 ms 5240 KB Output is correct
60 Correct 66 ms 5204 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2772 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 1 ms 2772 KB Output is correct
5 Correct 1 ms 2772 KB Output is correct
6 Correct 2 ms 2772 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 1 ms 2772 KB Output is correct
9 Correct 1 ms 2772 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 1 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 21 ms 3816 KB Output is correct
15 Correct 40 ms 4944 KB Output is correct
16 Correct 59 ms 5596 KB Output is correct
17 Correct 57 ms 6364 KB Output is correct
18 Correct 60 ms 5604 KB Output is correct
19 Correct 59 ms 5612 KB Output is correct
20 Correct 59 ms 5872 KB Output is correct
21 Correct 61 ms 5708 KB Output is correct
22 Correct 65 ms 5608 KB Output is correct
23 Correct 59 ms 5492 KB Output is correct
24 Correct 59 ms 5712 KB Output is correct
25 Correct 66 ms 5636 KB Output is correct
26 Correct 2 ms 2772 KB Output is correct
27 Correct 1 ms 2900 KB Output is correct
28 Correct 5 ms 2900 KB Output is correct
29 Correct 22 ms 3808 KB Output is correct
30 Correct 40 ms 4564 KB Output is correct
31 Correct 64 ms 5676 KB Output is correct
32 Correct 63 ms 5448 KB Output is correct
33 Correct 68 ms 5500 KB Output is correct
34 Correct 62 ms 5380 KB Output is correct
35 Correct 60 ms 5452 KB Output is correct
36 Correct 61 ms 5524 KB Output is correct
37 Correct 61 ms 5512 KB Output is correct
38 Correct 61 ms 5716 KB Output is correct
39 Correct 59 ms 5452 KB Output is correct
40 Correct 61 ms 5524 KB Output is correct
41 Correct 2 ms 2900 KB Output is correct
42 Correct 2 ms 2900 KB Output is correct
43 Correct 2 ms 2900 KB Output is correct
44 Correct 3 ms 2900 KB Output is correct
45 Correct 3 ms 2900 KB Output is correct
46 Correct 4 ms 2912 KB Output is correct
47 Correct 13 ms 3288 KB Output is correct
48 Correct 12 ms 3308 KB Output is correct
49 Correct 21 ms 3588 KB Output is correct
50 Correct 40 ms 4476 KB Output is correct
51 Correct 63 ms 5244 KB Output is correct
52 Correct 60 ms 5264 KB Output is correct
53 Correct 64 ms 5324 KB Output is correct
54 Correct 61 ms 5236 KB Output is correct
55 Correct 63 ms 5232 KB Output is correct
56 Correct 59 ms 5240 KB Output is correct
57 Correct 61 ms 5204 KB Output is correct
58 Correct 61 ms 5248 KB Output is correct
59 Correct 63 ms 5184 KB Output is correct
60 Correct 67 ms 5192 KB Output is correct
61 Correct 61 ms 5244 KB Output is correct
62 Correct 63 ms 5256 KB Output is correct
63 Correct 59 ms 5196 KB Output is correct
64 Correct 60 ms 5244 KB Output is correct
65 Correct 60 ms 5236 KB Output is correct
66 Correct 64 ms 5248 KB Output is correct
67 Correct 62 ms 5240 KB Output is correct
68 Correct 61 ms 5172 KB Output is correct
69 Correct 60 ms 5240 KB Output is correct
70 Correct 66 ms 5204 KB Output is correct
71 Correct 11 ms 3284 KB Output is correct
72 Correct 13 ms 3284 KB Output is correct
73 Correct 13 ms 3300 KB Output is correct
74 Correct 13 ms 3284 KB Output is correct
75 Correct 12 ms 3284 KB Output is correct
76 Correct 23 ms 3796 KB Output is correct
77 Correct 21 ms 3708 KB Output is correct
78 Correct 21 ms 3844 KB Output is correct
79 Correct 21 ms 3812 KB Output is correct
80 Correct 22 ms 3836 KB Output is correct
81 Correct 41 ms 4768 KB Output is correct
82 Correct 44 ms 4796 KB Output is correct
83 Correct 40 ms 4792 KB Output is correct
84 Correct 43 ms 4792 KB Output is correct
85 Correct 40 ms 4692 KB Output is correct
86 Correct 43 ms 5156 KB Output is correct
87 Correct 43 ms 5152 KB Output is correct
88 Correct 42 ms 5156 KB Output is correct
89 Correct 44 ms 5120 KB Output is correct
90 Correct 44 ms 5108 KB Output is correct
91 Correct 66 ms 8988 KB Output is correct
92 Correct 62 ms 9072 KB Output is correct
93 Correct 71 ms 9028 KB Output is correct
94 Correct 62 ms 9044 KB Output is correct
95 Correct 63 ms 8956 KB Output is correct
96 Correct 75 ms 12916 KB Output is correct
97 Correct 77 ms 12864 KB Output is correct
98 Correct 74 ms 12860 KB Output is correct
99 Correct 69 ms 12860 KB Output is correct
100 Correct 66 ms 12876 KB Output is correct
101 Correct 71 ms 12876 KB Output is correct
102 Correct 65 ms 12852 KB Output is correct
103 Correct 67 ms 12888 KB Output is correct
104 Correct 67 ms 12872 KB Output is correct
105 Correct 66 ms 12952 KB Output is correct
106 Correct 64 ms 14860 KB Output is correct
107 Correct 74 ms 14788 KB Output is correct
108 Correct 92 ms 14816 KB Output is correct
109 Correct 73 ms 14808 KB Output is correct
110 Correct 68 ms 14856 KB Output is correct
111 Correct 72 ms 14884 KB Output is correct
112 Correct 67 ms 14832 KB Output is correct
113 Correct 64 ms 14888 KB Output is correct
114 Correct 67 ms 14796 KB Output is correct
115 Correct 64 ms 14844 KB Output is correct

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2772 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 1 ms 2772 KB Output is correct
5 Correct 1 ms 2772 KB Output is correct
6 Correct 2 ms 2772 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 1 ms 2772 KB Output is correct
9 Correct 1 ms 2772 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 1 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 21 ms 3816 KB Output is correct
15 Correct 40 ms 4944 KB Output is correct
16 Correct 59 ms 5596 KB Output is correct
17 Correct 57 ms 6364 KB Output is correct
18 Correct 60 ms 5604 KB Output is correct
19 Correct 59 ms 5612 KB Output is correct
20 Correct 59 ms 5872 KB Output is correct
21 Correct 61 ms 5708 KB Output is correct
22 Correct 65 ms 5608 KB Output is correct
23 Correct 59 ms 5492 KB Output is correct
24 Correct 59 ms 5712 KB Output is correct
25 Correct 66 ms 5636 KB Output is correct
26 Correct 2 ms 2772 KB Output is correct
27 Correct 1 ms 2900 KB Output is correct
28 Correct 5 ms 2900 KB Output is correct
29 Correct 22 ms 3808 KB Output is correct
30 Correct 40 ms 4564 KB Output is correct
31 Correct 64 ms 5676 KB Output is correct
32 Correct 63 ms 5448 KB Output is correct
33 Correct 68 ms 5500 KB Output is correct
34 Correct 62 ms 5380 KB Output is correct
35 Correct 60 ms 5452 KB Output is correct
36 Correct 61 ms 5524 KB Output is correct
37 Correct 61 ms 5512 KB Output is correct
38 Correct 61 ms 5716 KB Output is correct
39 Correct 59 ms 5452 KB Output is correct
40 Correct 61 ms 5524 KB Output is correct
41 Correct 2 ms 2900 KB Output is correct
42 Correct 2 ms 2900 KB Output is correct
43 Correct 2 ms 2900 KB Output is correct
44 Correct 3 ms 2900 KB Output is correct
45 Correct 3 ms 2900 KB Output is correct
46 Correct 4 ms 2912 KB Output is correct
47 Correct 13 ms 3288 KB Output is correct
48 Correct 12 ms 3308 KB Output is correct
49 Correct 21 ms 3588 KB Output is correct
50 Correct 40 ms 4476 KB Output is correct
51 Correct 63 ms 5244 KB Output is correct
52 Correct 60 ms 5264 KB Output is correct
53 Correct 64 ms 5324 KB Output is correct
54 Correct 61 ms 5236 KB Output is correct
55 Correct 63 ms 5232 KB Output is correct
56 Correct 59 ms 5240 KB Output is correct
57 Correct 61 ms 5204 KB Output is correct
58 Correct 61 ms 5248 KB Output is correct
59 Correct 63 ms 5184 KB Output is correct
60 Correct 67 ms 5192 KB Output is correct
61 Correct 61 ms 5244 KB Output is correct
62 Correct 63 ms 5256 KB Output is correct
63 Correct 59 ms 5196 KB Output is correct
64 Correct 60 ms 5244 KB Output is correct
65 Correct 60 ms 5236 KB Output is correct
66 Correct 64 ms 5248 KB Output is correct
67 Correct 62 ms 5240 KB Output is correct
68 Correct 61 ms 5172 KB Output is correct
69 Correct 60 ms 5240 KB Output is correct
70 Correct 66 ms 5204 KB Output is correct
71 Correct 11 ms 3284 KB Output is correct
72 Correct 13 ms 3284 KB Output is correct
73 Correct 13 ms 3300 KB Output is correct
74 Correct 13 ms 3284 KB Output is correct
75 Correct 12 ms 3284 KB Output is correct
76 Correct 23 ms 3796 KB Output is correct
77 Correct 21 ms 3708 KB Output is correct
78 Correct 21 ms 3844 KB Output is correct
79 Correct 21 ms 3812 KB Output is correct
80 Correct 22 ms 3836 KB Output is correct
81 Correct 41 ms 4768 KB Output is correct
82 Correct 44 ms 4796 KB Output is correct
83 Correct 40 ms 4792 KB Output is correct
84 Correct 43 ms 4792 KB Output is correct
85 Correct 40 ms 4692 KB Output is correct
86 Correct 43 ms 5156 KB Output is correct
87 Correct 43 ms 5152 KB Output is correct
88 Correct 42 ms 5156 KB Output is correct
89 Correct 44 ms 5120 KB Output is correct
90 Correct 44 ms 5108 KB Output is correct
91 Correct 66 ms 8988 KB Output is correct
92 Correct 62 ms 9072 KB Output is correct
93 Correct 71 ms 9028 KB Output is correct
94 Correct 62 ms 9044 KB Output is correct
95 Correct 63 ms 8956 KB Output is correct
96 Correct 75 ms 12916 KB Output is correct
97 Correct 77 ms 12864 KB Output is correct
98 Correct 74 ms 12860 KB Output is correct
99 Correct 69 ms 12860 KB Output is correct
100 Correct 66 ms 12876 KB Output is correct
101 Correct 71 ms 12876 KB Output is correct
102 Correct 65 ms 12852 KB Output is correct
103 Correct 67 ms 12888 KB Output is correct
104 Correct 67 ms 12872 KB Output is correct
105 Correct 66 ms 12952 KB Output is correct
106 Correct 64 ms 14860 KB Output is correct
107 Correct 74 ms 14788 KB Output is correct
108 Correct 92 ms 14816 KB Output is correct
109 Correct 73 ms 14808 KB Output is correct
110 Correct 68 ms 14856 KB Output is correct
111 Correct 72 ms 14884 KB Output is correct
112 Correct 67 ms 14832 KB Output is correct
113 Correct 64 ms 14888 KB Output is correct
114 Correct 67 ms 14796 KB Output is correct
115 Correct 64 ms 14844 KB Output is correct
116 Runtime error 964 ms 14428 KB Execution killed with signal 11
117 Halted 0 ms 0 KB -