結果

問題 No.763 Noelちゃんと木遊び
ユーザー ミドリムシ+ミドリムシ+
提出日時 2018-12-11 13:53:45
言語 C++11
(gcc 4.8.5)
結果
AC  
実行時間 128 ms / 2,000 ms
コード長 2,924 Byte
コンパイル時間 649 ms
使用メモリ 16,932 KB
最終ジャッジ日時 2020-05-17 07:50:10

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 103 ms
16,932 KB
testcase_01 AC 39 ms
6,900 KB
testcase_02 AC 99 ms
6,896 KB
testcase_03 AC 66 ms
6,900 KB
testcase_04 AC 45 ms
8,944 KB
testcase_05 AC 62 ms
6,896 KB
testcase_06 AC 121 ms
8,944 KB
testcase_07 AC 120 ms
7,160 KB
testcase_08 AC 69 ms
8,944 KB
testcase_09 AC 44 ms
8,944 KB
testcase_10 AC 18 ms
8,940 KB
testcase_11 AC 125 ms
7,424 KB
testcase_12 AC 115 ms
6,904 KB
testcase_13 AC 107 ms
8,900 KB
testcase_14 AC 94 ms
8,896 KB
testcase_15 AC 63 ms
6,896 KB
testcase_16 AC 11 ms
8,944 KB
testcase_17 AC 65 ms
8,940 KB
testcase_18 AC 128 ms
7,420 KB
testcase_19 AC 116 ms
6,900 KB
testcase_20 AC 113 ms
6,896 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
#include <iostream>
#include <algorithm>
#include <vector>
#include <string.h>
using namespace std;
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; }
template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; }
template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; }
template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }
long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position move_pattern[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr start, itr goal){ for(auto i = start; i != goal; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
#define mod long(10007)
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl(long(n))
#define fcout cout << fixed << setprecision(10)
#define highest(x) (63 - __builtin_clzl(x))

vector<vector<int>> roads;

int dp[100010][2];

int move(int now, int back, bool is_cut){
    if(dp[now][is_cut] != -1){
        return dp[now][is_cut];
    }
    int ans = 0;
    for(int i: roads[now]){
        if(i != back){
            if(is_cut){
                ans += max(move(i, now, true), move(i, now, false));
            }else{
                ans += move(i, now, true);
            }
        }
    }
    return dp[now][is_cut] = ans + !is_cut;
}

int main(){
    int N;
    cin >> N;
    roads.resize(N);
    for(int i = 0; i < N - 1; i++){
        int u, v;
        cin >> u >> v;
        roads[u - 1].push_back(v - 1);
        roads[v - 1].push_back(u - 1);
    }
    memset(dp, -1, sizeof(dp));
    cout << max(move(0, -1, true), move(0, -1, false)) << endl;
}
0