oj.uz

Submission #963772

# Submission time Handle Problem Language Result Execution time Memory
963772 2024-04-15T15:58:43 Z Nhoksocqt1 Road Closures (APIO21_roads) C++17
100 / 100
 160 ms 72836 KB 
#include<bits/stdc++.h>
using namespace std;

#define inf 0x3f3f3f3f
#define sz(x) int((x).size())
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, int> li;

template<class X, class Y>
	inline bool maximize(X &x, const Y &y) {return (x < y ? x = y, 1 : 0);}
template<class X, class Y>
	inline bool minimize(X &x, const Y &y) {return (x > y ? x = y, 1 : 0);}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int Random(int l, int r) {
    return uniform_int_distribution<int>(l, r)(rng);
}

const int MAXN = 100005;

class DisjointSet {
    private:
        vector<int> lab;

    public:
        DisjointSet(int _n = 0) {
            lab.assign(_n + 7, -1);
        }

        int find(int u) {
            return (lab[u] < 0) ? u : (lab[u] = find(lab[u]));
        }

        bool join(int u, int v) {
            u = find(u), v = find(v);
            if(u == v)
                return (false);

            if(lab[u] > lab[v])
                swap(u, v);

            lab[u] += lab[v];
            lab[v] = u;
            return (true);
        }
} dsu;

struct Edge {
    int u, v, w;
} edge[MAXN];

vector<int> B[MAXN], idw[MAXN];
vector<ii> adj[MAXN];
li *fen[MAXN];
ll dp[MAXN][2], f[2003][2003][2];
int sz[MAXN], pa[MAXN], deg[MAXN], numNode;
bool dx[MAXN];

vector<ll> sub1(void) {
    sort(edge, edge + numNode - 1, [](const Edge &a, const Edge &b) {
        return (a.w > b.w);
    });

    vector<ll> ans;
    ll sumCost(0);
    for (int i = 0; i < numNode - 1; ++i)
        sumCost += edge[i].w;

    for (int i = 0; i < numNode; ++i) {
        ans.push_back(sumCost);
        sumCost -= edge[i].w;
    }

    return ans;
}

vector<ll> sub2(void) {
    vector<ll> ans;
    ll sumCost(0);

    dp[0][0] = dp[0][1] = 0;
    for (int i = 0; i < numNode - 1; ++i) {
        sumCost += edge[i].w;
        dp[i + 1][0] = max(dp[i][1], dp[i][0]);
        dp[i + 1][1] = dp[i][0] + edge[i].w;
    }

    ans.push_back(sumCost);
    ans.push_back(sumCost - max(dp[numNode - 1][0], dp[numNode - 1][1]));

    for (int i = 2; i < numNode; ++i)
        ans.push_back(0);

    return ans;
}

typedef pair<ll, ll> pll;
void dfsDP(int u) {
    for (int it = 0; it < sz(adj[u]); ++it) {
        int v(adj[u][it].fi), w(adj[u][it].se);
        if(v != pa[u]) {
            pa[v] = u;
            dfsDP(v);
            f[u][0][0] += f[v][0][0];
            f[u][0][1] += f[v][0][1];
        }
    }

    for (int i = 1; i < numNode; ++i) {
        vector<pll> p;
        for (int it = 0; it < sz(adj[u]); ++it) {
            int v(adj[u][it].fi), w(adj[u][it].se);
            if(v != pa[u])
                p.push_back(pll(max(f[v][i - 1][1], f[v][i][0]) + w, max(f[v][i][0], f[v][i][1])));
        }

        sort(p.begin(), p.end(), [](const pll &a, const pll &b) {
            return a.fi - a.se > b.fi - b.se;
        });

        f[u][i][0] = -1e18;
        for (int j = 0; j < sz(p); ++j) {
            f[u][i][0] = max(f[u][i][0] + (j < i ? max(p[j].fi, p[j].se) : p[j].se), (j < i ? f[u][i][1] + p[j].se : 0LL));
            f[u][i][1] += (j < i) ? max(p[j].fi, p[j].se) : p[j].se;
        }

        if(sz(p) < i)
            f[u][i][0] = max(f[u][i][0], f[u][i][1]);
    }
}

vector<ll> sub4(void) {
    ll sumCost(0);
    for (int i = 0; i + 1 < numNode; ++i) {
        int u(edge[i].u), v(edge[i].v), w(edge[i].w);
        adj[u].push_back(ii(v, w));
        adj[v].push_back(ii(u, w));
        sumCost += w;
    }

    pa[0] = -1;
    dfsDP(0);

    vector<ll> ans;
    for (int i = 0; i < numNode; ++i)
        ans.push_back(sumCost - max(f[0][i][0], f[0][i][1]));

    return ans;
}

