oj.uz

답안 #544318

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
544318 2022-04-01T16:42:34 Z inventiontime Network (BOI15_net) C++17
0 / 100
 6 ms 11988 KB 
#include <bits/stdc++.h>
using namespace std;

#define int ll
#define endl '\n'

#define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back
#define re resize
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define loop(i, n) for(int i = 0; i < n; i++)
#define loop1(i, n) for(int i = 1; i <= n; i++)
#define print(x) cout << #x << ": " << x << endl

typedef long long ll;
typedef vector<int> vi;
typedef array<int, 2> ii;
typedef array<int, 3> ti;
typedef vector<ii> vii;
typedef vector<ti> vti;
typedef priority_queue<int> pq;

template<class T> bool ckmin(T&a, T b) { bool B = a > b; a = min(a, b); return B; }
template<class T> bool ckmax(T&a, T b) { bool B = a < b; a = max(a, b); return B; }

const int inf = 1e17;
const int maxn = 5e5+5;

vi adj[maxn];

void solve() {
    
    int n; cin >> n;
    loop1(i, n-1) {
        int u, v;
        cin >> u >> v;
        adj[u].pb(v);
        adj[v].pb(u);
    }

    int leaves = 0;
    loop1(i, n)
        if(adj[i].size() == 2 or adj[i].size() == 0)
            leaves++;

    cout << (leaves+1) / 2 << endl;

}

signed main() {

    fast_io;

    int t = 1; //cin >> t;
    while(t--)
        solve();

    cout << flush;

    return 0;

}

Subtask #1
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 11988 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #2
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 11988 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 11988 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -