oj.uz

답안 #41120

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
41120 2018-02-13T02:37:58 Z wzy 바이오칩 (IZhO12_biochips) C++11
0 / 100
 2000 ms 415008 KB 
#include <stdio.h>
#include <stdint.h>
#include <string.h>
#include <vector>
#include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
#define eps (int) 1e9
#define pb push_back
int  root , rv[200005],  t = 0 , maxrv = 0 , dp[200005][505] , c[200005] , n , m , st[200005] , ed[200005];
vector<int> adj[200005];

void dfs(int x , int y){
	st[x] = ++t;
	rv[st[x]] = x;
	maxrv = max(maxrv , st[x]);
	for(int i = 0 ; i < adj[x].size() ; i++){
		int v = adj[x][i];
		if(v == y) continue;
		dfs(v,x);
	}
	ed[x] = t;
	return;
}

int solve(int i, int j){
	if(i == ed[rv[maxrv]] + 1 && j < m) return -eps;
	if(dp[i][j] != -1) return dp[i][j];
	if(j == m) return 0;
	if(i > maxrv) return -eps;
	dp[i][j] = 0;
	return dp[i][j] = max(solve(i + 1 , j) , solve(ed[rv[i]] + 1 , j + 1) + c[rv[i]]);
}

int32_t main(){
	scanf("%d%d" , &n , &m);
	memset(dp, -1 , sizeof dp);
	for(int i = 0 ; i <n; i++){
		int x , y;
		scanf("%d%d" , &x, &y);
		c[i] = y;
		if(x == 0){
			root = i;
			continue;
		}
		else{
			adj[i].pb(x-1);
			adj[x-1].pb(i);
		}
	}
	dfs(root, root);
	int qq = solve(st[root] , 0);
	printf("%d\n" , qq);
}

Compilation message

biochips.cpp: In function 'void dfs(int, int)':
biochips.cpp:18:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0 ; i < adj[x].size() ; i++){
                    ^
biochips.cpp: In function 'int32_t main()':
biochips.cpp:37:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d" , &n , &m);
                         ^
biochips.cpp:41:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d" , &x, &y);
                         ^

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 287 ms 400248 KB Output is correct
2 Correct 286 ms 400456 KB Output is correct
3 Correct 288 ms 400512 KB Output is correct
4 Correct 312 ms 401356 KB Output is correct
5 Correct 311 ms 401556 KB Output is correct
6 Correct 336 ms 401556 KB Output is correct
7 Execution timed out 2065 ms 415008 KB Time limit exceeded
8 Halted 0 ms 0 KB -