| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1138903 | ozner77 | Triumphal arch (POI13_luk) | Pypy 3 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef map<int,int> mii;
typedef map<ll,ll> mll;
bool construir(ll x,ll n,vector<ll> pisos){
for(ll dia=0;dia<n;dia++){
if(pisos[dia]!=0){
return false;
}
ll teams=x;
ll xd=1;
while(teams!=0){
if(pisos[dia+xd]==0){
teams=0;
}else{
if(teams>pisos[dia+xd]){
teams-=pisos[dia+xd];
pisos[dia+xd]=0;
}else{
pisos[dia+xd]-=teams;
teams=0;
}
}
xd++;
}
}
return true;
}
int main(){
ll n;
cin>>n;
vector<ll> pisos(n,0);
vector<vector<ll>> adj(n);
vector<bool> visitado(n,false);
for(int i=0;i<n-1;i++){
ll a,b;
cin >> a >> b;
a--;
b--;
adj[a].pb(b);
adj[b].pb(a);
}
queue<pll> q;
q.push(mp(0,0));
while(!q.empty()){
ll nodo=q.front().f;
ll piso=q.front().s;
q.pop();
visitado[nodo]=true;
pisos[piso]++;
for(auto x:adj[nodo]){
if(!visitado[x]){
q.push(mp(x,piso+1));
}
}
}
pisos[0]=0;
ll l=0;
ll r=n;
while(l<r){
ll m=(l+r)/2;
if(construir(m,n,pisos)){
r=m;
}else{
l=m+1;
}
}
cout<<l<<"\n";
}