oj.uz

Submission #678246

# Submission time Handle Problem Language Result Execution time Memory
678246 2023-01-05T10:58:09 Z stanislavpolyn Diversity (CEOI21_diversity) C++17
64 / 100
 7000 ms 4512 KB 
#include <bits/stdc++.h>

#define fr(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, a, b) for (int i = (a); i >= (b); --i)
#define fe(x, y) for (auto& x : y)

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple

#define all(x) (x).begin(), (x).end()
#define pw(x) (1LL << (x))
#define sz(x) (int)(x).size()

using namespace std;

//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

mt19937_64 rng(228);


//#ifdef LOCAL
//    #define __int128 ll
//#endif // LOCAL

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define fbo find_by_order
#define ook order_of_key

template <typename T>
bool umn(T& a, T b) {
    return a > b ? a = b, 1 : 0;
}
template <typename T>
bool umx(T& a, T b) {
    return a < b ? a = b, 1 : 0;
}

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename T>
using ve = vector<T>;

const int B = 560;

int calc(ve<int> a) {
    int ans = 0;
    fr (i, 0, sz(a) - 1) {
        set<int> s;
        fr (j, i, sz(a) - 1) {
            s.insert(a[j]);
            ans += sz(s);
        }
    }
    return ans;
}


ll calc2(ve<int> a) {
    int total = 0;
    fe (x, a) total += x;
    ll ans = 0;
    int toLeft = 0;
    ans += 1LL * sz(a) * total * (total + 1) / 2;
    fr (i, 0, sz(a) - 1) {
        int toRight = total - toLeft - a[i];
        ans -= 1LL * toLeft * (toLeft + 1) / 2;
        ans -= 1LL * toRight * (toRight + 1) / 2;
        toLeft += a[i];
    }
    return ans;
}

ll calc3Brute(ve<pii> a) {
    assert(sz(a) <= 2 * B);
    int total = 0;
    int gr = 0;
    fe (x, a) {
        total += x.fi * x.se;
        gr += x.se;
    }
    ll ans = 0;

    ans += 1LL * gr * total * (total + 1) / 2;
    int toLeft = 0;
    fe (cur, a) {
        fr (j, 1, cur.se) {
            ans -= 1LL * toLeft * (toLeft + 1) / 2;
            toLeft += cur.fi;
        }
    }
    reverse(all(a));
    toLeft = 0;
    fe (cur, a) {
        fr (j, 1, cur.se) {
            ans -= 1LL * toLeft * (toLeft + 1) / 2;
            toLeft += cur.fi;
        }
    }
    return ans;
}


ll calc3(ve<pll> a) {
    assert(sz(a) <= 2 * B);

    ll total = 0;
    ll gr = 0;
    fe (x, a) {
        total += x.fi * x.se;
        gr += x.se;
    }
    ll ans = 0;

    ans += 1LL * gr * total * (total + 1) / 2;
    ll toLeft = 0;
    fe (cur, a) {
        ll res = 0;

        res += toLeft * cur.se;
        res += cur.fi * 1LL * cur.se * (cur.se - 1) / 2;

        res += 1LL * toLeft * toLeft * cur.se;
        {
            ll t = cur.se * (cur.se - 1) / 2;
            t *= 2;
            res += t * cur.fi * toLeft;
        }

        cur.se--;
        ll sumSquares = cur.se * (cur.se + 1) * (2 * cur.se + 1) / 6;
        cur.se++;

        res += sumSquares * cur.fi * cur.fi;

        res /= 2;
        ans -= res;

        toLeft += cur.fi * cur.se;
    }
    reverse(all(a));

    toLeft = 0;
    fe (cur, a) {
        ll res = 0;

        res += toLeft * cur.se;
        res += cur.fi * 1LL * cur.se * (cur.se - 1) / 2;

        res += 1LL * toLeft * toLeft * cur.se;
        {
            ll t = cur.se * (cur.se - 1) / 2;
            t *= 2;
            res += t * cur.fi * toLeft;
        }

        cur.se--;
        ll sumSquares = cur.se * (cur.se + 1) * (2 * cur.se + 1) / 6;
        cur.se++;

        res += sumSquares * cur.fi * cur.fi;

        res /= 2;
        ans -= res;

        toLeft += cur.fi * cur.se;
    }

    return ans;
}

