Submission #396437

#	Time	Username	Problem	Language	Result	Execution time	Memory
396437		AmineWeslati	Meetings 2 (JOI21_meetings2)	C++14	4 / 100	4083 ms	6360 KiB

meetings2

//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e9;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////

int N; 
vi adj[MX],dist(MX);

void dfs(int u, int p){
	for(int v: adj[u]) if(v!=p){
		dist[v]=dist[u]+1;
		dfs(v,u);
	}
}

int main() {
    boost; IO();
    
    cin>>N;
    FOR(i,0,N-1){
    	int u,v; cin>>u>>v;
    	u--; v--;
    	adj[u].pb(v); 
    	adj[v].pb(u);
    }

    vi vec[N+1];

    FOR(m,0,1<<N){
    	int cnt=0;
    	FOR(i,0,N) if((m>>i)&1) cnt++;

    	vpi v;
    	FOR(u,0,N){
    		dist[u]=0;
    		dfs(u,u);

    		int cur=0;
    		FOR(i,0,N) if((m>>i)&1) cur+=dist[i];
    		v.eb(cur,u);
    	}
    	sort(all(v));

    	int ans=0,j=0;
    	vi chosen; 
    	while(j<N && v[j].fi==v[0].fi){
    		j++; 
    		ans++;
    		chosen.pb(v[j].se);
    	}
    	vec[cnt].pb(ans);
    	/*if(cnt==4 && ans==7){
    		FOR(i,0,N) if((m>>i)&1) cout << i+1 << ' '; cout << endl;
    		for(int u: chosen) cout << u+1 << ' '; cout << endl;
    		cout << v[0].fi << endl;
    	}*/
    }

    FOR(i,1,N+1){
    	sort(rall(vec[i]));
    	cout << vec[i][0] << endl;
    }


    return 0;
}
//Change your approach 

• Subtask 1: 4 / 4
• Subtask 2: 0 / 16
• Subtask 3: 0 / 80