void modify(li fen[], int i, int n, li v) {
    for (; i <= n; i += i & -i)
        fen[i] = {fen[i].fi + v.fi, fen[i].se + v.se};
}

li get(li fen[], int i) {
    li res = {0, 0};
    for (; i > 0; i -= i & -i)
        res = {res.fi + fen[i].fi, res.se + fen[i].se};

    return res;
}

ll getKMaximum(li fen[], int n, int k) {
    li res = {0, 0};
    int i(0), cnt(0);
    for (int j = 31 - __builtin_clz(n); j >= 0; --j) {
        if(i + (1 << j) <= n && fen[i + (1 << j)].se + res.se <= k) {
            i += (1 << j);
            res = {res.fi + fen[i].fi, res.se + fen[i].se};
        }
    }

    k -= res.se;
    if(k > 0 && i < n) {
        li ans = get(fen, i + 1);
        ans = {ans.fi - res.fi, ans.se - res.se};
        //cout << ',' << ans.fi << '\n';
        res.fi += ans.fi / ans.se * k;
    }

    return res.fi;
}

void dfs(int u, int p, int k) {
    dp[u][0] = dp[u][1] = dx[u] = 0;

    vector<ll> pw;
    ll sumAdd(0);
    for (int it = 0; it < sz(adj[u]); ++it) {
        int v(adj[u][it].fi), w(adj[u][it].se);
        if(sz(adj[v]) <= k)
            break;

        if(v != p) {
            dfs(v, u, k);
            sumAdd += dp[v][0];
            pw.push_back(dp[v][1] + w - dp[v][0]);
        }
    }

    sort(pw.begin(), pw.end(), greater<ll>());
    for (int i = 0; i <= min(sz(pw), k); ++i) {
        dp[u][0] = max(dp[u][0], sumAdd + getKMaximum(fen[u], sz(idw[u]), k - i));

        if(i < k)
            dp[u][1] = max(dp[u][1], sumAdd + getKMaximum(fen[u], sz(idw[u]), k - i - 1));

        if(i < sz(pw))
            sumAdd += pw[i];
    }
}

vector<ll> magicFunc(void) {
    vector<int> perm;
    for (int i = 0; i < numNode; ++i) {
        perm.push_back(i);
        if(i + 1 < numNode) {
            int u(edge[i].u), v(edge[i].v), w(edge[i].w);
            adj[u].push_back(ii(v, w));
            adj[v].push_back(ii(u, w));
        }
    }

    sort(perm.begin(), perm.end(), [](const int &a, const int &b) {
        return (sz(adj[a]) > sz(adj[b]));
    });

    ll sumCost(0);
    for (int i = 0; i + 1 < numNode; ++i)
        sumCost += edge[i].w;

    for (int i = 0; i < numNode; ++i) {
        for (int it = 0; it < sz(adj[i]); ++it) {
            int j(adj[i][it].fi), w(adj[i][it].se);
            idw[i].push_back(w);
        }

        sort(idw[i].begin(), idw[i].end());
        idw[i].erase(unique(idw[i].begin(), idw[i].end()), idw[i].end());

        sort(adj[i].begin(), adj[i].end(), [](const ii &a, const ii &b) {
            return (sz(adj[a.fi]) > sz(adj[b.fi]));
        });

        fen[i] = new li[sz(idw[i]) + 1];
        for (int j = 0; j <= sz(idw[i]); ++j)
            fen[i][j] = {0, 0};

        B[sz(adj[i])].push_back(i);
        dx[i] = 0;
    }

    vector<ll> ans;
    ans.push_back(sumCost);

    ll sumAdd(0);
    for (int k = 1; k < numNode; ++k) {
        for (int it = 0; it < sz(B[k]); ++it) {
            int u(B[k][it]);
            for (int jt = 0; jt < sz(adj[u]); ++jt) {
                int v(adj[u][jt].fi), w(adj[u][jt].se);
                //cout << k << ' ' << u << ' ' << v << ' ' << w << ' ' << sz(adj[u]) << ' ' << sz(adj[v]) << '\n';
                if(sz(adj[v]) <= k) {
                    sumAdd += (sz(adj[u]) != sz(adj[v]) || u < v) * w;
                    //cout << "+ " << k << ' ' << w << '\n';
                } else {
                    // insert w to node v
                    int pos = upper_bound(idw[v].begin(), idw[v].end(), w) - idw[v].begin();
                    modify(fen[v], sz(idw[v]) - pos + 1, sz(idw[v]), li(w, 1));
                    //cout << "+ " << k << ' ' << v << ' ' << sz(idw[v]) - pos + 1 << ' ' << w << '\n';
                }
            }
        }

        for (int it = 0; it < sz(perm); ++it) {
            int u(perm[it]);
            if(sz(adj[u]) <= k)
                break;

            dx[u] = 1;
        }

        ll result(sumAdd);
        for (int it = 0; it < sz(perm); ++it) {
            int u(perm[it]);
            if(sz(adj[u]) <= k)
                break;

            if(dx[u]) {
                dfs(u, -1, k);
                result += dp[u][0];
            }
        }

        ans.push_back(sumCost - result);
    }

    return ans;
}

