#628124 (C++17) No.1424 Ultrapalindrome

提出ソース

結果

問題	No.1424 Ultrapalindrome
ユーザー	👑 tute7627
提出日時	2021-03-12 21:33:14
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	56 ms / 2,000 ms
コード長	5,758 bytes
コンパイル時間	2,507 ms
コンパイル使用メモリ	208,248 KB
実行使用メモリ	13,696 KB
最終ジャッジ日時	2024-04-22 16:59:25
合計ジャッジ時間	4,283 ms
ジャッジサーバーID （参考情報）	judge5 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	2 ms 5,376 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	AC	51 ms 8,832 KB
testcase_10	AC	52 ms 8,832 KB
testcase_11	AC	34 ms 7,168 KB
testcase_12	AC	48 ms 8,448 KB
testcase_13	AC	12 ms 5,376 KB
testcase_14	AC	36 ms 7,552 KB
testcase_15	AC	2 ms 5,376 KB
testcase_16	AC	29 ms 6,656 KB
testcase_17	AC	34 ms 7,296 KB
testcase_18	AC	19 ms 5,888 KB
testcase_19	AC	37 ms 6,784 KB
testcase_20	AC	9 ms 5,376 KB
testcase_21	AC	31 ms 6,144 KB
testcase_22	AC	18 ms 5,376 KB
testcase_23	AC	4 ms 5,376 KB
testcase_24	AC	8 ms 5,376 KB
testcase_25	AC	7 ms 5,376 KB
testcase_26	AC	47 ms 7,424 KB
testcase_27	AC	56 ms 9,960 KB
testcase_28	AC	40 ms 13,696 KB
testcase_29	AC	40 ms 13,696 KB
testcase_30	AC	31 ms 10,508 KB
testcase_31	AC	35 ms 10,508 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T> using PQ = priority_queue<T>;
template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>void debug(T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};
template<typename T>void debug(T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
template<typename T>void rearrange(vector<int>&ord, vector<T>&v){
  auto tmp = v;
  for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){
  rearrange(ord, head);
  rearrange(ord, tail...);
}
template<typename T> vector<int> ascend(const vector<T>&v){
  vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
  sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});
  return ord;
}
template<typename T> vector<int> descend(const vector<T>&v){
  vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
  sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});
  return ord;
}
ll FLOOR(ll n,ll div){return n>=0?n/div:(n-div+1)/div;}
ll CEIL(ll n,ll div){return n>=0?(n+div-1)/div:n/div;}
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};
template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};
template< typename T = int >
struct edge {
  int to;
  T cost;
  int id;
  edge() = default;
  edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}
  operator int() const { return to; }
};

template<typename T>
using Graph = vector<vector<edge<T>>>;
template<typename T>
Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){
  Graph<T> ret(n);
  for(int es = 0; es < m; es++){
    int u,v,w=1;
    cin>>u>>v;u-=indexed,v-=indexed;
    if(weighted)cin>>w;
    ret[u].emplace_back(v,w,es);
    if(!directed)ret[v].emplace_back(u,w,es);
  }
  return ret;
}
template<typename T>
Graph<T> readParent(int n,int indexed=1,bool directed=true){
  Graph<T>ret(n);
  for(int i=1;i<n;i++){
    int p;cin>>p;
    p-=indexed;
    ret[p].emplace_back(i);
    if(!directed)ret[i].emplace_back(p);
  }
  return ret;
}
template<typename T>
struct Diameter{
  vector<long long>_dep;
  vector<int>ret;
  int n, root, end;
  long long diam;
  Graph<T> &g;
  Diameter(Graph<T>&G):g(G),n(G.size()){
    _dep.assign(n,-1LL);
    dfs(0,0);
    root = max_element(_dep.begin(),_dep.end()) - _dep.begin();
    fill(_dep.begin(),_dep.end(),-1LL);
    dfs(root,0);
    end = max_element(_dep.begin(),_dep.end()) - _dep.begin();
    diam = _dep[end];
  }
  void dfs(int k, long long d){
    _dep[k] = d;
    for(auto e:g[k]){
      if(_dep[e.to]==-1)dfs(e.to,d+e.cost);
    }
  }
  vector<int>diam_path(){
    vector<int>tmp;
    dfs2(root,-1,tmp);
    return ret;
  }
  void dfs2(int k, int par,vector<int>&v){
    v.push_back(k);
    if(k==end)ret=v;
    for(auto e:g[k]){
      if(par!=e.to)dfs2(e.to,k,v);
    }
    v.pop_back();
  }
};
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n;cin>>n;
  auto g=readGraph<int>(n,n-1);
  Diameter diam(g);
  ll dia=diam.diam;
  ll r=diam.root;
  auto dfs=[&](auto &&f,ll k,ll par,ll d)->void{
    if(g[k].size()==1&&d%dia!=0)judge=false;
    if(g[k].size()>2&&2*d!=dia)judge=false;
    for(auto to:g[k]){
      if(to==par)continue;
      f(f,to,k,d+1);
    }
  };
  dfs(dfs,r,-1,0);
  ans1(judge);
  return 0;
}

yukicoder

結果

テストケース

ソースコード