F. Power Sockets SOLUTION Code Forces

F. Power Sockets SOLUTION CodeForces

Educational Codeforces Round 101 (Rated for Div. 2)

// We decided to drop the legend about the power sockets but feel free to come up with your own :^)
Define a chain:
a chain of length 1 is a single vertex;
a chain of length x is a chain of length x−1 with a new vertex connected to the end of it with a single edge.
You are given n chains of lengths l1,l2,…,ln. You plan to build a tree using some of them.
Each vertex of the tree is either white or black.
The tree initially only has a white root vertex.
All chains initially consist only of white vertices.
You can take one of the chains and connect any of its vertices to any white vertex of the tree with an edge. The chain becomes part of the tree. Both endpoints of this edge become black.
Each chain can be used no more than once.
Some chains can be left unused.
The distance between two vertices of the tree is the number of edges on the shortest path between them.
If there is at least k white vertices in the resulting tree, then the value of the tree is the distance between the root and the k-th closest white vertex.
What’s the minimum value of the tree you can obtain? If there is no way to build a tree with at least k white vertices, then print -1.
The first line contains two integers n and k (1≤n≤2⋅105, 2≤k≤109) — the number of chains and the minimum number of white vertices a tree should have to have a value.
The second line contains n integers l1,l2,…,ln (3≤li≤2⋅105) — the lengths of the chains.
Print a single integer. If there is no way to build a tree with at least k white vertices, then print -1. Otherwise, print the minimum value the tree can have.
1 2
3 3
4 3 3
3 5
4 3 4
2 10
5 7
You are allowed to not use all the chains, so it’s optimal to only use chain of length 4 in the second example.
using namespace std;
#define pb push_back
#define pii pair<int, int>
const int maxi = 1e6 + 10;
vector<int> v[maxi];
int a[maxi], b[maxi];
string s;
int n;
int  k;
int check(long long x)
   long long cur = 1;
   priority_queue<pii> st;
   for (int i = 1;i<=n;i++)
    b[i] = a[i];
   st.push({0, 1});
   for (int i = 1;i<=n && st.size();i++)
       pii node = st.top();
       int len = -node.first;
       int ostalo = node.second – 1;
       if (ostalo){
        st.push({-(len+1), ostalo});
       if (len <= x) cur–;
       pii nd1 = {-(len + 2), b[i]/2};
       int doprinos1 = max(0ll, min(x – len-1, 1ll*b[i]/2));
       pii nd2 = {-(len + 2), b[i] – b[i]/2};
       int doprinos2 = max(0ll, min(x – len-1, 1ll*b[i] – b[i]/2));
       cur+=doprinos1 + doprinos2;
       if (cur >= k) return 1;
   return 0;
void solve()
   for (int i = 1;i<=n;i++)
   sort(a+1, a+n+1);
   reverse(a+1, a+n+1);
   long long sum = 0;
   for (int i = 1;i<=n;i++)
   if (sum < k) {
   long long lo = 0;
   long long ro = 1e12;
   while(lo < ro – 1)
       long long mid = (lo + ro ) / 2;
       if (check(mid)) ro = mid; else lo = mid;
int main()
   int t;
   t = 1;

Leave a Comment

16 − two =