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

提出ソース

結果

問題	No.1424 Ultrapalindrome
ユーザー	minato
提出日時	2021-03-13 19:22:25
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	53 ms / 2,000 ms
コード長	5,871 bytes
コンパイル時間	2,374 ms
コンパイル使用メモリ	205,568 KB
実行使用メモリ	11,084 KB
最終ジャッジ日時	2024-04-23 09:43:20
合計ジャッジ時間	4,274 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	43 ms 8,576 KB
testcase_10	AC	45 ms 8,576 KB
testcase_11	AC	29 ms 6,944 KB
testcase_12	AC	42 ms 8,704 KB
testcase_13	AC	10 ms 6,940 KB
testcase_14	AC	32 ms 7,808 KB
testcase_15	AC	2 ms 6,944 KB
testcase_16	AC	23 ms 6,944 KB
testcase_17	AC	32 ms 7,680 KB
testcase_18	AC	18 ms 6,944 KB
testcase_19	AC	32 ms 7,168 KB
testcase_20	AC	8 ms 6,940 KB
testcase_21	AC	25 ms 6,944 KB
testcase_22	AC	15 ms 6,940 KB
testcase_23	AC	4 ms 6,940 KB
testcase_24	AC	7 ms 6,944 KB
testcase_25	AC	7 ms 6,944 KB
testcase_26	AC	36 ms 7,808 KB
testcase_27	AC	53 ms 10,880 KB
testcase_28	AC	34 ms 9,472 KB
testcase_29	AC	33 ms 10,112 KB
testcase_30	AC	29 ms 11,084 KB
testcase_31	AC	32 ms 10,828 KB

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

コンパイルメッセージ

main.cpp: In function 'int main()':
main.cpp:105:25: warning: 'm' may be used uninitialized [-Wmaybe-uninitialized]
  105 |     auto dist2 = bfs(G,m);
      |                         ^
main.cpp:97:9: note: 'm' was declared here
   97 |     int m;
      |         ^

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vector<T>>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
constexpr char ln = '\n';
template <class Container> inline int SZ(const Container& v) { return int(v.size()); }
template <class T> inline void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); }
template <class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; }
template <class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; }
inline int topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); }
inline int botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); }
inline int popcount(ull x) { return __builtin_popcountll(x); }
inline int kthbit(ull x, int k) { return (x >> k) & 1; }
inline constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x - 1) * 10; }
const string YESNO[2] = {"NO", "YES"};
const string YesNo[2] = {"No", "Yes"};
inline void YES(bool t = true) { cout << YESNO[t] << "\n"; }
inline void Yes(bool t = true) { cout << YesNo[t] << "\n"; }
template <class T> inline void drop(T x) { cout << x << "\n"; exit(0); }
inline void print() { cout << "\n"; }
template <class T> inline void print(const vector<T>& v) { for (auto it = v.begin(); it != v.end(); ++it) { if (it != v.begin()) { cout << " "; } cout << *it; } print(); }
template <class T, class... Args> inline void print(const T& x, const Args& ... args) { cout << x << " "; print(args...); }
#ifdef MINATO_LOCAL
template <class T1, class T2> ostream& operator<<(ostream& os, pair<T1, T2> p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <size_t N, class TUPLE> void debug_tuple(ostream& os, TUPLE _) { (void)os; (void)_; }
template <size_t N, class TUPLE, class T, class ...Args> void debug_tuple(ostream &os, TUPLE t) { os << (N == 0 ? "" : ", ") << get<N>(t); debug_tuple<N + 1, TUPLE, Args...>(os, t); }
template <class ...Args> ostream& operator<<(ostream& os, tuple<Args...> t) { os << "("; debug_tuple<0, tuple<Args...>, Args...>(os, t); return os << ")"; }
string debug_delim(int& i) { return i++ == 0 ? "" : ", "; }
#define debug_embrace(x) { int i = 0; os << "{";  { x } return os << "}"; }
template <class T> ostream& operator<<(ostream& os, vector<T> v) { debug_embrace( for (T e : v) { os << debug_delim(i) << e; } ) }
template <class T, size_t N> ostream& operator<<(ostream& os, array<T, N> a) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) }
template <class T, size_t N> enable_if_t<!is_same_v<char, remove_cv_t<T>>, ostream>& operator<<(ostream& os, T(&a)[N]) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) }
template <class Key> ostream& operator<<(ostream& os, set<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) }
template <class Key, class T> ostream& operator<<(ostream& os, map<Key, T> mp) { debug_embrace( for (auto e : mp) { os << debug_delim(i) << e; }) }
template <class Key> ostream& operator<<(ostream& os, multiset<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) }
template <class T> ostream& operator<<(ostream& os, queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.front(); } ) }
template <class T> ostream& operator<<(ostream& os, deque<T> q) { debug_embrace( for (T e : q) { os << debug_delim(i) << e; } ) }
template <class T> ostream& operator<<(ostream& os, priority_queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) }
template <class T> ostream& operator<<(ostream& os, priority_queue<T, vector<T>, greater<T>> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) }
void debug_out() { cerr << endl; }
template <class T, class... Args> void debug_out(const T& x, const Args& ... args) { cerr << " " << x; debug_out(args...); }
#define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif
struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); cerr << fixed << setprecision(7); }; } fast_ios_;
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

vector<int> bfs(const vector<vector<int>>& G, int s = 0) {
    vector<int> ret(G.size(), -1);
    ret[s] = 0;
    queue<int> que;
    que.emplace(s);
    while (!que.empty()) {
        int v = que.front(); que.pop();
        for (int nv : G[v]) {
            if (~ret[nv]) continue;
            ret[nv] = ret[v] + 1;
            que.emplace(nv);
        }
    }
    return ret;
}

int main() {
    int N; cin >> N;
    vec<int> deg(N);
    vvec<int> G(N);
    rep(i,N-1) {
        int a,b; cin >> a >> b;
        a--; b--;
        G[a].emplace_back(b);
        G[b].emplace_back(a);
        deg[a]++;
        deg[b]++;
    }

    vec<int> ls;
    rep(i,N) {
        if (deg[i]==1) ls.emplace_back(i);
    }

    auto dist = bfs(G,ls[0]);
    int D = *max_element(all(dist));
    if (D&1) {
        Yes(SZ(ls)==2);
        return 0;
    }
    int m;
    rep(i,N) {
        if (D/2==dist[i]) {
            m = i;
            break;
        }
    }

    auto dist2 = bfs(G,m);
    rep(i,N) {
        if (i==m) continue;
        if (deg[i]==1) {
            if (dist2[i]!=D/2) drop("No");
        } else {
            if (deg[i]!=2) drop("No");
        }
    }
    Yes(1);
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード