oj.uz

답안 #764980

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
764980 2023-06-24T07:09:26 Z dxz05 Parkovi (COCI22_parkovi) C++17
50 / 110
 3000 ms 84256 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);
        }
    }
}

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

    vector<bool> deleted(n + 1, false);

    function<void(int, int, ll)> 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> 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:119:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  119 |         if (p.size() <= k){
      |             ~~~~~~~~~^~~~
Main.cpp:135:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  135 |         if (j == ans.size() || ans[j] != i){
      |             ~~^~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:145:13: warning: unused variable 'startTime' [-Wunused-variable]
  145 |     clock_t startTime = clock();
      |             ^~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 5044 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1068 ms 79716 KB Output is correct
2 Correct 1114 ms 81624 KB Output is correct
3 Correct 1878 ms 63524 KB Output is correct
4 Correct 2200 ms 60136 KB Output is correct
5 Correct 2191 ms 58660 KB Output is correct
6 Correct 2084 ms 58748 KB Output is correct
7 Correct 2479 ms 59184 KB Output is correct
8 Correct 2583 ms 61672 KB Output is correct
9 Correct 2541 ms 60216 KB Output is correct
10 Correct 2872 ms 61432 KB Output is correct
11 Correct 1996 ms 63628 KB Output is correct
12 Correct 1862 ms 61712 KB Output is correct
13 Correct 2100 ms 66572 KB Output is correct
14 Correct 1901 ms 61180 KB Output is correct
15 Correct 1937 ms 61372 KB Output is correct
16 Correct 1911 ms 62336 KB Output is correct
17 Correct 1992 ms 61292 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1014 ms 82824 KB Output is correct
2 Correct 976 ms 80764 KB Output is correct
3 Correct 995 ms 77116 KB Output is correct
4 Correct 1042 ms 77236 KB Output is correct
5 Correct 1014 ms 81336 KB Output is correct
6 Correct 1165 ms 81156 KB Output is correct
7 Correct 1158 ms 83808 KB Output is correct
8 Correct 1010 ms 83316 KB Output is correct
9 Correct 976 ms 82704 KB Output is correct
10 Correct 1022 ms 81156 KB Output is correct
11 Correct 1076 ms 78612 KB Output is correct
12 Correct 1175 ms 83408 KB Output is correct
13 Correct 1219 ms 84256 KB Output is correct
14 Correct 1208 ms 83220 KB Output is correct
15 Correct 1074 ms 81152 KB Output is correct
16 Correct 996 ms 78124 KB Output is correct
17 Correct 1103 ms 77916 KB Output is correct
18 Correct 1202 ms 81912 KB Output is correct
19 Correct 1076 ms 79608 KB Output is correct
20 Correct 1121 ms 81576 KB Output is correct
21 Correct 1087 ms 80420 KB Output is correct

Subtask #4
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 5044 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 1068 ms 79716 KB Output is correct
16 Correct 1114 ms 81624 KB Output is correct
17 Correct 1878 ms 63524 KB Output is correct
18 Correct 2200 ms 60136 KB Output is correct
19 Correct 2191 ms 58660 KB Output is correct
20 Correct 2084 ms 58748 KB Output is correct
21 Correct 2479 ms 59184 KB Output is correct
22 Correct 2583 ms 61672 KB Output is correct
23 Correct 2541 ms 60216 KB Output is correct
24 Correct 2872 ms 61432 KB Output is correct
25 Correct 1996 ms 63628 KB Output is correct
26 Correct 1862 ms 61712 KB Output is correct
27 Correct 2100 ms 66572 KB Output is correct
28 Correct 1901 ms 61180 KB Output is correct
29 Correct 1937 ms 61372 KB Output is correct
30 Correct 1911 ms 62336 KB Output is correct
31 Correct 1992 ms 61292 KB Output is correct
32 Correct 1014 ms 82824 KB Output is correct
33 Correct 976 ms 80764 KB Output is correct
34 Correct 995 ms 77116 KB Output is correct
35 Correct 1042 ms 77236 KB Output is correct
36 Correct 1014 ms 81336 KB Output is correct
37 Correct 1165 ms 81156 KB Output is correct
38 Correct 1158 ms 83808 KB Output is correct
39 Correct 1010 ms 83316 KB Output is correct
40 Correct 976 ms 82704 KB Output is correct
41 Correct 1022 ms 81156 KB Output is correct
42 Correct 1076 ms 78612 KB Output is correct
43 Correct 1175 ms 83408 KB Output is correct
44 Correct 1219 ms 84256 KB Output is correct
45 Correct 1208 ms 83220 KB Output is correct
46 Correct 1074 ms 81152 KB Output is correct
47 Correct 996 ms 78124 KB Output is correct
48 Correct 1103 ms 77916 KB Output is correct
49 Correct 1202 ms 81912 KB Output is correct
50 Correct 1076 ms 79608 KB Output is correct
51 Correct 1121 ms 81576 KB Output is correct
52 Correct 1087 ms 80420 KB Output is correct
53 Execution timed out 3051 ms 60120 KB Time limit exceeded
54 Halted 0 ms 0 KB -