#1013181 (C++23) No.1424 Ultrapalindrome

• 問題: No.1424 Ultrapalindrome
• ユーザー: t9unkubj
• 提出日時: 2024-09-24 16:43:16
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 43 ms / 2,000 ms
• コード長: 7,615 bytes
• コンパイル時間: 3,815 ms
• コンパイル使用メモリ: 272,980 KB
• 実行使用メモリ: 20,672 KB
• 最終ジャッジ日時: 2024-09-24 16:43:23
• 合計ジャッジ時間: 5,482 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,812 KB
testcase_01	AC	2 ms; 6,816 KB
testcase_02	AC	2 ms; 6,948 KB
testcase_03	AC	2 ms; 6,944 KB
testcase_04	AC	2 ms; 6,944 KB
testcase_05	AC	1 ms; 6,944 KB
testcase_06	AC	2 ms; 6,940 KB
testcase_07	AC	2 ms; 6,940 KB
testcase_08	AC	2 ms; 6,944 KB
testcase_09	AC	33 ms; 8,192 KB
testcase_10	AC	32 ms; 8,320 KB
testcase_11	AC	23 ms; 6,948 KB
testcase_12	AC	30 ms; 7,808 KB
testcase_13	AC	9 ms; 6,944 KB
testcase_14	AC	25 ms; 7,168 KB
testcase_15	AC	2 ms; 6,940 KB
testcase_16	AC	21 ms; 6,940 KB
testcase_17	AC	36 ms; 7,040 KB
testcase_18	AC	17 ms; 6,944 KB
testcase_19	AC	27 ms; 6,940 KB
testcase_20	AC	7 ms; 6,940 KB
testcase_21	AC	23 ms; 6,940 KB
testcase_22	AC	14 ms; 6,940 KB
testcase_23	AC	3 ms; 6,940 KB
testcase_24	AC	6 ms; 6,944 KB
testcase_25	AC	6 ms; 6,940 KB
testcase_26	AC	32 ms; 7,296 KB
testcase_27	AC	39 ms; 9,728 KB
testcase_28	AC	30 ms; 8,832 KB
testcase_29	AC	43 ms; 20,672 KB
testcase_30	AC	27 ms; 10,188 KB
testcase_31	AC	31 ms; 10,060 KB

コンパイルメッセージ

main.cpp: In function 'void solve()':
main.cpp:260:13: warning: 'md' may be used uninitialized [-Wmaybe-uninitialized]
  260 |         int md;
      |             ^~

ソースコード