const int N = 3e5 + 5;

int n, q;
int a[N];

int cnt[N];

int rnd(int l, int r) {
    return rng() % (r - l + 1) + l;
}

ll solve(ve<int> a) {
    fe (x, a) cnt[x] = 0;

    fe (x, a) cnt[x]++;

    ve<pii> order;
    fe (x, a) {
        if (cnt[x]) {
            order.pb({cnt[x], x});
            cnt[x] = 0;
        }
    }
    sort(all(order));
    reverse(all(order));

    {
        ve<pii> st;
        fe (cur, order) {
            if (!sz(st) || cur.fi != st.back().fi) {
                st.pb({cur.fi, 1});
            } else {
                st.back().se++;
            }
        }
        deque<pii> d;
        bool who = 0;
        fe (x, st) {
            if (x.se > 1) {
                d.push_front({x.fi, x.se / 2});
                d.pb({x.fi, x.se / 2});
                x.se %= 2;
            }
            if (x.se) {
                if (who == 0) {
                    if (sz(d) && d.front().fi == x.fi) d.front().se++;
                    else d.push_front({x.fi, 1});
                } else {
                    if (sz(d) && d.back().fi == x.fi) d.back().se++;
                    else d.pb({x.fi, 1});
                }
                who ^= 1;
            }
        }

        ve<pll> v;
        ve<pii> v2;
        fe (x, d) {
            v.pb(x);
            v2.pb(x);
        }

//        cout << calc3Brute(v2) << "\n";

        return calc3(v);
    }
    assert(0);
}

ve<array<int, 3>> Q;

set<int> have;

int cnt2[N];
ll ans[N];

void add(int x) {
    cnt2[cnt[x]]--;
    if (cnt2[cnt[x]] == 0) {
        have.erase(cnt[x]);
    }
    cnt[x]++;
    cnt2[cnt[x]]++;
    if (cnt2[cnt[x]] == 1) {
        have.insert(cnt[x]);
    }
}

void del(int x) {
    cnt2[cnt[x]]--;
    if (cnt2[cnt[x]] == 0) {
        have.erase(cnt[x]);
    }
    cnt[x]--;
    cnt2[cnt[x]]++;
    if (cnt2[cnt[x]] == 1) {
        have.insert(cnt[x]);
    }
}

ll getAns() {
    ve<pii> st;
    fe (cur, have) {
        st.pb({cur, cnt2[cur]});
    }
    reverse(all(st));

    deque<pii> d;
    bool who = 0;
    fe (x, st) {
        if (x.se > 1) {
            d.push_front({x.fi, x.se / 2});
            d.pb({x.fi, x.se / 2});
            x.se %= 2;
        }
        if (x.se) {
            if (who == 0) {
                if (sz(d) && d.front().fi == x.fi) d.front().se++;
                else d.push_front({x.fi, 1});
            } else {
                if (sz(d) && d.back().fi == x.fi) d.back().se++;
                else d.pb({x.fi, 1});
            }
            who ^= 1;
        }
    }

    ve<pll> v;
    fe (x, d) {
        v.pb(x);
    }

    return calc3(v);
}

int main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    ios::sync_with_stdio(0);
    cin.tie(0);
