oj.uz

Submission #335097

# Submission time Handle Problem Language Result Execution time Memory
335097 2020-12-11T06:36:36 Z daniel920712 Friend (IOI14_friend) C++14
35 / 100
 3 ms 2924 KB 
#include "friend.h"
#include <iostream>
#include <vector>

// Find out best sample
using namespace std;
int what[100005];
vector < int > Next[100005];
bool have[5][100005]={0};
int DP[5][100005]={0};
int how[100005];
int F(int x,int y,int fa)
{
    if(have[x][y]) return DP[x][y];
    have[x][y]=1;
    for(auto i:Next[y])
    {
        if(i==fa) continue;
        if(x==0) DP[x][y]+=max(F(0,i,y),F(1,i,y));
        else DP[x][y]+=F(0,i,y);
    }
    if(x==1) DP[x][y]+=how[y];
    return DP[x][y];
}
int findSample(int n,int confidence[],int host[],int protocol[])
{
	int ans=0,i,x=0,y=0;
	what[0]=0;
	x+=confidence[0];
	if(protocol[1]==1) ans+=confidence[0];
	if(protocol[1]==0)
    {
        for(i=0;i<n;i++) how[i]=confidence[i];

        for(i=1;i<n;i++)
        {
            Next[host[i]].push_back(i);
            Next[i].push_back(host[i]);
        }
        return max(F(0,0,-1),F(1,0,-1));
    }
    else
    {
        for(i=1;i<n;i++)
        {
            if(protocol[i]==1) ans+=confidence[i];
            else ans=max(ans,confidence[i]);
        }
    }



	return max(max(x,y),ans);
}

Subtask #1
0 / 11.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
8.0 / 8.0

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

Subtask #4
19.0 / 19.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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