vector<ll> minimum_closure_costs(int _N, vector<int> _U, vector<int> _V, vector<int> _W) {
    numNode = _N;

    bool check_sub1(1), check_sub2(1);
    for (int i = 0; i + 1 < numNode; ++i) {
        edge[i] = {_U[i], _V[i], _W[i]};
        if(edge[i].u > edge[i].v)
            swap(edge[i].u, edge[i].v);

        check_sub1 &= (edge[i].u == 0);
        check_sub2 &= (edge[i].u == i && edge[i].v == i + 1);
    }

    if(check_sub1)
        return sub1();

    if(check_sub2)
        return sub2();

    if(numNode <= 2000)
        return sub4();

    return magicFunc();
}

#ifdef Nhoksocqt1

int main(void) {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    #define TASK "roads"
    if(fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }

    vector<int> u, v, w;
    int n;
    cin >> n;
    //n = Random(10, 1000); cout << n << '\n';

    u.resize(n - 1), v.resize(n - 1), w.resize(n - 1);
    for (int i = 0; i + 1 < n; ++i) {
        cin >> u[i] >> v[i] >> w[i];
        //u[i] = Random(0, i), v[i] = i + 1, w[i] = Random(1, 100); cout << u[i] << ' ' << v[i] << ' ' << w[i] << '\n';
    }

    vector<ll> ans = minimum_closure_costs(n, u, v, w);
    cout << "ANSWER: ";
    for (int it = 0; it < sz(ans); ++it)
        cout << ans[it] << ' '; cout << '\n';

    return 0;
}

#endif // Nhoksocqt1

Compilation message

roads.cpp: In function 'void dfsDP(int)':
roads.cpp:103:31: warning: unused variable 'w' [-Wunused-variable]
  103 |         int v(adj[u][it].fi), w(adj[u][it].se);
      |                               ^
roads.cpp: In function 'll getKMaximum(li*, int, int)':
roads.cpp:169:15: warning: unused variable 'cnt' [-Wunused-variable]
  169 |     int i(0), cnt(0);
      |               ^~~
roads.cpp: In function 'std::vector<long long int> magicFunc()':
roads.cpp:238:17: warning: unused variable 'j' [-Wunused-variable]
  238 |             int j(adj[i][it].fi), w(adj[i][it].se);
      |                 ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 4 ms 8668 KB Output is correct
