oj.uz

답안 #827528

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
827528 2023-08-16T14:22:29 Z MasterTaster 바이오칩 (IZhO12_biochips) C++14
50 / 100
 299 ms 524288 KB 
#include <bits/stdc++.h>

#define ll long long
#define pii pair<int, int>
#define xx first
#define yy second
#define pb push_back
#define MAXN 200010
#define MAXM 510
#define MAXX 100000000000010LL

using namespace std;

int n, m, p[MAXN], w[MAXN], gde[MAXN], r[MAXN];
ll dp[MAXN][MAXM];
bool bio[MAXN];
vector<int> g[MAXN], svi;
void dfs(int u)
{
	bio[u]=true;

	svi.pb(u);
	gde[u]=svi.size()-1;
	for (int i=0; i<=m; i++) dp[gde[u]][i]=-MAXX;
	dp[gde[u]][1]=w[u];
	dp[gde[u]][0]=0;

	for (auto v:g[u])
	{
		if (!bio[v])
			dfs(v);
	}

	r[u]=svi.size();
	///cout<<u<<":"<<endl;
	///for (int i=0; i<=m; i++) cout<<dp[u][i]<<" ";
	///cout<<endl;
}

int main(){
	cin>>n>>m;

	int koren=1;
	for (int i=1; i<=n; i++)
	{
		cin>>p[i]>>w[i];
		if (p[i]==0) { koren=i; continue; }
		g[p[i]].pb(i); g[i].pb(p[i]);
	}

	dfs(koren);

	//for (int i=0; i<svi.size(); i++) cout<<svi[i]<<" ";
	//cout<<endl;

	for (int i=svi.size()-1; i>=0; i--)
	{
		for (int j=0; j<=m; j++)
		{
			if (j==0) { dp[i][j]=0; continue; }
			if (i!=svi.size()-1) dp[i][j]=max(dp[i][j], dp[i+1][j]);
			//else dp[i][1]=w[svi[i]];
			if (r[svi[i]]<svi.size()) dp[i][j]=max(dp[i][j], dp[r[svi[i]]][j-1]+w[svi[i]]);

			//cout<<i<<" "<<j<<": "<<dp[i][j]<<endl;
		}
	}
	cout<<dp[0][m];
}

Compilation message

biochips.cpp: In function 'int main()':
biochips.cpp:61:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |    if (i!=svi.size()-1) dp[i][j]=max(dp[i][j], dp[i+1][j]);
      |        ~^~~~~~~~~~~~~~
biochips.cpp:63:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |    if (r[svi[i]]<svi.size()) dp[i][j]=max(dp[i][j], dp[r[svi[i]]][j-1]+w[svi[i]]);
      |        ~~~~~~~~~^~~~~~~~~~~

Subtask #1
50.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Incorrect 2 ms 4980 KB Output isn't correct
3 Correct 3 ms 5332 KB Output is correct
4 Correct 20 ms 40988 KB Output is correct
5 Correct 24 ms 45524 KB Output is correct
6 Correct 27 ms 45540 KB Output is correct
7 Runtime error 299 ms 524288 KB Execution killed with signal 9
8 Runtime error 283 ms 524288 KB Execution killed with signal 9
9 Runtime error 258 ms 524288 KB Execution killed with signal 9
10 Runtime error 287 ms 524288 KB Execution killed with signal 9