oj.uz

답안 #41126

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
41126 2018-02-13T03:13:27 Z wzy 바이오칩 (IZhO12_biochips) C++14
0 / 100
 2000 ms 472108 KB 
#include <bits/stdc++.h>
using namespace std;
#define eps (int) 1e9
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define pb push_back
int  root , rv[200005],  t = -1 , maxrv = 0 , dp[200005][505] , c[200005] , n , m , st[200005] , ed[200005];
vector<int> adj[200005];
bool vis[200005][505];
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(j == m) return 0;
	if(i > maxrv) return -eps;
	if(vis[i][j]) return dp[i][j];
	vis[i][j] = true;
	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(0 , 0);
	printf("%d\n" , qq);
}

Compilation message

biochips.cpp: In function 'void dfs(int, int)':
biochips.cpp:14: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:32: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:36: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 288 ms 400376 KB Output is correct
2 Correct 282 ms 400388 KB Output is correct
3 Correct 283 ms 400640 KB Output is correct
4 Correct 302 ms 405840 KB Output is correct
5 Correct 310 ms 406552 KB Output is correct
6 Correct 313 ms 406624 KB Output is correct
7 Execution timed out 2049 ms 472108 KB Time limit exceeded
8 Halted 0 ms 0 KB -