oj.uz

답안 #155145

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
155145 2019-09-26T16:41:48 Z Mercenary 친구 (IOI14_friend) C++14
8 / 100
 3 ms 380 KB 
#include "friend.h"
#include <bits/stdc++.h>

using namespace std;
const int maxn = 1e5 + 5;

int dp[maxn][2];

int findSample(int n,int confidence[],int host[],int protocol[]){
    for(int i = n - 1 ; i >= 0 ; --i){
        int u = host[i];
        dp[i][0] += confidence[i];
        if(protocol[i] == 0){
            dp[u][0] += dp[i][1];
            dp[u][1] += dp[i][0];
        }else if(protocol[i] == 1){
            dp[u][0] += dp[i][0];
            dp[u][1] += dp[i][1];
        }else{
            dp[u][0] += dp[i][1];
            dp[u][1] += dp[i][1];
        }
        dp[u][0] = max(dp[u][0] , dp[u][1]);
    }
    return dp[0][0];
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -