oj.uz

답안 #998857

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
998857 2024-06-14T18:13:36 Z andrei_iorgulescu Diversity (CEOI21_diversity) C++14
64 / 100
 7000 ms 11732 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int B = 1340;
const int V = 3e5;

int n,a[300005],q;
int fr[300005],aibfr[300005];

void update_fr(int pos,int val)
{
    for (int i = pos; i <= V + 1; i += (i & -i))
        aibfr[i] += val;
}

int query_fr(int pos)
{
    int rr = 0;
    for (int i = pos; i > 0; i -= (i & -i))
        rr += aibfr[i];
    return rr;
}

struct query
{
    int l,r,idx;
};

bool cmp(query A1, query A2)
{
    if (A1.l / B != A2.l / B)
        return A1.l < A2.l;
    else
    {
        if ((A1.l / B) % 2 == 0)
            return A1.r < A2.r;
        return A1.r > A2.r;
    }
}

query queries[50005];
ll rasp[50005];
ll ans1,ans2,ans3;
int v[300005];
int nre;

int aibv[300005];
ll aibvii[300005];

void update_v(int pos,int val)
{
    for (int i = pos; i <= V; i += (i & -i))
        aibv[i] += val;
}

int query_v(int pos)
{
    int rr = 0;
    for (int i = pos; i > 0; i -= (i & -i))
        rr += aibv[i];
    return rr;
}

void update_vii(int pos,ll val)
{
    for (int i = pos; i <= V; i += (i & -i))
        aibvii[i] += val;
}

ll query_vii(int pos)
{
    ll rr = 0;
    for (int i = pos; i > 0; i -= (i & -i))
        rr += aibvii[i];
    return rr;
}

void get_initial_ans()
{
    vector<int> poz_fr;
    for (int i = 1; i <= V; i++)
        poz_fr.push_back(fr[i]);
    sort(poz_fr.begin(),poz_fr.end());
    int l1 = 1,r1 = V;
    for (int i = 0; i < poz_fr.size(); i++)
    {
        if (i % 2 == 0)
            v[l1]  = poz_fr[i],l1++;
        else
            v[r1] = poz_fr[i],r1--;
    }
    for (int i = 1; i <= V; i++)
        ans1 += 1ll * v[i] * (v[i] + 1) / 2;
    ll sumvi = 0,sumivi = 0;
    for (int j = 1; j <= V; j++)
    {
        ans3 += 1ll * j * v[j] * sumvi - 1ll * v[j] * sumivi;
        ans2 += 1ll * sumvi * v[j];
        sumvi += v[j];
        sumivi += 1ll * j * v[j];
    }
    for (int i = 1; i <= V; i++)
        update_v(i,v[i]);
    for (int i = 1; i <= V; i++)
        update_vii(i,v[i] * i);
}

void update_structure(int val,int coef)
{
    //cout << val << ' ' << coef << endl;
    ans1 -= 1ll * fr[val] * (fr[val] + 1) / 2;
    ans1 += 1ll * (fr[val] + coef) * (fr[val] + coef + 1) / 2;
    ans2 -= 1ll * fr[val] * (nre - fr[val]);
    ans2 += 1ll * (fr[val] + coef) * (nre - fr[val]);
    nre += coef;
    int pos;
    if (coef == 1)
        pos = query_fr(fr[val] + 1);
    else
        pos = query_fr(fr[val] - 1 + 1) + 1;
    if (pos % 2 == 1)
        pos = (pos + 1) / 2;
    else
        pos = V - (pos - 1) / 2;
    //cout << ans3 << endl;
    //cout << pos << endl;
    ll delta = 1ll * coef * pos * query_v(pos - 1) - 1ll * coef * pos * (query_v(V) - query_v(pos)) + 1ll * coef * (query_vii(V) - query_vii(pos)) - 1ll * coef * query_vii(pos - 1);
    ans3 += delta;
    int new_val = v[pos] + coef;
    update_v(pos,-v[pos]);
    update_v(pos,new_val);
    update_vii(pos,1ll * -v[pos] * pos);
    update_vii(pos,1ll * new_val * pos);
    v[pos] += coef;
    fr[val] += coef;
    //cout << fr[val] << ' ' << fr[val + coef] << endl;
    //cout << 1 << endl;
    update_fr(fr[val] - coef + 1,-1);
    //cout << 3 << endl;
    update_fr(fr[val] + 1,1);
    //cout << 2 << endl;
}

