oj.uz

Submission #432998

# Submission time Handle Problem Language Result Execution time Memory
432998 2021-06-18T17:21:59 Z REALITYNB Friend (IOI14_friend) C++17
19 / 100
 2 ms 460 KB 
#include <bits/stdc++.h>
#define pii pair<int,int>
#define F first
#define S second
#define mp make_pair
#include "friend.h"
using namespace std;
const int N = 3e5+1 ;
int findSample(int n , int* v, int* p , int* protocol ){
    vector<int> adj[n] ;
    vector<vector<int>> mem(n,vector<int>(2,-1));
    for(int i=1;i<n;i++) adj[p[i]].push_back(i) ;
    function<int(int,int,int)> dfs = [&](int a , int s,int p){
        if(mem[a][s]!=-1) return mem[a][s] ;
        int sum=(s?v[a]:0);
        for(int x: adj[a]){
            if(x==p) continue ;
            sum+=max(dfs(x,0,a),dfs(x,s^1,a)) ;
        }
        mem[a][s]=sum ;
        return sum ;
    };
    return max(dfs(0,0,0),dfs(0,1,0)) ;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 308 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 1 ms 296 KB Output isn't correct
4 Halted 0 ms 0 KB -