oj.uz

Submission #765012

# Submission time Handle Problem Language Result Execution time Memory
765012 2023-06-24T07:32:56 Z dxz05 Parkovi (COCI22_parkovi) C++17
50 / 110
 3000 ms 79960 KB 
#pragma GCC optimize("Ofast,O3,unroll-loops")
#pragma GCC target("avx,avx2")

#include <bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bpc(x) __builtin_popcount(x)
#define bpcll(x) __builtin_popcountll(x)
#define MP make_pair
#define BIT(x, i) (((x) >> (i)) & 1)
//#define endl '\n'

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

typedef long long ll;
const int MOD = 1e9 + 7;
const int N = 2e5 + 30;

int n;
vector<pair<int, int>> g[N];

ll dep[N];
int up[N][18];
ll sum[N][18];

void dfs0(int v, int p){
    up[v][0] = p;
    sum[v][0] = dep[v] - dep[p];
    for (int i = 1; i < 18; i++){
        int pp = up[v][i - 1];
        up[v][i] = up[pp][i - 1];
        sum[v][i] = sum[v][i - 1] + sum[pp][i - 1];
    }

    for (auto [u, w] : g[v]){
        if (u != p){
            dep[u] = dep[v] + w;
            dfs0(u, v);
        }
    }
}

ll was[N];
bool deleted[N];

void dfs(int v, int p, ll dist){
    if (was[v] >= dist) return;
    was[v] = dist;
    deleted[v] = true;

    for (auto [u, w] : g[v]){
        if (u == p) continue;
        if (w <= dist){
            dfs(u, v, dist - w);
        } else {
            break;
        }
    }
}

int parks[N];

int parks_cnt(ll d){
    priority_queue<pair<ll, int>> pq;
    for (int i = 1; i <= n; i++){
        pq.emplace(dep[i], i);
        was[i] = -1;
        deleted[i] = false;
    }

    int sz = 0;
    while (!pq.empty()){
        int v = pq.top().second;
        if (deleted[v]){
            pq.pop();
            continue;
        }

        ll x = d;
        for (int i = 17; i >= 0; i--){
            if (sum[v][i] <= x){
                x -= sum[v][i];
                v = up[v][i];
            }
        }

        parks[sz++] = v;

        dfs(v, -1, d);
    }

    return sz;
}

int ans[N];

void solve(){
    int k;
    cin >> n >> k;

    for (int i = 1; i < n; i++){
        int u, v, w;
        cin >> u >> v >> w;
        g[u].emplace_back(v, w);
        g[v].emplace_back(u, w);
    }

    int root = 1;
    for (int i = 1; i <= n; i++){
        if (g[i].size() > 1) root = i;

        sort(all(g[i]), [&](auto x, auto y){
            return x.second < y.second;
        });

    }

    dfs0(root, root);

    int sz = 0;

    ll l = 0, r = 2e14;
    while (l <= r){
        ll m = (l + r) >> 1;

        int res = parks_cnt(m);

        if (res <= k){
            sz = res;
            for (int i = 0; i < res; i++) ans[i] = parks[i];
            r = m - 1;
        } else {
            l = m + 1;
        }
    }

    sort(ans, ans + sz);

    cout << ++r << endl;
    for (int i = 0; i < sz; i++) cout << ans[i] << ' ';

    int x = k - sz;
    for (int i = 1; i <= n; i++){
        if (x == 0) break;
        int j = lower_bound(ans, ans + sz, i) - ans;
        if (j == sz || ans[j] != i){
            cout << i << ' ';
            x--;
        }
    }

    cout << endl;
}

