oj.uz

Submission #883868

# Submission time Handle Problem Language Result Execution time Memory
883868 2023-12-06T09:45:09 Z noiaint Travelling Trader (CCO23_day2problem2) C++17
11 / 25
 138 ms 61380 KB 
#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; // 998244353;
const int lg = 25; // lg + 1
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(0);

    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    #else
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    #endif

    int tc = 1;
    // cin >> tc;

    while (tc--) {
        process();
    }

    return 0;
}

/*

*/

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 28764 KB Output is correct
2 Correct 6 ms 28764 KB Output is correct
3 Correct 84 ms 45396 KB Output is correct
4 Correct 90 ms 46932 KB Output is correct
5 Correct 100 ms 46672 KB Output is correct
6 Correct 84 ms 47700 KB Output is correct
7 Correct 63 ms 44224 KB Output is correct
8 Correct 93 ms 46020 KB Output is correct
9 Correct 125 ms 61380 KB Output is correct
10 Correct 114 ms 55756 KB Output is correct
11 Correct 61 ms 47184 KB Output is correct
12 Correct 6 ms 28764 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 26716 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 26716 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 26716 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 26716 KB Output is correct
2 Correct 8 ms 26852 KB Output is correct
3 Correct 8 ms 26716 KB Output is correct
4 Correct 7 ms 26836 KB Output is correct
5 Correct 7 ms 26716 KB Output is correct
6 Correct 7 ms 26876 KB Output is correct
7 Correct 8 ms 26972 KB Output is correct
8 Correct 7 ms 26716 KB Output is correct
9 Correct 7 ms 26716 KB Output is correct
10 Correct 7 ms 26712 KB Output is correct
11 Correct 7 ms 26716 KB Output is correct
12 Correct 7 ms 26716 KB Output is correct
13 Correct 7 ms 26964 KB Output is correct
14 Correct 7 ms 26968 KB Output is correct
15 Correct 7 ms 26712 KB Output is correct
16 Correct 8 ms 26716 KB Output is correct
17 Correct 7 ms 26720 KB Output is correct
18 Correct 7 ms 26720 KB Output is correct
19 Correct 6 ms 26720 KB Output is correct
20 Correct 8 ms 26720 KB Output is correct
21 Correct 6 ms 26904 KB Output is correct
22 Correct 7 ms 26720 KB Output is correct
23 Correct 7 ms 26716 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 26716 KB Output is correct
2 Correct 8 ms 26852 KB Output is correct
3 Correct 8 ms 26716 KB Output is correct
4 Correct 7 ms 26836 KB Output is correct
5 Correct 7 ms 26716 KB Output is correct
6 Correct 7 ms 26876 KB Output is correct
7 Correct 8 ms 26972 KB Output is correct
8 Correct 7 ms 26716 KB Output is correct
9 Correct 7 ms 26716 KB Output is correct
10 Correct 7 ms 26712 KB Output is correct
11 Correct 7 ms 26716 KB Output is correct
12 Correct 7 ms 26716 KB Output is correct
13 Correct 7 ms 26964 KB Output is correct
14 Correct 7 ms 26968 KB Output is correct
15 Correct 7 ms 26712 KB Output is correct
16 Correct 8 ms 26716 KB Output is correct
17 Correct 7 ms 26720 KB Output is correct
18 Correct 7 ms 26720 KB Output is correct
19 Correct 6 ms 26720 KB Output is correct
20 Correct 8 ms 26720 KB Output is correct
21 Correct 6 ms 26904 KB Output is correct
22 Correct 7 ms 26720 KB Output is correct
23 Correct 7 ms 26716 KB Output is correct
24 Correct 96 ms 43652 KB Output is correct
25 Correct 104 ms 43464 KB Output is correct
26 Correct 97 ms 43460 KB Output is correct
27 Correct 99 ms 43460 KB Output is correct
28 Correct 98 ms 43464 KB Output is correct
29 Correct 116 ms 43456 KB Output is correct
30 Correct 105 ms 44340 KB Output is correct
31 Correct 109 ms 43464 KB Output is correct
32 Correct 102 ms 44480 KB Output is correct
33 Correct 103 ms 43468 KB Output is correct
34 Correct 93 ms 44492 KB Output is correct
35 Correct 77 ms 43200 KB Output is correct
36 Correct 87 ms 42716 KB Output is correct
37 Correct 96 ms 43452 KB Output is correct
38 Correct 93 ms 44188 KB Output is correct
39 Correct 138 ms 52268 KB Output is correct
40 Correct 115 ms 49356 KB Output is correct
41 Correct 106 ms 47728 KB Output is correct
42 Correct 107 ms 47048 KB Output is correct
43 Correct 128 ms 45884 KB Output is correct
44 Correct 107 ms 44900 KB Output is correct
45 Correct 72 ms 43720 KB Output is correct
46 Correct 70 ms 43404 KB Output is correct