oj.uz

Submission #442620

# Submission time Handle Problem Language Result Execution time Memory
442620 2021-07-08T10:03:58 Z Haruto810198 Road Closures (APIO21_roads) C++17
100 / 100
 776 ms 71368 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define double long double

#define FOR(i,l,r,d) for(int i=(l);i<=(r);i+=(d))
#define szof(x) ((int)(x).size())

#define vi vector<int>
#define pii pair<int,int>

#define F first
#define S second

#define pb push_back
#define eb emplace_back
#define mkp make_pair

#define lsb(x) ((x)&(-(x))

const int INF = 2147483647;
const int LNF = 4e18;
const int MOD = 1000000007;
const int mod = 998244353;
const double eps = 1e-12;

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")

const int MAX = 100010;

int n;
vector<pii> edge[MAX]; /// original tree
int deg[MAX]; /// degree of vertices

pii par[MAX]; /// parent and childs of vectices, on the original tree
vector<pii> ch[MAX];

vi induced[MAX]; /// vectices of each induced subgraph
pii par_induced[MAX]; /// parent and childs of vectices, on the induced subgraph
vector<pii> ch_induced[MAX];

int dep[MAX]; /// depth of vectices
vi ord; /// order of dp
int dp[MAX][2]; /// dp[vertex][is connnected to parent]

/// Treap
struct Treap{
    Treap *l, *r;
    int key, pri;
    int sz, sum;
    Treap(int _k): l(nullptr), r(nullptr), key(_k), pri(rand()), sz(1), sum(_k) {}
};

inline int get_sz(Treap *T){
    return (T != nullptr) ? T -> sz : 0;
}

inline int get_sum(Treap *T){
    return (T != nullptr) ? T -> sum : 0;
}

void pull(Treap *&T){
    if(T == nullptr) return;
    T -> sz = get_sz(T -> l) + get_sz(T -> r) + 1;
    T -> sum = get_sum(T -> l) + get_sum(T -> r) + T -> key;
}

Treap* Merge(Treap *a, Treap *b){
    if(a == nullptr) return b;
    if(b == nullptr) return a;
    if(a -> pri < b -> pri){
        a -> r = Merge(a -> r, b);
        pull(a);
        return a;
    }
    else{
        b -> l = Merge(a, b -> l);
        pull(b);
        return b;
    }
}

void Split_by_key(Treap *T, Treap *&a, Treap *&b, int k){
    if(T == nullptr){
        a = b = nullptr;
        return;
    }
    if(T -> key < k){
        a = T;
        Split_by_key(T->r, a->r, b, k);
        pull(a);
    }
    else{
        b = T;
        Split_by_key(T->l, a, b->l, k);
        pull(b);
    }
}

void Split_by_sz(Treap *T, Treap *&a, Treap *&b, int k){
    if(T == nullptr){
        a = b = nullptr;
        return;
    }
    if(get_sz(T -> l) + 1 <= k){
        a = T;
        Split_by_sz(T->r, a->r, b, k - get_sz(T -> l) - 1);
        pull(a);
    }
    else{
        b = T;
        Split_by_sz(T->l, a, b->l, k);
        pull(b);
    }
}

void Insert(Treap *&T, int val){
    Treap *a, *b;
    Split_by_key(T, a, b, val);
    T = Merge( Merge(a, new Treap(val)), b );
}

void Erase(Treap *&T, int val){
    Treap *a, *b, *c;
    Split_by_key(T, a, b, val);
    Split_by_sz(b, b, c, 1);
    T = Merge(a, c);
}

Treap* edge_cnt[MAX];

void edge_cnt_insert(int v, int val){
    Insert(edge_cnt[v], val);
}

void edge_cnt_erase(int v, int val){
    Erase(edge_cnt[v], val);
}

int edge_cnt_query(int v, int q){
    if(q > get_sz(edge_cnt[v])) return LNF;
    Treap *a, *b;
    Split_by_sz(edge_cnt[v], a, b, q);
    int ret = get_sum(a);
    edge_cnt[v] = Merge(a, b);
    return ret;
}

/// calculate dep[], par[], ch[]
void dfs(int v, pii pv, int cdep){

    par[v] = pv;
    dep[v] = cdep;

    for(pii e : edge[v]){
        int i = e.F;
        int w = e.S;
        if(i == pv.F) continue;
        ch[v].pb(e);
        dfs(i, mkp(v, w), cdep + 1);
    }

}

bool cmp_by_dep(int u, int v){
    return (dep[u] < dep[v]);
}

