Submission #10033340

---

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; }
///////////////////////////////////////////////////////////////////////////////////////////////////

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int N,M,K; cin >> N >> M >> K;
    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);
        }
    }
    if (K < M) {
        cout << -1 << endl;
        return 0;
    }
    K -= M;
    reverse(all(dist));
    vector<bitset<100001>> dp(M+1);
    dp[0][0] = 1;
    rep(i,N) {
        for (int j = M; j > 0; --j) {
            dp[j] |= (dp[j-1]<<dist[i]);
        }
    }
    if (!dp[M].test(K)) {
        cout << -1 << endl;
        return 0;
    }
    reverse(all(dist));
    vector<int> ans;
    rep(i,N) {
        if (M > 0 && K - dist[i] >= 0 && dp[M-1].test(K-dist[i])) {
            ans.emplace_back(i+1);
            K -= dist[i];
            M--;
        }
    }

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

}

Submission Info

Judge Result