oj.uz

Submission #533535

# Submission time Handle Problem Language Result Execution time Memory
533535 2022-03-06T09:04:55 Z Slavita Parkovi (COCI22_parkovi) C++14
10 / 110
 3000 ms 15880 KB 
#include <bits/stdc++.h>
/*#pragma optimize("O3")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")*/
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define ve vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pi pair<int,int>
#define all(v) v.begin(),v.end()
#define si(v) (int)v.size()
#define en '\n'
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_muiltiset tree<int, null_type,less_equal<>, rb_tree_tag,tree_order_statistics_node_update>
#define int long long
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;

const int N = 2e5 + 228;
const int big = 1e9 + 228;
const ll llbig = 1e18 + 228;
//ordered_set os; // os.order_of_key(4), (*os.find_by_order(5))
int n, m, ans, k, q, d[N];
vector<pair<int, int>> g[N];

void dfs(int v, int dist, int pr){
    if (dist <= d[v]){
        d[v] = dist;
    }else return;

    for (int i = 0; i < si(g[v]); i++){
        int u = g[v][i].fi;
        int cost = g[v][i].se;
        if (u == pr) continue;

        dfs(u, dist + cost, v);
    }
}

bool getbit(int mask, int bit){
    bit--;
    return (mask & (1 << bit)) == (1 << bit);
}

#undef int
int main(){
    #define int long long
    iostream::sync_with_stdio(false); cin.tie(0); ios_base::sync_with_stdio(false); cout.tie(0);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    cin >> n >> k;
    for (int i = 1; i <= n - 1; i++){
        int a, b, d;
        cin >> a >> b >> d;
        g[a].pb({b, d});
        g[b].pb({a, d});
    }

    ve ansv;
    int ans = llbig;
    for (int mask = 1; mask <= (1 << n); mask++){
        ve v;
        for (int i = 1; i <= n; i++){
            if (getbit(mask, i)){
                v.pb(i);
            }
        }
        if (si(v) != k) continue;

        for (int i = 1; i <= n; i++) d[i] = llbig;
        for (int i = 0; i < si(v); i++){
            dfs(v[i], 0, -1);
        }

        int mx = -llbig;
        for (int i = 1; i <= n; i++){
            mx = max(mx, d[i]);
        }

        if (mx < ans){
            ans = mx;
            ansv = v;
        }
    }
    cout << ans << en;
    for (int i = 0; i < si(ansv); i++){
        cout << ansv[i] << ' ';
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 218 ms 4992 KB Output is correct
2 Correct 231 ms 4940 KB Output is correct
3 Correct 230 ms 4996 KB Output is correct
4 Correct 240 ms 5004 KB Output is correct
5 Correct 223 ms 4996 KB Output is correct
6 Correct 225 ms 4996 KB Output is correct
7 Correct 249 ms 4992 KB Output is correct
8 Correct 224 ms 5000 KB Output is correct
9 Correct 309 ms 5012 KB Output is correct
10 Correct 221 ms 4996 KB Output is correct
11 Correct 309 ms 5000 KB Output is correct
12 Correct 259 ms 4940 KB Output is correct
13 Correct 241 ms 5060 KB Output is correct
14 Correct 281 ms 4940 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3085 ms 15376 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3050 ms 15880 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 218 ms 4992 KB Output is correct
2 Correct 231 ms 4940 KB Output is correct
3 Correct 230 ms 4996 KB Output is correct
4 Correct 240 ms 5004 KB Output is correct
5 Correct 223 ms 4996 KB Output is correct
6 Correct 225 ms 4996 KB Output is correct
7 Correct 249 ms 4992 KB Output is correct
8 Correct 224 ms 5000 KB Output is correct
9 Correct 309 ms 5012 KB Output is correct
10 Correct 221 ms 4996 KB Output is correct
11 Correct 309 ms 5000 KB Output is correct
12 Correct 259 ms 4940 KB Output is correct
13 Correct 241 ms 5060 KB Output is correct
14 Correct 281 ms 4940 KB Output is correct
15 Execution timed out 3085 ms 15376 KB Time limit exceeded
16 Halted 0 ms 0 KB -