/// solve for induced subgraph k
int solve(int k){

    //cerr<<"solve("<<k<<") : "<<endl;

    for(int v : induced[k]){
        par_induced[v] = mkp(v, 0);
        ch_induced[v].clear();
    }

    /// update edges in induced subgraph k
    for(int v : induced[k]){
        int u = par[v].F;
        int w = par[v].S;
        if(v!=u and deg[u]>k){
            par_induced[v] = mkp(u, w);
            ch_induced[u].eb(v, w);
            edge_cnt_erase(v, w);
            edge_cnt_erase(u, w);
        }
    }

    /// dp order
    ord = induced[k];
    sort(ord.begin(), ord.end(), cmp_by_dep);
    reverse(ord.begin(), ord.end());

    /// dp

    int ret = 0;

    for(int v : ord){

        int ori_cost = 0; /// original cost if don't pick any child
        int n_sum = 0, n_cnt = 0; /// sum, n. of negative cost child

        /// cost of picking each child
        vi cost_ch;
        for(pii e : ch_induced[v]){
            int i = e.F;
            int w = e.S;
            /// pick : dp[i][1] + w
            /// not pick : dp[i][0]
            cost_ch.pb(dp[i][1] + w - dp[i][0]);
            ori_cost += dp[i][0];
        }
        sort(cost_ch.begin(), cost_ch.end());

        for(int i : cost_ch){
            if(i >= 0) break;
            n_sum += i;
            n_cnt++;
        }

        /// dp[v][0]
        dp[v][0] = LNF;

        int pick = deg[v] - k; /// n. of edges must pick to close
        int cost_ch_sum = n_sum;

        FOR(pick_ch, 0, pick, 1){ /// n. of edges picked from child
            int pick_ext = pick - pick_ch; /// n. of edges picked from extra edges
            dp[v][0] = min(dp[v][0], ori_cost + cost_ch_sum + edge_cnt_query(v, pick_ext));
            if(pick_ch >= szof(cost_ch)) break;
            if(pick_ch >= n_cnt){
                cost_ch_sum += cost_ch[pick_ch];
            }
        }

        assert(dp[v][0] < LNF);

        /// if v is a root in the induced graph :
        if(par_induced[v].F == v){
            ret += dp[v][0];
            continue;
        }

        /// dp[v][1]
        dp[v][1] = LNF;

        pick = deg[v] - k - 1;
        cost_ch_sum = n_sum;

        FOR(pick_ch, 0, pick, 1){ /// n. of edges picked from child
            int pick_ext = pick - pick_ch; /// n. of edges picked from extra edges
            dp[v][1] = min(dp[v][1], ori_cost + cost_ch_sum + edge_cnt_query(v, pick_ext));
            if(pick_ch >= szof(cost_ch)) break;
            if(pick_ch >= n_cnt){
                cost_ch_sum += cost_ch[pick_ch];
            }
        }

        assert(dp[v][1] < LNF);

    }

    /// recover edge_cnt
    for(int v : induced[k]){
        int u = par[v].F;
        int w = par[v].S;
        if(v!=u and deg[u]>k){
            edge_cnt_insert(v, w);
            edge_cnt_insert(u, w);
        }
    }

    /*
    cerr<<"dp : "<<endl;
    for(int v : induced[k]){
        cerr<<"dp["<<v<<"][0] = "<<dp[v][0]<<"\t dp["<<v<<"][1] = "<<dp[v][1]<<endl;
    }
    cerr<<endl;
    */

    return ret;

}

vi minimum_closure_costs(signed N, vector<signed> U, vector<signed> V, vector<signed> W){

    int wsum = 0;

    /// input
    n = N;
    FOR(i, 0, n-2, 1){
        int u = U[i], v = V[i], w = W[i];
        edge[u].eb(v, w);
        edge[v].eb(u, w);
        deg[u]++;
        deg[v]++;
        edge_cnt_insert(u, w);
        edge_cnt_insert(v, w);
        wsum += w;
    }

    /// dfs
    dfs(0, mkp(0, 0), 0);

    /// induced subgraph
    FOR(i, 0, n-1, 1){
        FOR(j, 0, deg[i]-1, 1){
            induced[j].pb(i);
        }
    }

    /// solve for each induced subgraph
    vi res(n);
    res[0] = wsum;
    FOR(i, 1, n-1, 1){
        res[i] = solve(i);
    }

    return res;

}

