Submission #10039466

---

Source Code Expand

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define INF (1e9)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
const long double PI = acos(-1.0L);
const long long MOD = 1000000007LL;
//const long long MOD = 998244353LL;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true;} return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true;} return false; }
///////////////////////////////////////////////////////////////////////////////////////////////////

void dfs(int v, vector<vector<int>> &G, vector<bitset<300>> &H) {
    H[v][v] = 1;
    for (auto nv : G[v]) {
        dfs(nv, G, H);
        H[v] |= H[nv];
    }
}
int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int N,M,K; cin >> N >> M >> K;
    K -= M;
    vector<vector<int>> G(N);
    int s;
    rep(i,N) {
        int p; cin >> p;
        p--;
        if (p < 0) {
            s = i;
            continue;
        }
        G[p].emplace_back(i);
    }

    vector<int> dist(N);
    queue<int> que;
    que.emplace(s);
    while (!que.empty()) {
        int v = que.front(); que.pop();
        for (auto nv : G[v]) {
            dist[nv] = dist[v]+1;
            que.emplace(nv);
        }
    }

    vector<bitset<300>> H(N);
    dfs(s, G, H);
    bitset<300> t;
    vector<int> ans;
    rep(i,M) {
        bool ok = false;
        rep(j,N) {
            if (t[j]) continue;
            auto u = t | H[j];
            vector<int> A;
            rep(k,N) {
                if (u[k]) continue;
                A.emplace_back(dist[k]);
            }
            int sz = A.size();
            if (sz < M-1-i) continue;
            sort(all(A));
            int mini = 0, maxi = 0;
            rep(k,M-1-i) {
                mini += A[k];
                maxi += A[sz-1-k];
            }
            if (mini <= K-dist[j] && K-dist[j] <= maxi) {
                ans.emplace_back(j+1);
                K -= dist[j];
                t |= H[j];
                ok = true;
                break;
            }
        }
        if (!ok) {
            cout << -1 << endl;
            return 0;
        }
    }

    for (auto i : ans) cout << i << " ";
    cout << endl;
}

Submission Info

Judge Result