Submission #468735

#	Time	Username	Problem	Language	Result	Execution time	Memory
468735		Redmoonautumn	Mousetrap (CEOI17_mousetrap)	C++17	0 / 100	858 ms	62856 KiB

mousetrap

#include <bits/stdc++.h>
using namespace std;

#define int int64_t

vector<vector<int>> graph;

int dfs2(int v, int p){
    priority_queue<int> pq;
    for(auto u:graph[v]){
        if(u==p)continue;
        int x=dfs2(u,v);
        pq.push(x);
    }
    int sum=0;
    int i=0;
    while (!pq.empty()){
        sum++;
        if(i%2)sum+=pq.top();
        i++;
        pq.pop();
    }
    return sum;
}


signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n,t,m;
    cin>>n>>t>>m;
    graph.resize(n);
    t--;
    m--;
    for(int i=0;i<n-1;i++){
        int a,b;
        cin>>a>>b;
        a--;
        b--;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }
    int sol=dfs2(m,t);
    cout<<sol<<"\n";
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 25
• Subtask 3: 0 / 20
• Subtask 4: 0 / 35