int main(){
    clock_t startTime = clock();
    ios_base::sync_with_stdio(false);

#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int test_cases = 1;
//    cin >> test_cases;

    for (int test = 1; test <= test_cases; test++){
        // cout << (solve() ? "YES" : "NO") << endl;
        solve();
    }

#ifdef LOCAL
    cerr << "Time: " << int((double) (clock() - startTime) / CLOCKS_PER_SEC * 1000) << " ms" << endl;
#endif

    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:159:13: warning: unused variable 'startTime' [-Wunused-variable]
  159 |     clock_t startTime = clock();
      |             ^~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 5076 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 5076 KB Output is correct
5 Correct 4 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 4 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 976 ms 75524 KB Output is correct
2 Correct 1008 ms 77320 KB Output is correct
3 Correct 1961 ms 65540 KB Output is correct
4 Correct 2088 ms 61860 KB Output is correct
5 Correct 1965 ms 60040 KB Output is correct
6 Correct 1962 ms 60224 KB Output is correct
7 Correct 2105 ms 60764 KB Output is correct
8 Correct 2198 ms 63280 KB Output is correct
9 Correct 2107 ms 61884 KB Output is correct
10 Correct 2227 ms 63196 KB Output is correct
11 Correct 1907 ms 64576 KB Output is correct
12 Correct 1776 ms 62432 KB Output is correct
13 Correct 2021 ms 67156 KB Output is correct
14 Correct 1801 ms 61868 KB Output is correct
15 Correct 1786 ms 62204 KB Output is correct
16 Correct 1807 ms 62980 KB Output is correct
17 Correct 1829 ms 62140 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 953 ms 78700 KB Output is correct
2 Correct 921 ms 76768 KB Output is correct
3 Correct 873 ms 73080 KB Output is correct
4 Correct 916 ms 72928 KB Output is correct
5 Correct 983 ms 76828 KB Output is correct
6 Correct 1116 ms 76924 KB Output is correct
7 Correct 1135 ms 79080 KB Output is correct
8 Correct 958 ms 78984 KB Output is correct
9 Correct 974 ms 78272 KB Output is correct
10 Correct 993 ms 76880 KB Output is correct
11 Correct 1004 ms 74408 KB Output is correct
12 Correct 1164 ms 79088 KB Output is correct
13 Correct 1202 ms 79960 KB Output is correct
14 Correct 1199 ms 78708 KB Output is correct
15 Correct 1014 ms 76808 KB Output is correct
16 Correct 963 ms 73996 KB Output is correct
17 Correct 933 ms 73828 KB Output is correct
18 Correct 997 ms 77392 KB Output is correct
19 Correct 965 ms 74848 KB Output is correct
20 Correct 1000 ms 76928 KB Output is correct
21 Correct 974 ms 75716 KB Output is correct

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 5076 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 5076 KB Output is correct
5 Correct 4 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 4 ms 5076 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 976 ms 75524 KB Output is correct
16 Correct 1008 ms 77320 KB Output is correct
17 Correct 1961 ms 65540 KB Output is correct
18 Correct 2088 ms 61860 KB Output is correct
19 Correct 1965 ms 60040 KB Output is correct
20 Correct 1962 ms 60224 KB Output is correct
21 Correct 2105 ms 60764 KB Output is correct
22 Correct 2198 ms 63280 KB Output is correct
23 Correct 2107 ms 61884 KB Output is correct
24 Correct 2227 ms 63196 KB Output is correct
25 Correct 1907 ms 64576 KB Output is correct
26 Correct 1776 ms 62432 KB Output is correct
27 Correct 2021 ms 67156 KB Output is correct
28 Correct 1801 ms 61868 KB Output is correct
29 Correct 1786 ms 62204 KB Output is correct
30 Correct 1807 ms 62980 KB Output is correct
31 Correct 1829 ms 62140 KB Output is correct
32 Correct 953 ms 78700 KB Output is correct
33 Correct 921 ms 76768 KB Output is correct
34 Correct 873 ms 73080 KB Output is correct
35 Correct 916 ms 72928 KB Output is correct
36 Correct 983 ms 76828 KB Output is correct
37 Correct 1116 ms 76924 KB Output is correct
38 Correct 1135 ms 79080 KB Output is correct
39 Correct 958 ms 78984 KB Output is correct
40 Correct 974 ms 78272 KB Output is correct
41 Correct 993 ms 76880 KB Output is correct
42 Correct 1004 ms 74408 KB Output is correct
43 Correct 1164 ms 79088 KB Output is correct
44 Correct 1202 ms 79960 KB Output is correct
45 Correct 1199 ms 78708 KB Output is correct
46 Correct 1014 ms 76808 KB Output is correct
47 Correct 963 ms 73996 KB Output is correct
48 Correct 933 ms 73828 KB Output is correct
49 Correct 997 ms 77392 KB Output is correct
50 Correct 965 ms 74848 KB Output is correct
51 Correct 1000 ms 76928 KB Output is correct
52 Correct 974 ms 75716 KB Output is correct
53 Execution timed out 3057 ms 61320 KB Time limit exceeded
54 Halted 0 ms 0 KB -