제출 #1124809

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1124809		doducanh	Museum (CEOI17_museum)	C++20	0 / 100	4 ms	1092 KiB

museum

///roadtoVOI2025
///enjoythejourney
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define ii pair<int,int>
#define mp make_pair
#define in(x) freopen(x,"r",stdin)
#define out(x) freopen(x,"w",stdout)
#define bit(x,i) ((x>>i)&1)
#define lc (id<<1)
#define rc ((id<<1)^1)
const int maxn=1e4+7;
vector<ii>adj[maxn];
int dp[maxn][maxn];
int sz[maxn];
int n,k,x;
void work(int u,int v)
{
//    for(int i=)
}
void dfs(int u,int par)
{
    sz[u]=1;
    for(ii pp:adj[u]){
        int v=pp.fi;
        int w=pp.se;
        if(v==par)continue;
        dfs(v,u);
        work(u,v);
    }
}
void sol()
{
    cin>>n>>k>>x;
    for(int i=1;i<n;i++){
        int u,v,w;
        cin>>u>>v>>w;
        adj[u].push_back({v,w});
        adj[v].push_back({u,w});
    }
    dfs(x,0);
}
signed main(void)
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t=1;
    while(t--){
        sol();
    }
    // you should actually read the stuff at the bottom
    return 0;
}
/* stuff you should look for
 * int overflow, array bounds
 * special cases (n=1?)
 * do smth instead of nothing and stay organized
 * WRITE STUFF DOWN
 * DON'T GET STUCK ON ONE APPROACH
 */

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