#ifdef t9unkubj
#include"template.h"
//#include"template_no_debug.h"
#else
#undef _GLIBCXX_DEBUG
#pragma GCC optimize("O3")
#define dbg(...) 199958
using namespace std;
#include<bits/stdc++.h>
using uint=unsigned;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<class T>using vc=vector<T>;
template<class T>using vvc=vc<vc<T>>;
template<class T>using vvvc=vvc<vc<T>>;
using vi=vc<int>;
using vvi=vc<vi>;
using vvvi=vc<vvi>;
using vl=vc<ll>;
using vvl=vc<vl>;
using vvvl=vc<vvl>;
template<class T>using smpq=priority_queue<T,vector<T>,greater<T>>;
template<class T>using bipq=priority_queue<T>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,j,n) for(ll i=(j);i<(ll)(n);i++)
#define DREP(i,n,m) for(ll i=(n);i>=(m);i--)
#define drep(i,n) for(ll i=((n)-1);i>=0;i--)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define is insert
#define bg begin()
#define ed end()
void scan(int&a) { cin >> a; }
void scan(ll&a) { cin >> a; }
void scan(string&a) { cin >> a; }
void scan(char&a) { cin >> a; }
void scan(uint&a) { cin >> a; }
void scan(ull&a) { cin >> a; }
void scan(bool&a) { cin >> a; }
void scan(ld&a){ cin>> a;}
template<class T> void scan(vector<T>&a) { for(auto&x:a) scan(x); }
void read() {}
template<class Head, class... Tail> void read(Head&head, Tail&... tail) { scan(head); read(tail...); }
#define INT(...) int __VA_ARGS__; read(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; read(__VA_ARGS__);
#define ULL(...) ull __VA_ARGS__; read(__VA_ARGS__);
#define STR(...) string __VA_ARGS__; read(__VA_ARGS__);
#define CHR(...) char __VA_ARGS__; read(__VA_ARGS__);
#define DBL(...) double __VA_ARGS__; read(__VA_ARGS__);
#define LD(...) ld __VA_ARGS__; read(__VA_ARGS__);
#define VC(type, name, ...) vector<type> name(__VA_ARGS__); read(name);
#define VVC(type, name, size, ...) vector<vector<type>> name(size, vector<type>(__VA_ARGS__)); read(name);
void print(int a) { cout << a; }
void print(ll a) { cout << a; }
void print(string a) { cout << a; }
void print(char a) { cout << a; }
void print(uint a) { cout << a; }
void print(bool a) { cout << a; }
void print(ull a) { cout << a; }
void print(double a) { cout << a; }
void print(ld a){ cout<< a; }
template<class T> void print(vector<T>a) { for(int i=0;i<(int)a.size();i++){if(i)cout<<" ";print(a[i]);}cout<<endl;}
void PRT() { cout <<endl; return ; }
template<class T> void PRT(T a) { print(a); cout <<endl; return; }
template<class Head, class... Tail> void PRT(Head head, Tail ... tail) { print(head); cout << " "; PRT(tail...); return; }
template<class T,class F>
bool chmin(T &x, F y){
    if(x>y){
        x=y;
        return true;
    }
    return false;
}
template<class T, class F>
bool chmax(T &x, F y){
    if(x<y){
        x=y;
        return true;
    }
    return false;
}
void YesNo(bool b){
    cout<<(b?"Yes":"No")<<endl;
}
void Yes(){
    cout<<"Yes"<<endl;
}
void No(){
    cout<<"No"<<endl;
}
template<class T>
int popcount(T n){
    return __builtin_popcountll(n);
}
template<class T>
T sum(vc<T>&a){
    return accumulate(all(a),T(0));
}
template<class T>
T max(vc<T>&a){
    return *max_element(all(a));
}
template<class T>
T min(vc<T>&a){
    return *min_element(all(a));
}
template<class T>
void unique(vc<T>&a){
    a.erase(unique(all(a)),a.end());
}
vvi readgraph(int n,int m,int off = -1){
    vvi g(n);
    rep(i, m){
        int u,v;
        cin>>u>>v;
        u+=off,v+=off;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    return g;
}
vvi readtree(int n,int off=-1){
    return readgraph(n,n-1,off);
}
template<class T>
vc<T> presum(vc<T> &a){
    vc<T> ret(a.size()+1);
    rep(i,a.size())ret[i+1]=ret[i]+a[i];
    return ret;
}
template<class T, class F>
vc<T> &operator+=(vc<T> &a,F b){
    for (auto&v:a)v += b;
    return a;
}
template<class T, class F>
vc<T> &operator-=(vc<T>&a,F b){
    for (auto&v:a)v-=b;
    return a;
}
template<class T, class F>
vc<T> &operator*=(vc<T>&a,F b){
    for (auto&v:a)v*=b;
    return a;
}
#endif
#include<vector>
#include<cassert>
#include<algorithm>
struct HLD{
	int n;
    std::vector<int>depth,head,siz_,par,in,out;
    std::vector<std::vector<int>>g,c;
    HLD(int n):n(n),depth(n),head(n),siz_(n,1),in(n),out(n),g(n),c(n){}
    HLD(int n,std::vector<std::vector<int>>g):n(n),depth(n),head(n),siz_(n,1),in(n),out(n),g(g),c(n){}
    void add_edge(int u,int v,bool d=0){
        g[u].emplace_back(v);
		if(d)g[v].emplace_back(u);
    }
    void init_dfs1(int now,int pre){
        for(int &x:g[now]){
			if(x==pre)continue;
			c[now].emplace_back(x);
            depth[x]=depth[now]+1;
            par[x]=now;
            init_dfs1(x,now);
            siz_[now]+=siz_[x];
        }
    }
    void init_dfs2(int now,int pre,int&order){
		in[now]=order++;
        for(int i=0;i<(int)c[now].size();i++){
            if(siz_[c[now][0]]<siz_[c[now][i]])std::swap(c[now][0],c[now][i]);
        }
        for(int x:c[now]){
            if(x==c[now][0])head[x]=head[now];
            else head[x]=x;
            init_dfs2(x,now,order);
        }
		out[now]=order++;
    }
    void init(int root=0){//rootからの有向辺にになることに注意
		par=head=std::vector<int>(n,root);
        int order{};
        init_dfs1(root,-1);
        init_dfs2(root,-1,order);
    }
    int lca(int u,int v){//O(logN) u,vのlcaを取得する
        if(head[u]==head[v])return (depth[u]>depth[v]?v:u);
        if(depth[head[u]]>depth[head[v]])std::swap(u,v);
        v=par[head[v]];
        return lca(u,v);
    }
    int f1(int a){//入った時間を返すO(1)
        return in[a];
    }
    int f2(int a){//出た時間を返すO(1)
        return out[a];
    }
    int dis(int u,int v){//uとvの最短距離を求めるO(logN)
        assert(0<=u&&u<n);
        assert(0<=v&&v<n);
        return depth[u]+depth[v]-2*depth[lca(u,v)];
    }
    template<class T,class G>
    void set(int u,T&seg,G x){
        seg.set(f1(u),x);
    }
    template<class T,class G>
    G prod(int u,int v,bool edge,T&seg){//[u,v]の演算結果を取得する,G>ret T>seg木　O(log^2N)
        G sml=seg.e,smr=seg.e;
        while(1){
            if(in[u]>in[v])swap(u,v),swap(sml,smr);
            if(head[u]==head[v])break;
            smr=seg.op(smr,seg.prod(in[head[v]],in[v]+1));
            v=par[head[v]];
        }
        return seg.op(sml,seg.op(smr,seg.prod(in[u]+edge,in[v]+1)));
    }
};
double pass_time=0;
void solve(){
    INT(n);
    auto g=readtree(n);
    vi lef;
    rep(i,n)if(g[i].size()==1)lef.pb(i);
    if(lef.size()==2)return Yes();
    int mid;
    function<void(int,int,vi&)>dfs=[&](int u,int v,vi&t){
        if(u==lef[1])mid=t[t.size()/2];
        for(auto&x:g[u]){
            if(x==v)continue;
            t.pb(x);
            dfs(x,u,t);
            t.pop_back();
        }
    };  
    vi k{lef[0]};
    dfs(lef[0],-1,k); 
    set<int>st;
    vi is(n);for(auto&x:lef)is[x]=1;
    function<int(int,int,int)>dfs2=[&](int u,int v,int md){
        int  res=is[u];
        if(is[u])st.is(md);
        for(auto&x:g[u]){
            if(x==v)continue;
            res+=dfs2(x,u,md+1);
        }
        return res;
    }; 
    for(auto&x:g[mid]){
        int md;
        if(dfs2(x,mid,md)>=2)return No();
    }
    if(st.size()==1)return Yes();
    else No();
}
signed main(){
    cin.tie(0)->sync_with_stdio(0);
    pass_time=clock();
    int t=1;
    //cin>>t;
    while(t--)solve();
    pass_time=clock()-pass_time;
    dbg(pass_time/CLOCKS_PER_SEC);
}