/*
signed main(){

    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    //vi res = minimum_closure_costs(4, {0, 2, 0}, {1, 0, 3}, {5, 10, 5});
    //vi res = minimum_closure_costs(5, {0, 0, 0, 2}, {1, 2, 3, 4}, {1, 4, 3, 2});
    //vi res = minimum_closure_costs(6, {0, 1, 2, 3, 4}, {1, 2, 3, 4, 5}, {1, 10, 1, 10, 1});
    //vi res = minimum_closure_costs(6, {0, 0, 0, 0, 0}, {1, 2, 3, 4, 5}, {INF, INF, INF, INF, INF});

    cerr<<"res : ";
    for(int i : res){
        cerr<<i<<" ";
    }
    cerr<<endl;

    return 0;

}
*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 9 ms 10324 KB Output is correct
3 Correct 10 ms 10316 KB Output is correct
4 Correct 9 ms 10292 KB Output is correct
5 Correct 6 ms 9676 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 6 ms 9700 KB Output is correct
8 Correct 9 ms 10188 KB Output is correct
9 Correct 10 ms 10316 KB Output is correct
10 Correct 7 ms 9676 KB Output is correct
11 Correct 8 ms 9804 KB Output is correct
12 Correct 137 ms 28240 KB Output is correct
13 Correct 230 ms 40560 KB Output is correct
14 Correct 293 ms 38272 KB Output is correct
15 Correct 325 ms 41224 KB Output is correct
16 Correct 338 ms 41628 KB Output is correct
17 Correct 202 ms 41824 KB Output is correct
18 Correct 6 ms 9676 KB Output is correct
19 Correct 172 ms 37764 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 129 ms 59068 KB Output is correct
3 Correct 137 ms 65316 KB Output is correct
4 Correct 148 ms 69108 KB Output is correct
5 Correct 145 ms 69072 KB Output is correct
6 Correct 8 ms 10700 KB Output is correct
7 Correct 9 ms 10828 KB Output is correct
8 Correct 8 ms 10700 KB Output is correct
9 Correct 6 ms 9804 KB Output is correct
10 Correct 6 ms 9840 KB Output is correct
11 Correct 6 ms 9804 KB Output is correct
12 Correct 85 ms 45308 KB Output is correct
13 Correct 143 ms 69168 KB Output is correct
14 Correct 6 ms 9640 KB Output is correct
15 Correct 126 ms 63280 KB Output is correct
16 Correct 142 ms 69240 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 6 ms 9676 KB Output is correct
3 Correct 7 ms 9676 KB Output is correct
4 Correct 6 ms 9688 KB Output is correct
5 Correct 6 ms 9804 KB Output is correct
6 Correct 7 ms 9804 KB Output is correct
7 Correct 6 ms 9804 KB Output is correct
8 Correct 6 ms 9712 KB Output is correct
9 Correct 7 ms 9804 KB Output is correct
10 Correct 7 ms 9804 KB Output is correct
11 Correct 6 ms 9804 KB Output is correct
12 Correct 7 ms 9960 KB Output is correct
13 Correct 7 ms 9676 KB Output is correct
14 Correct 6 ms 9676 KB Output is correct
15 Correct 6 ms 9676 KB Output is correct
16 Correct 6 ms 9676 KB Output is correct
17 Correct 7 ms 9804 KB Output is correct
18 Correct 6 ms 9712 KB Output is correct
19 Correct 6 ms 9676 KB Output is correct
20 Correct 7 ms 9708 KB Output is correct
21 Correct 6 ms 9676 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 6 ms 9676 KB Output is correct
3 Correct 7 ms 9676 KB Output is correct
4 Correct 6 ms 9688 KB Output is correct
5 Correct 6 ms 9804 KB Output is correct
6 Correct 7 ms 9804 KB Output is correct
7 Correct 6 ms 9804 KB Output is correct
8 Correct 6 ms 9712 KB Output is correct
9 Correct 7 ms 9804 KB Output is correct
10 Correct 7 ms 9804 KB Output is correct
11 Correct 6 ms 9804 KB Output is correct
12 Correct 7 ms 9960 KB Output is correct
13 Correct 7 ms 9676 KB Output is correct
14 Correct 6 ms 9676 KB Output is correct
15 Correct 6 ms 9676 KB Output is correct
16 Correct 6 ms 9676 KB Output is correct
17 Correct 7 ms 9804 KB Output is correct
18 Correct 6 ms 9712 KB Output is correct
19 Correct 6 ms 9676 KB Output is correct
20 Correct 7 ms 9708 KB Output is correct
21 Correct 6 ms 9676 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 8 ms 10188 KB Output is correct
24 Correct 9 ms 10616 KB Output is correct
25 Correct 9 ms 10444 KB Output is correct
26 Correct 11 ms 10632 KB Output is correct
27 Correct 14 ms 10496 KB Output is correct
28 Correct 11 ms 10572 KB Output is correct
29 Correct 10 ms 10572 KB Output is correct
30 Correct 12 ms 10656 KB Output is correct
31 Correct 12 ms 10572 KB Output is correct
32 Correct 10 ms 10492 KB Output is correct
33 Correct 9 ms 10700 KB Output is correct
34 Correct 9 ms 10828 KB Output is correct
35 Correct 8 ms 10828 KB Output is correct
36 Correct 10 ms 10360 KB Output is correct
37 Correct 10 ms 10388 KB Output is correct
38 Correct 9 ms 10316 KB Output is correct
39 Correct 6 ms 9676 KB Output is correct
40 Correct 6 ms 9676 KB Output is correct
41 Correct 7 ms 9796 KB Output is correct
42 Correct 6 ms 9804 KB Output is correct
43 Correct 6 ms 9724 KB Output is correct
44 Correct 7 ms 9716 KB Output is correct
45 Correct 7 ms 9708 KB Output is correct
46 Correct 7 ms 9804 KB Output is correct
47 Correct 6 ms 9804 KB Output is correct
48 Correct 7 ms 9804 KB Output is correct
49 Correct 6 ms 9840 KB Output is correct
50 Correct 6 ms 9676 KB Output is correct
51 Correct 7 ms 9676 KB Output is correct
52 Correct 6 ms 9676 KB Output is correct
53 Correct 9 ms 10444 KB Output is correct
54 Correct 10 ms 10624 KB Output is correct
55 Correct 13 ms 10552 KB Output is correct
56 Correct 9 ms 10212 KB Output is correct
57 Correct 9 ms 10316 KB Output is correct
58 Correct 7 ms 9712 KB Output is correct
59 Correct 6 ms 9804 KB Output is correct
60 Correct 7 ms 9804 KB Output is correct
61 Correct 6 ms 9676 KB Output is correct
62 Correct 6 ms 9676 KB Output is correct
63 Correct 6 ms 9676 KB Output is correct
64 Correct 9 ms 10572 KB Output is correct
65 Correct 9 ms 10620 KB Output is correct
66 Correct 10 ms 10444 KB Output is correct
67 Correct 10 ms 10496 KB Output is correct
68 Correct 11 ms 10556 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 350 ms 52844 KB Output is correct
2 Correct 311 ms 52076 KB Output is correct
3 Correct 491 ms 53752 KB Output is correct
4 Correct 333 ms 54260 KB Output is correct
5 Correct 389 ms 53692 KB Output is correct
6 Correct 435 ms 50100 KB Output is correct
7 Correct 401 ms 55880 KB Output is correct
8 Correct 181 ms 37172 KB Output is correct
9 Correct 369 ms 56336 KB Output is correct
10 Correct 386 ms 53460 KB Output is correct
11 Correct 416 ms 49144 KB Output is correct
12 Correct 284 ms 44740 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 126 ms 63280 KB Output is correct
15 Correct 137 ms 69156 KB Output is correct
16 Correct 9 ms 10572 KB Output is correct
17 Correct 10 ms 10572 KB Output is correct
18 Correct 10 ms 10484 KB Output is correct
19 Correct 10 ms 10364 KB Output is correct
20 Correct 11 ms 10572 KB Output is correct
21 Correct 181 ms 36948 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 350 ms 52844 KB Output is correct
2 Correct 311 ms 52076 KB Output is correct
3 Correct 491 ms 53752 KB Output is correct
4 Correct 333 ms 54260 KB Output is correct
5 Correct 389 ms 53692 KB Output is correct
6 Correct 435 ms 50100 KB Output is correct
7 Correct 401 ms 55880 KB Output is correct
8 Correct 181 ms 37172 KB Output is correct
9 Correct 369 ms 56336 KB Output is correct
10 Correct 386 ms 53460 KB Output is correct
11 Correct 416 ms 49144 KB Output is correct
12 Correct 284 ms 44740 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 126 ms 63280 KB Output is correct
15 Correct 137 ms 69156 KB Output is correct
16 Correct 9 ms 10572 KB Output is correct
17 Correct 10 ms 10572 KB Output is correct
18 Correct 10 ms 10484 KB Output is correct
19 Correct 10 ms 10364 KB Output is correct
20 Correct 11 ms 10572 KB Output is correct
21 Correct 181 ms 36948 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 6 ms 9676 KB Output is correct
24 Correct 6 ms 9676 KB Output is correct
25 Correct 282 ms 48112 KB Output is correct
26 Correct 239 ms 44308 KB Output is correct
27 Correct 346 ms 54384 KB Output is correct
28 Correct 776 ms 53836 KB Output is correct
29 Correct 535 ms 50384 KB Output is correct
30 Correct 698 ms 48636 KB Output is correct
31 Correct 500 ms 48100 KB Output is correct
32 Correct 336 ms 50940 KB Output is correct
33 Correct 233 ms 37812 KB Output is correct
34 Correct 539 ms 55736 KB Output is correct
35 Correct 421 ms 59864 KB Output is correct
36 Correct 647 ms 49160 KB Output is correct
37 Correct 425 ms 44732 KB Output is correct
38 Correct 85 ms 45268 KB Output is correct
39 Correct 142 ms 69136 KB Output is correct
40 Correct 9 ms 10316 KB Output is correct
41 Correct 9 ms 10572 KB Output is correct
42 Correct 12 ms 10444 KB Output is correct
43 Correct 9 ms 10156 KB Output is correct
44 Correct 10 ms 10256 KB Output is correct
45 Correct 7 ms 9676 KB Output is correct
46 Correct 7 ms 9804 KB Output is correct
47 Correct 7 ms 9696 KB Output is correct
48 Correct 6 ms 9780 KB Output is correct
49 Correct 6 ms 9676 KB Output is correct
50 Correct 142 ms 27568 KB Output is correct
51 Correct 240 ms 39692 KB Output is correct
52 Correct 328 ms 52856 KB Output is correct
53 Correct 318 ms 52112 KB Output is correct
54 Correct 488 ms 53648 KB Output is correct
55 Correct 341 ms 54216 KB Output is correct
56 Correct 397 ms 53752 KB Output is correct
57 Correct 431 ms 50120 KB Output is correct
58 Correct 376 ms 55740 KB Output is correct
59 Correct 174 ms 37316 KB Output is correct
60 Correct 315 ms 56248 KB Output is correct
61 Correct 338 ms 53392 KB Output is correct
62 Correct 425 ms 49144 KB Output is correct
63 Correct 277 ms 44728 KB Output is correct
64 Correct 6 ms 9676 KB Output is correct
65 Correct 128 ms 63280 KB Output is correct
66 Correct 139 ms 69212 KB Output is correct
67 Correct 9 ms 10572 KB Output is correct
68 Correct 10 ms 10572 KB Output is correct
69 Correct 11 ms 10444 KB Output is correct
70 Correct 10 ms 10444 KB Output is correct
71 Correct 11 ms 10496 KB Output is correct
72 Correct 189 ms 36828 KB Output is correct

Subtask #7
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 9 ms 10324 KB Output is correct
3 Correct 10 ms 10316 KB Output is correct
4 Correct 9 ms 10292 KB Output is correct
5 Correct 6 ms 9676 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 6 ms 9700 KB Output is correct
8 Correct 9 ms 10188 KB Output is correct
9 Correct 10 ms 10316 KB Output is correct
10 Correct 7 ms 9676 KB Output is correct
11 Correct 8 ms 9804 KB Output is correct
12 Correct 137 ms 28240 KB Output is correct
13 Correct 230 ms 40560 KB Output is correct
14 Correct 293 ms 38272 KB Output is correct
15 Correct 325 ms 41224 KB Output is correct
16 Correct 338 ms 41628 KB Output is correct
17 Correct 202 ms 41824 KB Output is correct
18 Correct 6 ms 9676 KB Output is correct
19 Correct 172 ms 37764 KB Output is correct
20 Correct 6 ms 9676 KB Output is correct
21 Correct 129 ms 59068 KB Output is correct
22 Correct 137 ms 65316 KB Output is correct
23 Correct 148 ms 69108 KB Output is correct
24 Correct 145 ms 69072 KB Output is correct
25 Correct 8 ms 10700 KB Output is correct
26 Correct 9 ms 10828 KB Output is correct
27 Correct 8 ms 10700 KB Output is correct
28 Correct 6 ms 9804 KB Output is correct
29 Correct 6 ms 9840 KB Output is correct
30 Correct 6 ms 9804 KB Output is correct
31 Correct 85 ms 45308 KB Output is correct
32 Correct 143 ms 69168 KB Output is correct
33 Correct 6 ms 9640 KB Output is correct
34 Correct 126 ms 63280 KB Output is correct
35 Correct 142 ms 69240 KB Output is correct
36 Correct 6 ms 9676 KB Output is correct
37 Correct 6 ms 9676 KB Output is correct
38 Correct 7 ms 9676 KB Output is correct
39 Correct 6 ms 9688 KB Output is correct
40 Correct 6 ms 9804 KB Output is correct
41 Correct 7 ms 9804 KB Output is correct
42 Correct 6 ms 9804 KB Output is correct
43 Correct 6 ms 9712 KB Output is correct
44 Correct 7 ms 9804 KB Output is correct
45 Correct 7 ms 9804 KB Output is correct
46 Correct 6 ms 9804 KB Output is correct
47 Correct 7 ms 9960 KB Output is correct
48 Correct 7 ms 9676 KB Output is correct
49 Correct 6 ms 9676 KB Output is correct
50 Correct 6 ms 9676 KB Output is correct
51 Correct 6 ms 9676 KB Output is correct
52 Correct 7 ms 9804 KB Output is correct
53 Correct 6 ms 9712 KB Output is correct
54 Correct 6 ms 9676 KB Output is correct
55 Correct 7 ms 9708 KB Output is correct
56 Correct 6 ms 9676 KB Output is correct
57 Correct 6 ms 9676 KB Output is correct
58 Correct 8 ms 10188 KB Output is correct
59 Correct 9 ms 10616 KB Output is correct
60 Correct 9 ms 10444 KB Output is correct
61 Correct 11 ms 10632 KB Output is correct
62 Correct 14 ms 10496 KB Output is correct
63 Correct 11 ms 10572 KB Output is correct
64 Correct 10 ms 10572 KB Output is correct
65 Correct 12 ms 10656 KB Output is correct
66 Correct 12 ms 10572 KB Output is correct
67 Correct 10 ms 10492 KB Output is correct
68 Correct 9 ms 10700 KB Output is correct
69 Correct 9 ms 10828 KB Output is correct
70 Correct 8 ms 10828 KB Output is correct
71 Correct 10 ms 10360 KB Output is correct
72 Correct 10 ms 10388 KB Output is correct
73 Correct 9 ms 10316 KB Output is correct
74 Correct 6 ms 9676 KB Output is correct
75 Correct 6 ms 9676 KB Output is correct
76 Correct 7 ms 9796 KB Output is correct
77 Correct 6 ms 9804 KB Output is correct
78 Correct 6 ms 9724 KB Output is correct
79 Correct 7 ms 9716 KB Output is correct
80 Correct 7 ms 9708 KB Output is correct
81 Correct 7 ms 9804 KB Output is correct
82 Correct 6 ms 9804 KB Output is correct
83 Correct 7 ms 9804 KB Output is correct
84 Correct 6 ms 9840 KB Output is correct
85 Correct 6 ms 9676 KB Output is correct
86 Correct 7 ms 9676 KB Output is correct
87 Correct 6 ms 9676 KB Output is correct
88 Correct 9 ms 10444 KB Output is correct
89 Correct 10 ms 10624 KB Output is correct
90 Correct 13 ms 10552 KB Output is correct
91 Correct 9 ms 10212 KB Output is correct
92 Correct 9 ms 10316 KB Output is correct
93 Correct 7 ms 9712 KB Output is correct
94 Correct 6 ms 9804 KB Output is correct
95 Correct 7 ms 9804 KB Output is correct
96 Correct 6 ms 9676 KB Output is correct
97 Correct 6 ms 9676 KB Output is correct
98 Correct 6 ms 9676 KB Output is correct
99 Correct 9 ms 10572 KB Output is correct
100 Correct 9 ms 10620 KB Output is correct
101 Correct 10 ms 10444 KB Output is correct
102 Correct 10 ms 10496 KB Output is correct
103 Correct 11 ms 10556 KB Output is correct
104 Correct 350 ms 52844 KB Output is correct
105 Correct 311 ms 52076 KB Output is correct
106 Correct 491 ms 53752 KB Output is correct
107 Correct 333 ms 54260 KB Output is correct
108 Correct 389 ms 53692 KB Output is correct
109 Correct 435 ms 50100 KB Output is correct
110 Correct 401 ms 55880 KB Output is correct
111 Correct 181 ms 37172 KB Output is correct
112 Correct 369 ms 56336 KB Output is correct
113 Correct 386 ms 53460 KB Output is correct
114 Correct 416 ms 49144 KB Output is correct
115 Correct 284 ms 44740 KB Output is correct
116 Correct 6 ms 9676 KB Output is correct
117 Correct 126 ms 63280 KB Output is correct
118 Correct 137 ms 69156 KB Output is correct
119 Correct 9 ms 10572 KB Output is correct
120 Correct 10 ms 10572 KB Output is correct
121 Correct 10 ms 10484 KB Output is correct
122 Correct 10 ms 10364 KB Output is correct
123 Correct 11 ms 10572 KB Output is correct
124 Correct 181 ms 36948 KB Output is correct
125 Correct 6 ms 9676 KB Output is correct
126 Correct 6 ms 9676 KB Output is correct
127 Correct 6 ms 9676 KB Output is correct
128 Correct 282 ms 48112 KB Output is correct
129 Correct 239 ms 44308 KB Output is correct
130 Correct 346 ms 54384 KB Output is correct
131 Correct 776 ms 53836 KB Output is correct
132 Correct 535 ms 50384 KB Output is correct
133 Correct 698 ms 48636 KB Output is correct
134 Correct 500 ms 48100 KB Output is correct
135 Correct 336 ms 50940 KB Output is correct
136 Correct 233 ms 37812 KB Output is correct
137 Correct 539 ms 55736 KB Output is correct
138 Correct 421 ms 59864 KB Output is correct
139 Correct 647 ms 49160 KB Output is correct
140 Correct 425 ms 44732 KB Output is correct
141 Correct 85 ms 45268 KB Output is correct
142 Correct 142 ms 69136 KB Output is correct
143 Correct 9 ms 10316 KB Output is correct
144 Correct 9 ms 10572 KB Output is correct
145 Correct 12 ms 10444 KB Output is correct
146 Correct 9 ms 10156 KB Output is correct
147 Correct 10 ms 10256 KB Output is correct
148 Correct 7 ms 9676 KB Output is correct
149 Correct 7 ms 9804 KB Output is correct
150 Correct 7 ms 9696 KB Output is correct
151 Correct 6 ms 9780 KB Output is correct
152 Correct 6 ms 9676 KB Output is correct
153 Correct 142 ms 27568 KB Output is correct
154 Correct 240 ms 39692 KB Output is correct
155 Correct 328 ms 52856 KB Output is correct
156 Correct 318 ms 52112 KB Output is correct
157 Correct 488 ms 53648 KB Output is correct
158 Correct 341 ms 54216 KB Output is correct
159 Correct 397 ms 53752 KB Output is correct
160 Correct 431 ms 50120 KB Output is correct
161 Correct 376 ms 55740 KB Output is correct
162 Correct 174 ms 37316 KB Output is correct
163 Correct 315 ms 56248 KB Output is correct
164 Correct 338 ms 53392 KB Output is correct
165 Correct 425 ms 49144 KB Output is correct
166 Correct 277 ms 44728 KB Output is correct
167 Correct 6 ms 9676 KB Output is correct
168 Correct 128 ms 63280 KB Output is correct
169 Correct 139 ms 69212 KB Output is correct
170 Correct 9 ms 10572 KB Output is correct
171 Correct 10 ms 10572 KB Output is correct
172 Correct 11 ms 10444 KB Output is correct
173 Correct 10 ms 10444 KB Output is correct
174 Correct 11 ms 10496 KB Output is correct
175 Correct 189 ms 36828 KB Output is correct
176 Correct 6 ms 9704 KB Output is correct
177 Correct 379 ms 55872 KB Output is correct
178 Correct 252 ms 45812 KB Output is correct
179 Correct 557 ms 55080 KB Output is correct
180 Correct 596 ms 53240 KB Output is correct
181 Correct 405 ms 56192 KB Output is correct
182 Correct 455 ms 54348 KB Output is correct
183 Correct 429 ms 57272 KB Output is correct
184 Correct 747 ms 50332 KB Output is correct
185 Correct 650 ms 49856 KB Output is correct
186 Correct 570 ms 47328 KB Output is correct
187 Correct 327 ms 41688 KB Output is correct
188 Correct 328 ms 53512 KB Output is correct
189 Correct 348 ms 53332 KB Output is correct
190 Correct 618 ms 51452 KB Output is correct
191 Correct 419 ms 50792 KB Output is correct
192 Correct 501 ms 46940 KB Output is correct
193 Correct 499 ms 46900 KB Output is correct
194 Correct 436 ms 51736 KB Output is correct
195 Correct 123 ms 60848 KB Output is correct
196 Correct 140 ms 67236 KB Output is correct
197 Correct 151 ms 71280 KB Output is correct
198 Correct 144 ms 71368 KB Output is correct
199 Correct 8 ms 10256 KB Output is correct
200 Correct 9 ms 10572 KB Output is correct
201 Correct 9 ms 10440 KB Output is correct
202 Correct 10 ms 10572 KB Output is correct
203 Correct 13 ms 10604 KB Output is correct
204 Correct 11 ms 10572 KB Output is correct
205 Correct 9 ms 10572 KB Output is correct
206 Correct 12 ms 10620 KB Output is correct
207 Correct 11 ms 10492 KB Output is correct
208 Correct 10 ms 10488 KB Output is correct
209 Correct 9 ms 10880 KB Output is correct
210 Correct 10 ms 10828 KB Output is correct
211 Correct 9 ms 10700 KB Output is correct
212 Correct 9 ms 10316 KB Output is correct
213 Correct 9 ms 10316 KB Output is correct
214 Correct 9 ms 10316 KB Output is correct
215 Correct 6 ms 9676 KB Output is correct
216 Correct 6 ms 9616 KB Output is correct
217 Correct 6 ms 9696 KB Output is correct
218 Correct 7 ms 9804 KB Output is correct
219 Correct 7 ms 9804 KB Output is correct
220 Correct 7 ms 9708 KB Output is correct
221 Correct 6 ms 9708 KB Output is correct
222 Correct 6 ms 9804 KB Output is correct
223 Correct 6 ms 9772 KB Output is correct
224 Correct 6 ms 9832 KB Output is correct
225 Correct 6 ms 9804 KB Output is correct
226 Correct 6 ms 9712 KB Output is correct
227 Correct 6 ms 9676 KB Output is correct
228 Correct 6 ms 9704 KB Output is correct
229 Correct 274 ms 49136 KB Output is correct
230 Correct 256 ms 45284 KB Output is correct
231 Correct 368 ms 55664 KB Output is correct
232 Correct 762 ms 55028 KB Output is correct
233 Correct 547 ms 51736 KB Output is correct
234 Correct 693 ms 49848 KB Output is correct
235 Correct 493 ms 49448 KB Output is correct
236 Correct 362 ms 52224 KB Output is correct
237 Correct 227 ms 39100 KB Output is correct
238 Correct 534 ms 57200 KB Output is correct
239 Correct 377 ms 61112 KB Output is correct
240 Correct 610 ms 50604 KB Output is correct
241 Correct 418 ms 46076 KB Output is correct
242 Correct 89 ms 46244 KB Output is correct
243 Correct 146 ms 70508 KB Output is correct
244 Correct 9 ms 10316 KB Output is correct
245 Correct 9 ms 10608 KB Output is correct
246 Correct 13 ms 10504 KB Output is correct
247 Correct 8 ms 10188 KB Output is correct
248 Correct 9 ms 10232 KB Output is correct
249 Correct 6 ms 9676 KB Output is correct
250 Correct 7 ms 9720 KB Output is correct
251 Correct 6 ms 9800 KB Output is correct
252 Correct 6 ms 9676 KB Output is correct
253 Correct 6 ms 9720 KB Output is correct
254 Correct 141 ms 28164 KB Output is correct
255 Correct 261 ms 40660 KB Output is correct
256 Correct 296 ms 38300 KB Output is correct
257 Correct 333 ms 41196 KB Output is correct
258 Correct 341 ms 41760 KB Output is correct
259 Correct 199 ms 41820 KB Output is correct
260 Correct 324 ms 54164 KB Output is correct
261 Correct 318 ms 53356 KB Output is correct
262 Correct 514 ms 54968 KB Output is correct
263 Correct 343 ms 55544 KB Output is correct
264 Correct 406 ms 54996 KB Output is correct
265 Correct 423 ms 51468 KB Output is correct
266 Correct 383 ms 57104 KB Output is correct
267 Correct 174 ms 38448 KB Output is correct
268 Correct 329 ms 57724 KB Output is correct
269 Correct 359 ms 54780 KB Output is correct
270 Correct 410 ms 50556 KB Output is correct
271 Correct 281 ms 46100 KB Output is correct
272 Correct 6 ms 9676 KB Output is correct
273 Correct 130 ms 64496 KB Output is correct
274 Correct 141 ms 70656 KB Output is correct
275 Correct 9 ms 10572 KB Output is correct
276 Correct 9 ms 10572 KB Output is correct
277 Correct 10 ms 10496 KB Output is correct
278 Correct 10 ms 10444 KB Output is correct
279 Correct 11 ms 10572 KB Output is correct
280 Correct 171 ms 37764 KB Output is correct