oj.uz

Submission #137819

# Submission time Handle Problem Language Result Execution time Memory
137819 2019-07-28T09:56:59 Z Osama_Alkhodairy Friend (IOI14_friend) C++17
35 / 100
 5 ms 2808 KB 
#include <bits/stdc++.h>
#include "friend.h"
//~ #include "grader.cpp"
using namespace std;

const int N = 100001;

int p[N], dp[N][2];
vector <int> c, v[N];

int find(int x){
    if(p[x] == x) return x;
    return p[x] = find(p[x]);
}
void merge(int x, int y){
    x = find(x);
    y = find(y);
    if(x == y) return;
    p[y] = x;
}
void dfs(int node){
    dp[node][1] = c[node];
    for(auto &i : v[node]){
        dfs(i);
        dp[node][0] += max(dp[i][0], dp[i][1]);
        dp[node][1] += dp[i][0];
    }
}
int findSample(int n, int confidence[], int host[], int protocol[]){
    for(int i = 0 ; i < n ; i++) p[i] = i;
    for(int i = 1 ; i < n ; i++){
        if(protocol[i] == 0){
            v[find(host[i])].push_back(i);
        }
        else if(protocol[i] == 1){
            confidence[find(host[i])] += confidence[i];
            merge(host[i], i);
        }
        else{
            confidence[find(host[i])] = max(confidence[find(host[i])], confidence[i]);
            merge(host[i], i);
        }
    }
    for(int i = 0 ; i < n ; i++){
        c.push_back(confidence[i]);
    }
    dfs(0);
    return max(dp[0][0], dp[0][1]);
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2684 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Incorrect 4 ms 2680 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

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

Subtask #3
8.0 / 8.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2652 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2808 KB Output is correct
6 Correct 5 ms 2728 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2808 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2684 KB Output is correct
13 Correct 4 ms 2680 KB Output is correct
14 Correct 4 ms 2684 KB Output is correct
15 Correct 4 ms 2680 KB Output is correct

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Incorrect 4 ms 2680 KB Output isn't correct
8 Halted 0 ms 0 KB -