제출 #1095755

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1095755		alexander707070	Magic Tree (CEOI19_magictree)	C++14	34 / 100	85 ms	40764 KiB

magictree

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

int n,m,k,p[MAXN],a,d,w;
pair<int,int> cost[MAXN];
vector<int> v[MAXN];

long long dp[MAXN][27];
bool vis[MAXN][27];

long long ff(int x,int day){
	if(vis[x][day])return dp[x][day];
	vis[x][day]=true;

	if(day==cost[x].first)dp[x][day]+=cost[x].second;

	for(int i=0;i<v[x].size();i++){
		dp[x][day]+=ff(v[x][i],day);
	}

	if(day>1)dp[x][day]=max(dp[x][day],ff(x,day-1));

	return dp[x][day];
}

int main(){

	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	cin>>n>>m>>k;
	for(int i=2;i<=n;i++){
		cin>>p[i];
		v[p[i]].push_back(i);
	}

	for(int i=1;i<=m;i++){
		cin>>a>>d>>w;
		cost[a]={d,w};
	}

	cout<<ff(1,20)<<"\n";

    return 0;
}

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

magictree.cpp: In function 'long long int ff(int, int)':
magictree.cpp:18:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |  for(int i=0;i<v[x].size();i++){
      |              ~^~~~~~~~~~~~

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