Submission #1209937

#TimeUsernameProblemLanguageResultExecution timeMemory
1209937dksnfjkfnwkfwTravelling Trader (CCO23_day2problem2)C++20
2 / 25
99 ms51900 KiB
#include <bits/stdc++.h> using namespace std; #define sonic ios_base::sync_with_stdio(false);cin.tie(0); cout.tie(0) #define IO(main) if(fopen(main".inp","r")){freopen(main".inp","r",stdin);freopen(main".out","w",stdout);} #define pb push_back #define fi first #define se second #define mp make_pair #define ins insert #define pb push_back #define el cout << endl #define SZ(x) ((int)(x).size()) #define ALL(x) (x).begin(), (x).end() #define MASK(i) ((1LL)<<(i)) #define BIT(x,i) (((x)>>(i))&(1LL)) #define FOR(i, a, b) for(int (i)=(a);(i)<=(b); i++) #define FORD(i, a, b) for(int (i)=(a);(i)>=(b); i--) using ll = long long; using ull = unsigned long long; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; using vi = vector<int>; using vii = vector<pii>; const int N = 1e6 + 9; const int mod = 1e9 + 7; const int INF = 1e9 + 7; const int base = 31; const int LOG = 20; const ll MOD = 1e9 + 7; int mul(int x, int y) {return 1LL * x * y % mod;} int calPw(int x, int y) { int ans = 1; while(y) { if (y&1) ans = 1LL * ans * x % mod; x = 1LL * x * x % mod; y >>= 1; } return ans; } int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1}; int dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}; int dy[8] = {1, 1, 0, -1, -1, -1, 0, 1}; ///Author: Le Chi Thien Luong The Vinh high school 2008 ///code template<class X, class Y> bool minimize(X &x , Y y){ if(x > y){ x = y; return true; } return false; } void add(int &x, int y){ x+=y; if(x >= mod)x-=mod; } void sub(int &x, int y){ x-=y; if(x < 0)x+=mod; } void Solve(){ } ll n, dp[N], a[N], k; vector<int>adj[N]; int par[N]; void dfs(int u, int p){ dp[u] = a[u]; for(int v : adj[u]){ if(v == p)continue; dfs(v, u); if(dp[u] < dp[v] + a[u]){ dp[u] = dp[v] + a[u]; par[u] = v; } } } void Read(){ cin >> n >> k; FOR(i, 2, n){ int u, v; cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u); } FOR(i, 1, n){ cin >> a[i]; } dfs(1, 1); cout << dp[1] << endl; int x = 1; int tmp = dp[1]; vector<int>ans; while(x!=0){ ans.push_back(x); tmp = dp[par[x]]; x = par[x]; } cout << ans.size() << endl; for(int v : ans)cout << v << " "; } int main() { sonic; int TEST = 1; // cin >> TEST; while(TEST--) { Read(); Solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...