#endif



    cin >> n >> q;

    fr (i, 1, n) {
        cin >> a[i];
    }

    fr (i, 1, q) {
        int l, r;
        cin >> l >> r;

        Q.pb({l, r, i});
    }

    sort(all(Q), [](array<int, 3> a, array<int, 3> b) {
        if (a[0] / B != b[0] / B) {
            return a[0] / B < b[0] / B;
         }
         return a[1] < b[1];
    });

    int L = 1;
    int R = 0;

    fe (cur, Q) {
        while (R < cur[1]) add(a[++R]);
        while (L > cur[0]) add(a[--L]);
        while (R > cur[1]) del(a[R--]);
        while (L < cur[0]) del(a[L++]);

        ans[cur[2]] = getAns();
    }

    fr (i, 1, q) {
        cout << ans[i] << "\n";
    }

    return 0;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 13 ms 820 KB Output is correct
5 Correct 25 ms 1364 KB Output is correct
6 Correct 46 ms 1620 KB Output is correct
7 Correct 38 ms 2028 KB Output is correct
8 Correct 39 ms 1616 KB Output is correct
9 Correct 39 ms 1644 KB Output is correct
10 Correct 38 ms 1836 KB Output is correct
11 Correct 38 ms 1740 KB Output is correct
12 Correct 45 ms 1704 KB Output is correct
13 Correct 38 ms 1620 KB Output is correct
14 Correct 38 ms 1780 KB Output is correct
15 Correct 39 ms 1668 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 13 ms 820 KB Output is correct
5 Correct 25 ms 1364 KB Output is correct
6 Correct 46 ms 1620 KB Output is correct
7 Correct 38 ms 2028 KB Output is correct
8 Correct 39 ms 1616 KB Output is correct
9 Correct 39 ms 1644 KB Output is correct
10 Correct 38 ms 1836 KB Output is correct
11 Correct 38 ms 1740 KB Output is correct
12 Correct 45 ms 1704 KB Output is correct
13 Correct 38 ms 1620 KB Output is correct
14 Correct 38 ms 1780 KB Output is correct
15 Correct 39 ms 1668 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 15 ms 788 KB Output is correct
20 Correct 30 ms 1172 KB Output is correct
21 Correct 44 ms 1664 KB Output is correct
22 Correct 44 ms 1532 KB Output is correct
23 Correct 43 ms 1672 KB Output is correct
24 Correct 44 ms 1636 KB Output is correct
25 Correct 47 ms 1660 KB Output is correct
26 Correct 46 ms 1532 KB Output is correct
27 Correct 44 ms 1628 KB Output is correct
28 Correct 45 ms 1688 KB Output is correct
29 Correct 45 ms 1612 KB Output is correct
30 Correct 50 ms 1580 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 13 ms 820 KB Output is correct
5 Correct 25 ms 1364 KB Output is correct
6 Correct 46 ms 1620 KB Output is correct
7 Correct 38 ms 2028 KB Output is correct
8 Correct 39 ms 1616 KB Output is correct
9 Correct 39 ms 1644 KB Output is correct
10 Correct 38 ms 1836 KB Output is correct
11 Correct 38 ms 1740 KB Output is correct
12 Correct 45 ms 1704 KB Output is correct
13 Correct 38 ms 1620 KB Output is correct
14 Correct 38 ms 1780 KB Output is correct
15 Correct 39 ms 1668 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 15 ms 788 KB Output is correct
20 Correct 30 ms 1172 KB Output is correct
21 Correct 44 ms 1664 KB Output is correct
22 Correct 44 ms 1532 KB Output is correct
23 Correct 43 ms 1672 KB Output is correct
24 Correct 44 ms 1636 KB Output is correct
25 Correct 47 ms 1660 KB Output is correct
26 Correct 46 ms 1532 KB Output is correct
27 Correct 44 ms 1628 KB Output is correct
28 Correct 45 ms 1688 KB Output is correct
29 Correct 45 ms 1612 KB Output is correct
30 Correct 50 ms 1580 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 6 ms 468 KB Output is correct
38 Correct 4 ms 468 KB Output is correct
39 Correct 9 ms 724 KB Output is correct
40 Correct 22 ms 1136 KB Output is correct
41 Correct 34 ms 1552 KB Output is correct
42 Correct 35 ms 1524 KB Output is correct
43 Correct 36 ms 1520 KB Output is correct
44 Correct 39 ms 1580 KB Output is correct
45 Correct 36 ms 1524 KB Output is correct
46 Correct 34 ms 1484 KB Output is correct
47 Correct 35 ms 1492 KB Output is correct
48 Correct 35 ms 1540 KB Output is correct
49 Correct 34 ms 1536 KB Output is correct
50 Correct 37 ms 1540 KB Output is correct
51 Correct 35 ms 1540 KB Output is correct
52 Correct 34 ms 1540 KB Output is correct
53 Correct 35 ms 1536 KB Output is correct
54 Correct 35 ms 1532 KB Output is correct
55 Correct 34 ms 1548 KB Output is correct
56 Correct 36 ms 1656 KB Output is correct
57 Correct 33 ms 1532 KB Output is correct
58 Correct 34 ms 1536 KB Output is correct
59 Correct 34 ms 1512 KB Output is correct
60 Correct 34 ms 1532 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 13 ms 820 KB Output is correct
15 Correct 25 ms 1364 KB Output is correct
16 Correct 46 ms 1620 KB Output is correct
17 Correct 38 ms 2028 KB Output is correct
18 Correct 39 ms 1616 KB Output is correct
19 Correct 39 ms 1644 KB Output is correct
20 Correct 38 ms 1836 KB Output is correct
21 Correct 38 ms 1740 KB Output is correct
22 Correct 45 ms 1704 KB Output is correct
23 Correct 38 ms 1620 KB Output is correct
24 Correct 38 ms 1780 KB Output is correct
25 Correct 39 ms 1668 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 15 ms 788 KB Output is correct
30 Correct 30 ms 1172 KB Output is correct
31 Correct 44 ms 1664 KB Output is correct
32 Correct 44 ms 1532 KB Output is correct
33 Correct 43 ms 1672 KB Output is correct
34 Correct 44 ms 1636 KB Output is correct
35 Correct 47 ms 1660 KB Output is correct
36 Correct 46 ms 1532 KB Output is correct
37 Correct 44 ms 1628 KB Output is correct
38 Correct 45 ms 1688 KB Output is correct
39 Correct 45 ms 1612 KB Output is correct
40 Correct 50 ms 1580 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 2 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 6 ms 468 KB Output is correct
48 Correct 4 ms 468 KB Output is correct
49 Correct 9 ms 724 KB Output is correct
50 Correct 22 ms 1136 KB Output is correct
51 Correct 34 ms 1552 KB Output is correct
52 Correct 35 ms 1524 KB Output is correct
53 Correct 36 ms 1520 KB Output is correct
54 Correct 39 ms 1580 KB Output is correct
55 Correct 36 ms 1524 KB Output is correct
56 Correct 34 ms 1484 KB Output is correct
57 Correct 35 ms 1492 KB Output is correct
58 Correct 35 ms 1540 KB Output is correct
59 Correct 34 ms 1536 KB Output is correct
60 Correct 37 ms 1540 KB Output is correct
61 Correct 35 ms 1540 KB Output is correct
62 Correct 34 ms 1540 KB Output is correct
63 Correct 35 ms 1536 KB Output is correct
64 Correct 35 ms 1532 KB Output is correct
65 Correct 34 ms 1548 KB Output is correct
66 Correct 36 ms 1656 KB Output is correct
67 Correct 33 ms 1532 KB Output is correct
68 Correct 34 ms 1536 KB Output is correct
69 Correct 34 ms 1512 KB Output is correct
70 Correct 34 ms 1532 KB Output is correct
71 Correct 4 ms 560 KB Output is correct
72 Correct 4 ms 468 KB Output is correct
73 Correct 5 ms 468 KB Output is correct
74 Correct 4 ms 468 KB Output is correct
75 Correct 4 ms 468 KB Output is correct
76 Correct 7 ms 744 KB Output is correct
77 Correct 8 ms 724 KB Output is correct
78 Correct 7 ms 724 KB Output is correct
79 Correct 7 ms 764 KB Output is correct
80 Correct 7 ms 724 KB Output is correct
81 Correct 19 ms 1144 KB Output is correct
82 Correct 14 ms 1152 KB Output is correct
83 Correct 14 ms 1136 KB Output is correct
84 Correct 14 ms 1108 KB Output is correct
85 Correct 13 ms 1128 KB Output is correct
86 Correct 16 ms 1092 KB Output is correct
87 Correct 15 ms 1108 KB Output is correct
88 Correct 16 ms 1108 KB Output is correct
89 Correct 15 ms 1144 KB Output is correct
90 Correct 15 ms 1196 KB Output is correct
91 Correct 24 ms 1844 KB Output is correct
92 Correct 23 ms 1840 KB Output is correct
93 Correct 24 ms 1876 KB Output is correct
94 Correct 23 ms 1876 KB Output is correct
95 Correct 23 ms 1872 KB Output is correct
96 Correct 26 ms 2252 KB Output is correct
97 Correct 27 ms 2240 KB Output is correct
98 Correct 27 ms 2184 KB Output is correct
99 Correct 28 ms 2260 KB Output is correct
100 Correct 27 ms 2232 KB Output is correct
101 Correct 27 ms 2232 KB Output is correct
102 Correct 28 ms 2244 KB Output is correct
103 Correct 27 ms 2228 KB Output is correct
104 Correct 28 ms 2260 KB Output is correct
105 Correct 26 ms 2272 KB Output is correct
106 Correct 27 ms 2452 KB Output is correct
107 Correct 26 ms 2424 KB Output is correct
108 Correct 27 ms 2468 KB Output is correct
109 Correct 26 ms 2396 KB Output is correct
110 Correct 28 ms 2388 KB Output is correct
111 Correct 29 ms 2468 KB Output is correct
112 Correct 27 ms 2392 KB Output is correct
113 Correct 27 ms 2424 KB Output is correct
114 Correct 27 ms 2396 KB Output is correct
115 Correct 27 ms 2388 KB Output is correct

