oj.uz

Submission #923423

# Submission time Handle Problem Language Result Execution time Memory
923423 2024-02-07T08:17:32 Z efedmrlr Road Closures (APIO21_roads) C++17
100 / 100
 289 ms 54612 KB 
#include "roads.h"
// #pragma GCC optimize("O3,Ofast,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>

using namespace std;


#define lli long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int i = 0; (i) < (n); (i)++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const double EPS = 0.00001;
const lli INF = 1e17;
const lli MX = 1e9 + 5;
const int M = 1e5+5;
const int ALPH = 26;
const int LGN = 25;
constexpr int MOD = 1e9+7;
int n,m,q,k;

vector<int> deg(M, 0);
vector<array<int,2> > p(M);
vector<vector<array<int,2> > > adj(M, vector<array<int,2> >());
vector<array<int,2> > deg_nodes;
vector<int> tin(M, 0), vis(M, -1);
int timer = 0;
set<array<int,2> > roots;
  
    struct Node {
        int lc, rc;
        lli x;
        lli y;
        int sz;
        lli sum;
        Node(int val) : lc(-1), rc(-1), x(val), y(rng()), sz(1), sum(val) {};

    };
     
    struct SegT {
        vector<Node> data;
        int root = -1;
        SegT() : root(-1) {};
        lli getSum(int t) {
            if(t == -1) return 0;
            return data[t].sum;
        }
        int getSize(int t) {
            if(t == -1) return 0;
            return data[t].sz;
        }
        void merge(int L, int R, int &t) {
            if(L == -1) {
                t = R;
                return;
            }
            if(R == -1) {
                t = L;
                return;
            }
            if(data[L].y > data[R].y) {
                t = L;
                merge(data[t].rc, R, data[t].rc);
            }
            else {
                t = R;
                merge(L, data[t].lc, data[t].lc);
            }
            data[t].sum = getSum(data[t].lc) + getSum(data[t].rc) + data[t].x;
            data[t].sum = min(data[t].sum, INF);
            data[t].sz = getSize(data[t].lc) + getSize(data[t].rc) + 1;
        }
        void split(int t, int &L, int &R, int x) {
            if(t == -1) {
                L = R = -1;
                return;
            }
            if(data[t].x <= x) {
                L = t;
                split(data[t].rc, data[t].rc, R, x);
            }
            else {
                R = t;
                split(data[t].lc, L, data[t].lc, x);
            }
            data[t].sum = getSum(data[t].lc) + getSum(data[t].rc) + data[t].x;
            data[t].sum = min(data[t].sum, INF);
            data[t].sz = getSize(data[t].lc) + getSize(data[t].rc) + 1;
        }
        void split_k(int t, int &L, int &R, int ks, int add = 0) {
            if(t == -1) {
                L = R = -1;
                return;
            }
            int sub = getSize(data[t].lc) + add;
            if(sub < ks) {
                L = t;
                split_k(data[t].rc, data[t].rc, R, ks, sub + 1);
            } 
            else {
                R = t;
                split_k(data[t].lc, L, data[t].lc, ks, add);
            }
            data[t].sum = getSum(data[t].lc) + getSum(data[t].rc) + data[t].x;
            data[t].sum = min(data[t].sum, INF);
            data[t].sz = getSize(data[t].lc) + getSize(data[t].rc) + 1;
        }
        void insert(int val) {
            // cout << "insert:" << val << "\n";
            // if(!(0ll < val && val < MX)) {
            //  return;
            // }
            data.pb(Node(val));
            int tl, tr;
            split(root, tl, tr, val);
            merge(tl, (int)data.size() - 1, root);
            merge(root, tr, root);
        }
 
        lli k_sum(int sm) {
            int tl, tr;
            split_k(root, tl, tr, sm);
            lli ans = getSum(tl);
            if(getSize(tl) < sm) {
                return INF;
            }
            // assert(getSize(tl) == sm);
            // cout << sm << " sum : " << ans << "\n";

            merge(tl, tr, root);
            return min(INF, ans);
        }
    };

