oj.uz

답안 #752659

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
752659 2023-06-03T11:32:01 Z 이동현(#9968) Diversity (CEOI21_diversity) C++17
64 / 100
 7000 ms 9596 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#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, B;
long long t1[TS], t2[TS], t3[TS], t4[TS];
int a[NS];
int stkn;
int fir[NS], ed[NS], cnt[NS], pos[NS], stk[NS];
long long 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;
    //n = 300000, q = 50000;
    for(int i = 1; i <= n; ++i){
        cin >> a[i];
        //a[i] = i;
    }
    for(int i = 1; i <= q; ++i){
        cin >> que[i].l >> que[i].r;
        //que[i].l = i, que[i].r = i * 6;
        que[i].id = i;
    }

    B = 2000;
    sort(que + 1, que + q + 1);
    int l = 1, r = 0;
    long long 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){
            long long t1a = 0, t2a = 0, t3a = 0, t4a = 0;
            long long 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{
            long long t1a = 0, t2a = 0, t3a = 0, t4a = 0;
            long long 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 + (long long)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 1620 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 1 ms 1620 KB Output is correct
4 Correct 1 ms 1620 KB Output is correct
5 Correct 1 ms 1620 KB Output is correct
6 Correct 1 ms 1620 KB Output is correct
7 Correct 2 ms 1620 KB Output is correct
8 Correct 1 ms 1620 KB Output is correct
9 Correct 1 ms 1620 KB Output is correct
10 Correct 2 ms 1620 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 4 ms 1748 KB Output is correct
4 Correct 25 ms 2136 KB Output is correct
5 Correct 54 ms 2652 KB Output is correct
6 Correct 73 ms 3024 KB Output is correct
7 Correct 72 ms 3456 KB Output is correct
8 Correct 74 ms 3172 KB Output is correct
9 Correct 70 ms 3008 KB Output is correct
10 Correct 80 ms 3244 KB Output is correct
11 Correct 77 ms 3076 KB Output is correct
12 Correct 93 ms 2956 KB Output is correct
13 Correct 75 ms 2988 KB Output is correct
14 Correct 80 ms 3224 KB Output is correct
15 Correct 74 ms 3064 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 4 ms 1748 KB Output is correct
4 Correct 25 ms 2136 KB Output is correct
5 Correct 54 ms 2652 KB Output is correct
6 Correct 73 ms 3024 KB Output is correct
7 Correct 72 ms 3456 KB Output is correct
8 Correct 74 ms 3172 KB Output is correct
9 Correct 70 ms 3008 KB Output is correct
10 Correct 80 ms 3244 KB Output is correct
11 Correct 77 ms 3076 KB Output is correct
12 Correct 93 ms 2956 KB Output is correct
13 Correct 75 ms 2988 KB Output is correct
14 Correct 80 ms 3224 KB Output is correct
15 Correct 74 ms 3064 KB Output is correct
16 Correct 1 ms 1620 KB Output is correct
17 Correct 2 ms 1620 KB Output is correct
18 Correct 3 ms 1748 KB Output is correct
19 Correct 25 ms 2132 KB Output is correct
20 Correct 50 ms 2568 KB Output is correct
21 Correct 92 ms 3028 KB Output is correct
22 Correct 87 ms 2952 KB Output is correct
23 Correct 72 ms 2968 KB Output is correct
24 Correct 72 ms 3040 KB Output is correct
25 Correct 72 ms 3016 KB Output is correct
26 Correct 77 ms 2940 KB Output is correct
27 Correct 74 ms 2924 KB Output is correct
28 Correct 77 ms 3152 KB Output is correct
29 Correct 79 ms 3012 KB Output is correct
30 Correct 74 ms 3020 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 4 ms 1748 KB Output is correct
4 Correct 25 ms 2136 KB Output is correct
5 Correct 54 ms 2652 KB Output is correct
6 Correct 73 ms 3024 KB Output is correct
7 Correct 72 ms 3456 KB Output is correct
8 Correct 74 ms 3172 KB Output is correct
9 Correct 70 ms 3008 KB Output is correct
10 Correct 80 ms 3244 KB Output is correct
11 Correct 77 ms 3076 KB Output is correct
12 Correct 93 ms 2956 KB Output is correct
13 Correct 75 ms 2988 KB Output is correct
14 Correct 80 ms 3224 KB Output is correct
15 Correct 74 ms 3064 KB Output is correct
16 Correct 1 ms 1620 KB Output is correct
17 Correct 2 ms 1620 KB Output is correct
18 Correct 3 ms 1748 KB Output is correct
19 Correct 25 ms 2132 KB Output is correct
20 Correct 50 ms 2568 KB Output is correct
21 Correct 92 ms 3028 KB Output is correct
22 Correct 87 ms 2952 KB Output is correct
23 Correct 72 ms 2968 KB Output is correct
24 Correct 72 ms 3040 KB Output is correct
25 Correct 72 ms 3016 KB Output is correct
26 Correct 77 ms 2940 KB Output is correct
27 Correct 74 ms 2924 KB Output is correct
28 Correct 77 ms 3152 KB Output is correct
29 Correct 79 ms 3012 KB Output is correct
30 Correct 74 ms 3020 KB Output is correct
31 Correct 1 ms 1620 KB Output is correct
32 Correct 1 ms 1620 KB Output is correct
33 Correct 2 ms 1620 KB Output is correct
34 Correct 4 ms 1748 KB Output is correct
35 Correct 3 ms 1620 KB Output is correct
36 Correct 3 ms 1748 KB Output is correct
37 Correct 13 ms 1876 KB Output is correct
38 Correct 14 ms 1904 KB Output is correct
39 Correct 25 ms 2108 KB Output is correct
40 Correct 54 ms 2388 KB Output is correct
41 Correct 73 ms 2876 KB Output is correct
42 Correct 70 ms 2768 KB Output is correct
43 Correct 76 ms 2872 KB Output is correct
44 Correct 69 ms 2864 KB Output is correct
45 Correct 92 ms 2864 KB Output is correct
46 Correct 77 ms 2852 KB Output is correct
47 Correct 71 ms 2876 KB Output is correct
48 Correct 70 ms 2872 KB Output is correct
49 Correct 78 ms 2872 KB Output is correct
50 Correct 72 ms 2864 KB Output is correct
51 Correct 74 ms 2860 KB Output is correct
52 Correct 69 ms 2872 KB Output is correct
53 Correct 76 ms 2864 KB Output is correct
54 Correct 77 ms 2872 KB Output is correct
55 Correct 75 ms 2900 KB Output is correct
56 Correct 70 ms 2864 KB Output is correct
57 Correct 72 ms 2868 KB Output is correct
58 Correct 70 ms 2764 KB Output is correct
59 Correct 76 ms 2768 KB Output is correct
60 Correct 84 ms 2844 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 1 ms 1620 KB Output is correct
4 Correct 1 ms 1620 KB Output is correct
5 Correct 1 ms 1620 KB Output is correct
6 Correct 1 ms 1620 KB Output is correct
7 Correct 2 ms 1620 KB Output is correct
8 Correct 1 ms 1620 KB Output is correct
9 Correct 1 ms 1620 KB Output is correct
10 Correct 2 ms 1620 KB Output is correct
11 Correct 1 ms 1620 KB Output is correct
12 Correct 1 ms 1620 KB Output is correct
13 Correct 4 ms 1748 KB Output is correct
14 Correct 25 ms 2136 KB Output is correct
15 Correct 54 ms 2652 KB Output is correct
16 Correct 73 ms 3024 KB Output is correct
17 Correct 72 ms 3456 KB Output is correct
18 Correct 74 ms 3172 KB Output is correct
19 Correct 70 ms 3008 KB Output is correct
20 Correct 80 ms 3244 KB Output is correct
21 Correct 77 ms 3076 KB Output is correct
22 Correct 93 ms 2956 KB Output is correct
23 Correct 75 ms 2988 KB Output is correct
24 Correct 80 ms 3224 KB Output is correct
25 Correct 74 ms 3064 KB Output is correct
26 Correct 1 ms 1620 KB Output is correct
27 Correct 2 ms 1620 KB Output is correct
28 Correct 3 ms 1748 KB Output is correct
29 Correct 25 ms 2132 KB Output is correct
30 Correct 50 ms 2568 KB Output is correct
31 Correct 92 ms 3028 KB Output is correct
32 Correct 87 ms 2952 KB Output is correct
33 Correct 72 ms 2968 KB Output is correct
34 Correct 72 ms 3040 KB Output is correct
35 Correct 72 ms 3016 KB Output is correct
36 Correct 77 ms 2940 KB Output is correct
37 Correct 74 ms 2924 KB Output is correct
38 Correct 77 ms 3152 KB Output is correct
39 Correct 79 ms 3012 KB Output is correct
40 Correct 74 ms 3020 KB Output is correct
41 Correct 1 ms 1620 KB Output is correct
42 Correct 1 ms 1620 KB Output is correct
43 Correct 2 ms 1620 KB Output is correct
44 Correct 4 ms 1748 KB Output is correct
45 Correct 3 ms 1620 KB Output is correct
46 Correct 3 ms 1748 KB Output is correct
47 Correct 13 ms 1876 KB Output is correct
48 Correct 14 ms 1904 KB Output is correct
49 Correct 25 ms 2108 KB Output is correct
50 Correct 54 ms 2388 KB Output is correct
51 Correct 73 ms 2876 KB Output is correct
52 Correct 70 ms 2768 KB Output is correct
53 Correct 76 ms 2872 KB Output is correct
54 Correct 69 ms 2864 KB Output is correct
55 Correct 92 ms 2864 KB Output is correct
56 Correct 77 ms 2852 KB Output is correct
57 Correct 71 ms 2876 KB Output is correct
58 Correct 70 ms 2872 KB Output is correct
59 Correct 78 ms 2872 KB Output is correct
60 Correct 72 ms 2864 KB Output is correct
61 Correct 74 ms 2860 KB Output is correct
62 Correct 69 ms 2872 KB Output is correct
63 Correct 76 ms 2864 KB Output is correct
64 Correct 77 ms 2872 KB Output is correct
65 Correct 75 ms 2900 KB Output is correct
66 Correct 70 ms 2864 KB Output is correct
67 Correct 72 ms 2868 KB Output is correct
68 Correct 70 ms 2764 KB Output is correct
69 Correct 76 ms 2768 KB Output is correct
70 Correct 84 ms 2844 KB Output is correct
71 Correct 13 ms 1876 KB Output is correct
72 Correct 18 ms 1924 KB Output is correct
73 Correct 13 ms 1928 KB Output is correct
74 Correct 13 ms 1876 KB Output is correct
75 Correct 14 ms 1924 KB Output is correct
76 Correct 26 ms 2184 KB Output is correct
77 Correct 24 ms 2192 KB Output is correct
78 Correct 26 ms 2132 KB Output is correct
79 Correct 26 ms 2132 KB Output is correct
80 Correct 25 ms 2136 KB Output is correct
81 Correct 48 ms 2700 KB Output is correct
82 Correct 47 ms 2708 KB Output is correct
83 Correct 47 ms 2692 KB Output is correct
84 Correct 47 ms 2700 KB Output is correct
85 Correct 55 ms 2624 KB Output is correct
86 Correct 55 ms 2964 KB Output is correct
87 Correct 59 ms 2956 KB Output is correct
88 Correct 48 ms 2892 KB Output is correct
89 Correct 49 ms 2964 KB Output is correct
90 Correct 48 ms 2852 KB Output is correct
91 Correct 79 ms 5424 KB Output is correct
92 Correct 71 ms 5444 KB Output is correct
93 Correct 71 ms 5508 KB Output is correct
94 Correct 85 ms 5572 KB Output is correct
95 Correct 73 ms 5496 KB Output is correct
96 Correct 73 ms 8232 KB Output is correct
97 Correct 81 ms 8248 KB Output is correct
98 Correct 78 ms 8140 KB Output is correct
99 Correct 70 ms 8136 KB Output is correct
100 Correct 71 ms 8208 KB Output is correct
101 Correct 72 ms 8132 KB Output is correct
102 Correct 84 ms 8188 KB Output is correct
103 Correct 75 ms 8204 KB Output is correct
104 Correct 70 ms 8248 KB Output is correct
105 Correct 79 ms 8268 KB Output is correct
106 Correct 77 ms 9540 KB Output is correct
107 Correct 70 ms 9532 KB Output is correct
108 Correct 72 ms 9532 KB Output is correct
109 Correct 72 ms 9564 KB Output is correct
110 Correct 77 ms 9488 KB Output is correct
111 Correct 79 ms 9596 KB Output is correct
112 Correct 70 ms 9528 KB Output is correct
113 Correct 73 ms 9496 KB Output is correct
114 Correct 73 ms 9516 KB Output is correct
115 Correct 69 ms 9504 KB Output is correct

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 1 ms 1620 KB Output is correct
4 Correct 1 ms 1620 KB Output is correct
5 Correct 1 ms 1620 KB Output is correct
6 Correct 1 ms 1620 KB Output is correct
7 Correct 2 ms 1620 KB Output is correct
8 Correct 1 ms 1620 KB Output is correct
9 Correct 1 ms 1620 KB Output is correct
10 Correct 2 ms 1620 KB Output is correct
11 Correct 1 ms 1620 KB Output is correct
12 Correct 1 ms 1620 KB Output is correct
13 Correct 4 ms 1748 KB Output is correct
14 Correct 25 ms 2136 KB Output is correct
15 Correct 54 ms 2652 KB Output is correct
16 Correct 73 ms 3024 KB Output is correct
17 Correct 72 ms 3456 KB Output is correct
18 Correct 74 ms 3172 KB Output is correct
19 Correct 70 ms 3008 KB Output is correct
20 Correct 80 ms 3244 KB Output is correct
21 Correct 77 ms 3076 KB Output is correct
22 Correct 93 ms 2956 KB Output is correct
23 Correct 75 ms 2988 KB Output is correct
24 Correct 80 ms 3224 KB Output is correct
25 Correct 74 ms 3064 KB Output is correct
26 Correct 1 ms 1620 KB Output is correct
27 Correct 2 ms 1620 KB Output is correct
28 Correct 3 ms 1748 KB Output is correct
29 Correct 25 ms 2132 KB Output is correct
30 Correct 50 ms 2568 KB Output is correct
31 Correct 92 ms 3028 KB Output is correct
32 Correct 87 ms 2952 KB Output is correct
33 Correct 72 ms 2968 KB Output is correct
34 Correct 72 ms 3040 KB Output is correct
35 Correct 72 ms 3016 KB Output is correct
36 Correct 77 ms 2940 KB Output is correct
37 Correct 74 ms 2924 KB Output is correct
38 Correct 77 ms 3152 KB Output is correct
39 Correct 79 ms 3012 KB Output is correct
40 Correct 74 ms 3020 KB Output is correct
41 Correct 1 ms 1620 KB Output is correct
42 Correct 1 ms 1620 KB Output is correct
43 Correct 2 ms 1620 KB Output is correct
44 Correct 4 ms 1748 KB Output is correct
45 Correct 3 ms 1620 KB Output is correct
46 Correct 3 ms 1748 KB Output is correct
47 Correct 13 ms 1876 KB Output is correct
48 Correct 14 ms 1904 KB Output is correct
49 Correct 25 ms 2108 KB Output is correct
50 Correct 54 ms 2388 KB Output is correct
51 Correct 73 ms 2876 KB Output is correct
52 Correct 70 ms 2768 KB Output is correct
53 Correct 76 ms 2872 KB Output is correct
54 Correct 69 ms 2864 KB Output is correct
55 Correct 92 ms 2864 KB Output is correct
56 Correct 77 ms 2852 KB Output is correct
57 Correct 71 ms 2876 KB Output is correct
58 Correct 70 ms 2872 KB Output is correct
59 Correct 78 ms 2872 KB Output is correct
60 Correct 72 ms 2864 KB Output is correct
61 Correct 74 ms 2860 KB Output is correct
62 Correct 69 ms 2872 KB Output is correct
63 Correct 76 ms 2864 KB Output is correct
64 Correct 77 ms 2872 KB Output is correct
65 Correct 75 ms 2900 KB Output is correct
66 Correct 70 ms 2864 KB Output is correct
67 Correct 72 ms 2868 KB Output is correct
68 Correct 70 ms 2764 KB Output is correct
69 Correct 76 ms 2768 KB Output is correct
70 Correct 84 ms 2844 KB Output is correct
71 Correct 13 ms 1876 KB Output is correct
72 Correct 18 ms 1924 KB Output is correct
73 Correct 13 ms 1928 KB Output is correct
74 Correct 13 ms 1876 KB Output is correct
75 Correct 14 ms 1924 KB Output is correct
76 Correct 26 ms 2184 KB Output is correct
77 Correct 24 ms 2192 KB Output is correct
78 Correct 26 ms 2132 KB Output is correct
79 Correct 26 ms 2132 KB Output is correct
80 Correct 25 ms 2136 KB Output is correct
81 Correct 48 ms 2700 KB Output is correct
82 Correct 47 ms 2708 KB Output is correct
83 Correct 47 ms 2692 KB Output is correct
84 Correct 47 ms 2700 KB Output is correct
85 Correct 55 ms 2624 KB Output is correct
86 Correct 55 ms 2964 KB Output is correct
87 Correct 59 ms 2956 KB Output is correct
88 Correct 48 ms 2892 KB Output is correct
89 Correct 49 ms 2964 KB Output is correct
90 Correct 48 ms 2852 KB Output is correct
91 Correct 79 ms 5424 KB Output is correct
92 Correct 71 ms 5444 KB Output is correct
93 Correct 71 ms 5508 KB Output is correct
94 Correct 85 ms 5572 KB Output is correct
95 Correct 73 ms 5496 KB Output is correct
96 Correct 73 ms 8232 KB Output is correct
97 Correct 81 ms 8248 KB Output is correct
98 Correct 78 ms 8140 KB Output is correct
99 Correct 70 ms 8136 KB Output is correct
100 Correct 71 ms 8208 KB Output is correct
101 Correct 72 ms 8132 KB Output is correct
102 Correct 84 ms 8188 KB Output is correct
103 Correct 75 ms 8204 KB Output is correct
104 Correct 70 ms 8248 KB Output is correct
105 Correct 79 ms 8268 KB Output is correct
106 Correct 77 ms 9540 KB Output is correct
107 Correct 70 ms 9532 KB Output is correct
108 Correct 72 ms 9532 KB Output is correct
109 Correct 72 ms 9564 KB Output is correct
110 Correct 77 ms 9488 KB Output is correct
111 Correct 79 ms 9596 KB Output is correct
112 Correct 70 ms 9528 KB Output is correct
113 Correct 73 ms 9496 KB Output is correct
114 Correct 73 ms 9516 KB Output is correct
115 Correct 69 ms 9504 KB Output is correct
116 Correct 5635 ms 3084 KB Output is correct
117 Correct 6754 ms 3080 KB Output is correct
118 Correct 5968 ms 3460 KB Output is correct
119 Execution timed out 7036 ms 2772 KB Time limit exceeded
120 Halted 0 ms 0 KB -