# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14253 | dohyun0324 | Company Planning (TOKI14_company) | C++98 | 161 ms | 13112 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
vector<int>con[100010];
int ch[100010],maxi,arr[100010],t,n,m,par[100010],d[100010],num[100010];
void dfs(int x,int k)
{
int i;
for(i=0;i<con[x].size();i++){
dfs(con[x][i],k);
}
t=0; d[x]=0;
for(i=0;i<con[x].size();i++){
arr[++t]=d[con[x][i]]-num[con[x][i]];
d[x]+=num[con[x][i]];
}
sort(arr+1,arr+t+1);
for(i=1;i<=min(k,t);i++) d[x]+=arr[i];
}
int pro(int x){
dfs(1,x);
return n-d[1];
}
void bsearch()
{
int st=1,en=n,mid;
while(st!=en){
mid=(st+en)/2;
if(pro(mid)>=m) en=mid;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |