제출 #238392

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
238392		oscarsierra12	친구 (IOI14_friend)	C++14	100 / 100	90 ms	14456 KiB

friend

#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 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] ) {
                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++ ;
               rep3 = max ( rep3, ini - go(G[u][2][it3],0) + go(G[u][2][it3],1) + repp2 ) ;
               it3++ ;
            }
            x = max ( x, max(rep2+ini, rep3)+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) ;
}

컴파일 시 표준 에러 (stderr) 메시지

friend.cpp: In function 'int go(int, int)':
friend.cpp:34:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while ( it1 < G[u][0].size() ) {
                 ~~~~^~~~~~~~~~~~~~~~
friend.cpp:35:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while ( it2 < G[u][1].size() && G[u][1][it2] < G[u][0][it1] ) {
                     ~~~~^~~~~~~~~~~~~~~~
friend.cpp:40:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while ( it3 < G[u][2].size() && G[u][2][it3] < G[u][0][it1] ) {
                     ~~~~^~~~~~~~~~~~~~~~
friend.cpp:41:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 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++ ;
                         ~~~~~~~^~~~~~~~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 19 / 19
• Subtask 5: 23 / 23
• Subtask 6: 31 / 31