#960471 (C++17) No.2677 Minmax Independent Set

• 問題: No.2677 Minmax Independent Set
• ユーザー: akua
• 提出日時: 2024-03-15 22:22:25
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 291 ms / 2,000 ms
• コード長: 5,203 bytes
• コンパイル時間: 1,705 ms
• コンパイル使用メモリ: 143,576 KB
• 実行使用メモリ: 57,872 KB
• 最終ジャッジ日時: 2024-03-15 22:22:37
• 合計ジャッジ時間: 11,580 ms
• ジャッジサーバーID （参考情報）: judge10 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,676 KB
testcase_01	AC	2 ms; 6,676 KB
testcase_02	AC	2 ms; 6,676 KB
testcase_03	AC	2 ms; 6,676 KB
testcase_04	AC	2 ms; 6,676 KB
testcase_05	AC	234 ms; 38,288 KB
testcase_06	AC	245 ms; 38,544 KB
testcase_07	AC	234 ms; 38,672 KB
testcase_08	AC	239 ms; 39,312 KB
testcase_09	AC	238 ms; 40,208 KB
testcase_10	AC	198 ms; 36,812 KB
testcase_11	AC	204 ms; 36,812 KB
testcase_12	AC	231 ms; 57,872 KB
testcase_13	AC	266 ms; 43,828 KB
testcase_14	AC	252 ms; 43,800 KB
testcase_15	AC	283 ms; 48,400 KB
testcase_16	AC	291 ms; 36,204 KB
testcase_17	AC	260 ms; 36,204 KB
testcase_18	AC	157 ms; 24,288 KB
testcase_19	AC	192 ms; 28,124 KB
testcase_20	AC	48 ms; 12,032 KB
testcase_21	AC	215 ms; 30,780 KB
testcase_22	AC	12 ms; 6,676 KB
testcase_23	AC	2 ms; 6,676 KB
testcase_24	AC	2 ms; 6,676 KB
testcase_25	AC	2 ms; 6,676 KB
testcase_26	AC	2 ms; 6,676 KB
testcase_27	AC	3 ms; 6,676 KB
testcase_28	AC	211 ms; 36,892 KB
testcase_29	AC	255 ms; 49,888 KB
testcase_30	AC	2 ms; 6,676 KB
testcase_31	AC	2 ms; 6,676 KB
testcase_32	AC	2 ms; 6,676 KB
testcase_33	AC	2 ms; 6,676 KB
testcase_34	AC	2 ms; 6,676 KB
testcase_35	AC	2 ms; 6,676 KB
testcase_36	AC	2 ms; 6,676 KB
testcase_37	AC	2 ms; 6,676 KB
testcase_38	AC	2 ms; 6,676 KB
testcase_39	AC	3 ms; 6,676 KB
testcase_40	AC	4 ms; 6,676 KB
testcase_41	AC	5 ms; 6,676 KB
testcase_42	AC	9 ms; 6,676 KB
testcase_43	AC	18 ms; 7,296 KB
testcase_44	AC	42 ms; 11,392 KB
testcase_45	AC	112 ms; 19,456 KB
testcase_46	AC	250 ms; 35,656 KB
testcase_47	AC	261 ms; 36,172 KB
testcase_48	AC	250 ms; 36,172 KB
testcase_49	AC	250 ms; 36,296 KB
testcase_50	AC	57 ms; 15,956 KB
testcase_51	AC	5 ms; 6,676 KB
testcase_52	AC	163 ms; 31,124 KB
testcase_53	AC	148 ms; 28,856 KB
testcase_54	AC	4 ms; 6,676 KB
testcase_55	AC	234 ms; 36,836 KB
testcase_56	AC	213 ms; 36,840 KB
testcase_57	AC	224 ms; 36,820 KB
testcase_58	AC	221 ms; 36,924 KB
testcase_59	AC	218 ms; 36,916 KB
testcase_60	AC	99 ms; 36,220 KB
testcase_61	AC	104 ms; 36,404 KB
testcase_62	AC	105 ms; 40,464 KB
testcase_63	AC	110 ms; 47,512 KB

ソースコード

#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque #include <unordered_map> // unordered_map #include <unordered_set> // unordered_set #include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <iomanip>
#include <functional>
#include<unordered_map>
#include <random>
#include<bitset>
#include<cassert>
using namespace std;  
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
//#define endl '\n'
#define all(x) (x).begin(),(x).end()
#define arr(x) (x).rbegin(),(x).rend()
typedef long long ll;
typedef unsigned long long ull;
const ll inf=1e18;  
using graph = vector<vector<int> > ;
using vi=vector<int>;
using P= pair<ll,ll>;  
using vvi=vector<vi>;
using vll=vector<ll>; 
using vvll=vector<vll>;
using vp=vector<P>;
using vvp=vector<vp>;
using vd=vector<double>;
using vvd =vector<vd>;
//using vs=vector<string>;
//string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
//string S="abcdefghijklmnopqrstuvwxyz";
//g++ main.cpp -std=c++17 -I .  
//cout <<setprecision(20);
//cout << fixed << setprecision(10);
//cin.tie(0); ios::sync_with_stdio(false);

