oj.uz

답안 #764971

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
764971 2023-06-24T07:04:01 Z dxz05 Parkovi (COCI22_parkovi) C++17
40 / 110
 3000 ms 98576 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){
    set<pair<ll, int>> s;
    for (int i = 1; i <= n; i++) s.emplace(dep[i], i);

    function<void(int, int, ll)> dfs = [&](int v, int p, ll dist){
        s.erase(MP(dep[v], v));
        for (auto [u, w] : g[v]){
            if (u == p) continue;
            if (w <= dist){
                dfs(u, v, dist - w);
            } else {
                break;
            }
        }
    };

    vector<int> ans;
    while (!s.empty()){
        int v = s.rbegin()->second;

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

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 4 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
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2732 ms 93092 KB Output is correct
2 Correct 2417 ms 95476 KB Output is correct
3 Execution timed out 3066 ms 69100 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1620 ms 97088 KB Output is correct
2 Correct 1583 ms 94532 KB Output is correct
3 Correct 1904 ms 89964 KB Output is correct
4 Correct 2070 ms 89772 KB Output is correct
5 Correct 2320 ms 94208 KB Output is correct
6 Correct 2352 ms 94604 KB Output is correct
7 Correct 2542 ms 97656 KB Output is correct
8 Correct 1618 ms 97668 KB Output is correct
9 Correct 1617 ms 96876 KB Output is correct
10 Correct 2009 ms 95012 KB Output is correct
11 Correct 2261 ms 91692 KB Output is correct
12 Correct 2282 ms 97360 KB Output is correct
13 Correct 2592 ms 98576 KB Output is correct
14 Correct 2513 ms 97152 KB Output is correct
15 Correct 2224 ms 94952 KB Output is correct
16 Correct 2143 ms 91212 KB Output is correct
17 Correct 2281 ms 90884 KB Output is correct
18 Correct 2512 ms 95644 KB Output is correct
19 Correct 2105 ms 91656 KB Output is correct
20 Correct 2315 ms 94692 KB Output is correct
21 Correct 2373 ms 93056 KB Output is correct

Subtask #4
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 4 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 2732 ms 93092 KB Output is correct
16 Correct 2417 ms 95476 KB Output is correct
17 Execution timed out 3066 ms 69100 KB Time limit exceeded
18 Halted 0 ms 0 KB -