#327166 (C++11) No.806 木を道に

• 問題: No.806 木を道に
• ユーザー: ミドリムシ
• 提出日時: 2019-03-22 21:24:37
• 言語: C++11 (gcc 11.4.0)
• 結果: AC
• 実行時間: 57 ms / 2,000 ms
• コード長: 2,962 bytes
• コンパイル時間: 809 ms
• コンパイル使用メモリ: 76,632 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-19 02:43:19
• 合計ジャッジ時間: 2,220 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	1 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	13 ms; 5,376 KB
testcase_11	AC	12 ms; 5,376 KB
testcase_12	AC	49 ms; 5,376 KB
testcase_13	AC	35 ms; 5,376 KB
testcase_14	AC	47 ms; 5,376 KB
testcase_15	AC	49 ms; 5,376 KB
testcase_16	AC	19 ms; 5,376 KB
testcase_17	AC	43 ms; 5,376 KB
testcase_18	AC	6 ms; 5,376 KB
testcase_19	AC	14 ms; 5,376 KB
testcase_20	AC	43 ms; 5,376 KB
testcase_21	AC	24 ms; 5,376 KB
testcase_22	AC	57 ms; 5,376 KB
testcase_23	AC	57 ms; 5,376 KB
testcase_24	AC	31 ms; 5,376 KB
testcase_25	AC	46 ms; 5,376 KB
testcase_26	AC	17 ms; 5,376 KB
testcase_27	AC	55 ms; 5,376 KB
testcase_28	AC	3 ms; 5,376 KB

ソースコード

#include <iostream>
#include <algorithm>
#include <vector>
#include <string.h>
#include <random>
#include <cmath>
using namespace std;
using lint = long long;
const long mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl(long(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
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 mv[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); } string to_string(string x){ return x; }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) 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; }
struct combination{ vector<long> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } long C(int p, int q) const{ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };

int main(){
    int N;
    cin >> N;
    vector<int> sum(N, 0);
    for(int i = 0; i < N - 1; i++){
        int A, B;
        cin >> A >> B;
        sum[A - 1]++;
        sum[B - 1]++;
    }
    int ans = 0;
    for(int i = 0; i < N; i++){
        ans += max(0, sum[i] - 2);
    }
    cout << ans << endl;
}