oj.uz

Submission #238372

# Submission time Handle Problem Language Result Execution time Memory
238372 2020-06-10T22:50:15 Z oscarsierra12 Friend (IOI14_friend) C++14
58 / 100
 41 ms 6136 KB 
#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][2] ;

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][1] ) x += go( v, 1 ) ;
        rf = x ;
        ///dont take
        x = 0 ;
        int it1 = 0, it2 = 0, rep = 0, rep2 =0 ;
        for ( auto v:G[u][0] ) rep += go(v, 1) ;
        for ( auto v:G[u][1] ) rep2 += go(v, 0) ;
        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++ ;
            }
            x = max ( x, rep2+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][0] ) x += go ( v, 1 ) ;
        rf = x ;
    }
    return rf ;
}

int findSample(int n,int confidence[],int host[],int protocol[]){
    if ( protocol[1] == 2 ) return *max_element ( confidence, confidence+n ) ;
    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) ;
}

Compilation message

friend.cpp: In function 'int go(int, int)':
friend.cpp:30:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while ( it1 < G[u][0].size() ) {
                 ~~~~^~~~~~~~~~~~~~~~
friend.cpp:31: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] ) {
                     ~~~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5760 KB Output is correct
2 Correct 8 ms 5760 KB Output is correct
3 Correct 8 ms 5888 KB Output is correct
4 Correct 8 ms 5760 KB Output is correct
5 Correct 8 ms 5760 KB Output is correct
6 Correct 7 ms 5760 KB Output is correct
7 Correct 8 ms 5760 KB Output is correct
8 Correct 9 ms 5760 KB Output is correct
9 Correct 8 ms 5760 KB Output is correct
10 Correct 8 ms 5760 KB Output is correct
11 Correct 8 ms 5760 KB Output is correct
12 Correct 8 ms 5760 KB Output is correct
13 Correct 9 ms 5888 KB Output is correct
14 Incorrect 7 ms 5760 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5760 KB Output is correct
2 Correct 8 ms 5888 KB Output is correct
3 Correct 9 ms 5760 KB Output is correct
4 Correct 11 ms 5888 KB Output is correct
5 Correct 8 ms 5888 KB Output is correct
6 Correct 9 ms 5888 KB Output is correct
7 Correct 8 ms 5888 KB Output is correct
8 Correct 9 ms 5888 KB Output is correct
9 Correct 8 ms 5888 KB Output is correct
10 Correct 10 ms 5888 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 4992 KB Output is correct
2 Correct 8 ms 4992 KB Output is correct
3 Correct 8 ms 4992 KB Output is correct
4 Correct 8 ms 4992 KB Output is correct
5 Correct 8 ms 4992 KB Output is correct
6 Correct 8 ms 4992 KB Output is correct
7 Correct 7 ms 4992 KB Output is correct
8 Correct 8 ms 4992 KB Output is correct
9 Correct 7 ms 5120 KB Output is correct
10 Correct 7 ms 4992 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5760 KB Output is correct
2 Correct 8 ms 5760 KB Output is correct
3 Correct 7 ms 5760 KB Output is correct
4 Correct 8 ms 5888 KB Output is correct
5 Correct 8 ms 6016 KB Output is correct
6 Correct 8 ms 5888 KB Output is correct
7 Correct 8 ms 5888 KB Output is correct
8 Correct 8 ms 5888 KB Output is correct
9 Correct 8 ms 5760 KB Output is correct
10 Correct 9 ms 5760 KB Output is correct
11 Correct 10 ms 5760 KB Output is correct
12 Correct 8 ms 5888 KB Output is correct
13 Correct 8 ms 5888 KB Output is correct
14 Correct 8 ms 5760 KB Output is correct
15 Correct 8 ms 5888 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 5760 KB Output is correct
2 Correct 8 ms 5940 KB Output is correct
3 Correct 9 ms 5760 KB Output is correct
4 Correct 9 ms 5760 KB Output is correct
5 Correct 9 ms 5760 KB Output is correct
6 Correct 10 ms 5760 KB Output is correct
7 Correct 9 ms 5888 KB Output is correct
8 Correct 7 ms 5760 KB Output is correct
9 Correct 8 ms 6016 KB Output is correct
10 Correct 9 ms 6016 KB Output is correct
11 Correct 8 ms 6016 KB Output is correct
12 Correct 8 ms 5888 KB Output is correct
13 Correct 8 ms 5888 KB Output is correct
14 Correct 8 ms 5888 KB Output is correct
15 Correct 8 ms 5888 KB Output is correct
16 Correct 9 ms 5888 KB Output is correct
17 Correct 8 ms 5760 KB Output is correct
18 Correct 8 ms 5760 KB Output is correct
19 Correct 8 ms 5888 KB Output is correct
20 Correct 10 ms 5888 KB Output is correct
21 Correct 9 ms 5888 KB Output is correct

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 5760 KB Output is correct
2 Correct 9 ms 5888 KB Output is correct
3 Correct 9 ms 5760 KB Output is correct
4 Correct 8 ms 5888 KB Output is correct
5 Correct 8 ms 5760 KB Output is correct
6 Correct 10 ms 5812 KB Output is correct
7 Correct 8 ms 5888 KB Output is correct
8 Correct 8 ms 5888 KB Output is correct
9 Correct 8 ms 5760 KB Output is correct
10 Correct 8 ms 5888 KB Output is correct
11 Correct 8 ms 5760 KB Output is correct
12 Incorrect 41 ms 6136 KB Output isn't correct
13 Halted 0 ms 0 KB -