LeetCode Weekly Contest 264
問題文
省略
省略
C++に変換後のコードはこちら
#define main dummy_main
{}
#undef main
int N, M, A[1d5], B[], sz[];
ll score[], mx;
graph g;
class Solution {
public:
int countHighestScoreNodes(VI& p) {
dummy_main();
int res = 0, rem;
N = p.size();
M = 0;
rep(i,1,N) arrInsert(M, M, A, i, B, p[i]);
g.setEdgeRootedTree(N,M,A,B);
g.SubTreeSize(0, sz);
rep(i,N){
score[i] = 1;
rem = N - 1;
rep[g.edge[i]](j,g.es[i]){
score[i] *= sz[j];
rem -= sz[j];
}
if(rem > 1) score[i] *= rem;
}
mx = max(score(N));
return sum[i,0,N @ score[i] == mx](1);
}
};
Current time: 2024年04月27日04時34分57秒
Last modified: 2021年10月24日16時04分19秒 (by laycrs)
Tags: Competitive_Programming_Incomplete LeetCode
トップページに戻る
Logged in as: unknown user (not login)