제출 #198649

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
198649		arnold518	Magic Tree (CEOI19_magictree)	C++14	15 / 100	184 ms	36984 KiB

magictree

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;

int N, MM, K, D[MAXN+10], W[MAXN+10];
vector<int> adj[MAXN+10];

map<int, ll> M[MAXN+10];

void dfs(int now)
{
	for(int nxt : adj[now])
	{
		dfs(nxt);
		if(M[now].size()<M[nxt].size()) swap(M[now], M[nxt]);
		for(auto it : M[nxt]) M[now][it.first]+=it.second;
	}
	
	if(D[now])
	{
		vector<map<int, ll>::iterator> V;

		ll s=0;
		auto it=M[now].upper_bound(D[now]);
		for(; it!=M[now].end(); it++)
		{
			s+=it->second;
			if(W[now]<s) break;
			V.push_back(it);
		}
		if(it!=M[now].end()) it->second-=W[now];
		for(auto jt : V) M[now].erase(jt);
		M[now][D[now]]+=W[now];
	}
}

int main()
{
	int i, j;

	scanf("%d%d%d", &N, &MM, &K);
	for(i=2; i<=N; i++)
	{
		int u;
		scanf("%d", &u);
		adj[u].push_back(i);
	}

	for(i=1; i<=MM; i++)
	{
		int v, d, w;
		scanf("%d%d%d", &v, &d, &w);
		D[v]=d; W[v]=w;
	}

	dfs(1);
	ll ans=0;
	for(auto it : M[1]) ans+=it.second;
	printf("%lld", ans);
}

컴파일 시 표준 에러 (stderr) 메시지

magictree.cpp: In function 'int main()':
magictree.cpp:44:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
magictree.cpp:46:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &N, &MM, &K);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
magictree.cpp:50:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &u);
   ~~~~~^~~~~~~~~~
magictree.cpp:57:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &v, &d, &w);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 6
• Subtask 2: 3 / 3
• Subtask 3: 0 / 11
• Subtask 4: 12 / 12
• Subtask 5: 0 / 16
• Subtask 6: 0 / 13
• Subtask 7: 0 / 22
• Subtask 8: 0 / 17