#include "roads.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
const int MAXN = 2e5+5;
vii g1(MAXN),g2(MAXN);
vector<int>par(MAXN),szz(MAXN,1),act(MAXN);
vector<ll>ans;
int find(int x){
if(x == par[x])return x;
else return par[x] = find(par[x]);
}
void unite(int a,int b){
a = find(a);
b = find(b);
if(a==b)return;
if(szz[a] > szz[b])swap(a,b);
par[a] = b;
szz[b]+=szz[a];
}
int dfs(int v,int u,int k){
int need = sz(g1[v])-k;
for(int x:g2[v]){
if(x != u){
int res = dfs(x,v,k);
need-=res;
ans[k]+=res;
}
}
if(need && u != -1){
need--;
ans[k]+=max(0,need);
return 1;
}
else{
ans[k]+=max(0,need);
return 0;
}
}
vector<ll> minimum_closure_costs(int n, vector<int> u,vector<int>v,vector<int>w){
bool sub4 = 1;
ans.resize(n);
for(int i=0;i<n-1;i++){
g1[u[i]].pb(v[i]);
g1[v[i]].pb(u[i]);
if(w[i]!=1)sub4 = 0;
}
if(sub4){
vector<int>c(n);
for(int i=0;i<n;i++){c[i] = i;par[i] = i;}
sort(all(c),[&](int x,int y){return sz(g1[x]) > sz(g1[y]);});
//for(int x:c)cout<<x<<" ";
//cout<<'\n';
int ptr = -1;
vector<int>vis(n);
for(int i=n-1;i>=0;i--){
while(ptr+1<n && sz(g1[c[ptr+1]]) > i){
ptr++;
int d = c[ptr];
act[d] = 1;
for(int x:g1[d]){
if(act[x]){
g2[x].pb(d);
g2[d].pb(x);
unite(x,d);
}
}
}
vector<int>meet;
for(int j=0;j<=ptr;j++){
int a = find(c[j]);
if(vis[a])continue;
else{
meet.pb(a);
dfs(a,-1,i);
vis[a] = 1;
}
}
for(int x:meet)vis[x] = 0;
}
}
return ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
9 ms |
11980 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
8 ms |
12052 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
8 ms |
12012 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
8 ms |
12012 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
216 ms |
23256 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
216 ms |
23256 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
9 ms |
11980 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