///fr poate fi intre 0 si V, grija la aib!!

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> q;
    for (int i = 1; i <= n; i++)
        cin >> a[i],fr[a[i]]++;
    get_initial_ans();
    nre = n;
    for (int i = 1; i <= q; i++)
    {
        cin >> queries[i].l >> queries[i].r;
        queries[i].idx = i;
    }
    sort(queries + 1,queries + q + 1,cmp);
    for (int i = 1; i <= V; i++)
        update_fr(fr[i] + 1,1);
    int l = 1,r = n;
    for (int i = 1; i <= q; i++)
    {
        while (r < queries[i].r)
        {
            r++;
            update_structure(a[r],1);
        }
        while (l > queries[i].l)
        {
            l--;
            update_structure(a[l],1);
        }
        while (r > queries[i].r)
        {
            update_structure(a[r],-1);
            r--;
        }
        while (l < queries[i].l)
        {
            update_structure(a[l],-1);
            l++;
        }
        //cout << ans1 << ' ' << ans2 << ' ' << ans3 << endl;
        rasp[queries[i].idx] = ans1 + ans2 + ans3;
    }
    for (int i = 1; i <= q; i++)
        cout << rasp[i] << '\n';
    return 0;
}

Compilation message

diversity.cpp: In function 'void get_initial_ans()':
diversity.cpp:88:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |     for (int i = 0; i < poz_fr.size(); i++)
      |                     ~~^~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 9936 KB Output is correct
