| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 238390 | oscarsierra12 | 친구 (IOI14_friend) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
//#include "friend.h"
#include <bits/stdc++.h>
#define pb push_back
using namespace std ;
// Find out best sample
const int N = 100010 ;
int confi[N] ;
int dp [N][2];
vector <int> G[N][3] ;
int conf[N], ho[N], pro[N] ;
int go ( int u, int flag ) {
auto &rf = dp[u][flag];
if ( rf!=-1 ) return rf ;
if ( flag ) {
///take
int x = confi[u] ;
for ( auto v:G[u][0] ) x += go( v, 0 ) ;
for ( auto v:G[u][2] ) x += go( v, 0 ) ;
for ( auto v:G[u][1] ) x += go( v, 1 ) ;
rf = x ;
///dont take
x = 0 ;
int it1 = 0, it2 = 0, it3 = 0, rep3 = 0, ini= 0, rep = 0, repp = 0,repp2= 0,rep2 =0, itLast = 0 ;
for ( auto v:G[u][0] ) rep += go(v, 1), repp += go(v,0) ;
for ( auto v:G[u][1] ) rep2 += go(v, 0) ;
for ( auto v:G[u][2] ) ini += go(v,0);
repp2 = rep2 ;
G[u][0].push_back ( 100002 ) ;
while ( it1 < G[u][0].size() ) {
while ( it2 < G[u][1].size() && G[u][1][it2] < G[u][0][it1] ) {
rep2 -= go(G[u][1][it2], 0) ;
rep2 += go(G[u][1][it2], 1) ;
it2++ ;
}
while ( it3 < G[u][2].size() && G[u][2][it3] < G[u][0][it1] ) {
rep3 = max ( rep3, ini - go(G[u][2][it3],0) + go(G[u][2][it3],1) ) ;
if ( rep3 == ini - go(G[u][2][it3],0) + go(G[u][2][it3],1) ) {
while ( itLast < G[u][1].size() && G[u][1][itLast] < G[u][2][it3] ) repp2 += -go(G[u][1][itLast],0) + go(G[u][1][itLast],1),itLast++ ;
}
it3++ ;
}
x = max ( x, max(rep2+ini, rep3+repp2)+rep ) ;
rep -= go(G[u][0][it1],1) ;
rep += go(G[u][0][it1],0) ;
it1++ ;
}
rf = max ( rf, x ) ;
}
else {
int x = 0 ;
for ( auto v:G[u][1] ) x += go ( v, 0 ) ;
for ( auto v:G[u][2] ) x += go(v,0) ;
for ( auto v:G[u][0] ) x += go ( v, 1 ) ;
rf = x ;
}
return rf ;
}
int findSample(int n,int confidence[],int host[],int protocol[]){
for ( int i = 0 ; i < n ; ++i ) confi[i] = confidence[i] ;
for ( int i = 1 ; i < n ; ++i ) G[host[i]][protocol[i]].push_back ( i ) ;
memset ( dp,-1,sizeof dp ) ;
return go(0,1) ;
}
int main() {
int n ; cin >> n;
for ( int i = 0 ; i < n ;++i ) cin >> conf[i] ;
for ( int i = 1 ; i < n ; ++i ) cin >> ho[i] >> pro[i] ;
cout << findSample ( n, conf, ho, pro ) << endl ;
}