oj.uz

답안 #442623

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
442623 2021-07-08T10:07:27 Z Haruto810198 도로 폐쇄 (APIO21_roads) C++17
100 / 100
 786 ms 69224 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

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){

    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];
            }
        }

        /// 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];
            }
        }

    }

    /// 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);
        }
    }

    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;

}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 9 ms 10316 KB Output is correct
3 Correct 9 ms 10316 KB Output is correct
4 Correct 9 ms 10316 KB Output is correct
5 Correct 6 ms 9676 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 8 ms 9744 KB Output is correct
8 Correct 9 ms 10240 KB Output is correct
9 Correct 9 ms 10316 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 136 ms 27644 KB Output is correct
13 Correct 241 ms 39672 KB Output is correct
14 Correct 289 ms 36636 KB Output is correct
15 Correct 325 ms 39508 KB Output is correct
16 Correct 348 ms 40092 KB Output is correct
17 Correct 206 ms 39928 KB Output is correct
18 Correct 6 ms 9676 KB Output is correct
19 Correct 173 ms 36868 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 125 ms 59104 KB Output is correct
3 Correct 136 ms 65324 KB Output is correct
4 Correct 148 ms 69148 KB Output is correct
5 Correct 147 ms 69224 KB Output is correct
6 Correct 8 ms 10696 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 9804 KB Output is correct
11 Correct 6 ms 9804 KB Output is correct
12 Correct 85 ms 45348 KB Output is correct
13 Correct 139 ms 69168 KB Output is correct
14 Correct 6 ms 9676 KB Output is correct
15 Correct 127 ms 63256 KB Output is correct
16 Correct 138 ms 69168 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 6 ms 9676 KB Output is correct
3 Correct 6 ms 9700 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 6 ms 9804 KB Output is correct
6 Correct 6 ms 9804 KB Output is correct
7 Correct 6 ms 9804 KB Output is correct
8 Correct 6 ms 9804 KB Output is correct
9 Correct 6 ms 9772 KB Output is correct
10 Correct 6 ms 9748 KB Output is correct
11 Correct 6 ms 9804 KB Output is correct
12 Correct 7 ms 9804 KB Output is correct
13 Correct 7 ms 9728 KB Output is correct
14 Correct 6 ms 9676 KB Output is correct
15 Correct 7 ms 9676 KB Output is correct
16 Correct 6 ms 9676 KB Output is correct
17 Correct 6 ms 9804 KB Output is correct
18 Correct 6 ms 9736 KB Output is correct
19 Correct 6 ms 9676 KB Output is correct
20 Correct 6 ms 9780 KB Output is correct
21 Correct 6 ms 9676 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 6 ms 9676 KB Output is correct
3 Correct 6 ms 9700 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 6 ms 9804 KB Output is correct
6 Correct 6 ms 9804 KB Output is correct
7 Correct 6 ms 9804 KB Output is correct
8 Correct 6 ms 9804 KB Output is correct
9 Correct 6 ms 9772 KB Output is correct
10 Correct 6 ms 9748 KB Output is correct
11 Correct 6 ms 9804 KB Output is correct
12 Correct 7 ms 9804 KB Output is correct
13 Correct 7 ms 9728 KB Output is correct
14 Correct 6 ms 9676 KB Output is correct
15 Correct 7 ms 9676 KB Output is correct
16 Correct 6 ms 9676 KB Output is correct
17 Correct 6 ms 9804 KB Output is correct
18 Correct 6 ms 9736 KB Output is correct
19 Correct 6 ms 9676 KB Output is correct
20 Correct 6 ms 9780 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 10572 KB Output is correct
25 Correct 9 ms 10408 KB Output is correct
26 Correct 11 ms 10556 KB Output is correct
27 Correct 13 ms 10492 KB Output is correct
28 Correct 11 ms 10492 KB Output is correct
29 Correct 9 ms 10444 KB Output is correct
30 Correct 12 ms 10572 KB Output is correct
31 Correct 11 ms 10532 KB Output is correct
32 Correct 10 ms 10444 KB Output is correct
33 Correct 8 ms 10756 KB Output is correct
34 Correct 9 ms 10908 KB Output is correct
35 Correct 8 ms 10684 KB Output is correct
36 Correct 9 ms 10324 KB Output is correct
37 Correct 9 ms 10328 KB Output is correct
38 Correct 8 ms 10316 KB Output is correct
39 Correct 6 ms 9676 KB Output is correct
40 Correct 6 ms 9720 KB Output is correct
41 Correct 6 ms 9696 KB Output is correct
42 Correct 6 ms 9804 KB Output is correct
43 Correct 6 ms 9760 KB Output is correct
44 Correct 6 ms 9760 KB Output is correct
45 Correct 6 ms 9804 KB Output is correct
46 Correct 6 ms 9804 KB Output is correct
47 Correct 6 ms 9804 KB Output is correct
48 Correct 6 ms 9832 KB Output is correct
49 Correct 7 ms 9804 KB Output is correct
50 Correct 6 ms 9676 KB Output is correct
51 Correct 6 ms 9784 KB Output is correct
52 Correct 6 ms 9676 KB Output is correct
53 Correct 9 ms 10316 KB Output is correct
54 Correct 9 ms 10580 KB Output is correct
55 Correct 13 ms 10516 KB Output is correct
56 Correct 9 ms 10188 KB Output is correct
57 Correct 9 ms 10316 KB Output is correct
58 Correct 7 ms 9676 KB Output is correct
59 Correct 6 ms 9804 KB Output is correct
60 Correct 6 ms 9804 KB Output is correct
61 Correct 6 ms 9728 KB Output is correct
62 Correct 8 ms 9676 KB Output is correct
63 Correct 6 ms 9676 KB Output is correct
64 Correct 9 ms 10608 KB Output is correct
65 Correct 9 ms 10624 KB Output is correct
66 Correct 11 ms 10444 KB Output is correct
67 Correct 10 ms 10392 KB Output is correct
68 Correct 11 ms 10564 KB Output is correct

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 361 ms 52872 KB Output is correct
2 Correct 323 ms 52068 KB Output is correct
3 Correct 525 ms 53636 KB Output is correct
4 Correct 357 ms 54204 KB Output is correct
5 Correct 393 ms 53728 KB Output is correct
6 Correct 430 ms 50048 KB Output is correct
7 Correct 380 ms 55992 KB Output is correct
8 Correct 175 ms 37172 KB Output is correct
9 Correct 344 ms 56352 KB Output is correct
10 Correct 342 ms 53424 KB Output is correct
11 Correct 412 ms 49216 KB Output is correct
12 Correct 302 ms 44720 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 123 ms 63216 KB Output is correct
15 Correct 137 ms 69124 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 10508 KB Output is correct
19 Correct 10 ms 10364 KB Output is correct
20 Correct 11 ms 10572 KB Output is correct
21 Correct 177 ms 36828 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 361 ms 52872 KB Output is correct
2 Correct 323 ms 52068 KB Output is correct
3 Correct 525 ms 53636 KB Output is correct
4 Correct 357 ms 54204 KB Output is correct
5 Correct 393 ms 53728 KB Output is correct
6 Correct 430 ms 50048 KB Output is correct
7 Correct 380 ms 55992 KB Output is correct
8 Correct 175 ms 37172 KB Output is correct
9 Correct 344 ms 56352 KB Output is correct
10 Correct 342 ms 53424 KB Output is correct
11 Correct 412 ms 49216 KB Output is correct
12 Correct 302 ms 44720 KB Output is correct
13 Correct 6 ms 9676 KB Output is correct
14 Correct 123 ms 63216 KB Output is correct
15 Correct 137 ms 69124 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 10508 KB Output is correct
19 Correct 10 ms 10364 KB Output is correct
20 Correct 11 ms 10572 KB Output is correct
21 Correct 177 ms 36828 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 9684 KB Output is correct
25 Correct 316 ms 47928 KB Output is correct
26 Correct 245 ms 44268 KB Output is correct
27 Correct 363 ms 54328 KB Output is correct
28 Correct 786 ms 53744 KB Output is correct
29 Correct 524 ms 50488 KB Output is correct
30 Correct 714 ms 48624 KB Output is correct
31 Correct 524 ms 48040 KB Output is correct
32 Correct 348 ms 50884 KB Output is correct
33 Correct 231 ms 37820 KB Output is correct
34 Correct 577 ms 55812 KB Output is correct
35 Correct 411 ms 59744 KB Output is correct
36 Correct 649 ms 49132 KB Output is correct
37 Correct 452 ms 44720 KB Output is correct
38 Correct 88 ms 45272 KB Output is correct
39 Correct 148 ms 69128 KB Output is correct
40 Correct 12 ms 10404 KB Output is correct
41 Correct 10 ms 10572 KB Output is correct
42 Correct 13 ms 10444 KB Output is correct
43 Correct 9 ms 10180 KB Output is correct
44 Correct 11 ms 10316 KB Output is correct
45 Correct 8 ms 9676 KB Output is correct
46 Correct 7 ms 9804 KB Output is correct
47 Correct 8 ms 9804 KB Output is correct
48 Correct 7 ms 9776 KB Output is correct
49 Correct 6 ms 9676 KB Output is correct
50 Correct 137 ms 27644 KB Output is correct
51 Correct 245 ms 39840 KB Output is correct
52 Correct 352 ms 52856 KB Output is correct
53 Correct 337 ms 52088 KB Output is correct
54 Correct 494 ms 53656 KB Output is correct
55 Correct 397 ms 54440 KB Output is correct
56 Correct 424 ms 53656 KB Output is correct
57 Correct 459 ms 50104 KB Output is correct
58 Correct 404 ms 55788 KB Output is correct
59 Correct 194 ms 37172 KB Output is correct
60 Correct 429 ms 56348 KB Output is correct
61 Correct 405 ms 53392 KB Output is correct
62 Correct 427 ms 49216 KB Output is correct
63 Correct 285 ms 44656 KB Output is correct
64 Correct 6 ms 9676 KB Output is correct
65 Correct 124 ms 63232 KB Output is correct
66 Correct 187 ms 69060 KB Output is correct
67 Correct 9 ms 10572 KB Output is correct
68 Correct 9 ms 10572 KB Output is correct
69 Correct 10 ms 10444 KB Output is correct
70 Correct 11 ms 10444 KB Output is correct
71 Correct 11 ms 10576 KB Output is correct
72 Correct 166 ms 36880 KB Output is correct

