fork download
copy 
  1. /*
  2. * @Author: hungeazy
  3. * @Date:   2025-11-18 10:50:36
  4. * @Last Modified by:   hungeazy
  5. * @Last Modified time: 2025-11-18 12:02:56
  6. */
  7. #include <bits/stdc++.h>
  8. #include <ext/pb_ds/assoc_container.hpp> 
  9. #include <ext/pb_ds/tree_policy.hpp> 
  10. #pragma GCC optimize("O3")  
  11. #pragma GCC optimize("unroll-loops")  
  12. #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")  
  13. using namespace std;
  14. using namespace __gnu_pbds; 
  15. bool M1;
  16. #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
  17. #define int long long
  18. #define ll long long 
  19. #define ull unsigned long long
  20. #define sz(x) x.size()
  21. #define sqr(x) (1LL * (x) * (x))
  22. #define all(x) x.begin(), x.end()
  23. #define fill(f,x) memset(f,x,sizeof(f))
  24. #define FOR(i,l,r) for(int i=l;i<=r;i++)
  25. #define FOD(i,r,l) for(int i=r;i>=l;i--)
  26. #define debug(x) cout << #x << " = " << x << '\n'
  27. #define ii pair<int,int>
  28. #define iii pair<int,ii>
  29. #define di pair<ii,ii>
  30. #define vi vector<int>
  31. #define vii vector<ii>
  32. #define mii map<int,int>
  33. #define fi first
  34. #define se second
  35. #define pb push_back
  36. #define MOD 1000000007
  37. #define __lcm(a,b) (1ll * ((a) / __gcd((a), (b))) * (b))
  38. #define YES cout << "YES\n"
  39. #define NO cout << "NO\n"
  40. #define MASK(i) (1LL << (i))
  41. #define c_bit(i) __builtin_popcountll(i)
  42. #define BIT(x,i) ((x) & MASK(i))
  43. #define SET_ON(x,i) ((x) | MASK(i))
  44. #define SET_OFF(x,i) ((x) & ~MASK(i))
  45. #define oo 1e18
  46. #define name "04"
  47. #define endl '\n'
  48. #define memory() cerr << abs(&M2-&M1)/1024.0/1024 << " MB" << endl
  49. #define time() cerr << endl << "-------------Time:" << 1000.0 * clock() / CLOCKS_PER_SEC << "ms." << endl
  50. template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
  51. template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
  52. template <class T> using ordered_set = tree <T, null_type, less_equal <T>, rb_tree_tag,tree_order_statistics_node_update>;
  53. const int N = (int)5e5+10;
  54. int n,q,p[N],t[N],l[N];
  55. vi g[N];
  56.  
  57. struct Query {
  58. 	int u,x;
  59. } query[N];
  60.  
  61. namespace sub1 {
  62.  
  63. 	bool approved() {
  64. 		FOR(i,2,n)
  65. 			if (p[i] != 1) return false;
  66. 		return n <= 2e3 and q <= 2e3;
  67. 	}
  68.  
  69. 	void solve(void)
  70. 	{
  71. 		FOR(i,1,q)
  72. 		{
  73. 			int u = query[i].u, x = query[i].x;
  74. 			l[u] += x;
  75. 			int ans = 0, cur = (l[1] >= t[1]);
  76. 			maximize(ans,cur);
  77. 			FOR(j,2,n) maximize(ans,cur+(l[1]+l[j] >= t[j]));
  78. 			cout << ans << endl;
  79. 		}
  80. 	}
  81.  
  82. }
  83.  
  84. namespace sub2 {
  85.  
  86. 	bool approved() {
  87. 		FOR(i,2,n) 
  88. 			if (p[i] != i-1) return false;
  89. 		return n <= 2e3 and q <= 2e3;
  90. 	}
  91.  
  92. 	void solve(void)
  93. 	{
  94. 		int ans = 0;
  95. 		FOR(i,1,q)
  96. 		{
  97. 			int u = query[i].u, x = query[i].x;
  98. 			l[u] += x;
  99. 			int val = 0, ans = 0;
  100. 			FOR(j,1,n)
  101. 			{
  102. 				val += l[j];
  103. 				if (val >= t[j]) ans++;
  104. 			}
  105. 			cout << ans << endl;
  106. 		}
  107. 	}
  108.  
  109. }
  110.  
  111. namespace sub3 {
  112.  
  113. 	bool approved() {
  114. 		FOR(i,2,n)
  115. 			if (p[i] != i-1) return false;
  116. 		return true;
  117. 	}
  118.  
  119. 	struct SegmentTree {
  120. 		struct Node {
  121. 			int mn,mx;
  122. 			Node() {};
  123. 			Node(int _mn, int _mx):
  124. 				mn(_mn), mx(_mx) {};
  125. 			friend Node operator+(const Node &L, const Node &R)
  126. 			{
  127. 				Node res;
  128. 				res.mx = max(L.mx,R.mx);
  129. 				res.mn = min(L.mn,R.mn);
  130. 				return res;
  131. 			}
  132. 		};
  133. 		vector<Node> st;
  134. 		vi lazy;
  135. 		int n;
  136.  
  137. 		SegmentTree() {};
  138. 		SegmentTree(int _n):
  139. 			n(_n), st((_n<<2)+1,Node()), lazy((_n<<2)+1,0) {};
  140.  
  141. 		void down(int id)
  142. 		{
  143. 			if (!lazy[id]) return;
  144. 			int &k = lazy[id];
  145. 			for (int i : {id<<1,id<<1|1})
  146. 			{
  147. 				st[i].mn += k;
  148. 				st[i].mx += k;
  149. 				lazy[i] += k;
  150. 			}
  151. 			k = 0;
  152. 		}
  153.  
  154. 		void build(int id, int l, int r)
  155. 		{
  156. 			if (l == r)
  157. 			{
  158. 				st[id] = Node(-t[l],-t[l]);
  159. 				return;
  160. 			}
  161. 			int mid = (l+r)>>1;
  162. 			build(id<<1,l,mid);
  163. 			build(id<<1|1,mid+1,r);
  164. 			st[id] = st[id<<1]+st[id<<1|1];
  165. 		}
  166.  
  167. 		void update(int id, int l, int r, int u, int v, int val)
  168. 		{
  169. 			if (l > v or r < u) return;
  170. 			if (l >= u and r <= v)
  171. 			{
  172. 				st[id].mn += val;
  173. 				st[id].mx += val;
  174. 				lazy[id] += val;
  175. 				return;
  176. 			}
  177. 			int mid = (l+r)>>1; down(id);
  178. 			update(id<<1,l,mid,u,v,val);
  179. 			update(id<<1|1,mid+1,r,u,v,val);
  180. 			st[id] = st[id<<1]+st[id<<1|1];
  181. 		}
  182.  
  183. 		int get(int id, int l, int r)
  184. 		{
  185. 			if (st[id].mx < 0) return 0;
  186. 			if (st[id].mn >= 0) return r-l+1;
  187. 			if (l == r) return (st[id].mn >= 0);
  188. 			int mid = (l+r)>>1; down(id);
  189. 			return get(id<<1,l,mid)+get(id<<1|1,mid+1,r);
  190. 		}
  191. 	} IT;
  192.  
  193. 	void solve(void)
  194. 	{
  195. 		IT = SegmentTree(n);
  196. 		IT.build(1,1,n);
  197. 		FOR(i,1,q)
  198. 		{
  199. 			int u = query[i].u, x = query[i].x;
  200. 			IT.update(1,1,n,u,n,x);
  201. 			cout << IT.get(1,1,n) << endl;
  202. 		}
  203. 	}
  204.  
  205. }
  206.  
  207. bool M2;
  208. signed main()
  209. {
  210.     fast;
  211.     if (fopen(name".inp","r"))
  212.     {
  213.     	freopen(name".inp","r",stdin);
  214.     	freopen(name".out","w",stdout);
  215.     }
  216.     cin >> n >> q;
  217.     FOR(i,2,n)
  218.     {
  219.     	cin >> p[i];
  220.     	g[i].pb(p[i]); g[p[i]].pb(i);
  221.     }
  222.     FOR(i,1,n) cin >> t[i];
  223.     FOR(i,1,q) cin >> query[i].u >> query[i].x;
  224.     if (sub1::approved()) return sub1::solve(), time(), memory(), 0;
  225.     // if (sub2::approved()) return sub2::solve(), time(), memory(), 0;
  226.     if (sub3::approved()) return sub3::solve(), time(), memory(), 0;
  227.     time();
  228.     memory();
  229.     return 0;
  230. }
  231. // ██░ ██  █    ██  ███▄    █   ▄████
  232. //▓██░ ██▒ ██  ▓██▒ ██ ▀█   █  ██▒ ▀█▒
  233. //▒██▀▀██░▓██  ▒██░▓██  ▀█ ██▒▒██░▄▄▄░
  234. //░▓█ ░██ ▓▓█  ░██░▓██▒  ▐▌██▒░▓█  ██▓
  235. //░▓█▒░██▓▒▒█████▓ ▒██░   ▓██░░▒▓███▀▒
  236. // ▒ ░░▒░▒░▒▓▒ ▒ ▒ ░ ▒░   ▒ ▒  ░▒   ▒
  237. // ▒ ░▒░ ░░░▒░ ░ ░ ░ ░░   ░ ▒░  ░   ░
  238. // ░  ░░ ░ ░░░ ░ ░    ░   ░ ░ ░ ░   ░
  239. // ░  ░  ░   ░              ░       ░
Success #stdin #stdout #stderr 0.01s 18212KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
stderr
copy 
-------------Time:8.164ms.
30.5183 MB
https://ideone.com/uBrqM3
language:
C++14 (gcc 8.3)
created:
6 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!