oj.uz

Submission #764982

# Submission time Handle Problem Language Result Execution time Memory
764982 2023-06-24T07:10:48 Z dxz05 Parkovi (COCI22_parkovi) C++17
50 / 110
 3000 ms 79532 KB 
#pragma GCC optimize("Ofast,O3,unroll-loops")
#pragma GCC target("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);
        }
    }
}

bool deleted[N];

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

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

vector<int> parks(ll d){
    priority_queue<pair<ll, int>> pq;
    for (int i = 1; i <= n; i++) pq.emplace(dep[i], i);
    fill(deleted + 1, deleted + n + 1, false);

    vector<int> ans;
    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];
            }
        }

        ans.push_back(v);
        dfs(v, -1, d);
    }

    return ans;
}

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);

    vector<int> ans;

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

        vector<int> p = parks(m);

        if (p.size() <= k){
            ans = p;
            r = m - 1;
        } else {
            l = m + 1;
        }
    }


    cout << ++r << endl;
    for (int x : ans) cout << x << ' ';

    int x = k - (int) ans.size();
    for (int i = 1; i <= n; i++){
        if (x == 0) break;
        int j = lower_bound(all(ans), i) - ans.begin();
        if (j == ans.size() || 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 'void solve()':
Main.cpp:120:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  120 |         if (p.size() <= k){
      |             ~~~~~~~~~^~~~
Main.cpp:136:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  136 |         if (j == ans.size() || ans[j] != i){
      |             ~~^~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:146:13: warning: unused variable 'startTime' [-Wunused-variable]
  146 |     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 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 4 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 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 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 955 ms 73932 KB Output is correct
2 Correct 991 ms 75680 KB Output is correct
3 Correct 1902 ms 63784 KB Output is correct
4 Correct 2119 ms 60320 KB Output is correct
5 Correct 1964 ms 58612 KB Output is correct
6 Correct 2031 ms 58776 KB Output is correct
7 Correct 2310 ms 59104 KB Output is correct
8 Correct 2634 ms 61816 KB Output is correct
9 Correct 2506 ms 60468 KB Output is correct
10 Correct 2819 ms 61660 KB Output is correct
11 Correct 2058 ms 62912 KB Output is correct
12 Correct 1802 ms 61044 KB Output is correct
13 Correct 1998 ms 65584 KB Output is correct
14 Correct 1882 ms 60428 KB Output is correct
15 Correct 1853 ms 60608 KB Output is correct
16 Correct 1803 ms 61588 KB Output is correct
17 Correct 1894 ms 60596 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 982 ms 76944 KB Output is correct
2 Correct 923 ms 75108 KB Output is correct
3 Correct 910 ms 71828 KB Output is correct
4 Correct 925 ms 71484 KB Output is correct
5 Correct 954 ms 77432 KB Output is correct
6 Correct 1071 ms 75880 KB Output is correct
7 Correct 1075 ms 78316 KB Output is correct
8 Correct 943 ms 77332 KB Output is correct
9 Correct 942 ms 76840 KB Output is correct
10 Correct 951 ms 75444 KB Output is correct
11 Correct 957 ms 72936 KB Output is correct
12 Correct 1098 ms 79532 KB Output is correct
13 Correct 1122 ms 78708 KB Output is correct
14 Correct 1110 ms 77268 KB Output is correct
15 Correct 956 ms 75392 KB Output is correct
16 Correct 907 ms 72588 KB Output is correct
17 Correct 911 ms 72584 KB Output is correct
18 Correct 992 ms 75896 KB Output is correct
19 Correct 943 ms 73824 KB Output is correct
20 Correct 995 ms 75616 KB Output is correct
21 Correct 976 ms 74524 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 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 4 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 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 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 955 ms 73932 KB Output is correct
16 Correct 991 ms 75680 KB Output is correct
17 Correct 1902 ms 63784 KB Output is correct
18 Correct 2119 ms 60320 KB Output is correct
19 Correct 1964 ms 58612 KB Output is correct
20 Correct 2031 ms 58776 KB Output is correct
21 Correct 2310 ms 59104 KB Output is correct
22 Correct 2634 ms 61816 KB Output is correct
23 Correct 2506 ms 60468 KB Output is correct
24 Correct 2819 ms 61660 KB Output is correct
25 Correct 2058 ms 62912 KB Output is correct
26 Correct 1802 ms 61044 KB Output is correct
27 Correct 1998 ms 65584 KB Output is correct
28 Correct 1882 ms 60428 KB Output is correct
29 Correct 1853 ms 60608 KB Output is correct
30 Correct 1803 ms 61588 KB Output is correct
31 Correct 1894 ms 60596 KB Output is correct
32 Correct 982 ms 76944 KB Output is correct
33 Correct 923 ms 75108 KB Output is correct
34 Correct 910 ms 71828 KB Output is correct
35 Correct 925 ms 71484 KB Output is correct
36 Correct 954 ms 77432 KB Output is correct
37 Correct 1071 ms 75880 KB Output is correct
38 Correct 1075 ms 78316 KB Output is correct
39 Correct 943 ms 77332 KB Output is correct
40 Correct 942 ms 76840 KB Output is correct
41 Correct 951 ms 75444 KB Output is correct
42 Correct 957 ms 72936 KB Output is correct
43 Correct 1098 ms 79532 KB Output is correct
44 Correct 1122 ms 78708 KB Output is correct
45 Correct 1110 ms 77268 KB Output is correct
46 Correct 956 ms 75392 KB Output is correct
47 Correct 907 ms 72588 KB Output is correct
48 Correct 911 ms 72584 KB Output is correct
49 Correct 992 ms 75896 KB Output is correct
50 Correct 943 ms 73824 KB Output is correct
51 Correct 995 ms 75616 KB Output is correct
52 Correct 976 ms 74524 KB Output is correct
53 Execution timed out 3062 ms 60024 KB Time limit exceeded
54 Halted 0 ms 0 KB -