Submission #502806

#	Time	Username	Problem	Language	Result	Execution time	Memory
502806		tmn2005	Biochips (IZhO12_biochips)	C++17	100 / 100	351 ms	417424 KiB

biochips

#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 1e6+12,INF=1e9+7;
vector <int> g[N];
int l[N],cnt=1,n,m,w[N],ves[N],dp[200001][501];
void dfs(int x){
    int t = cnt,i;
    for (i=0;i<g[x].size();++i){
        dfs(g[x][i]);
    }
    ves[cnt]=w[x];
    l[cnt++]=t;
}
 
 
 
main(){
    int s=0,i,j;
    cin>>n>>m;
    for (i=1;i<=n;++i){
        int a,b;
        cin>>a>>w[i];
        g[a].pb(i);
    }
    dfs(0);
 
    for(int i = 0; i <= n; ++i)
        for(int j = 1; j <= m; ++j)
            dp[i][j] = -INF;
            
    for (i=1;i<=n;++i){
        for (j=1;j<=m;++j){
            dp[i][j] = max(dp[i-1][j],dp[l[i]-1][j-1]+ves[i]);
        }
    }
    cout <<dp[n][m];
}

Compilation message (stderr)

biochips.cpp: In function 'void dfs(int)':
biochips.cpp:24:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     for (i=0;i<g[x].size();++i){
      |              ~^~~~~~~~~~~~
biochips.cpp: At global scope:
biochips.cpp:33:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   33 | main(){
      | ^~~~
biochips.cpp: In function 'int main()':
biochips.cpp:37:15: warning: unused variable 'b' [-Wunused-variable]
   37 |         int a,b;
      |               ^
biochips.cpp:34:9: warning: unused variable 's' [-Wunused-variable]
   34 |     int s=0,i,j;
      |         ^

• Subtask 1: 100 / 100