oj.uz

Submission #827524

# Submission time Handle Problem Language Result Execution time Memory
827524 2023-08-16T14:20:43 Z MasterTaster Biochips (IZhO12_biochips) C++14
90 / 100
 457 ms 413632 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 100000010

using namespace std;

int n, m, p[MAXN], w[MAXN], gde[MAXN], r[MAXN], 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;
	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:59:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |    if (i!=svi.size()-1) dp[i][j]=max(dp[i][j], dp[i+1][j]);
      |        ~^~~~~~~~~~~~~~
biochips.cpp:61:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |    if (r[svi[i]]<svi.size()) dp[i][j]=max(dp[i][j], dp[r[svi[i]]][j-1]+w[svi[i]]);
      |        ~~~~~~~~~^~~~~~~~~~~

Subtask #1
90.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5016 KB Output is correct
2 Incorrect 2 ms 4948 KB Output isn't correct
3 Correct 2 ms 5204 KB Output is correct
4 Correct 14 ms 23296 KB Output is correct
5 Correct 17 ms 25596 KB Output is correct
6 Correct 17 ms 25492 KB Output is correct
7 Correct 297 ms 308160 KB Output is correct
8 Correct 405 ms 308212 KB Output is correct
9 Correct 371 ms 374784 KB Output is correct
10 Correct 457 ms 413632 KB Output is correct