3 Correct 3 ms 8796 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Correct 2 ms 8536 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 2 ms 8540 KB Output is correct
12 Correct 20 ms 11408 KB Output is correct
13 Correct 46 ms 13652 KB Output is correct
14 Correct 40 ms 13780 KB Output is correct
15 Correct 41 ms 14292 KB Output is correct
16 Correct 51 ms 14660 KB Output is correct
17 Correct 36 ms 14636 KB Output is correct
18 Correct 2 ms 8536 KB Output is correct
19 Correct 29 ms 13520 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 29 ms 15828 KB Output is correct
3 Correct 46 ms 16584 KB Output is correct
4 Correct 35 ms 16716 KB Output is correct
5 Correct 39 ms 17040 KB Output is correct
6 Correct 4 ms 10720 KB Output is correct
7 Correct 3 ms 10716 KB Output is correct
8 Correct 3 ms 10584 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 2 ms 10584 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 20 ms 13528 KB Output is correct
13 Correct 31 ms 16180 KB Output is correct
14 Correct 2 ms 8536 KB Output is correct
15 Correct 29 ms 15576 KB Output is correct
16 Correct 36 ms 16088 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8664 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 2 ms 8644 KB Output is correct
4 Correct 4 ms 14684 KB Output is correct
5 Correct 4 ms 16732 KB Output is correct
6 Correct 5 ms 16836 KB Output is correct
7 Correct 4 ms 16732 KB Output is correct
8 Correct 5 ms 16732 KB Output is correct
9 Correct 4 ms 16732 KB Output is correct
10 Correct 2 ms 10584 KB Output is correct
11 Correct 2 ms 10584 KB Output is correct
12 Correct 3 ms 10584 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 2 ms 8536 KB Output is correct
15 Correct 2 ms 8540 KB Output is correct
16 Correct 3 ms 14788 KB Output is correct
17 Correct 4 ms 16732 KB Output is correct
18 Correct 4 ms 16732 KB Output is correct
19 Correct 2 ms 8696 KB Output is correct
20 Correct 2 ms 8540 KB Output is correct
21 Correct 2 ms 8656 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8664 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 2 ms 8644 KB Output is correct
4 Correct 4 ms 14684 KB Output is correct
5 Correct 4 ms 16732 KB Output is correct
6 Correct 5 ms 16836 KB Output is correct
7 Correct 4 ms 16732 KB Output is correct
8 Correct 5 ms 16732 KB Output is correct
9 Correct 4 ms 16732 KB Output is correct
10 Correct 2 ms 10584 KB Output is correct
11 Correct 2 ms 10584 KB Output is correct
12 Correct 3 ms 10584 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 2 ms 8536 KB Output is correct
15 Correct 2 ms 8540 KB Output is correct
16 Correct 3 ms 14788 KB Output is correct
17 Correct 4 ms 16732 KB Output is correct
18 Correct 4 ms 16732 KB Output is correct
19 Correct 2 ms 8696 KB Output is correct
20 Correct 2 ms 8540 KB Output is correct
21 Correct 2 ms 8656 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 63 ms 41564 KB Output is correct
24 Correct 140 ms 72512 KB Output is correct
25 Correct 106 ms 62464 KB Output is correct
26 Correct 123 ms 72592 KB Output is correct
27 Correct 130 ms 72528 KB Output is correct
28 Correct 112 ms 72352 KB Output is correct
29 Correct 136 ms 67352 KB Output is correct
30 Correct 113 ms 72532 KB Output is correct
31 Correct 116 ms 72676 KB Output is correct
32 Correct 115 ms 72528 KB Output is correct
33 Correct 3 ms 10588 KB Output is correct
34 Correct 3 ms 10768 KB Output is correct
35 Correct 3 ms 10716 KB Output is correct
36 Correct 3 ms 8708 KB Output is correct
37 Correct 2 ms 8796 KB Output is correct
38 Correct 2 ms 8796 KB Output is correct
39 Correct 3 ms 10720 KB Output is correct
40 Correct 2 ms 8540 KB Output is correct
41 Correct 3 ms 14684 KB Output is correct
42 Correct 4 ms 15196 KB Output is correct
43 Correct 4 ms 16732 KB Output is correct
44 Correct 5 ms 16732 KB Output is correct
45 Correct 4 ms 16732 KB Output is correct
46 Correct 4 ms 16732 KB Output is correct
47 Correct 2 ms 10588 KB Output is correct
48 Correct 3 ms 10588 KB Output is correct
49 Correct 2 ms 10588 KB Output is correct
50 Correct 3 ms 8540 KB Output is correct
51 Correct 2 ms 8536 KB Output is correct
52 Correct 3 ms 8540 KB Output is correct
53 Correct 93 ms 54032 KB Output is correct
54 Correct 143 ms 72532 KB Output is correct
55 Correct 125 ms 72568 KB Output is correct
56 Correct 3 ms 8536 KB Output is correct
57 Correct 4 ms 8540 KB Output is correct
58 Correct 3 ms 12632 KB Output is correct
59 Correct 4 ms 13660 KB Output is correct
60 Correct 4 ms 13404 KB Output is correct
61 Correct 2 ms 8540 KB Output is correct
62 Correct 2 ms 8540 KB Output is correct
63 Correct 2 ms 8540 KB Output is correct
64 Correct 143 ms 71508 KB Output is correct
65 Correct 146 ms 72576 KB Output is correct
66 Correct 106 ms 72496 KB Output is correct
67 Correct 112 ms 72640 KB Output is correct
68 Correct 106 ms 72636 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 28112 KB Output is correct
2 Correct 108 ms 27712 KB Output is correct
3 Correct 75 ms 29904 KB Output is correct
4 Correct 115 ms 28548 KB Output is correct
5 Correct 68 ms 29872 KB Output is correct
6 Correct 67 ms 29000 KB Output is correct
7 Correct 87 ms 29164 KB Output is correct
8 Correct 71 ms 28268 KB Output is correct
9 Correct 123 ms 31632 KB Output is correct
10 Correct 108 ms 28264 KB Output is correct
11 Correct 76 ms 29696 KB Output is correct
12 Correct 78 ms 29380 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 28 ms 15568 KB Output is correct
15 Correct 31 ms 16072 KB Output is correct
16 Correct 134 ms 71552 KB Output is correct
17 Correct 148 ms 72432 KB Output is correct
18 Correct 104 ms 72612 KB Output is correct
19 Correct 115 ms 72412 KB Output is correct
20 Correct 102 ms 72612 KB Output is correct
21 Correct 28 ms 13256 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 28112 KB Output is correct
2 Correct 108 ms 27712 KB Output is correct
3 Correct 75 ms 29904 KB Output is correct
4 Correct 115 ms 28548 KB Output is correct
5 Correct 68 ms 29872 KB Output is correct
6 Correct 67 ms 29000 KB Output is correct
7 Correct 87 ms 29164 KB Output is correct
8 Correct 71 ms 28268 KB Output is correct
9 Correct 123 ms 31632 KB Output is correct
10 Correct 108 ms 28264 KB Output is correct
11 Correct 76 ms 29696 KB Output is correct
12 Correct 78 ms 29380 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 28 ms 15568 KB Output is correct
15 Correct 31 ms 16072 KB Output is correct
16 Correct 134 ms 71552 KB Output is correct
17 Correct 148 ms 72432 KB Output is correct
18 Correct 104 ms 72612 KB Output is correct
19 Correct 115 ms 72412 KB Output is correct
20 Correct 102 ms 72612 KB Output is correct
21 Correct 28 ms 13256 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 2 ms 10588 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 89 ms 27212 KB Output is correct
26 Correct 80 ms 25792 KB Output is correct
27 Correct 113 ms 30028 KB Output is correct
28 Correct 85 ms 29980 KB Output is correct
29 Correct 65 ms 28280 KB Output is correct
30 Correct 77 ms 28492 KB Output is correct
31 Correct 70 ms 28876 KB Output is correct
32 Correct 98 ms 28024 KB Output is correct
33 Correct 67 ms 28428 KB Output is correct
34 Correct 91 ms 29772 KB Output is correct
35 Correct 126 ms 34124 KB Output is correct
36 Correct 89 ms 29784 KB Output is correct
37 Correct 74 ms 29224 KB Output is correct
38 Correct 19 ms 13528 KB Output is correct
39 Correct 31 ms 16076 KB Output is correct
40 Correct 85 ms 53820 KB Output is correct
41 Correct 154 ms 72440 KB Output is correct
42 Correct 121 ms 72528 KB Output is correct
43 Correct 2 ms 8540 KB Output is correct
44 Correct 2 ms 8644 KB Output is correct
45 Correct 3 ms 12632 KB Output is correct
46 Correct 4 ms 13656 KB Output is correct
47 Correct 4 ms 13660 KB Output is correct
48 Correct 2 ms 8540 KB Output is correct
49 Correct 2 ms 8540 KB Output is correct
50 Correct 21 ms 11220 KB Output is correct
51 Correct 32 ms 13644 KB Output is correct
52 Correct 100 ms 28112 KB Output is correct
53 Correct 92 ms 27748 KB Output is correct
54 Correct 95 ms 29772 KB Output is correct
55 Correct 109 ms 28532 KB Output is correct
56 Correct 68 ms 29776 KB Output is correct
57 Correct 65 ms 29188 KB Output is correct
58 Correct 84 ms 29152 KB Output is correct
59 Correct 64 ms 28044 KB Output is correct
60 Correct 103 ms 31796 KB Output is correct
61 Correct 125 ms 28328 KB Output is correct
62 Correct 72 ms 29512 KB Output is correct
63 Correct 75 ms 29056 KB Output is correct
64 Correct 2 ms 8540 KB Output is correct
65 Correct 28 ms 15584 KB Output is correct
66 Correct 35 ms 16084 KB Output is correct
67 Correct 160 ms 71656 KB Output is correct
68 Correct 138 ms 72532 KB Output is correct
69 Correct 102 ms 72660 KB Output is correct
70 Correct 111 ms 72532 KB Output is correct
71 Correct 111 ms 72516 KB Output is correct
72 Correct 40 ms 13280 KB Output is correct

