제출 #502600

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
502600		tmn2005	바이오칩 (IZhO12_biochips)	C++17	0 / 100	2097 ms	181684 KiB

biochips

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

typedef long long ll;

#define ar array
#define fr first
#define sc second

#define vec vector
#define ret return

#define ins insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front

#define int long long

#define pii pair<int,int>

#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()

#define NeedForSpeed ios::sync_with_stdio(0),cin.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N=2e5
+12,INF=1e9,mod = 1e9+7;
bool iswowel(char n){ n = toupper(n); if(n == 'A' || n == 'O' || n == 'U' || n == 'E' || n == 'I') return true; else return false;}
int n, m, k, x, y, l, r, o, ans, res, ok, mx, mn = INF;
int a[N][505], b[N],d[N], c,sz[N], used[N];
vec<int>g[N];

void dfs(int v){
	int sum=0;
	for(int to : g[v]){
		dfs(to);
		sz[v]+=sz[to];
		sum += g[to].size();
		for(int i=min(sz[v],k); i>=0; i--){
			int mx=0;
			for(int j=min(sz[v],k); j>=0; j--){
				if (j>i)continue;
				mx = max(mx, a[to][j] + a[v][i - j]);	
			}
			d[i] = mx;
		}
		for(int i=min(sz[v],k); i>=0; i--)a[v][i] = d[i];
	}
	if (g[v].size() == 0)sz[v]=1;
	
    a[v][1] = max(a[v][1],b[v]);
}
main(){
    cin>>n>>k;
    for(int i=1; i<=n; i++){
        cin>>x>>y;
        b[i] = y;
        g[x].pb(i);
    }
	dfs(0);
	cout <<a[g[0][0]][k];
    
    ret 0;
}

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

biochips.cpp:56:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   56 | main(){
      | ^~~~

• Subtask 1: 0 / 100