제출 #993600

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
993600		Trisanu_Das	Travelling Trader (CCO23_day2problem2)	C++17	11 / 25	133 ms	54984 KiB

Main

#include <bits/stdc++.h>
#define int int64_t
 
using namespace std;
 
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
 
#define file ""
 
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
 
#define bit(x) (1LL << (x))
#define getbit(x, i) (((x) >> (i)) & 1)
#define popcount __builtin_popcountll
 
mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}
 
const int N = 1e6 + 5;
const int mod = (int)1e9 + 7;
const int lg = 25;
const int oo = 1e9;
const long long ooo = 1e18;
 
template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}
 
int n, k;
vector<int> adj[N];
int a[N];
 
namespace task1 {
 
int f[N];
int trace[N];
 
void dfs(int u, int p) {
    f[u] = a[u];
    for (int v : adj[u]) if (v != p) {
        dfs(v, u);
        if (maxi(f[u], f[v] + a[u])) trace[u] = v;
    }
}
 
void solve() {
    dfs(1, 0);
    cout << f[1] << '\n';
    vector<int> node;
    int u = 1;
    do {
        node.push_back(u);
        u = trace[u];
    } while (u != 0);
    cout << (int) node.size() << '\n';
    for (int u : node) cout << u << ' ';
 
}
 
}
 
namespace task3 {
 
vector<int> node;
 
void dfs(int u, int p) {
    node.push_back(u);
    for (int v : adj[u]) if (v != p) {
        for (int w : adj[v]) if (w != u) dfs(w, v);
        node.push_back(v);
    }
}
 
void solve() {
    dfs(1, 0);
    int res = 0;
    for (int i = 1; i <= n; ++i) res += a[i];
    cout << res << '\n';
    cout << n << '\n';
    for (int u : node) cout << u << ' ';
}
 
}
 
void process() {
    cin >> n >> k;
    for (int i = 1; i < n; ++i) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    for (int i = 1; i <= n; ++i) cin >> a[i];
    if (k == 1) task1::solve();
    if (k == 3) task3::solve();
}
 
signed main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    process();
}

• Subtask 1: 2 / 2
• Subtask 2: 0 / 7
• Subtask 3: 0 / 3
• Subtask 4: 0 / 4
• Subtask 5: 4 / 4
• Subtask 6: 5 / 5