Submission #9880111
Source Code Expand
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define rep(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, m, n) for(int i=(m); i<(n); ++i)
#define rrep(i, n) for(int i=(n)-1; i>=0; --i)
#define rfor(i, m, n) for(int i=(m); i>=(n); --i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define mp make_pair
#define pb push_back
#define eb emplace_back
using namespace std;
using LL = long long; using ld = long double;
using VB = vector<bool>; using VVB = vector<VB>;
using VI = vector<int>; using VVI = vector<VI>;
using VL = vector<LL>; using VVL = vector<VL>;
using VS = vector<string>; using VD = vector<double>;
using PII = pair<int, int>; using VP = vector<PII>;
using PLL = pair<LL, LL>; using VPL = vector<PLL>;
template<class T>using Grid = vector<vector<T>>;
template<class T>using PQ = priority_queue<T>;
template<class T>using PQS = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = (int)1e9;
constexpr LL inf_ll = (LL)1e18, MOD = 1000000007;
constexpr ld PI = M_PI, EPS = 1e-12;
template<class T>inline void Sort(T& a)noexcept { sort(all(a)); }
template<class T>inline void RSort(T& a)noexcept { sort(rall(a)); }
template<class T>inline void Reverse(T& a)noexcept { reverse(all(a)); }
template<class T>inline void Unique(T& a)noexcept { a.erase(unique(all(a)), a.end()); }
template<class T>inline T Sorted(T a)noexcept { Sort(a); return a; }
template<class T>inline T RSorted(T a)noexcept { RSort(a); return a; }
template<class T>inline T Reversed(T a)noexcept { Reverse(a); return a; }
template<class T>inline T Uniqued(T a)noexcept { Unique(a); return a; }
template<class T>inline auto Max(const T& a)noexcept { return *max_element(all(a)); }
template<class T>inline auto Min(const T& a)noexcept { return *min_element(all(a)); }
template<class T>inline int MaxPos(const T& a)noexcept { return max_element(all(a)) - a.begin(); }
template<class T>inline int MinPos(const T& a)noexcept { return min_element(all(a)) - a.begin(); }
template<class T, class U>inline int Count(const T& a, const U& v)noexcept { return count(all(a), v); }
template<class T, class U>inline int Find(const T& a, const U& v)noexcept { auto pos = find(all(a), v); return pos == a.end() ? -1 : pos - a.begin(); }
template<class T, class U>inline U Sum(const T& a, const U& v)noexcept { return accumulate(all(a), v); }
template<class T, class U>inline int Lower(const T& a, const U& v)noexcept { return lower_bound(all(a), v) - a.begin(); }
template<class T, class U>inline int Upper(const T& a, const U& v)noexcept { return upper_bound(all(a), v) - a.begin(); }
template<class T, class P>inline void RemoveIf(T& a, P f)noexcept { a.erase(remove_if(all(a), f), a.end()); }
template<class T>inline T Age(T n, T m)noexcept { return (n + m - 1) / m; }
template<class T>inline T Age2(T n, T m)noexcept { return Age(n, m) * m; }
template<class T>inline T Tri(T n)noexcept { return (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1); }
template<class T = long long>inline T BIT(int b)noexcept { return T{ 1 } << b; }
template<class T>inline T Gcd(T n, T m)noexcept { return m ? Gcd(m, n % m) : n; }
template<class T>inline T Lcm(T n, T m)noexcept { return n / Gcd(n, m) * m; }
template<class T>inline T Pow(T a, T n)noexcept { T r = 1; while (n > 0) { if (n & 1)r *= a; a *= a; n /= 2; }return r; }
template<class T>inline T Powmod(T a, T n, T m = MOD)noexcept { T r = 1; while (n > 0) { if (n & 1)r = r * a % m, n--; else a = a * a % m, n /= 2; }return r; }
template<class T>inline bool chmax(T& a, const T& b)noexcept { if (a < b) { a = b; return true; } return false; }
template<class T>inline bool chmin(T& a, const T& b)noexcept { if (a > b) { a = b; return true; } return false; }
template<class T>inline bool inRange(const T& v, const T& min, const T& max)noexcept { return min <= v && v <= max; }
inline string operator*(string s, int n)noexcept { string ret; rep(i, n)ret += s; return ret; }
// --- input --- //
#if defined(_WIN32) || defined(ONLINE_JUDGE)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
inline int gc()noexcept { return getchar_unlocked(); }
template<class T>inline void InputF(T& v)noexcept { cin >> v; }
inline void InputF(char& v)noexcept { while (isspace(v = gc())); }
inline void InputF(string& v)noexcept {
char c; for (InputF(c); !isspace(c); c = gc())v += c;
}
inline void InputF(int& v)noexcept {
bool neg = false; v = 0; char c; InputF(c);
if (c == '-') { neg = true; c = gc(); }
for (; isdigit(c); c = gc())v = v * 10 + (c - '0');
if (neg)v = -v;
}
inline void InputF(long long& v)noexcept {
bool neg = false; v = 0; char c; InputF(c);
if (c == '-') { neg = true; c = gc(); }
for (; isdigit(c); c = gc())v = v * 10 + (LL)(c - '0');
if (neg)v = -v;
}
inline void InputF(double& v)noexcept {
double dp = 1; bool neg = false, adp = false; v = 0; char c; InputF(c);
if (c == '-') { neg = true; c = gc(); }
for (; isdigit(c) || c == '.'; c = gc()) {
if (c == '.')adp = true;
else if (adp)v += (c - '0') * (dp *= 0.1);
else v = v * 10 + (c - '0');
}
if (neg)v = -v;
}
template<class T, class U>inline void InputF(pair<T, U>& v)noexcept {
InputF(v.first); InputF(v.second);
}
template<class T>inline void InputF(vector<T>& v)noexcept {
for (auto& e : v)InputF(e);
}
template<class T>inline T input() { T v; InputF(v); return v; }
struct InputV {
int n, m;
InputV(int N) :n(N), m(0) {}
InputV(pair<int, int> N) :n(N.first), m(N.second) {}
template<class T>operator vector<T>()noexcept {
vector<T> v(n); InputF(v); return v;
}
template<class T>operator vector<vector<T>>()noexcept {
vector<vector<T>> v(n, vector<T>(m)); InputF(v); return v;
}
};
struct Input {
template<class T>operator T()noexcept { return input<T>(); }
int operator--(int) { int v; InputF(v); v--; return v; }
InputV operator[](int n)noexcept { return InputV(n); }
InputV operator[](pair<int, int> n)noexcept { return InputV(n); }
void operator()() {}
template<class H, class...T>void operator()(H&& h, T&& ...t) {
InputF(h); operator()(forward<T>(t)...);
}
template<class T, size_t W>array<vector<T>, W> get(int H) {
array<vector<T>, W> ret;
rep(i, H)rep(j, W) { T x = *this; ret[j].push_back(x); }
return ret;
}
}in;
// --- output --- //
struct BoolStr {
const char* t, * f; BoolStr(const char* _t, const char* _f) :t(_t), f(_f) {}
}Yes("Yes", "No"), yes("yes", "no"), YES("YES", "NO"), Int("1", "0");
struct DivStr {
const char* d, * l; DivStr(const char* _d, const char* _l) :d(_d), l(_l) {}
}spc(" ", "\n"), no_spc("", "\n"), end_line("\n", "\n"), comma(",", "\n"), no_endl(" ", "");
class Output {
BoolStr B{ Yes }; DivStr D{ spc }; bool isPrint = true;
void p(double v) { printf("%.20f", v); } void p(long double v) { printf("%.20Lf", v); }
void p(int v) { printf("%d", v); } void p(LL v) { printf("%lld", v); }
void p(char v) { putchar(v); } void p(bool v) { printf("%s", v ? B.t : B.f); }
template<class T>void p(const T& v) { cout << v; }
template<class T, class U>void p(const pair<T, U>& v) { p(v.first); printf("%s", D.d); p(v.second); }
template<class T>void p(const vector<T>& v) { rep(i, sz(v)) { if (i)printf("%s", D.d); p(v[i]); } }
template<class T>void p(const vector<vector<T>>& v) { rep(i, sz(v)) { if (i)printf("%s", D.l); p(v[i]); } }
void p(const BoolStr& v) { B = v; isPrint = false; } void p(const DivStr& v) { D = v; isPrint = false; }
public:
void operator()() { printf("%s", D.l); }
template<class H>void operator()(H&& h) {
p(h); if (isPrint)printf("%s", D.l); isPrint = true; B = Yes; D = spc;
}
template<class H, class...T>void operator()(H&& h, T&& ...t) {
p(h); if (isPrint)printf("%s", D.d); isPrint = true; operator()(forward<T>(t)...);
}
template<class...T>void exit(T&& ...t) {
operator()(forward<T>(t)...); std::exit(EXIT_SUCCESS);
}
}out;
// --- dump --- //
#if __has_include("dump.hpp")
#include "dump.hpp"
#else
#define dump(...) (void(0))
#endif
// ---------------------------------------------------------------- //
using Weight = long long;
constexpr Weight INF = numeric_limits<Weight>::max();
struct Edge {
int to; Weight cost;
Edge() :to(-1), cost(-1) {}
Edge(int _to, Weight _cost = 1) :to(_to), cost(_cost) {}
};
bool operator>(const Edge& e1, const Edge& e2) { return e1.cost > e2.cost; }
ostream& operator<<(ostream& os, const Edge& e) {
return os << "->" << e.to << '(' << e.cost << ')';
}
struct Edge2 {
int u, v; Weight cost;
Edge2() :u(-1), v(-1), cost(0) {}
Edge2(int _u, int _v, Weight _cost) :u(_u), v(_v), cost(_cost) {}
};
ostream& operator<<(ostream& os, const Edge2& e) {
return os << e.u << "->" << e.v << '(' << e.cost << ')';
}
using Edges = vector<Edge>;
using Graph = vector<Edges>;
using Array = vector<Weight>;
using Matrix = vector<Array>;
using UnWeightedGraph = vector<vector<int>>;
vector<int> ShortestPath(const UnWeightedGraph& g, int s) {
int V = g.size();
vector<int> dist(V);
function<void(int, int, int)> dfs = [&](int v, int p, int depth) {
dist[v] = depth;
for (auto e : g[v])if (e != p) {
dfs(e, v, depth + 1);
}
};
dfs(s, -1, 0);
return dist;
}
vector<int> DescendantNode(const UnWeightedGraph& g, int s) {
int V = g.size();
vector<int> res;
function<void(int)> dfs = [&](int v) {
res.push_back(v);
for (auto e : g[v]) {
dfs(e);
}
};
dfs(s);
return res;
}
int main() {
int n, m, k; in(n, m, k);
int root = -1;
UnWeightedGraph g(n);
rep(i, n) {
int p = in;
if (p == 0) {
root = i;
} else {
g[p - 1].eb(i);
}
}
dump(g);
auto dist = ShortestPath(g, root);
VI ans(m, -1);
set<int> S; rep(i, n)S.insert(i);
int cnt = k - m;
rep(i, m) {
for (auto j : S) { // ans[i] = j
set<int> S2 = S;
auto d = DescendantNode(g, j);
for (auto k : d)S2.erase(k);
VI dist_S2;
for (auto k : S2) {
dist_S2.pb(dist[k]);
}
Sort(dist_S2);
dump(i, j, S2, dist_S2);
int remain = m - i - 1;
if (remain > sz(S2))continue;
int mi = 0, ma = 0;
rep(k, remain)mi += dist_S2[k];
FOR(k, sz(dist_S2) - remain, sz(dist_S2))ma += dist_S2[k];
if (mi <= cnt - dist[j] && cnt - dist[j] <= ma) {
ans[i] = j + 1;
cnt -= dist[j];
S = S2;
break;
}
}
if (ans[i] == -1) {
out.exit(-1);
}
}
out(ans);
}
Submission Info
Submission Time |
|
Task |
F - Coins on the tree |
User |
yuruhiya |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
10555 Byte |
Status |
AC |
Exec Time |
181 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
400 / 400 |
Status |
|
|
Set Name |
Test Cases |
Sample |
s1.txt, s2.txt |
All |
01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, s1.txt, s2.txt |
Case Name |
Status |
Exec Time |
Memory |
01.txt |
AC |
2 ms |
256 KB |
02.txt |
AC |
1 ms |
256 KB |
03.txt |
AC |
1 ms |
256 KB |
04.txt |
AC |
2 ms |
256 KB |
05.txt |
AC |
1 ms |
256 KB |
06.txt |
AC |
16 ms |
256 KB |
07.txt |
AC |
5 ms |
256 KB |
08.txt |
AC |
3 ms |
256 KB |
09.txt |
AC |
9 ms |
256 KB |
10.txt |
AC |
129 ms |
256 KB |
11.txt |
AC |
38 ms |
256 KB |
12.txt |
AC |
89 ms |
256 KB |
13.txt |
AC |
144 ms |
256 KB |
14.txt |
AC |
92 ms |
256 KB |
15.txt |
AC |
48 ms |
256 KB |
16.txt |
AC |
130 ms |
256 KB |
17.txt |
AC |
13 ms |
256 KB |
18.txt |
AC |
119 ms |
256 KB |
19.txt |
AC |
63 ms |
256 KB |
20.txt |
AC |
83 ms |
256 KB |
21.txt |
AC |
27 ms |
256 KB |
22.txt |
AC |
134 ms |
256 KB |
23.txt |
AC |
111 ms |
256 KB |
24.txt |
AC |
79 ms |
256 KB |
25.txt |
AC |
121 ms |
256 KB |
26.txt |
AC |
139 ms |
256 KB |
27.txt |
AC |
147 ms |
256 KB |
28.txt |
AC |
120 ms |
256 KB |
29.txt |
AC |
181 ms |
256 KB |
30.txt |
AC |
121 ms |
256 KB |
31.txt |
AC |
3 ms |
256 KB |
32.txt |
AC |
1 ms |
256 KB |
33.txt |
AC |
2 ms |
256 KB |
34.txt |
AC |
1 ms |
256 KB |
35.txt |
AC |
6 ms |
256 KB |
36.txt |
AC |
7 ms |
256 KB |
37.txt |
AC |
1 ms |
256 KB |
38.txt |
AC |
2 ms |
256 KB |
39.txt |
AC |
2 ms |
256 KB |
40.txt |
AC |
2 ms |
256 KB |
s1.txt |
AC |
1 ms |
256 KB |
s2.txt |
AC |
1 ms |
256 KB |