oj.uz

답안 #502808

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
502808 2022-01-06T15:33:50 Z tmn2005 바이오칩 (IZhO12_biochips) C++17
100 / 100
 363 ms 417348 KB 
#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 = 1e6+12,INF=1e9+7;
vector <int> g[N];
int tout[N],o=1,n,k,b[N],a[N],dp[200001][501];

void dfs(int v){
    int t = o;
    for(int to : g[v]){
        dfs(to);
    }
    a[o] = b[v];
    tout[o++] = t;
} 
main(){
    cin>>n>>k;
    for (int i=1;i<=n;++i){
        int a;
        cin>>a>>b[i];
        g[a].pb(i);
    }
    dfs(0);
	for(int i = 0; i <= n; ++i)
        for(int j = 1; j <= k; ++j)
            dp[i][j] = -INF;
      
	for(int i=1; i<=n; i++){
		for(int j=1; j<=k; j++){
			dp[i][j] = max(dp[i-1][j], dp[tout[i]-1][j-1] + a[i]);
		}
	}
	cout<<dp[n][k];
}

Compilation message

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

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23756 KB Output is correct
2 Correct 14 ms 23764 KB Output is correct
3 Correct 12 ms 23924 KB Output is correct
4 Correct 25 ms 41400 KB Output is correct
5 Correct 26 ms 43612 KB Output is correct
6 Correct 32 ms 43596 KB Output is correct
7 Correct 273 ms 315772 KB Output is correct
8 Correct 255 ms 315968 KB Output is correct
9 Correct 296 ms 379944 KB Output is correct
10 Correct 363 ms 417348 KB Output is correct