提出 a37c4cb7-6ed4-475f-aab4-9ed0f65d2dca

コード

#ifndef INCLUDE_MACRO
#define INCLUDE_MACRO
#include __FILE__

vector<vector<int>> vec;

int solve(int x, vector<int>& seen) {
    seen[x] = true;
    vector<int> ans;
    for (auto i : vec[x]) {
        if (seen[i]) continue;
        if (ans.size() == 2) return INF;
        ans.push_back(solve(i, seen));
    }
    if (ans.size() == 0) return 1;
    if (ans.size() == 1) return ans[0] + 1;
    if (ans.size() == 2) {
        if (ans[0] == ans[1] && ans[0] != 1) return ans[0] + 2;
        else return max(ans[0], ans[1]) + 1;
    }
}

signed main() {
    int n;
    cin >> n;
    vec.resize(n);
    rep(i, n - 1) {
        int u, v;
        cin >> u >> v;
        vec[u - 1].push_back(v - 1);
        vec[v - 1].push_back(u - 1);
    }
    int ans = INF;
    rep(root, n) {
        // i is root
        vector<int> seen(n, false);
        chmin(ans, solve(root, seen));
    }
    if (ans == INF) cout << -1 << endl;
    else cout << ans << endl;
    return 0;
}

#else

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define int long long
#define under(N) std::fixed << std::setprecision(N)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define rep(i, n) for (int i = 0; i < n; i++)
#define orep(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define cy std::cout << "Yes" << std::endl
#define cyre {std::cout << "Yes" << std::endl; return 0;}
#define cn std::cout << "No" << std::endl
#define cnre {std::cout << "No" << std::endl; return 0;}
#define MOD 998244353LL
#define INF (3LL<<60)
#define PI 3.141592653589793238
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
std::vector<int> dx = {1, -1, 0, 0};
std::vector<int> dy = {0, 0, 1, -1};
std::vector<int> dx8 = {1, -1, 0, 0, 1, -1, -1, 1};
std::vector<int> dy8 = {0, 0, 1, -1, 1, -1, 1, -1};
template<class T>
T ipow(T x, T y) {
    T ret = 1;
    while (y > 0) {
        if (y % 2 == 1) {
            ret *= x;
        }
        x *= x;
        y >>= 1;
    }
    return ret;
}
template<class T>
T mod_pow(T x, T y, T mod) {
    T ret = 1;
    while (y > 0) {
        if (y % 2 == 1) {
            ret = ret * x % mod;
        }
        x = x * x % mod;
        y >>= 1;
    }
    return ret;
}
template<class T>
T isqrt(T n) {
    if (n == 0) return 0;
    T rinzi = T(std::sqrt(n)) - 1;
    return rinzi * (rinzi + 2) < n ? rinzi + 1 : rinzi;
}
template<class T>
bool out_glid(T i, T j, T h, T w) {
    if (i < 0 || h <= i || j < 0 || w <= j) return true;
    else return false;
}
void allout(vector<int> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << *it;
        if (it != prev(x.end())) std::cout << " ";
    }
    std::cout << std::endl;
}
void allout(vector<string> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << *it << std::endl;
    }
}
void allout(vector<bool> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        if (*it) std::cout << 1;
        else std::cout << 0;
        if (it != prev(x.end())) std::cout << " ";
    }
    std::cout << std::endl;
}
void allout(vector<pair<int, int>> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << it->first << " " << it->second << endl;
    }
}
template<class T>
void allout(vector<vector<T>> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        allout(*it);
    }
}
void allout(set<int> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << *it;
        if (it != prev(x.end())) std::cout << " ";
    }
    std::cout << std::endl;
}
void allout(set<pair<int, int>> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << it->first << " " << it->second << endl;
    }
}
template<class T>
void allout(vector<set<T>> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        allout(*it);
    }
}
void allout(map<int, int> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << it->first << " : " << it->second << std::endl;
    }
}
void allout(map<int, pair<int, int>> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << it->first << " : " << (it->second).first << " " << (it->second).second << std::endl;
    }
}
template<class T>
void allout(map<int, vector<T>> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << it->first << " : ";
        allout(it->second);
    }
}
template<class T>
void allout(map<int, set<T>> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << it->first << " : ";
        allout(it->second);
    }
}
class Timer {
    chrono::system_clock::time_point start;
public:
    Timer() : start(chrono::system_clock::now()) {}
    double count() {
        chrono::duration<double> Time_ = chrono::system_clock::now() - start;
        return Time_.count();
    }
    bool is_under(double x) {
        return (this->count()) < x;
    }
};

#endif

結果

問題	点数	言語	結果	実行時間	メモリ
E. Fibonacci Subtree	200	C++ (gcc)	RE	3010 ms	23168 KiB

コンパイルエラー

テストセット

テストセット	結果	得点	実行時間	メモリ
Sample	AC × 3	0	16 ms	8320 KiB
Subtask1	AC × 12	200	750 ms	8576 KiB
Subtask2	AC × 14 TLE × 8 RE × 2	0	3010 ms	23168 KiB

詳細結果

テストケース	結果	実行時間	メモリ
1_1	AC	19 ms	8320 KiB
1_2	AC	16 ms	8320 KiB
1_3	AC	750 ms	8448 KiB
1_4	AC	32 ms	8576 KiB
1_5	AC	17 ms	8448 KiB
1_6	AC	264 ms	8064 KiB
1_7	AC	17 ms	8320 KiB
1_8	AC	17 ms	8192 KiB
1_9	AC	21 ms	8192 KiB
2_1	TLE	3007 ms	8320 KiB
2_10	AC	1272 ms	8192 KiB
2_11	TLE	3010 ms	8320 KiB
2_12	TLE	3007 ms	8064 KiB
2_2	TLE	3007 ms	8192 KiB
2_3	TLE	3007 ms	8320 KiB
2_4	RE	259 ms	23168 KiB
2_5	RE	226 ms	22400 KiB
2_6	AC	870 ms	8192 KiB
2_7	TLE	3007 ms	8064 KiB
2_8	TLE	3008 ms	8320 KiB
2_9	TLE	3007 ms	8064 KiB
sample_1	AC	16 ms	8192 KiB
sample_2	AC	15 ms	8320 KiB
sample_3	AC	16 ms	8192 KiB