const double PI = acos(-1);
int vx[]={0,1,0,-1,-1,1,1,-1},vy[]={1,0,-1,0,1,1,-1,-1};
void putsYes(bool f){cout << (f?"Yes":"No") << endl;}
void putsYES(bool f){cout << (f?"YES":"NO") << endl;}
void putsFirst(bool f){cout << (f?"First":"Second") << endl;}
void debug(int test){cout << "TEST" << " " << test << endl;}
ll pow_pow(ll x,ll n,ll mod){
    if(n==0) return 1; 
    x%=mod;
    ll res=pow_pow(x*x%mod,n/2,mod);
    if(n&1)res=res*x%mod;
    return res;
}
ll gcdll(ll x,ll y){
    if(y==0)return x;
    return gcdll(y,x%y);
}
//ll INFF=1000100100100100100;
ll lcmll(ll x,ll y){
    ll X=(x/gcdll(x,y)),Y=y;
    return X*Y;
}
template<class T> bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    else return false;
}
template<class T> bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    else return false;
}
struct edge{
  int to; ll cost; 
  edge(int to,ll cost) : to(to),cost(cost){}
};
using ve=vector<edge>;
using vve=vector<ve>;
struct UnionFind { 
    vector<int> par, siz;
    UnionFind(int n) : par(n, -1) , siz(n, 1) { } 
    int root(int x) { 
        if (par[x] == -1) return x;
        else return par[x] = root(par[x]);
    }
    bool issame(int x, int y) {
        return root(x) == root(y);
    }
    bool unite(int x, int y) {
        x = root(x), y = root(y);
        if (x == y) return false; 
        if (siz[x] < siz[y]) swap(x, y);
        par[y] = x;
        siz[x] += siz[y];
        return true;
    }
    int size(int x) {
        return siz[root(x)];
    }
};
struct Compress{
   vll a;
   map<ll,ll> d,d2;
   int cnt;
   Compress() :cnt(0) {}
   void add(ll x){a.push_back(x);}
   void init(){
     set<ll>s(a.begin(),a.end());
     for(auto y:s)d[y]=cnt++;
     for(auto&y:a)y=d[y];
     for(auto u:d)d2[u.second]=u.first;
   }
   ll to(ll x){return d[x];} //変換先
   ll from(ll x){return d2[x];}//逆引き
   int size(){return cnt;}
};
vll anss;
void solve(int test){
    int n; cin >> n;
    vvi g(n);
    rep(i,n-1){
        int a,b; cin >> a >> b;a--;b--;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    vvll dp(n,vll(2,inf)),dp2(n,vll(2,-inf));
    auto dfs=[&](auto dfs,int v,int p=-1)->void{
        dp[v][0]=0;
        dp[v][1]=1;
        for(auto u:g[v]){
            if(u==p)continue;
            dfs(dfs,u,v);
            ll x=dp[v][1]+dp[u][0];
            ll y=dp[v][0]+dp[u][0];
            ll z=dp[v][0]+dp[u][1];
            chmax(dp[v][1],x);
            chmax(dp[v][0],y);
            chmax(dp[v][0],z);
        }
    };
    dfs(dfs,0,-1);
    dp2[0][0]=0;
    dp2[0][1]=1;
    ll ans=dp[0][1];
    auto dfs2=[&](auto dfs2,int v,int p=-1)->void{
        ll one=dp2[v][1];
        ll zero=dp2[v][0];
        for(auto u:g[v]){
            if(u==p)continue;
            zero+=max(dp[u][0],dp[u][1]);
            one+=dp[u][0];
        }
        for(auto u:g[v]){
            if(u==p)continue;
            chmax(dp2[u][0],one-dp[u][0]);
            chmax(dp2[u][0],zero-max(dp[u][0],dp[u][1]));
            chmax(dp2[u][1],zero-max(dp[u][0],dp[u][1])+1);
            chmin(ans,dp2[u][1]+dp[u][1]-1);
            dfs2(dfs2,u,v);
        }
    };
    dfs2(dfs2,0,-1);
   // rep(i,n)cout<< dp2[i][1]+dp[i][1]-1<< endl;
    cout << ans << endl;
}
//g++ cf.cpp -std=c++17 -I .
int main(){cin.tie(0);ios::sync_with_stdio(false);
    int t=1;//cin >>t;
    rep(test,t)solve(test);
    for(auto u:anss){
        cout << u << endl;
    }
}