Subtask #6
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 13 ms 820 KB Output is correct
15 Correct 25 ms 1364 KB Output is correct
16 Correct 46 ms 1620 KB Output is correct
17 Correct 38 ms 2028 KB Output is correct
18 Correct 39 ms 1616 KB Output is correct
19 Correct 39 ms 1644 KB Output is correct
20 Correct 38 ms 1836 KB Output is correct
21 Correct 38 ms 1740 KB Output is correct
22 Correct 45 ms 1704 KB Output is correct
23 Correct 38 ms 1620 KB Output is correct
24 Correct 38 ms 1780 KB Output is correct
25 Correct 39 ms 1668 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 15 ms 788 KB Output is correct
30 Correct 30 ms 1172 KB Output is correct
31 Correct 44 ms 1664 KB Output is correct
32 Correct 44 ms 1532 KB Output is correct
33 Correct 43 ms 1672 KB Output is correct
34 Correct 44 ms 1636 KB Output is correct
35 Correct 47 ms 1660 KB Output is correct
36 Correct 46 ms 1532 KB Output is correct
37 Correct 44 ms 1628 KB Output is correct
38 Correct 45 ms 1688 KB Output is correct
39 Correct 45 ms 1612 KB Output is correct
40 Correct 50 ms 1580 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 2 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 6 ms 468 KB Output is correct
48 Correct 4 ms 468 KB Output is correct
49 Correct 9 ms 724 KB Output is correct
50 Correct 22 ms 1136 KB Output is correct
51 Correct 34 ms 1552 KB Output is correct
52 Correct 35 ms 1524 KB Output is correct
53 Correct 36 ms 1520 KB Output is correct
54 Correct 39 ms 1580 KB Output is correct
55 Correct 36 ms 1524 KB Output is correct
56 Correct 34 ms 1484 KB Output is correct
57 Correct 35 ms 1492 KB Output is correct
58 Correct 35 ms 1540 KB Output is correct
59 Correct 34 ms 1536 KB Output is correct
60 Correct 37 ms 1540 KB Output is correct
61 Correct 35 ms 1540 KB Output is correct
62 Correct 34 ms 1540 KB Output is correct
63 Correct 35 ms 1536 KB Output is correct
64 Correct 35 ms 1532 KB Output is correct
65 Correct 34 ms 1548 KB Output is correct
66 Correct 36 ms 1656 KB Output is correct
67 Correct 33 ms 1532 KB Output is correct
68 Correct 34 ms 1536 KB Output is correct
69 Correct 34 ms 1512 KB Output is correct
70 Correct 34 ms 1532 KB Output is correct
71 Correct 4 ms 560 KB Output is correct
72 Correct 4 ms 468 KB Output is correct
73 Correct 5 ms 468 KB Output is correct
74 Correct 4 ms 468 KB Output is correct
75 Correct 4 ms 468 KB Output is correct
76 Correct 7 ms 744 KB Output is correct
77 Correct 8 ms 724 KB Output is correct
78 Correct 7 ms 724 KB Output is correct
79 Correct 7 ms 764 KB Output is correct
80 Correct 7 ms 724 KB Output is correct
81 Correct 19 ms 1144 KB Output is correct
82 Correct 14 ms 1152 KB Output is correct
83 Correct 14 ms 1136 KB Output is correct
84 Correct 14 ms 1108 KB Output is correct
85 Correct 13 ms 1128 KB Output is correct
86 Correct 16 ms 1092 KB Output is correct
87 Correct 15 ms 1108 KB Output is correct
88 Correct 16 ms 1108 KB Output is correct
89 Correct 15 ms 1144 KB Output is correct
90 Correct 15 ms 1196 KB Output is correct
91 Correct 24 ms 1844 KB Output is correct
92 Correct 23 ms 1840 KB Output is correct
93 Correct 24 ms 1876 KB Output is correct
94 Correct 23 ms 1876 KB Output is correct
95 Correct 23 ms 1872 KB Output is correct
96 Correct 26 ms 2252 KB Output is correct
97 Correct 27 ms 2240 KB Output is correct
98 Correct 27 ms 2184 KB Output is correct
99 Correct 28 ms 2260 KB Output is correct
100 Correct 27 ms 2232 KB Output is correct
101 Correct 27 ms 2232 KB Output is correct
102 Correct 28 ms 2244 KB Output is correct
103 Correct 27 ms 2228 KB Output is correct
104 Correct 28 ms 2260 KB Output is correct
105 Correct 26 ms 2272 KB Output is correct
106 Correct 27 ms 2452 KB Output is correct
107 Correct 26 ms 2424 KB Output is correct
108 Correct 27 ms 2468 KB Output is correct
109 Correct 26 ms 2396 KB Output is correct
110 Correct 28 ms 2388 KB Output is correct
111 Correct 29 ms 2468 KB Output is correct
112 Correct 27 ms 2392 KB Output is correct
113 Correct 27 ms 2424 KB Output is correct
114 Correct 27 ms 2396 KB Output is correct
115 Correct 27 ms 2388 KB Output is correct
116 Correct 958 ms 2276 KB Output is correct
117 Correct 766 ms 2392 KB Output is correct
118 Correct 1623 ms 2908 KB Output is correct
119 Correct 815 ms 2920 KB Output is correct
120 Correct 498 ms 2900 KB Output is correct
121 Correct 1159 ms 3448 KB Output is correct
122 Correct 681 ms 3396 KB Output is correct
123 Correct 3836 ms 4280 KB Output is correct
124 Correct 1095 ms 4464 KB Output is correct
125 Correct 840 ms 4512 KB Output is correct
126 Execution timed out 7058 ms 4508 KB Time limit exceeded
127 Halted 0 ms 0 KB -