Subtask #7
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 4 ms 8668 KB Output is correct
3 Correct 3 ms 8796 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Correct 2 ms 8536 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 2 ms 8540 KB Output is correct
12 Correct 20 ms 11408 KB Output is correct
13 Correct 46 ms 13652 KB Output is correct
14 Correct 40 ms 13780 KB Output is correct
15 Correct 41 ms 14292 KB Output is correct
16 Correct 51 ms 14660 KB Output is correct
17 Correct 36 ms 14636 KB Output is correct
18 Correct 2 ms 8536 KB Output is correct
19 Correct 29 ms 13520 KB Output is correct
20 Correct 2 ms 8536 KB Output is correct
21 Correct 29 ms 15828 KB Output is correct
22 Correct 46 ms 16584 KB Output is correct
23 Correct 35 ms 16716 KB Output is correct
24 Correct 39 ms 17040 KB Output is correct
25 Correct 4 ms 10720 KB Output is correct
26 Correct 3 ms 10716 KB Output is correct
27 Correct 3 ms 10584 KB Output is correct
28 Correct 2 ms 10588 KB Output is correct
29 Correct 2 ms 10584 KB Output is correct
30 Correct 2 ms 10588 KB Output is correct
31 Correct 20 ms 13528 KB Output is correct
32 Correct 31 ms 16180 KB Output is correct
33 Correct 2 ms 8536 KB Output is correct
34 Correct 29 ms 15576 KB Output is correct
35 Correct 36 ms 16088 KB Output is correct
36 Correct 2 ms 8664 KB Output is correct
37 Correct 2 ms 10588 KB Output is correct
38 Correct 2 ms 8644 KB Output is correct
39 Correct 4 ms 14684 KB Output is correct
40 Correct 4 ms 16732 KB Output is correct
41 Correct 5 ms 16836 KB Output is correct
42 Correct 4 ms 16732 KB Output is correct
43 Correct 5 ms 16732 KB Output is correct
44 Correct 4 ms 16732 KB Output is correct
45 Correct 2 ms 10584 KB Output is correct
46 Correct 2 ms 10584 KB Output is correct
47 Correct 3 ms 10584 KB Output is correct
48 Correct 2 ms 8540 KB Output is correct
49 Correct 2 ms 8536 KB Output is correct
50 Correct 2 ms 8540 KB Output is correct
51 Correct 3 ms 14788 KB Output is correct
52 Correct 4 ms 16732 KB Output is correct
53 Correct 4 ms 16732 KB Output is correct
54 Correct 2 ms 8696 KB Output is correct
55 Correct 2 ms 8540 KB Output is correct
56 Correct 2 ms 8656 KB Output is correct
57 Correct 2 ms 8540 KB Output is correct
58 Correct 63 ms 41564 KB Output is correct
59 Correct 140 ms 72512 KB Output is correct
60 Correct 106 ms 62464 KB Output is correct
61 Correct 123 ms 72592 KB Output is correct
62 Correct 130 ms 72528 KB Output is correct
63 Correct 112 ms 72352 KB Output is correct
64 Correct 136 ms 67352 KB Output is correct
65 Correct 113 ms 72532 KB Output is correct
66 Correct 116 ms 72676 KB Output is correct
67 Correct 115 ms 72528 KB Output is correct
68 Correct 3 ms 10588 KB Output is correct
69 Correct 3 ms 10768 KB Output is correct
70 Correct 3 ms 10716 KB Output is correct
71 Correct 3 ms 8708 KB Output is correct
72 Correct 2 ms 8796 KB Output is correct
73 Correct 2 ms 8796 KB Output is correct
74 Correct 3 ms 10720 KB Output is correct
75 Correct 2 ms 8540 KB Output is correct
76 Correct 3 ms 14684 KB Output is correct
77 Correct 4 ms 15196 KB Output is correct
78 Correct 4 ms 16732 KB Output is correct
79 Correct 5 ms 16732 KB Output is correct
80 Correct 4 ms 16732 KB Output is correct
81 Correct 4 ms 16732 KB Output is correct
82 Correct 2 ms 10588 KB Output is correct
83 Correct 3 ms 10588 KB Output is correct
84 Correct 2 ms 10588 KB Output is correct
85 Correct 3 ms 8540 KB Output is correct
86 Correct 2 ms 8536 KB Output is correct
87 Correct 3 ms 8540 KB Output is correct
88 Correct 93 ms 54032 KB Output is correct
89 Correct 143 ms 72532 KB Output is correct
90 Correct 125 ms 72568 KB Output is correct
91 Correct 3 ms 8536 KB Output is correct
92 Correct 4 ms 8540 KB Output is correct
93 Correct 3 ms 12632 KB Output is correct
94 Correct 4 ms 13660 KB Output is correct
95 Correct 4 ms 13404 KB Output is correct
96 Correct 2 ms 8540 KB Output is correct
97 Correct 2 ms 8540 KB Output is correct
98 Correct 2 ms 8540 KB Output is correct
99 Correct 143 ms 71508 KB Output is correct
100 Correct 146 ms 72576 KB Output is correct
101 Correct 106 ms 72496 KB Output is correct
102 Correct 112 ms 72640 KB Output is correct
103 Correct 106 ms 72636 KB Output is correct
104 Correct 127 ms 28112 KB Output is correct
105 Correct 108 ms 27712 KB Output is correct
106 Correct 75 ms 29904 KB Output is correct
107 Correct 115 ms 28548 KB Output is correct
108 Correct 68 ms 29872 KB Output is correct
109 Correct 67 ms 29000 KB Output is correct
110 Correct 87 ms 29164 KB Output is correct
111 Correct 71 ms 28268 KB Output is correct
112 Correct 123 ms 31632 KB Output is correct
113 Correct 108 ms 28264 KB Output is correct
114 Correct 76 ms 29696 KB Output is correct
115 Correct 78 ms 29380 KB Output is correct
116 Correct 2 ms 8540 KB Output is correct
117 Correct 28 ms 15568 KB Output is correct
118 Correct 31 ms 16072 KB Output is correct
119 Correct 134 ms 71552 KB Output is correct
120 Correct 148 ms 72432 KB Output is correct
121 Correct 104 ms 72612 KB Output is correct
122 Correct 115 ms 72412 KB Output is correct
123 Correct 102 ms 72612 KB Output is correct
124 Correct 28 ms 13256 KB Output is correct
125 Correct 2 ms 8540 KB Output is correct
126 Correct 2 ms 10588 KB Output is correct
127 Correct 2 ms 8540 KB Output is correct
128 Correct 89 ms 27212 KB Output is correct
129 Correct 80 ms 25792 KB Output is correct
130 Correct 113 ms 30028 KB Output is correct
131 Correct 85 ms 29980 KB Output is correct
132 Correct 65 ms 28280 KB Output is correct
133 Correct 77 ms 28492 KB Output is correct
134 Correct 70 ms 28876 KB Output is correct
135 Correct 98 ms 28024 KB Output is correct
136 Correct 67 ms 28428 KB Output is correct
137 Correct 91 ms 29772 KB Output is correct
138 Correct 126 ms 34124 KB Output is correct
139 Correct 89 ms 29784 KB Output is correct
140 Correct 74 ms 29224 KB Output is correct
141 Correct 19 ms 13528 KB Output is correct
142 Correct 31 ms 16076 KB Output is correct
143 Correct 85 ms 53820 KB Output is correct
144 Correct 154 ms 72440 KB Output is correct
145 Correct 121 ms 72528 KB Output is correct
146 Correct 2 ms 8540 KB Output is correct
147 Correct 2 ms 8644 KB Output is correct
148 Correct 3 ms 12632 KB Output is correct
149 Correct 4 ms 13656 KB Output is correct
150 Correct 4 ms 13660 KB Output is correct
151 Correct 2 ms 8540 KB Output is correct
152 Correct 2 ms 8540 KB Output is correct
153 Correct 21 ms 11220 KB Output is correct
154 Correct 32 ms 13644 KB Output is correct
155 Correct 100 ms 28112 KB Output is correct
156 Correct 92 ms 27748 KB Output is correct
157 Correct 95 ms 29772 KB Output is correct
158 Correct 109 ms 28532 KB Output is correct
159 Correct 68 ms 29776 KB Output is correct
160 Correct 65 ms 29188 KB Output is correct
161 Correct 84 ms 29152 KB Output is correct
162 Correct 64 ms 28044 KB Output is correct
163 Correct 103 ms 31796 KB Output is correct
164 Correct 125 ms 28328 KB Output is correct
165 Correct 72 ms 29512 KB Output is correct
166 Correct 75 ms 29056 KB Output is correct
167 Correct 2 ms 8540 KB Output is correct
168 Correct 28 ms 15584 KB Output is correct
169 Correct 35 ms 16084 KB Output is correct
170 Correct 160 ms 71656 KB Output is correct
171 Correct 138 ms 72532 KB Output is correct
172 Correct 102 ms 72660 KB Output is correct
173 Correct 111 ms 72532 KB Output is correct
174 Correct 111 ms 72516 KB Output is correct
175 Correct 40 ms 13280 KB Output is correct
176 Correct 2 ms 8540 KB Output is correct
177 Correct 115 ms 30540 KB Output is correct
178 Correct 76 ms 26452 KB Output is correct
179 Correct 77 ms 29768 KB Output is correct
180 Correct 88 ms 30752 KB Output is correct
181 Correct 74 ms 30604 KB Output is correct
182 Correct 70 ms 30536 KB Output is correct
183 Correct 92 ms 29772 KB Output is correct
184 Correct 87 ms 30728 KB Output is correct
185 Correct 101 ms 30628 KB Output is correct
186 Correct 95 ms 30048 KB Output is correct
187 Correct 107 ms 31552 KB Output is correct
188 Correct 95 ms 28492 KB Output is correct
189 Correct 108 ms 28936 KB Output is correct
190 Correct 93 ms 32036 KB Output is correct
191 Correct 82 ms 29516 KB Output is correct
192 Correct 106 ms 31416 KB Output is correct
193 Correct 105 ms 31552 KB Output is correct
194 Correct 80 ms 30540 KB Output is correct
195 Correct 29 ms 15816 KB Output is correct
196 Correct 32 ms 16392 KB Output is correct
197 Correct 42 ms 16840 KB Output is correct
198 Correct 35 ms 16868 KB Output is correct
199 Correct 55 ms 38996 KB Output is correct
200 Correct 140 ms 72536 KB Output is correct
201 Correct 103 ms 62324 KB Output is correct
202 Correct 125 ms 72528 KB Output is correct
203 Correct 134 ms 72528 KB Output is correct
204 Correct 128 ms 72396 KB Output is correct
205 Correct 115 ms 67412 KB Output is correct
206 Correct 118 ms 72836 KB Output is correct
207 Correct 109 ms 72528 KB Output is correct
208 Correct 110 ms 72636 KB Output is correct
209 Correct 2 ms 8796 KB Output is correct
210 Correct 3 ms 8796 KB Output is correct
211 Correct 3 ms 8796 KB Output is correct
212 Correct 3 ms 8540 KB Output is correct
213 Correct 3 ms 8792 KB Output is correct
214 Correct 3 ms 8796 KB Output is correct
215 Correct 2 ms 8536 KB Output is correct
216 Correct 2 ms 8648 KB Output is correct
217 Correct 4 ms 9564 KB Output is correct
218 Correct 4 ms 10076 KB Output is correct
219 Correct 3 ms 9820 KB Output is correct
220 Correct 3 ms 9820 KB Output is correct
221 Correct 3 ms 10076 KB Output is correct
222 Correct 4 ms 10072 KB Output is correct
223 Correct 2 ms 8540 KB Output is correct
224 Correct 2 ms 8636 KB Output is correct
225 Correct 2 ms 8028 KB Output is correct
226 Correct 2 ms 8540 KB Output is correct
227 Correct 2 ms 8540 KB Output is correct
228 Correct 2 ms 8536 KB Output is correct
229 Correct 86 ms 26540 KB Output is correct
230 Correct 79 ms 25164 KB Output is correct
231 Correct 134 ms 29692 KB Output is correct
232 Correct 90 ms 28780 KB Output is correct
233 Correct 63 ms 27252 KB Output is correct
234 Correct 74 ms 26828 KB Output is correct
235 Correct 71 ms 27084 KB Output is correct
236 Correct 94 ms 27508 KB Output is correct
237 Correct 65 ms 26604 KB Output is correct
238 Correct 94 ms 29424 KB Output is correct
239 Correct 138 ms 33928 KB Output is correct
240 Correct 78 ms 28892 KB Output is correct
241 Correct 68 ms 27536 KB Output is correct
242 Correct 19 ms 12504 KB Output is correct
243 Correct 32 ms 15712 KB Output is correct
244 Correct 86 ms 52220 KB Output is correct
245 Correct 160 ms 71556 KB Output is correct
246 Correct 125 ms 71528 KB Output is correct
247 Correct 2 ms 8540 KB Output is correct
248 Correct 3 ms 8028 KB Output is correct
249 Correct 3 ms 9176 KB Output is correct
250 Correct 4 ms 10076 KB Output is correct
251 Correct 4 ms 10076 KB Output is correct
252 Correct 4 ms 8536 KB Output is correct
253 Correct 3 ms 8660 KB Output is correct
254 Correct 25 ms 11224 KB Output is correct
255 Correct 34 ms 13740 KB Output is correct
256 Correct 38 ms 13772 KB Output is correct
257 Correct 40 ms 14280 KB Output is correct
258 Correct 41 ms 14524 KB Output is correct
259 Correct 37 ms 14676 KB Output is correct
260 Correct 104 ms 27528 KB Output is correct
261 Correct 96 ms 27212 KB Output is correct
262 Correct 80 ms 28892 KB Output is correct
263 Correct 121 ms 28244 KB Output is correct
264 Correct 81 ms 28748 KB Output is correct
265 Correct 67 ms 27328 KB Output is correct
266 Correct 120 ms 28932 KB Output is correct
267 Correct 62 ms 26228 KB Output is correct
268 Correct 111 ms 31148 KB Output is correct
269 Correct 105 ms 27984 KB Output is correct
270 Correct 67 ms 28888 KB Output is correct
271 Correct 66 ms 27332 KB Output is correct
272 Correct 2 ms 8536 KB Output is correct
273 Correct 29 ms 14952 KB Output is correct
274 Correct 40 ms 15564 KB Output is correct
275 Correct 137 ms 70532 KB Output is correct
276 Correct 143 ms 71508 KB Output is correct
277 Correct 117 ms 71436 KB Output is correct
278 Correct 111 ms 71400 KB Output is correct
279 Correct 121 ms 71480 KB Output is correct
280 Correct 35 ms 13256 KB Output is correct