2 Correct 23 ms 9940 KB Output is correct
3 Correct 23 ms 9940 KB Output is correct
4 Correct 23 ms 9984 KB Output is correct
5 Correct 26 ms 9940 KB Output is correct
6 Correct 23 ms 9940 KB Output is correct
7 Correct 24 ms 9936 KB Output is correct
8 Correct 23 ms 9940 KB Output is correct
9 Correct 23 ms 9984 KB Output is correct
10 Correct 27 ms 9984 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 9936 KB Output is correct
2 Correct 23 ms 9940 KB Output is correct
3 Correct 24 ms 9984 KB Output is correct
4 Correct 26 ms 10024 KB Output is correct
5 Correct 29 ms 10452 KB Output is correct
6 Correct 34 ms 10792 KB Output is correct
7 Correct 33 ms 10704 KB Output is correct
8 Correct 33 ms 11732 KB Output is correct
9 Correct 33 ms 10708 KB Output is correct
10 Correct 34 ms 10960 KB Output is correct
11 Correct 33 ms 10708 KB Output is correct
12 Correct 36 ms 10960 KB Output is correct
13 Correct 34 ms 10840 KB Output is correct
14 Correct 34 ms 10952 KB Output is correct
15 Correct 40 ms 10964 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 9936 KB Output is correct
2 Correct 23 ms 9940 KB Output is correct
3 Correct 24 ms 9984 KB Output is correct
4 Correct 26 ms 10024 KB Output is correct
5 Correct 29 ms 10452 KB Output is correct
6 Correct 34 ms 10792 KB Output is correct
7 Correct 33 ms 10704 KB Output is correct
8 Correct 33 ms 11732 KB Output is correct
9 Correct 33 ms 10708 KB Output is correct
10 Correct 34 ms 10960 KB Output is correct
11 Correct 33 ms 10708 KB Output is correct
12 Correct 36 ms 10960 KB Output is correct
13 Correct 34 ms 10840 KB Output is correct
14 Correct 34 ms 10952 KB Output is correct
15 Correct 40 ms 10964 KB Output is correct
16 Correct 23 ms 9940 KB Output is correct
17 Correct 23 ms 9940 KB Output is correct
18 Correct 23 ms 9996 KB Output is correct
19 Correct 27 ms 10196 KB Output is correct
20 Correct 31 ms 10400 KB Output is correct
21 Correct 34 ms 10780 KB Output is correct
22 Correct 34 ms 10960 KB Output is correct
23 Correct 34 ms 10960 KB Output is correct
24 Correct 35 ms 10964 KB Output is correct
25 Correct 35 ms 10960 KB Output is correct
26 Correct 34 ms 10952 KB Output is correct
27 Correct 35 ms 10956 KB Output is correct
28 Correct 36 ms 10788 KB Output is correct
29 Correct 36 ms 10964 KB Output is correct
30 Correct 35 ms 10956 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 9936 KB Output is correct
2 Correct 23 ms 9940 KB Output is correct
3 Correct 24 ms 9984 KB Output is correct
4 Correct 26 ms 10024 KB Output is correct
5 Correct 29 ms 10452 KB Output is correct
6 Correct 34 ms 10792 KB Output is correct
7 Correct 33 ms 10704 KB Output is correct
8 Correct 33 ms 11732 KB Output is correct
9 Correct 33 ms 10708 KB Output is correct
10 Correct 34 ms 10960 KB Output is correct
11 Correct 33 ms 10708 KB Output is correct
12 Correct 36 ms 10960 KB Output is correct
13 Correct 34 ms 10840 KB Output is correct
14 Correct 34 ms 10952 KB Output is correct
15 Correct 40 ms 10964 KB Output is correct
16 Correct 23 ms 9940 KB Output is correct
17 Correct 23 ms 9940 KB Output is correct
18 Correct 23 ms 9996 KB Output is correct
19 Correct 27 ms 10196 KB Output is correct
20 Correct 31 ms 10400 KB Output is correct
21 Correct 34 ms 10780 KB Output is correct
22 Correct 34 ms 10960 KB Output is correct
23 Correct 34 ms 10960 KB Output is correct
24 Correct 35 ms 10964 KB Output is correct
25 Correct 35 ms 10960 KB Output is correct
26 Correct 34 ms 10952 KB Output is correct
27 Correct 35 ms 10956 KB Output is correct
28 Correct 36 ms 10788 KB Output is correct
29 Correct 36 ms 10964 KB Output is correct
30 Correct 35 ms 10956 KB Output is correct
31 Correct 23 ms 9940 KB Output is correct
32 Correct 24 ms 9992 KB Output is correct
33 Correct 23 ms 9940 KB Output is correct
34 Correct 24 ms 9940 KB Output is correct
35 Correct 24 ms 9984 KB Output is correct
36 Correct 24 ms 9940 KB Output is correct
37 Correct 25 ms 10056 KB Output is correct
38 Correct 26 ms 9936 KB Output is correct
39 Correct 28 ms 10196 KB Output is correct
40 Correct 32 ms 10452 KB Output is correct
41 Correct 35 ms 10796 KB Output is correct
42 Correct 35 ms 10964 KB Output is correct
43 Correct 36 ms 10788 KB Output is correct
44 Correct 36 ms 10964 KB Output is correct
45 Correct 36 ms 10776 KB Output is correct
46 Correct 35 ms 10700 KB Output is correct
47 Correct 35 ms 10792 KB Output is correct
48 Correct 35 ms 10952 KB Output is correct
49 Correct 35 ms 10696 KB Output is correct
50 Correct 35 ms 10704 KB Output is correct
51 Correct 45 ms 10820 KB Output is correct
52 Correct 35 ms 10964 KB Output is correct
53 Correct 39 ms 10700 KB Output is correct
54 Correct 35 ms 10960 KB Output is correct
55 Correct 35 ms 10792 KB Output is correct
56 Correct 35 ms 10964 KB Output is correct
57 Correct 35 ms 10960 KB Output is correct
58 Correct 35 ms 10884 KB Output is correct
59 Correct 36 ms 10704 KB Output is correct
60 Correct 38 ms 10964 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 9936 KB Output is correct
2 Correct 23 ms 9940 KB Output is correct
3 Correct 23 ms 9940 KB Output is correct
4 Correct 23 ms 9984 KB Output is correct
5 Correct 26 ms 9940 KB Output is correct
6 Correct 23 ms 9940 KB Output is correct
7 Correct 24 ms 9936 KB Output is correct
8 Correct 23 ms 9940 KB Output is correct
9 Correct 23 ms 9984 KB Output is correct
10 Correct 27 ms 9984 KB Output is correct
11 Correct 24 ms 9936 KB Output is correct
12 Correct 23 ms 9940 KB Output is correct
13 Correct 24 ms 9984 KB Output is correct
14 Correct 26 ms 10024 KB Output is correct
15 Correct 29 ms 10452 KB Output is correct
16 Correct 34 ms 10792 KB Output is correct
17 Correct 33 ms 10704 KB Output is correct
18 Correct 33 ms 11732 KB Output is correct
19 Correct 33 ms 10708 KB Output is correct
20 Correct 34 ms 10960 KB Output is correct
21 Correct 33 ms 10708 KB Output is correct
22 Correct 36 ms 10960 KB Output is correct
23 Correct 34 ms 10840 KB Output is correct
24 Correct 34 ms 10952 KB Output is correct
25 Correct 40 ms 10964 KB Output is correct
26 Correct 23 ms 9940 KB Output is correct
27 Correct 23 ms 9940 KB Output is correct
28 Correct 23 ms 9996 KB Output is correct
29 Correct 27 ms 10196 KB Output is correct
30 Correct 31 ms 10400 KB Output is correct
31 Correct 34 ms 10780 KB Output is correct
32 Correct 34 ms 10960 KB Output is correct
33 Correct 34 ms 10960 KB Output is correct
34 Correct 35 ms 10964 KB Output is correct
35 Correct 35 ms 10960 KB Output is correct
36 Correct 34 ms 10952 KB Output is correct
37 Correct 35 ms 10956 KB Output is correct
38 Correct 36 ms 10788 KB Output is correct
39 Correct 36 ms 10964 KB Output is correct
40 Correct 35 ms 10956 KB Output is correct
41 Correct 23 ms 9940 KB Output is correct
42 Correct 24 ms 9992 KB Output is correct
43 Correct 23 ms 9940 KB Output is correct
44 Correct 24 ms 9940 KB Output is correct
45 Correct 24 ms 9984 KB Output is correct
46 Correct 24 ms 9940 KB Output is correct
47 Correct 25 ms 10056 KB Output is correct
48 Correct 26 ms 9936 KB Output is correct
49 Correct 28 ms 10196 KB Output is correct
50 Correct 32 ms 10452 KB Output is correct
51 Correct 35 ms 10796 KB Output is correct
52 Correct 35 ms 10964 KB Output is correct
53 Correct 36 ms 10788 KB Output is correct
54 Correct 36 ms 10964 KB Output is correct
55 Correct 36 ms 10776 KB Output is correct
56 Correct 35 ms 10700 KB Output is correct
57 Correct 35 ms 10792 KB Output is correct
58 Correct 35 ms 10952 KB Output is correct
59 Correct 35 ms 10696 KB Output is correct
60 Correct 35 ms 10704 KB Output is correct
61 Correct 45 ms 10820 KB Output is correct
62 Correct 35 ms 10964 KB Output is correct
63 Correct 39 ms 10700 KB Output is correct
64 Correct 35 ms 10960 KB Output is correct
65 Correct 35 ms 10792 KB Output is correct
66 Correct 35 ms 10964 KB Output is correct
67 Correct 35 ms 10960 KB Output is correct
68 Correct 35 ms 10884 KB Output is correct
69 Correct 36 ms 10704 KB Output is correct
70 Correct 38 ms 10964 KB Output is correct
71 Correct 26 ms 9940 KB Output is correct
72 Correct 30 ms 9940 KB Output is correct
73 Correct 25 ms 9992 KB Output is correct
74 Correct 26 ms 9940 KB Output is correct
75 Correct 26 ms 9940 KB Output is correct
76 Correct 30 ms 10196 KB Output is correct
77 Correct 28 ms 10192 KB Output is correct
78 Correct 28 ms 10196 KB Output is correct
79 Correct 27 ms 9940 KB Output is correct
80 Correct 28 ms 10024 KB Output is correct
81 Correct 32 ms 10444 KB Output is correct
82 Correct 34 ms 10440 KB Output is correct
83 Correct 32 ms 10448 KB Output is correct
84 Correct 32 ms 10452 KB Output is correct
85 Correct 32 ms 10448 KB Output is correct
86 Correct 33 ms 10448 KB Output is correct
87 Correct 33 ms 10496 KB Output is correct
88 Correct 33 ms 10572 KB Output is correct
89 Correct 33 ms 10452 KB Output is correct
90 Correct 36 ms 10448 KB Output is correct
91 Correct 40 ms 10964 KB Output is correct
92 Correct 39 ms 10964 KB Output is correct
93 Correct 39 ms 10956 KB Output is correct
94 Correct 40 ms 10952 KB Output is correct
95 Correct 42 ms 10952 KB Output is correct
96 Correct 40 ms 10952 KB Output is correct
97 Correct 42 ms 10792 KB Output is correct
98 Correct 42 ms 10964 KB Output is correct
99 Correct 41 ms 10748 KB Output is correct
100 Correct 43 ms 10788 KB Output is correct
101 Correct 42 ms 10964 KB Output is correct
102 Correct 41 ms 10952 KB Output is correct
103 Correct 44 ms 10700 KB Output is correct
104 Correct 42 ms 10696 KB Output is correct
105 Correct 41 ms 10964 KB Output is correct
106 Correct 41 ms 10696 KB Output is correct
107 Correct 43 ms 10960 KB Output is correct
108 Correct 44 ms 10964 KB Output is correct
109 Correct 41 ms 10700 KB Output is correct
110 Correct 41 ms 10964 KB Output is correct
111 Correct 41 ms 10700 KB Output is correct
112 Correct 41 ms 10696 KB Output is correct
113 Correct 41 ms 10964 KB Output is correct
114 Correct 41 ms 10844 KB Output is correct
115 Correct 42 ms 10952 KB Output is correct

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 9936 KB Output is correct
2 Correct 23 ms 9940 KB Output is correct
3 Correct 23 ms 9940 KB Output is correct
4 Correct 23 ms 9984 KB Output is correct
5 Correct 26 ms 9940 KB Output is correct
6 Correct 23 ms 9940 KB Output is correct
7 Correct 24 ms 9936 KB Output is correct
8 Correct 23 ms 9940 KB Output is correct
9 Correct 23 ms 9984 KB Output is correct
10 Correct 27 ms 9984 KB Output is correct
11 Correct 24 ms 9936 KB Output is correct
12 Correct 23 ms 9940 KB Output is correct
13 Correct 24 ms 9984 KB Output is correct
14 Correct 26 ms 10024 KB Output is correct
15 Correct 29 ms 10452 KB Output is correct
16 Correct 34 ms 10792 KB Output is correct
17 Correct 33 ms 10704 KB Output is correct
18 Correct 33 ms 11732 KB Output is correct
19 Correct 33 ms 10708 KB Output is correct
20 Correct 34 ms 10960 KB Output is correct
21 Correct 33 ms 10708 KB Output is correct
22 Correct 36 ms 10960 KB Output is correct
23 Correct 34 ms 10840 KB Output is correct
24 Correct 34 ms 10952 KB Output is correct
25 Correct 40 ms 10964 KB Output is correct
26 Correct 23 ms 9940 KB Output is correct
27 Correct 23 ms 9940 KB Output is correct
28 Correct 23 ms 9996 KB Output is correct
29 Correct 27 ms 10196 KB Output is correct
30 Correct 31 ms 10400 KB Output is correct
31 Correct 34 ms 10780 KB Output is correct
32 Correct 34 ms 10960 KB Output is correct
33 Correct 34 ms 10960 KB Output is correct
34 Correct 35 ms 10964 KB Output is correct
35 Correct 35 ms 10960 KB Output is correct
36 Correct 34 ms 10952 KB Output is correct
37 Correct 35 ms 10956 KB Output is correct
38 Correct 36 ms 10788 KB Output is correct
39 Correct 36 ms 10964 KB Output is correct
40 Correct 35 ms 10956 KB Output is correct
41 Correct 23 ms 9940 KB Output is correct
42 Correct 24 ms 9992 KB Output is correct
43 Correct 23 ms 9940 KB Output is correct
44 Correct 24 ms 9940 KB Output is correct
45 Correct 24 ms 9984 KB Output is correct
46 Correct 24 ms 9940 KB Output is correct
47 Correct 25 ms 10056 KB Output is correct
48 Correct 26 ms 9936 KB Output is correct
49 Correct 28 ms 10196 KB Output is correct
50 Correct 32 ms 10452 KB Output is correct
51 Correct 35 ms 10796 KB Output is correct
52 Correct 35 ms 10964 KB Output is correct
53 Correct 36 ms 10788 KB Output is correct
54 Correct 36 ms 10964 KB Output is correct
55 Correct 36 ms 10776 KB Output is correct
56 Correct 35 ms 10700 KB Output is correct
57 Correct 35 ms 10792 KB Output is correct
58 Correct 35 ms 10952 KB Output is correct
59 Correct 35 ms 10696 KB Output is correct
60 Correct 35 ms 10704 KB Output is correct
61 Correct 45 ms 10820 KB Output is correct
62 Correct 35 ms 10964 KB Output is correct
63 Correct 39 ms 10700 KB Output is correct
64 Correct 35 ms 10960 KB Output is correct
65 Correct 35 ms 10792 KB Output is correct
66 Correct 35 ms 10964 KB Output is correct
67 Correct 35 ms 10960 KB Output is correct
68 Correct 35 ms 10884 KB Output is correct
69 Correct 36 ms 10704 KB Output is correct
70 Correct 38 ms 10964 KB Output is correct
71 Correct 26 ms 9940 KB Output is correct
72 Correct 30 ms 9940 KB Output is correct
73 Correct 25 ms 9992 KB Output is correct
74 Correct 26 ms 9940 KB Output is correct
75 Correct 26 ms 9940 KB Output is correct
76 Correct 30 ms 10196 KB Output is correct
77 Correct 28 ms 10192 KB Output is correct
78 Correct 28 ms 10196 KB Output is correct
79 Correct 27 ms 9940 KB Output is correct
80 Correct 28 ms 10024 KB Output is correct
81 Correct 32 ms 10444 KB Output is correct
82 Correct 34 ms 10440 KB Output is correct
83 Correct 32 ms 10448 KB Output is correct
84 Correct 32 ms 10452 KB Output is correct
85 Correct 32 ms 10448 KB Output is correct
86 Correct 33 ms 10448 KB Output is correct
87 Correct 33 ms 10496 KB Output is correct
88 Correct 33 ms 10572 KB Output is correct
89 Correct 33 ms 10452 KB Output is correct
90 Correct 36 ms 10448 KB Output is correct
91 Correct 40 ms 10964 KB Output is correct
92 Correct 39 ms 10964 KB Output is correct
93 Correct 39 ms 10956 KB Output is correct
94 Correct 40 ms 10952 KB Output is correct
95 Correct 42 ms 10952 KB Output is correct
96 Correct 40 ms 10952 KB Output is correct
97 Correct 42 ms 10792 KB Output is correct
98 Correct 42 ms 10964 KB Output is correct
99 Correct 41 ms 10748 KB Output is correct
100 Correct 43 ms 10788 KB Output is correct
101 Correct 42 ms 10964 KB Output is correct
102 Correct 41 ms 10952 KB Output is correct
103 Correct 44 ms 10700 KB Output is correct
104 Correct 42 ms 10696 KB Output is correct
105 Correct 41 ms 10964 KB Output is correct
106 Correct 41 ms 10696 KB Output is correct
107 Correct 43 ms 10960 KB Output is correct
108 Correct 44 ms 10964 KB Output is correct
109 Correct 41 ms 10700 KB Output is correct
110 Correct 41 ms 10964 KB Output is correct
111 Correct 41 ms 10700 KB Output is correct
112 Correct 41 ms 10696 KB Output is correct
113 Correct 41 ms 10964 KB Output is correct
114 Correct 41 ms 10844 KB Output is correct
115 Correct 42 ms 10952 KB Output is correct
116 Correct 3348 ms 9936 KB Output is correct
117 Correct 3373 ms 9940 KB Output is correct
118 Correct 3803 ms 9940 KB Output is correct
119 Correct 3642 ms 9940 KB Output is correct
120 Correct 3747 ms 9940 KB Output is correct
121 Correct 4205 ms 10448 KB Output is correct
122 Correct 4384 ms 10192 KB Output is correct
123 Correct 6002 ms 10452 KB Output is correct
124 Correct 5627 ms 10452 KB Output is correct
125 Correct 5888 ms 10408 KB Output is correct
126 Execution timed out 7041 ms 10960 KB Time limit exceeded
127 Halted 0 ms 0 KB -