oj.uz

답안 #678258

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
678258 2023-01-05T11:05:53 Z stanislavpolyn Diversity (CEOI21_diversity) C++17
64 / 100
 7000 ms 4536 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("O3")

#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

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 14 ms 980 KB Output is correct
5 Correct 25 ms 1792 KB Output is correct
6 Correct 42 ms 2376 KB Output is correct
7 Correct 35 ms 2628 KB Output is correct
8 Correct 53 ms 2212 KB Output is correct
9 Correct 51 ms 2308 KB Output is correct
10 Correct 39 ms 2464 KB Output is correct
11 Correct 38 ms 2380 KB Output is correct
12 Correct 42 ms 2328 KB Output is correct
13 Correct 41 ms 2280 KB Output is correct
14 Correct 40 ms 2364 KB Output is correct
15 Correct 39 ms 2368 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 14 ms 980 KB Output is correct
5 Correct 25 ms 1792 KB Output is correct
6 Correct 42 ms 2376 KB Output is correct
7 Correct 35 ms 2628 KB Output is correct
8 Correct 53 ms 2212 KB Output is correct
9 Correct 51 ms 2308 KB Output is correct
10 Correct 39 ms 2464 KB Output is correct
11 Correct 38 ms 2380 KB Output is correct
12 Correct 42 ms 2328 KB Output is correct
13 Correct 41 ms 2280 KB Output is correct
14 Correct 40 ms 2364 KB Output is correct
15 Correct 39 ms 2368 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 15 ms 984 KB Output is correct
20 Correct 30 ms 1712 KB Output is correct
21 Correct 45 ms 2468 KB Output is correct
22 Correct 50 ms 2416 KB Output is correct
23 Correct 47 ms 2464 KB Output is correct
24 Correct 47 ms 2384 KB Output is correct
25 Correct 46 ms 2376 KB Output is correct
26 Correct 55 ms 2384 KB Output is correct
27 Correct 52 ms 2396 KB Output is correct
28 Correct 49 ms 2480 KB Output is correct
29 Correct 49 ms 2360 KB Output is correct
30 Correct 46 ms 2440 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 14 ms 980 KB Output is correct
5 Correct 25 ms 1792 KB Output is correct
6 Correct 42 ms 2376 KB Output is correct
7 Correct 35 ms 2628 KB Output is correct
8 Correct 53 ms 2212 KB Output is correct
9 Correct 51 ms 2308 KB Output is correct
10 Correct 39 ms 2464 KB Output is correct
11 Correct 38 ms 2380 KB Output is correct
12 Correct 42 ms 2328 KB Output is correct
13 Correct 41 ms 2280 KB Output is correct
14 Correct 40 ms 2364 KB Output is correct
15 Correct 39 ms 2368 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 15 ms 984 KB Output is correct
20 Correct 30 ms 1712 KB Output is correct
21 Correct 45 ms 2468 KB Output is correct
22 Correct 50 ms 2416 KB Output is correct
23 Correct 47 ms 2464 KB Output is correct
24 Correct 47 ms 2384 KB Output is correct
25 Correct 46 ms 2376 KB Output is correct
26 Correct 55 ms 2384 KB Output is correct
27 Correct 52 ms 2396 KB Output is correct
28 Correct 49 ms 2480 KB Output is correct
29 Correct 49 ms 2360 KB Output is correct
30 Correct 46 ms 2440 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 2 ms 388 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 6 ms 724 KB Output is correct
38 Correct 5 ms 720 KB Output is correct
39 Correct 12 ms 1204 KB Output is correct
40 Correct 25 ms 1868 KB Output is correct
41 Correct 45 ms 2644 KB Output is correct
42 Correct 37 ms 2668 KB Output is correct
43 Correct 39 ms 2608 KB Output is correct
44 Correct 37 ms 2604 KB Output is correct
45 Correct 38 ms 2800 KB Output is correct
46 Correct 35 ms 2604 KB Output is correct
47 Correct 41 ms 2724 KB Output is correct
48 Correct 39 ms 2644 KB Output is correct
49 Correct 36 ms 2656 KB Output is correct
50 Correct 39 ms 2628 KB Output is correct
51 Correct 37 ms 2636 KB Output is correct
52 Correct 39 ms 2612 KB Output is correct
53 Correct 37 ms 2624 KB Output is correct
54 Correct 38 ms 2672 KB Output is correct
55 Correct 40 ms 2620 KB Output is correct
56 Correct 36 ms 2604 KB Output is correct
57 Correct 35 ms 2672 KB Output is correct
58 Correct 36 ms 2616 KB Output is correct
59 Correct 43 ms 2664 KB Output is correct
60 Correct 43 ms 2672 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 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 14 ms 980 KB Output is correct
15 Correct 25 ms 1792 KB Output is correct
16 Correct 42 ms 2376 KB Output is correct
17 Correct 35 ms 2628 KB Output is correct
18 Correct 53 ms 2212 KB Output is correct
19 Correct 51 ms 2308 KB Output is correct
20 Correct 39 ms 2464 KB Output is correct
21 Correct 38 ms 2380 KB Output is correct
22 Correct 42 ms 2328 KB Output is correct
23 Correct 41 ms 2280 KB Output is correct
24 Correct 40 ms 2364 KB Output is correct
25 Correct 39 ms 2368 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 15 ms 984 KB Output is correct
30 Correct 30 ms 1712 KB Output is correct
31 Correct 45 ms 2468 KB Output is correct
32 Correct 50 ms 2416 KB Output is correct
33 Correct 47 ms 2464 KB Output is correct
34 Correct 47 ms 2384 KB Output is correct
35 Correct 46 ms 2376 KB Output is correct
36 Correct 55 ms 2384 KB Output is correct
37 Correct 52 ms 2396 KB Output is correct
38 Correct 49 ms 2480 KB Output is correct
39 Correct 49 ms 2360 KB Output is correct
40 Correct 46 ms 2440 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 2 ms 340 KB Output is correct
45 Correct 2 ms 388 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 6 ms 724 KB Output is correct
48 Correct 5 ms 720 KB Output is correct
49 Correct 12 ms 1204 KB Output is correct
50 Correct 25 ms 1868 KB Output is correct
51 Correct 45 ms 2644 KB Output is correct
52 Correct 37 ms 2668 KB Output is correct
53 Correct 39 ms 2608 KB Output is correct
54 Correct 37 ms 2604 KB Output is correct
55 Correct 38 ms 2800 KB Output is correct
56 Correct 35 ms 2604 KB Output is correct
57 Correct 41 ms 2724 KB Output is correct
58 Correct 39 ms 2644 KB Output is correct
59 Correct 36 ms 2656 KB Output is correct
60 Correct 39 ms 2628 KB Output is correct
61 Correct 37 ms 2636 KB Output is correct
62 Correct 39 ms 2612 KB Output is correct
63 Correct 37 ms 2624 KB Output is correct
64 Correct 38 ms 2672 KB Output is correct
65 Correct 40 ms 2620 KB Output is correct
66 Correct 36 ms 2604 KB Output is correct
67 Correct 35 ms 2672 KB Output is correct
68 Correct 36 ms 2616 KB Output is correct
69 Correct 43 ms 2664 KB Output is correct
70 Correct 43 ms 2672 KB Output is correct
71 Correct 5 ms 724 KB Output is correct
72 Correct 6 ms 724 KB Output is correct
73 Correct 5 ms 784 KB Output is correct
74 Correct 4 ms 780 KB Output is correct
75 Correct 5 ms 724 KB Output is correct
76 Correct 8 ms 1228 KB Output is correct
77 Correct 8 ms 1228 KB Output is correct
78 Correct 8 ms 1124 KB Output is correct
79 Correct 10 ms 1236 KB Output is correct
80 Correct 8 ms 1116 KB Output is correct
81 Correct 18 ms 2112 KB Output is correct
82 Correct 14 ms 2020 KB Output is correct
83 Correct 16 ms 2128 KB Output is correct
84 Correct 15 ms 2004 KB Output is correct
85 Correct 15 ms 2144 KB Output is correct
86 Correct 18 ms 2252 KB Output is correct
87 Correct 17 ms 2252 KB Output is correct
88 Correct 17 ms 2256 KB Output is correct
89 Correct 17 ms 2264 KB Output is correct
90 Correct 18 ms 2180 KB Output is correct
91 Correct 25 ms 3608 KB Output is correct
92 Correct 26 ms 3616 KB Output is correct
93 Correct 27 ms 3556 KB Output is correct
94 Correct 26 ms 3584 KB Output is correct
95 Correct 25 ms 3604 KB Output is correct
96 Correct 29 ms 4140 KB Output is correct
97 Correct 31 ms 4112 KB Output is correct
98 Correct 32 ms 4044 KB Output is correct
99 Correct 28 ms 4108 KB Output is correct
100 Correct 30 ms 4132 KB Output is correct
101 Correct 32 ms 4088 KB Output is correct
102 Correct 28 ms 4068 KB Output is correct
103 Correct 30 ms 4172 KB Output is correct
104 Correct 27 ms 4152 KB Output is correct
105 Correct 34 ms 4156 KB Output is correct
106 Correct 34 ms 4404 KB Output is correct
107 Correct 29 ms 4348 KB Output is correct
108 Correct 30 ms 4392 KB Output is correct
109 Correct 30 ms 4296 KB Output is correct
110 Correct 28 ms 4084 KB Output is correct
111 Correct 30 ms 3352 KB Output is correct
112 Correct 27 ms 3032 KB Output is correct
113 Correct 28 ms 2752 KB Output is correct
114 Correct 28 ms 2664 KB Output is correct
115 Correct 34 ms 2600 KB Output is correct

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 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 14 ms 980 KB Output is correct
15 Correct 25 ms 1792 KB Output is correct
16 Correct 42 ms 2376 KB Output is correct
17 Correct 35 ms 2628 KB Output is correct
18 Correct 53 ms 2212 KB Output is correct
19 Correct 51 ms 2308 KB Output is correct
20 Correct 39 ms 2464 KB Output is correct
21 Correct 38 ms 2380 KB Output is correct
22 Correct 42 ms 2328 KB Output is correct
23 Correct 41 ms 2280 KB Output is correct
24 Correct 40 ms 2364 KB Output is correct
25 Correct 39 ms 2368 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 15 ms 984 KB Output is correct
30 Correct 30 ms 1712 KB Output is correct
31 Correct 45 ms 2468 KB Output is correct
32 Correct 50 ms 2416 KB Output is correct
33 Correct 47 ms 2464 KB Output is correct
34 Correct 47 ms 2384 KB Output is correct
35 Correct 46 ms 2376 KB Output is correct
36 Correct 55 ms 2384 KB Output is correct
37 Correct 52 ms 2396 KB Output is correct
38 Correct 49 ms 2480 KB Output is correct
39 Correct 49 ms 2360 KB Output is correct
40 Correct 46 ms 2440 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 2 ms 340 KB Output is correct
45 Correct 2 ms 388 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 6 ms 724 KB Output is correct
48 Correct 5 ms 720 KB Output is correct
49 Correct 12 ms 1204 KB Output is correct
50 Correct 25 ms 1868 KB Output is correct
51 Correct 45 ms 2644 KB Output is correct
52 Correct 37 ms 2668 KB Output is correct
53 Correct 39 ms 2608 KB Output is correct
54 Correct 37 ms 2604 KB Output is correct
55 Correct 38 ms 2800 KB Output is correct
56 Correct 35 ms 2604 KB Output is correct
57 Correct 41 ms 2724 KB Output is correct
58 Correct 39 ms 2644 KB Output is correct
59 Correct 36 ms 2656 KB Output is correct
60 Correct 39 ms 2628 KB Output is correct
61 Correct 37 ms 2636 KB Output is correct
62 Correct 39 ms 2612 KB Output is correct
63 Correct 37 ms 2624 KB Output is correct
64 Correct 38 ms 2672 KB Output is correct
65 Correct 40 ms 2620 KB Output is correct
66 Correct 36 ms 2604 KB Output is correct
67 Correct 35 ms 2672 KB Output is correct
68 Correct 36 ms 2616 KB Output is correct
69 Correct 43 ms 2664 KB Output is correct
70 Correct 43 ms 2672 KB Output is correct
71 Correct 5 ms 724 KB Output is correct
72 Correct 6 ms 724 KB Output is correct
73 Correct 5 ms 784 KB Output is correct
74 Correct 4 ms 780 KB Output is correct
75 Correct 5 ms 724 KB Output is correct
76 Correct 8 ms 1228 KB Output is correct
77 Correct 8 ms 1228 KB Output is correct
78 Correct 8 ms 1124 KB Output is correct
79 Correct 10 ms 1236 KB Output is correct
80 Correct 8 ms 1116 KB Output is correct
81 Correct 18 ms 2112 KB Output is correct
82 Correct 14 ms 2020 KB Output is correct
83 Correct 16 ms 2128 KB Output is correct
84 Correct 15 ms 2004 KB Output is correct
85 Correct 15 ms 2144 KB Output is correct
86 Correct 18 ms 2252 KB Output is correct
87 Correct 17 ms 2252 KB Output is correct
88 Correct 17 ms 2256 KB Output is correct
89 Correct 17 ms 2264 KB Output is correct
90 Correct 18 ms 2180 KB Output is correct
91 Correct 25 ms 3608 KB Output is correct
92 Correct 26 ms 3616 KB Output is correct
93 Correct 27 ms 3556 KB Output is correct
94 Correct 26 ms 3584 KB Output is correct
95 Correct 25 ms 3604 KB Output is correct
96 Correct 29 ms 4140 KB Output is correct
97 Correct 31 ms 4112 KB Output is correct
98 Correct 32 ms 4044 KB Output is correct
99 Correct 28 ms 4108 KB Output is correct
100 Correct 30 ms 4132 KB Output is correct
101 Correct 32 ms 4088 KB Output is correct
102 Correct 28 ms 4068 KB Output is correct
103 Correct 30 ms 4172 KB Output is correct
104 Correct 27 ms 4152 KB Output is correct
105 Correct 34 ms 4156 KB Output is correct
106 Correct 34 ms 4404 KB Output is correct
107 Correct 29 ms 4348 KB Output is correct
108 Correct 30 ms 4392 KB Output is correct
109 Correct 30 ms 4296 KB Output is correct
110 Correct 28 ms 4084 KB Output is correct
111 Correct 30 ms 3352 KB Output is correct
112 Correct 27 ms 3032 KB Output is correct
113 Correct 28 ms 2752 KB Output is correct
114 Correct 28 ms 2664 KB Output is correct
115 Correct 34 ms 2600 KB Output is correct
116 Correct 1038 ms 1880 KB Output is correct
117 Correct 777 ms 1884 KB Output is correct
118 Correct 1713 ms 2164 KB Output is correct
119 Correct 827 ms 2912 KB Output is correct
120 Correct 525 ms 2932 KB Output is correct
121 Correct 1196 ms 3312 KB Output is correct
122 Correct 674 ms 3448 KB Output is correct
123 Correct 3996 ms 4160 KB Output is correct
124 Correct 1028 ms 4536 KB Output is correct
125 Correct 766 ms 4496 KB Output is correct
126 Execution timed out 7035 ms 4372 KB Time limit exceeded
127 Halted 0 ms 0 KB -