vector<SegT> st;
void prec(int node, int par, int cst) {
    p[node] = array<int, 2>({par, cst});
    tin[node] = timer++;
    roots.insert({tin[node], node});

    for(auto itr = adj[node].begin(); itr != adj[node].end(); ) {
        int c = (*itr)[0];
        if(c == par) {
            itr = adj[node].erase(itr);
            continue;
        }
        prec((int)c, node, (*itr)[1]);
        itr++;
    }
}
array<lli, 2> dfs(int node) {
    vis[node] = k;
    // cout<<"dfs : " << node << endl;
    int csz = 0;
    vector<lli> A1, A2;
    vector<int> srt;
    array<lli,2> ret = {INF, INF};
    lli sum = 0;
    for(auto &c : adj[node]) {
        if(deg[c[0]] <= k) {
            break;
        }
        srt.pb(csz);
        csz++;
        auto tmp = dfs((int)c[0]);
        A1.pb(tmp[1] + c[1]); A2.pb(tmp[0]);
        sum += min(tmp[0], tmp[1] + c[1]);
    }
    auto comp = [&](const int &x, const int &y) {
        // assert(max(x, y) < min(A1.size(), A2.size()));
        return A1[x] - A2[x] < A1[y] - A2[y];
    };
    int cnt = deg[node] - k;
    // assert(cnt > 0);
    sort(all(srt), comp);
    vector<lli> cev(csz + 1);
    cev[0] = sum;
    
    for(int i = 1; i <= csz; i++) {
        cev[i] = cev[i - 1] - min(A1[srt[i - 1] ], A2[srt[i - 1]]) + A1[srt[i - 1]];
    }
    for(int i = 0; i <= min(cnt, csz); i++) {
        ret[0] = min(ret[0], cev[i] + st[node].k_sum(cnt - i));
        if(i < cnt) ret[1] = min(ret[1], cev[i] + st[node].k_sum(cnt - i - 1));
    }
    // cout << "node:"<<node<<" normal:"<<ret[0]<<" del par:"<<ret[1]<<"\n";
    // cout<<"cnt:"<<cnt<<"csz:"<<csz<<"\n";
    return ret;

}
lli solve_k() {
    // cout<<"k:"<<k<<"\n\n";
    while(deg_nodes.size() && deg_nodes.back()[0] == k) {
        auto cur = deg_nodes.back();
        // cout<<"erase:"<<cur[1]<<"\n";
        roots.erase({tin[cur[1]], cur[1]});
        st[p[cur[1]][0]].insert(p[cur[1]][1]);
        for(auto &c : adj[cur[1]]) {
            st[c[0]].insert(c[1]);
        }
        deg_nodes.pop_back();
    }
    lli ret = 0;
    for(auto &c : roots) {
        if(vis[c[1]] == k) continue;
        
        ret += dfs(c[1])[0];
    }
    return ret;
}


