// Cao Quang Hung
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long , long long>
#define vi vector<int>
#define vpii vector<pii>
#define SZ(x) ((int)(x.size()))
#define fi first
#define se second
#define IN(x,y) ((y).find((x))!=(y).end())
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define dem(x) __builtin_popcount(x)
#define Mask(x) (1LL << (x))
#define BIT(x, i) ((x) >> (i) & 1)
#define ln '\n'
#define io_faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
///mt19937 rnd(time(0));
const int INF = 1e9 , mod = 1e9 + 7;
template <class T1, class T2>
inline T1 mul(T1& x, const T2 &k){ return x = (1LL * x * k) % mod; }
template <class T1 , class T2>
inline T1 pw(T1 x, T2 k){T1 res = 1; for (; k ; k >>= 1){ if (k & 1) mul(res, x); mul(x, x); } return res;}
template <class T>
inline bool minimize(T &x, const T &y){ if (x > y){x = y; return 1;} return 0; }
template <class T>
inline bool maximize(T &x, const T &y){ if (x < y){x = y; return 1;} return 0; }
template <class T>
inline void add(T &x , const T &y){ if ((x += y) >= mod) x -= mod; }
template <class T>
inline T product (const T &x , const T &y) { return 1LL * x * y % mod; }
#define PROB "a"
void file(){
if(fopen(PROB".inp", "r")){
freopen(PROB".inp","r",stdin);
freopen(PROB".out","w",stdout);
}
}
void sinh_(){
// srand(time(0));
// freopen(PROB".inp" , "w" , stdout);
// int n;
}
typedef long long ll;
typedef double db;
const int N = 1e5 + 5;
int n, m, k, par[N];
int d[N], w[N] = {};
vi adj[N];
bool sub2 = 1;
void readip(){
cin >> n >> m >> k;
REP(i, 2, n) {
cin >> par[i];
adj[par[i]].eb(i);
}
REP(i, 1, m) {
int v; cin >> v;
cin >> d[v] >> w[v];
if (!adj[v].empty()) sub2 = false;
}
}
namespace sub1{
multiset<int> s[N];
void dfs_tree(int u) {
for (int v : adj[u]) {
dfs_tree(v);
if (s[v].size() > s[u].size())
swap(s[u], s[v]);
for (int x : s[v]) s[u].insert(x);
}
if (w[u] == 0) return;
auto it = s[u].upper_bound(d[u]);
if (it != s[u].end()) s[u].erase(it);
s[u].insert(d[u]);
}
void solve() {
dfs_tree(1);
cout << s[1].size();
}
};
namespace sub4 {
ll sum[N][2] = {}, res = 0;
void dfs_tree(int u) {
if (d[u] == 1) sum[u][0] = w[u];
if (d[u] == 2) sum[u][1] = w[u];
for (int v : adj[u]) {
dfs_tree(v);
sum[u][0] += sum[v][0];
sum[u][1] += sum[v][1];
}
if (sum[u][0] >= sum[u][1]) {
res += sum[u][0];
sum[u][0] = sum[u][1] = 0;
}
}
void solve() {
dfs_tree(1);
cout << res + sum[1][1] << ln;
}
};
namespace subfull{
map<int , ll> f[N];
void dfs_tree(int u) {
for (int v : adj[u]) {
dfs_tree(v);
if (f[u].size() < f[v].size())
swap(f[u], f[v]);
for (auto it : f[v])
f[u][it.fi] += it.se;
}
if (w[u] == 0) return;
f[u][d[u]] += w[u];
auto it = f[u].upper_bound(d[u]);
while(w[u] > 0 && it != f[u].end()) {
if (w[u] >= it -> se) it = f[u].erase(it);
else it -> se -= w[u], w[u] = 0;
}
}
void solve() {
dfs_tree(1);
ll res = 0;
for (auto it : f[1]) res += it.se;
cout << res << ln;
}
};
void solve(){
// int maxw = 0;
// REP(i, 1, n) maximize(maxw, w[i]);
// if (maxw <= 1) {
// sub1::solve();
// return;
// }
// if (sub2) {
// ll res = 0;
// REP(i, 1, n) res += w[i];
// cout << res << ln;
// return;
// }
// if (k <= 2) {
// sub4::solve();
// return;
// }
subfull::solve();
}
int main(){
sinh_();
io_faster
file();
int t = 1;
// cin >> t;
while (t--){
readip();
solve();
}
}
Compilation message
magictree.cpp: In function 'void readip()':
magictree.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
| ^
magictree.cpp:146:5: note: in expansion of macro 'REP'
146 | REP(i, 2, n) {
| ^~~
magictree.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
| ^
magictree.cpp:150:5: note: in expansion of macro 'REP'
150 | REP(i, 1, m) {
| ^~~
magictree.cpp: In function 'void file()':
magictree.cpp:125:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
125 | freopen(PROB".inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
magictree.cpp:126:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
126 | freopen(PROB".out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
13660 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
47 ms |
25028 KB |
Output is correct |
| 2 |
Correct |
31 ms |
26424 KB |
Output is correct |
| 3 |
Correct |
104 ms |
43768 KB |
Output is correct |
| 4 |
Correct |
61 ms |
26576 KB |
Output is correct |
| 5 |
Correct |
86 ms |
28632 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
13912 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
48 ms |
22328 KB |
Output is correct |
| 2 |
Correct |
50 ms |
21508 KB |
Output is correct |
| 3 |
Correct |
40 ms |
26196 KB |
Output is correct |
| 4 |
Correct |
33 ms |
22484 KB |
Output is correct |
| 5 |
Correct |
38 ms |
34128 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
13660 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
6 ms |
14628 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
13660 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
13660 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