Subtask #7
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 9 ms 10316 KB Output is correct
3 Correct 9 ms 10316 KB Output is correct
4 Correct 9 ms 10316 KB Output is correct
5 Correct 6 ms 9676 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 8 ms 9744 KB Output is correct
8 Correct 9 ms 10240 KB Output is correct
9 Correct 9 ms 10316 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 136 ms 27644 KB Output is correct
13 Correct 241 ms 39672 KB Output is correct
14 Correct 289 ms 36636 KB Output is correct
15 Correct 325 ms 39508 KB Output is correct
16 Correct 348 ms 40092 KB Output is correct
17 Correct 206 ms 39928 KB Output is correct
18 Correct 6 ms 9676 KB Output is correct
19 Correct 173 ms 36868 KB Output is correct
20 Correct 6 ms 9676 KB Output is correct
21 Correct 125 ms 59104 KB Output is correct
22 Correct 136 ms 65324 KB Output is correct
23 Correct 148 ms 69148 KB Output is correct
24 Correct 147 ms 69224 KB Output is correct
25 Correct 8 ms 10696 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 9804 KB Output is correct
30 Correct 6 ms 9804 KB Output is correct
31 Correct 85 ms 45348 KB Output is correct
32 Correct 139 ms 69168 KB Output is correct
33 Correct 6 ms 9676 KB Output is correct
34 Correct 127 ms 63256 KB Output is correct
35 Correct 138 ms 69168 KB Output is correct
36 Correct 6 ms 9676 KB Output is correct
37 Correct 6 ms 9676 KB Output is correct
38 Correct 6 ms 9700 KB Output is correct
39 Correct 6 ms 9676 KB Output is correct
40 Correct 6 ms 9804 KB Output is correct
41 Correct 6 ms 9804 KB Output is correct
42 Correct 6 ms 9804 KB Output is correct
43 Correct 6 ms 9804 KB Output is correct
44 Correct 6 ms 9772 KB Output is correct
45 Correct 6 ms 9748 KB Output is correct
46 Correct 6 ms 9804 KB Output is correct
47 Correct 7 ms 9804 KB Output is correct
48 Correct 7 ms 9728 KB Output is correct
49 Correct 6 ms 9676 KB Output is correct
50 Correct 7 ms 9676 KB Output is correct
51 Correct 6 ms 9676 KB Output is correct
52 Correct 6 ms 9804 KB Output is correct
53 Correct 6 ms 9736 KB Output is correct
54 Correct 6 ms 9676 KB Output is correct
55 Correct 6 ms 9780 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 10572 KB Output is correct
60 Correct 9 ms 10408 KB Output is correct
61 Correct 11 ms 10556 KB Output is correct
62 Correct 13 ms 10492 KB Output is correct
63 Correct 11 ms 10492 KB Output is correct
64 Correct 9 ms 10444 KB Output is correct
65 Correct 12 ms 10572 KB Output is correct
66 Correct 11 ms 10532 KB Output is correct
67 Correct 10 ms 10444 KB Output is correct
68 Correct 8 ms 10756 KB Output is correct
69 Correct 9 ms 10908 KB Output is correct
70 Correct 8 ms 10684 KB Output is correct
71 Correct 9 ms 10324 KB Output is correct
72 Correct 9 ms 10328 KB Output is correct
73 Correct 8 ms 10316 KB Output is correct
74 Correct 6 ms 9676 KB Output is correct
75 Correct 6 ms 9720 KB Output is correct
76 Correct 6 ms 9696 KB Output is correct
77 Correct 6 ms 9804 KB Output is correct
78 Correct 6 ms 9760 KB Output is correct
79 Correct 6 ms 9760 KB Output is correct
80 Correct 6 ms 9804 KB Output is correct
81 Correct 6 ms 9804 KB Output is correct
82 Correct 6 ms 9804 KB Output is correct
83 Correct 6 ms 9832 KB Output is correct
84 Correct 7 ms 9804 KB Output is correct
85 Correct 6 ms 9676 KB Output is correct
86 Correct 6 ms 9784 KB Output is correct
87 Correct 6 ms 9676 KB Output is correct
88 Correct 9 ms 10316 KB Output is correct
89 Correct 9 ms 10580 KB Output is correct
90 Correct 13 ms 10516 KB Output is correct
91 Correct 9 ms 10188 KB Output is correct
92 Correct 9 ms 10316 KB Output is correct
93 Correct 7 ms 9676 KB Output is correct
94 Correct 6 ms 9804 KB Output is correct
95 Correct 6 ms 9804 KB Output is correct
96 Correct 6 ms 9728 KB Output is correct
97 Correct 8 ms 9676 KB Output is correct
98 Correct 6 ms 9676 KB Output is correct
99 Correct 9 ms 10608 KB Output is correct
100 Correct 9 ms 10624 KB Output is correct
101 Correct 11 ms 10444 KB Output is correct
102 Correct 10 ms 10392 KB Output is correct
103 Correct 11 ms 10564 KB Output is correct
104 Correct 361 ms 52872 KB Output is correct
105 Correct 323 ms 52068 KB Output is correct
106 Correct 525 ms 53636 KB Output is correct
107 Correct 357 ms 54204 KB Output is correct
108 Correct 393 ms 53728 KB Output is correct
109 Correct 430 ms 50048 KB Output is correct
110 Correct 380 ms 55992 KB Output is correct
111 Correct 175 ms 37172 KB Output is correct
112 Correct 344 ms 56352 KB Output is correct
113 Correct 342 ms 53424 KB Output is correct
114 Correct 412 ms 49216 KB Output is correct
115 Correct 302 ms 44720 KB Output is correct
116 Correct 6 ms 9676 KB Output is correct
117 Correct 123 ms 63216 KB Output is correct
118 Correct 137 ms 69124 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 10508 KB Output is correct
122 Correct 10 ms 10364 KB Output is correct
123 Correct 11 ms 10572 KB Output is correct
124 Correct 177 ms 36828 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 9684 KB Output is correct
128 Correct 316 ms 47928 KB Output is correct
129 Correct 245 ms 44268 KB Output is correct
130 Correct 363 ms 54328 KB Output is correct
131 Correct 786 ms 53744 KB Output is correct
132 Correct 524 ms 50488 KB Output is correct
133 Correct 714 ms 48624 KB Output is correct
134 Correct 524 ms 48040 KB Output is correct
135 Correct 348 ms 50884 KB Output is correct
136 Correct 231 ms 37820 KB Output is correct
137 Correct 577 ms 55812 KB Output is correct
138 Correct 411 ms 59744 KB Output is correct
139 Correct 649 ms 49132 KB Output is correct
140 Correct 452 ms 44720 KB Output is correct
141 Correct 88 ms 45272 KB Output is correct
142 Correct 148 ms 69128 KB Output is correct
143 Correct 12 ms 10404 KB Output is correct
144 Correct 10 ms 10572 KB Output is correct
145 Correct 13 ms 10444 KB Output is correct
146 Correct 9 ms 10180 KB Output is correct
147 Correct 11 ms 10316 KB Output is correct
148 Correct 8 ms 9676 KB Output is correct
149 Correct 7 ms 9804 KB Output is correct
150 Correct 8 ms 9804 KB Output is correct
151 Correct 7 ms 9776 KB Output is correct
152 Correct 6 ms 9676 KB Output is correct
153 Correct 137 ms 27644 KB Output is correct
154 Correct 245 ms 39840 KB Output is correct
155 Correct 352 ms 52856 KB Output is correct
156 Correct 337 ms 52088 KB Output is correct
157 Correct 494 ms 53656 KB Output is correct
158 Correct 397 ms 54440 KB Output is correct
159 Correct 424 ms 53656 KB Output is correct
160 Correct 459 ms 50104 KB Output is correct
161 Correct 404 ms 55788 KB Output is correct
162 Correct 194 ms 37172 KB Output is correct
163 Correct 429 ms 56348 KB Output is correct
164 Correct 405 ms 53392 KB Output is correct
165 Correct 427 ms 49216 KB Output is correct
166 Correct 285 ms 44656 KB Output is correct
167 Correct 6 ms 9676 KB Output is correct
168 Correct 124 ms 63232 KB Output is correct
169 Correct 187 ms 69060 KB Output is correct
170 Correct 9 ms 10572 KB Output is correct
171 Correct 9 ms 10572 KB Output is correct
172 Correct 10 ms 10444 KB Output is correct
173 Correct 11 ms 10444 KB Output is correct
174 Correct 11 ms 10576 KB Output is correct
175 Correct 166 ms 36880 KB Output is correct
176 Correct 6 ms 9676 KB Output is correct
177 Correct 333 ms 53796 KB Output is correct
178 Correct 242 ms 44132 KB Output is correct
179 Correct 569 ms 53848 KB Output is correct
180 Correct 569 ms 51248 KB Output is correct
181 Correct 398 ms 53908 KB Output is correct
182 Correct 465 ms 52812 KB Output is correct
183 Correct 431 ms 55724 KB Output is correct
184 Correct 765 ms 48312 KB Output is correct
185 Correct 633 ms 47548 KB Output is correct
186 Correct 562 ms 45256 KB Output is correct
187 Correct 314 ms 39388 KB Output is correct
188 Correct 334 ms 52320 KB Output is correct
189 Correct 360 ms 51312 KB Output is correct
190 Correct 646 ms 49516 KB Output is correct
191 Correct 424 ms 49452 KB Output is correct
192 Correct 509 ms 44724 KB Output is correct
193 Correct 499 ms 44980 KB Output is correct
194 Correct 423 ms 49380 KB Output is correct
195 Correct 147 ms 59064 KB Output is correct
196 Correct 154 ms 65292 KB Output is correct
197 Correct 146 ms 69168 KB Output is correct
198 Correct 146 ms 69112 KB Output is correct
199 Correct 8 ms 10188 KB Output is correct
200 Correct 11 ms 10568 KB Output is correct
201 Correct 8 ms 10444 KB Output is correct
202 Correct 10 ms 10572 KB Output is correct
203 Correct 12 ms 10444 KB Output is correct
204 Correct 11 ms 10444 KB Output is correct
205 Correct 9 ms 10444 KB Output is correct
206 Correct 12 ms 10572 KB Output is correct
207 Correct 11 ms 10444 KB Output is correct
208 Correct 10 ms 10444 KB Output is correct
209 Correct 8 ms 10744 KB Output is correct
210 Correct 9 ms 10808 KB Output is correct
211 Correct 8 ms 10748 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 9600 KB Output is correct
217 Correct 6 ms 9676 KB Output is correct
218 Correct 6 ms 9804 KB Output is correct
219 Correct 6 ms 9804 KB Output is correct
220 Correct 6 ms 9808 KB Output is correct
221 Correct 7 ms 9804 KB Output is correct
222 Correct 6 ms 9804 KB Output is correct
223 Correct 6 ms 9804 KB Output is correct
224 Correct 6 ms 9804 KB Output is correct
225 Correct 6 ms 9804 KB Output is correct
226 Correct 6 ms 9676 KB Output is correct
227 Correct 6 ms 9676 KB Output is correct
228 Correct 6 ms 9676 KB Output is correct
229 Correct 275 ms 47872 KB Output is correct
230 Correct 259 ms 44284 KB Output is correct
231 Correct 334 ms 54296 KB Output is correct
232 Correct 782 ms 53840 KB Output is correct
233 Correct 528 ms 50456 KB Output is correct
234 Correct 698 ms 48648 KB Output is correct
235 Correct 506 ms 47996 KB Output is correct
236 Correct 339 ms 51116 KB Output is correct
237 Correct 223 ms 37696 KB Output is correct
238 Correct 542 ms 55880 KB Output is correct
239 Correct 389 ms 59836 KB Output is correct
240 Correct 597 ms 49408 KB Output is correct
241 Correct 427 ms 44792 KB Output is correct
242 Correct 85 ms 45288 KB Output is correct
243 Correct 141 ms 69108 KB Output is correct
244 Correct 9 ms 10316 KB Output is correct
245 Correct 9 ms 10572 KB Output is correct
246 Correct 13 ms 10444 KB Output is correct
247 Correct 9 ms 10188 KB Output is correct
248 Correct 9 ms 10316 KB Output is correct
249 Correct 6 ms 9676 KB Output is correct
250 Correct 6 ms 9804 KB Output is correct
251 Correct 6 ms 9804 KB Output is correct
252 Correct 6 ms 9676 KB Output is correct
253 Correct 6 ms 9676 KB Output is correct
254 Correct 131 ms 27584 KB Output is correct
255 Correct 229 ms 39608 KB Output is correct
256 Correct 297 ms 36828 KB Output is correct
257 Correct 327 ms 39540 KB Output is correct
258 Correct 337 ms 39932 KB Output is correct
259 Correct 200 ms 39908 KB Output is correct
260 Correct 313 ms 52764 KB Output is correct
261 Correct 313 ms 52072 KB Output is correct
262 Correct 491 ms 53632 KB Output is correct
263 Correct 336 ms 54260 KB Output is correct
264 Correct 396 ms 53632 KB Output is correct
265 Correct 424 ms 50104 KB Output is correct
266 Correct 380 ms 55736 KB Output is correct
267 Correct 168 ms 37176 KB Output is correct
268 Correct 322 ms 56340 KB Output is correct
269 Correct 362 ms 53604 KB Output is correct
270 Correct 425 ms 49140 KB Output is correct
271 Correct 291 ms 44728 KB Output is correct
272 Correct 6 ms 9676 KB Output is correct
273 Correct 126 ms 63236 KB Output is correct
274 Correct 137 ms 69168 KB Output is correct
275 Correct 9 ms 10600 KB Output is correct
276 Correct 11 ms 10572 KB Output is correct
277 Correct 10 ms 10444 KB Output is correct
278 Correct 10 ms 10444 KB Output is correct
279 Correct 13 ms 10572 KB Output is correct
280 Correct 182 ms 36936 KB Output is correct