std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,
  std::vector<int> V,
  std::vector<int> W) {
    n = N;
    lli sum = 0ll;
    for(int i = 0; i<n - 1; i++) {
      V[i]++; U[i]++;
      adj[U[i]].pb({V[i], W[i]});
      adj[V[i]].pb({U[i], W[i]});
      sum += W[i]; 
    }
    vector<lli> ans(n);
    deg_nodes.resize(n);
    for(int i = 1; i<=n; i++) {
        deg[i] = (int)adj[i].size();
        deg_nodes[i - 1] = {deg[i], i};
    }
    sort(rall(deg_nodes));
    auto comp = [](const array<int,2> &x, const array<int,2> &y) { return deg[x[0]] < deg[y[0]]; }; 
    for(int i = 1; i<=n; i++) {
        sort(rall(adj[i]), comp);
    }
    prec(1, 0, 0);
    ans[0] = sum;
    st.assign(n + 3, SegT());
    

    for(int i = 1; i<=n - 1; i++) {
        // cout<<"i:"<<i<<endl;
        k = i;
        ans[i] = solve_k();

    }
    return ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4700 KB Output is correct
2 Correct 5 ms 5212 KB Output is correct
3 Correct 6 ms 5260 KB Output is correct
4 Correct 5 ms 5212 KB Output is correct
5 Correct 3 ms 4696 KB Output is correct
6 Correct 3 ms 4700 KB Output is correct
7 Correct 3 ms 4700 KB Output is correct
8 Correct 5 ms 5024 KB Output is correct
9 Correct 5 ms 5212 KB Output is correct
10 Correct 2 ms 4700 KB Output is correct
11 Correct 3 ms 4700 KB Output is correct
12 Correct 129 ms 17568 KB Output is correct
13 Correct 229 ms 27008 KB Output is correct
14 Correct 243 ms 27864 KB Output is correct
15 Correct 248 ms 28900 KB Output is correct
16 Correct 286 ms 28368 KB Output is correct
17 Correct 211 ms 28540 KB Output is correct
18 Correct 2 ms 4700 KB Output is correct
19 Correct 178 ms 25912 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4700 KB Output is correct
2 Correct 99 ms 45980 KB Output is correct
3 Correct 107 ms 51264 KB Output is correct
4 Correct 117 ms 54424 KB Output is correct
5 Correct 117 ms 54612 KB Output is correct
6 Correct 4 ms 5468 KB Output is correct
7 Correct 4 ms 5724 KB Output is correct
8 Correct 4 ms 5600 KB Output is correct
9 Correct 2 ms 4700 KB Output is correct
10 Correct 2 ms 4700 KB Output is correct
11 Correct 2 ms 4700 KB Output is correct
12 Correct 67 ms 34100 KB Output is correct
13 Correct 120 ms 53844 KB Output is correct
14 Correct 2 ms 4700 KB Output is correct
15 Correct 103 ms 48824 KB Output is correct
16 Correct 126 ms 53672 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4700 KB Output is correct
2 Correct 2 ms 4700 KB Output is correct
3 Correct 2 ms 4696 KB Output is correct
4 Correct 2 ms 4700 KB Output is correct
5 Correct 2 ms 4700 KB Output is correct
6 Correct 3 ms 4700 KB Output is correct
7 Correct 2 ms 4700 KB Output is correct
8 Correct 2 ms 4656 KB Output is correct
9 Correct 3 ms 4700 KB Output is correct
10 Correct 3 ms 4700 KB Output is correct
11 Correct 2 ms 4700 KB Output is correct
12 Correct 3 ms 4700 KB Output is correct
13 Correct 2 ms 4696 KB Output is correct
14 Correct 3 ms 4700 KB Output is correct
15 Correct 3 ms 4700 KB Output is correct
16 Correct 2 ms 4700 KB Output is correct
17 Correct 2 ms 4700 KB Output is correct
18 Correct 3 ms 4700 KB Output is correct
19 Correct 2 ms 4700 KB Output is correct
20 Correct 2 ms 4700 KB Output is correct
21 Correct 2 ms 4712 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4700 KB Output is correct
2 Correct 2 ms 4700 KB Output is correct
3 Correct 2 ms 4696 KB Output is correct
4 Correct 2 ms 4700 KB Output is correct
5 Correct 2 ms 4700 KB Output is correct
6 Correct 3 ms 4700 KB Output is correct
7 Correct 2 ms 4700 KB Output is correct
8 Correct 2 ms 4656 KB Output is correct
9 Correct 3 ms 4700 KB Output is correct
10 Correct 3 ms 4700 KB Output is correct
11 Correct 2 ms 4700 KB Output is correct
12 Correct 3 ms 4700 KB Output is correct
13 Correct 2 ms 4696 KB Output is correct
14 Correct 3 ms 4700 KB Output is correct
15 Correct 3 ms 4700 KB Output is correct
16 Correct 2 ms 4700 KB Output is correct
17 Correct 2 ms 4700 KB Output is correct
18 Correct 3 ms 4700 KB Output is correct
19 Correct 2 ms 4700 KB Output is correct
20 Correct 2 ms 4700 KB Output is correct
21 Correct 2 ms 4712 KB Output is correct
22 Correct 2 ms 4700 KB Output is correct
23 Correct 4 ms 4956 KB Output is correct
24 Correct 4 ms 5212 KB Output is correct
25 Correct 4 ms 4956 KB Output is correct
26 Correct 4 ms 5208 KB Output is correct
27 Correct 6 ms 5284 KB Output is correct
28 Correct 5 ms 5212 KB Output is correct
29 Correct 5 ms 5208 KB Output is correct
30 Correct 6 ms 5212 KB Output is correct
31 Correct 5 ms 5180 KB Output is correct
32 Correct 5 ms 5408 KB Output is correct
33 Correct 4 ms 5468 KB Output is correct
34 Correct 4 ms 5724 KB Output is correct
35 Correct 4 ms 5724 KB Output is correct
36 Correct 6 ms 5212 KB Output is correct
37 Correct 6 ms 5080 KB Output is correct
38 Correct 5 ms 5284 KB Output is correct
39 Correct 2 ms 4700 KB Output is correct
40 Correct 3 ms 4700 KB Output is correct
41 Correct 3 ms 4700 KB Output is correct
42 Correct 2 ms 4700 KB Output is correct
43 Correct 2 ms 4700 KB Output is correct
44 Correct 2 ms 4700 KB Output is correct
45 Correct 3 ms 4700 KB Output is correct
46 Correct 2 ms 4764 KB Output is correct
47 Correct 2 ms 4700 KB Output is correct
48 Correct 2 ms 4700 KB Output is correct
49 Correct 2 ms 4700 KB Output is correct
50 Correct 3 ms 4700 KB Output is correct
51 Correct 2 ms 4700 KB Output is correct
52 Correct 2 ms 4952 KB Output is correct
53 Correct 4 ms 4956 KB Output is correct
54 Correct 4 ms 5212 KB Output is correct
55 Correct 5 ms 5212 KB Output is correct
56 Correct 6 ms 4956 KB Output is correct
57 Correct 5 ms 5212 KB Output is correct
58 Correct 2 ms 4700 KB Output is correct
59 Correct 4 ms 4700 KB Output is correct
60 Correct 2 ms 4700 KB Output is correct
61 Correct 3 ms 4700 KB Output is correct
62 Correct 2 ms 4696 KB Output is correct
63 Correct 2 ms 4700 KB Output is correct
64 Correct 6 ms 5208 KB Output is correct
65 Correct 4 ms 5208 KB Output is correct
66 Correct 5 ms 5212 KB Output is correct
67 Correct 5 ms 5212 KB Output is correct
68 Correct 5 ms 5244 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 157 ms 27044 KB Output is correct
2 Correct 164 ms 26704 KB Output is correct
3 Correct 253 ms 28316 KB Output is correct
4 Correct 177 ms 27728 KB Output is correct
5 Correct 195 ms 28672 KB Output is correct
6 Correct 237 ms 26280 KB Output is correct
7 Correct 222 ms 27472 KB Output is correct
8 Correct 171 ms 27588 KB Output is correct
9 Correct 155 ms 38228 KB Output is correct
10 Correct 174 ms 27336 KB Output is correct
11 Correct 223 ms 27732 KB Output is correct
12 Correct 237 ms 26152 KB Output is correct
13 Correct 2 ms 4700 KB Output is correct
14 Correct 102 ms 48916 KB Output is correct
15 Correct 113 ms 53792 KB Output is correct
16 Correct 5 ms 5212 KB Output is correct
17 Correct 4 ms 5212 KB Output is correct
18 Correct 7 ms 5212 KB Output is correct
19 Correct 5 ms 5464 KB Output is correct
20 Correct 5 ms 5060 KB Output is correct
21 Correct 185 ms 25960 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 157 ms 27044 KB Output is correct
2 Correct 164 ms 26704 KB Output is correct
3 Correct 253 ms 28316 KB Output is correct
4 Correct 177 ms 27728 KB Output is correct
5 Correct 195 ms 28672 KB Output is correct
6 Correct 237 ms 26280 KB Output is correct
7 Correct 222 ms 27472 KB Output is correct
8 Correct 171 ms 27588 KB Output is correct
9 Correct 155 ms 38228 KB Output is correct
10 Correct 174 ms 27336 KB Output is correct
11 Correct 223 ms 27732 KB Output is correct
12 Correct 237 ms 26152 KB Output is correct
13 Correct 2 ms 4700 KB Output is correct
14 Correct 102 ms 48916 KB Output is correct
15 Correct 113 ms 53792 KB Output is correct
16 Correct 5 ms 5212 KB Output is correct
17 Correct 4 ms 5212 KB Output is correct
18 Correct 7 ms 5212 KB Output is correct
19 Correct 5 ms 5464 KB Output is correct
20 Correct 5 ms 5060 KB Output is correct
21 Correct 185 ms 25960 KB Output is correct
22 Correct 2 ms 4696 KB Output is correct
23 Correct 2 ms 4700 KB Output is correct
24 Correct 2 ms 4696 KB Output is correct
25 Correct 155 ms 24740 KB Output is correct
26 Correct 118 ms 22636 KB Output is correct
27 Correct 180 ms 27784 KB Output is correct
28 Correct 279 ms 28792 KB Output is correct
29 Correct 203 ms 26704 KB Output is correct
30 Correct 257 ms 25176 KB Output is correct
31 Correct 275 ms 25688 KB Output is correct
32 Correct 154 ms 25788 KB Output is correct
33 Correct 213 ms 26540 KB Output is correct
34 Correct 196 ms 27476 KB Output is correct
35 Correct 179 ms 39252 KB Output is correct
36 Correct 264 ms 27800 KB Output is correct
37 Correct 245 ms 26496 KB Output is correct
38 Correct 69 ms 34132 KB Output is correct
39 Correct 122 ms 53840 KB Output is correct
40 Correct 5 ms 5212 KB Output is correct
41 Correct 4 ms 5212 KB Output is correct
42 Correct 6 ms 5212 KB Output is correct
43 Correct 5 ms 4956 KB Output is correct
44 Correct 5 ms 5052 KB Output is correct
45 Correct 3 ms 4700 KB Output is correct
46 Correct 2 ms 4584 KB Output is correct
47 Correct 3 ms 4700 KB Output is correct
48 Correct 2 ms 4700 KB Output is correct
49 Correct 2 ms 4700 KB Output is correct
50 Correct 128 ms 18568 KB Output is correct
51 Correct 230 ms 28544 KB Output is correct
52 Correct 171 ms 26996 KB Output is correct
53 Correct 152 ms 26532 KB Output is correct
54 Correct 257 ms 28572 KB Output is correct
55 Correct 181 ms 27796 KB Output is correct
56 Correct 199 ms 28664 KB Output is correct
57 Correct 220 ms 26276 KB Output is correct
58 Correct 195 ms 27296 KB Output is correct
59 Correct 171 ms 27676 KB Output is correct
60 Correct 161 ms 38228 KB Output is correct
61 Correct 185 ms 27112 KB Output is correct
62 Correct 239 ms 27724 KB Output is correct
63 Correct 224 ms 27136 KB Output is correct
64 Correct 2 ms 4700 KB Output is correct
65 Correct 111 ms 48804 KB Output is correct
66 Correct 131 ms 53812 KB Output is correct
67 Correct 5 ms 5388 KB Output is correct
68 Correct 5 ms 5212 KB Output is correct
69 Correct 5 ms 5212 KB Output is correct
70 Correct 5 ms 5028 KB Output is correct
71 Correct 7 ms 5212 KB Output is correct
72 Correct 180 ms 25404 KB Output is correct

Subtask #7
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4700 KB Output is correct
2 Correct 5 ms 5212 KB Output is correct
3 Correct 6 ms 5260 KB Output is correct
4 Correct 5 ms 5212 KB Output is correct
5 Correct 3 ms 4696 KB Output is correct
6 Correct 3 ms 4700 KB Output is correct
7 Correct 3 ms 4700 KB Output is correct
8 Correct 5 ms 5024 KB Output is correct
9 Correct 5 ms 5212 KB Output is correct
10 Correct 2 ms 4700 KB Output is correct
11 Correct 3 ms 4700 KB Output is correct
12 Correct 129 ms 17568 KB Output is correct
13 Correct 229 ms 27008 KB Output is correct
14 Correct 243 ms 27864 KB Output is correct
15 Correct 248 ms 28900 KB Output is correct
16 Correct 286 ms 28368 KB Output is correct
17 Correct 211 ms 28540 KB Output is correct
18 Correct 2 ms 4700 KB Output is correct
19 Correct 178 ms 25912 KB Output is correct
20 Correct 2 ms 4700 KB Output is correct
21 Correct 99 ms 45980 KB Output is correct
22 Correct 107 ms 51264 KB Output is correct
23 Correct 117 ms 54424 KB Output is correct
24 Correct 117 ms 54612 KB Output is correct
25 Correct 4 ms 5468 KB Output is correct
26 Correct 4 ms 5724 KB Output is correct
27 Correct 4 ms 5600 KB Output is correct
28 Correct 2 ms 4700 KB Output is correct
29 Correct 2 ms 4700 KB Output is correct
30 Correct 2 ms 4700 KB Output is correct
31 Correct 67 ms 34100 KB Output is correct
32 Correct 120 ms 53844 KB Output is correct
33 Correct 2 ms 4700 KB Output is correct
34 Correct 103 ms 48824 KB Output is correct
35 Correct 126 ms 53672 KB Output is correct
36 Correct 2 ms 4700 KB Output is correct
37 Correct 2 ms 4700 KB Output is correct
38 Correct 2 ms 4696 KB Output is correct
39 Correct 2 ms 4700 KB Output is correct
40 Correct 2 ms 4700 KB Output is correct
41 Correct 3 ms 4700 KB Output is correct
42 Correct 2 ms 4700 KB Output is correct
43 Correct 2 ms 4656 KB Output is correct
44 Correct 3 ms 4700 KB Output is correct
45 Correct 3 ms 4700 KB Output is correct
46 Correct 2 ms 4700 KB Output is correct
47 Correct 3 ms 4700 KB Output is correct
48 Correct 2 ms 4696 KB Output is correct
49 Correct 3 ms 4700 KB Output is correct
50 Correct 3 ms 4700 KB Output is correct
51 Correct 2 ms 4700 KB Output is correct
52 Correct 2 ms 4700 KB Output is correct
53 Correct 3 ms 4700 KB Output is correct
54 Correct 2 ms 4700 KB Output is correct
55 Correct 2 ms 4700 KB Output is correct
56 Correct 2 ms 4712 KB Output is correct
57 Correct 2 ms 4700 KB Output is correct
58 Correct 4 ms 4956 KB Output is correct
59 Correct 4 ms 5212 KB Output is correct
60 Correct 4 ms 4956 KB Output is correct
61 Correct 4 ms 5208 KB Output is correct
62 Correct 6 ms 5284 KB Output is correct
63 Correct 5 ms 5212 KB Output is correct
64 Correct 5 ms 5208 KB Output is correct
65 Correct 6 ms 5212 KB Output is correct
66 Correct 5 ms 5180 KB Output is correct
67 Correct 5 ms 5408 KB Output is correct
68 Correct 4 ms 5468 KB Output is correct
69 Correct 4 ms 5724 KB Output is correct
70 Correct 4 ms 5724 KB Output is correct
71 Correct 6 ms 5212 KB Output is correct
72 Correct 6 ms 5080 KB Output is correct
73 Correct 5 ms 5284 KB Output is correct
74 Correct 2 ms 4700 KB Output is correct
75 Correct 3 ms 4700 KB Output is correct
76 Correct 3 ms 4700 KB Output is correct
77 Correct 2 ms 4700 KB Output is correct
78 Correct 2 ms 4700 KB Output is correct
79 Correct 2 ms 4700 KB Output is correct
80 Correct 3 ms 4700 KB Output is correct
81 Correct 2 ms 4764 KB Output is correct
82 Correct 2 ms 4700 KB Output is correct
83 Correct 2 ms 4700 KB Output is correct
84 Correct 2 ms 4700 KB Output is correct
85 Correct 3 ms 4700 KB Output is correct
86 Correct 2 ms 4700 KB Output is correct
87 Correct 2 ms 4952 KB Output is correct
88 Correct 4 ms 4956 KB Output is correct
89 Correct 4 ms 5212 KB Output is correct
90 Correct 5 ms 5212 KB Output is correct
91 Correct 6 ms 4956 KB Output is correct
92 Correct 5 ms 5212 KB Output is correct
93 Correct 2 ms 4700 KB Output is correct
94 Correct 4 ms 4700 KB Output is correct
95 Correct 2 ms 4700 KB Output is correct
96 Correct 3 ms 4700 KB Output is correct
97 Correct 2 ms 4696 KB Output is correct
98 Correct 2 ms 4700 KB Output is correct
99 Correct 6 ms 5208 KB Output is correct
100 Correct 4 ms 5208 KB Output is correct
101 Correct 5 ms 5212 KB Output is correct
102 Correct 5 ms 5212 KB Output is correct
103 Correct 5 ms 5244 KB Output is correct
104 Correct 157 ms 27044 KB Output is correct
105 Correct 164 ms 26704 KB Output is correct
106 Correct 253 ms 28316 KB Output is correct
107 Correct 177 ms 27728 KB Output is correct
108 Correct 195 ms 28672 KB Output is correct
109 Correct 237 ms 26280 KB Output is correct
110 Correct 222 ms 27472 KB Output is correct
111 Correct 171 ms 27588 KB Output is correct
112 Correct 155 ms 38228 KB Output is correct
113 Correct 174 ms 27336 KB Output is correct
114 Correct 223 ms 27732 KB Output is correct
115 Correct 237 ms 26152 KB Output is correct
116 Correct 2 ms 4700 KB Output is correct
117 Correct 102 ms 48916 KB Output is correct
118 Correct 113 ms 53792 KB Output is correct
119 Correct 5 ms 5212 KB Output is correct
120 Correct 4 ms 5212 KB Output is correct
121 Correct 7 ms 5212 KB Output is correct
122 Correct 5 ms 5464 KB Output is correct
123 Correct 5 ms 5060 KB Output is correct
124 Correct 185 ms 25960 KB Output is correct
125 Correct 2 ms 4696 KB Output is correct
126 Correct 2 ms 4700 KB Output is correct
127 Correct 2 ms 4696 KB Output is correct
128 Correct 155 ms 24740 KB Output is correct
129 Correct 118 ms 22636 KB Output is correct
130 Correct 180 ms 27784 KB Output is correct
131 Correct 279 ms 28792 KB Output is correct
132 Correct 203 ms 26704 KB Output is correct
133 Correct 257 ms 25176 KB Output is correct
134 Correct 275 ms 25688 KB Output is correct
135 Correct 154 ms 25788 KB Output is correct
136 Correct 213 ms 26540 KB Output is correct
137 Correct 196 ms 27476 KB Output is correct
138 Correct 179 ms 39252 KB Output is correct
139 Correct 264 ms 27800 KB Output is correct
140 Correct 245 ms 26496 KB Output is correct
141 Correct 69 ms 34132 KB Output is correct
142 Correct 122 ms 53840 KB Output is correct
143 Correct 5 ms 5212 KB Output is correct
144 Correct 4 ms 5212 KB Output is correct
145 Correct 6 ms 5212 KB Output is correct
146 Correct 5 ms 4956 KB Output is correct
147 Correct 5 ms 5052 KB Output is correct
148 Correct 3 ms 4700 KB Output is correct
149 Correct 2 ms 4584 KB Output is correct
150 Correct 3 ms 4700 KB Output is correct
151 Correct 2 ms 4700 KB Output is correct
152 Correct 2 ms 4700 KB Output is correct
153 Correct 128 ms 18568 KB Output is correct
154 Correct 230 ms 28544 KB Output is correct
155 Correct 171 ms 26996 KB Output is correct
156 Correct 152 ms 26532 KB Output is correct
157 Correct 257 ms 28572 KB Output is correct
158 Correct 181 ms 27796 KB Output is correct
159 Correct 199 ms 28664 KB Output is correct
160 Correct 220 ms 26276 KB Output is correct
161 Correct 195 ms 27296 KB Output is correct
162 Correct 171 ms 27676 KB Output is correct
163 Correct 161 ms 38228 KB Output is correct
164 Correct 185 ms 27112 KB Output is correct
165 Correct 239 ms 27724 KB Output is correct
166 Correct 224 ms 27136 KB Output is correct
167 Correct 2 ms 4700 KB Output is correct
168 Correct 111 ms 48804 KB Output is correct
169 Correct 131 ms 53812 KB Output is correct
170 Correct 5 ms 5388 KB Output is correct
171 Correct 5 ms 5212 KB Output is correct
172 Correct 5 ms 5212 KB Output is correct
173 Correct 5 ms 5028 KB Output is correct
174 Correct 7 ms 5212 KB Output is correct
175 Correct 180 ms 25404 KB Output is correct
176 Correct 2 ms 4700 KB Output is correct
177 Correct 179 ms 28244 KB Output is correct
178 Correct 138 ms 23144 KB Output is correct
179 Correct 279 ms 28500 KB Output is correct
180 Correct 249 ms 27732 KB Output is correct
181 Correct 205 ms 29332 KB Output is correct
182 Correct 264 ms 29652 KB Output is correct
183 Correct 194 ms 27736 KB Output is correct
184 Correct 281 ms 27544 KB Output is correct
185 Correct 272 ms 26176 KB Output is correct
186 Correct 270 ms 25128 KB Output is correct
187 Correct 244 ms 29260 KB Output is correct
188 Correct 165 ms 26708 KB Output is correct
189 Correct 160 ms 26800 KB Output is correct
190 Correct 268 ms 28860 KB Output is correct
191 Correct 244 ms 27732 KB Output is correct
192 Correct 289 ms 27460 KB Output is correct
193 Correct 269 ms 26912 KB Output is correct
194 Correct 235 ms 28772 KB Output is correct
195 Correct 99 ms 46160 KB Output is correct
196 Correct 117 ms 51332 KB Output is correct
197 Correct 116 ms 54552 KB Output is correct
198 Correct 118 ms 54612 KB Output is correct
199 Correct 3 ms 4952 KB Output is correct
200 Correct 4 ms 5212 KB Output is correct
201 Correct 4 ms 4956 KB Output is correct
202 Correct 5 ms 5000 KB Output is correct
203 Correct 5 ms 5080 KB Output is correct
204 Correct 5 ms 5212 KB Output is correct
205 Correct 4 ms 4956 KB Output is correct
206 Correct 6 ms 5212 KB Output is correct
207 Correct 5 ms 5212 KB Output is correct
208 Correct 5 ms 5212 KB Output is correct
209 Correct 4 ms 5468 KB Output is correct
210 Correct 4 ms 5724 KB Output is correct
211 Correct 5 ms 5724 KB Output is correct
212 Correct 5 ms 5212 KB Output is correct
213 Correct 6 ms 5212 KB Output is correct
214 Correct 5 ms 5212 KB Output is correct
215 Correct 2 ms 4700 KB Output is correct
216 Correct 2 ms 4700 KB Output is correct
217 Correct 2 ms 4700 KB Output is correct
218 Correct 3 ms 4700 KB Output is correct
219 Correct 3 ms 4764 KB Output is correct
220 Correct 3 ms 4696 KB Output is correct
221 Correct 2 ms 4700 KB Output is correct
222 Correct 2 ms 4700 KB Output is correct
223 Correct 2 ms 4700 KB Output is correct
224 Correct 2 ms 4700 KB Output is correct
225 Correct 3 ms 4700 KB Output is correct
226 Correct 3 ms 4700 KB Output is correct
227 Correct 3 ms 4700 KB Output is correct
228 Correct 3 ms 4700 KB Output is correct
229 Correct 139 ms 24404 KB Output is correct
230 Correct 159 ms 22608 KB Output is correct
231 Correct 199 ms 28088 KB Output is correct
232 Correct 283 ms 28644 KB Output is correct
233 Correct 200 ms 26764 KB Output is correct
234 Correct 266 ms 25168 KB Output is correct
235 Correct 278 ms 25688 KB Output is correct
236 Correct 166 ms 25980 KB Output is correct
237 Correct 202 ms 27400 KB Output is correct
238 Correct 221 ms 27408 KB Output is correct
239 Correct 209 ms 39408 KB Output is correct
240 Correct 250 ms 27792 KB Output is correct
241 Correct 241 ms 27584 KB Output is correct
242 Correct 75 ms 34016 KB Output is correct
243 Correct 122 ms 54112 KB Output is correct
244 Correct 5 ms 4956 KB Output is correct
245 Correct 4 ms 5212 KB Output is correct
246 Correct 6 ms 5208 KB Output is correct
247 Correct 5 ms 4956 KB Output is correct
248 Correct 6 ms 5032 KB Output is correct
249 Correct 2 ms 4700 KB Output is correct
250 Correct 2 ms 4700 KB Output is correct
251 Correct 2 ms 4700 KB Output is correct
252 Correct 2 ms 4700 KB Output is correct
253 Correct 3 ms 4652 KB Output is correct
254 Correct 127 ms 17412 KB Output is correct
255 Correct 233 ms 26992 KB Output is correct
256 Correct 221 ms 27184 KB Output is correct
257 Correct 242 ms 28480 KB Output is correct
258 Correct 270 ms 28476 KB Output is correct
259 Correct 241 ms 29908 KB Output is correct
260 Correct 180 ms 26968 KB Output is correct
261 Correct 169 ms 26524 KB Output is correct
262 Correct 257 ms 28496 KB Output is correct
263 Correct 177 ms 27756 KB Output is correct
264 Correct 200 ms 28492 KB Output is correct
265 Correct 232 ms 26096 KB Output is correct
266 Correct 191 ms 27404 KB Output is correct
267 Correct 184 ms 26676 KB Output is correct
268 Correct 186 ms 38132 KB Output is correct
269 Correct 165 ms 26992 KB Output is correct
270 Correct 222 ms 27732 KB Output is correct
271 Correct 223 ms 26172 KB Output is correct
272 Correct 2 ms 4696 KB Output is correct
273 Correct 105 ms 48980 KB Output is correct
274 Correct 122 ms 54036 KB Output is correct
275 Correct 4 ms 5208 KB Output is correct
276 Correct 4 ms 5212 KB Output is correct
277 Correct 5 ms 5028 KB Output is correct
278 Correct 5 ms 5212 KB Output is correct
279 Correct 5 ms 5280 KB Output is correct
280 Correct 189 ms 26912 KB Output is correct