oj.uz

Submission #93791

# Submission time Handle Problem Language Result Execution time Memory
93791 2019-01-11T11:51:41 Z Bodo171 Friend (IOI14_friend) C++14
19 / 100
 55 ms 12536 KB 
#include "friend.h"
#include <vector>
#include <iostream>
// Find out best sample
using namespace std;
const int nmax=100005;
vector<int> v[nmax],ad[nmax],inloc[nmax];
int sum[nmax][2],best[nmax][2];
int a[nmax],val[nmax];
int nr,p,tip;
void dfs(int x)
{
    for(int i=0;i<v[x].size();i++)
       dfs(v[x][i]);
    nr=0;
    for(int i=0;i<v[x].size();i++)
    {
        a[++nr]=v[x][i];
        sum[nr][0]=sum[nr-1][0]+best[a[nr]][0];
        sum[nr][1]=sum[nr-1][1]+max(best[a[nr]][0],best[a[nr]][1]);
    }
    best[x][1]=sum[nr][0]+val[x];
    for(int i=0;i<ad[x].size();i++)
    {
        p=0;
        while(a[p]<ad[x][i])
            p++;
        p--;
        best[x][1]=max(best[x][0],sum[p][0]+sum[nr][1]-sum[p][1]+val[ad[x][i]]);
        best[x][1]=max(best[x][1],sum[nr][0]+val[x]+val[ad[x][i]]);
    }
    for(int i=0;i<inloc[x].size();i++)
    {
        p=0;
        while(a[p]<inloc[x][i])
            p++;
        p--;
        best[x][1]=max(best[x][1],val[inloc[x][i]]+sum[nr][1]-sum[p][1]+sum[p][0]);
    }
    for(int i=0;i<v[x].size();i++)
        best[x][0]+=max(best[v[x][i]][0],best[v[x][i]][1]);
}
int findSample(int n,int confidence[],int host[],int protocol[]){
    for(int i=0;i<n;i++)
        val[i]=confidence[i];
    for(int i=1;i<n;i++)
    {
        tip=protocol[i];
        if(tip==0)
        {
            v[host[i]].push_back(i);
        }
        if(tip==1)
        {
            ad[host[i]].push_back(i);
        }
        if(tip==2)
        {
            inloc[host[i]].push_back(i);
        }
    }
    dfs(0);
	return max(best[0][0],best[0][1]);
}

Compilation message

friend.cpp: In function 'void dfs(int)':
friend.cpp:13:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<v[x].size();i++)
                 ~^~~~~~~~~~~~
friend.cpp:16:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<v[x].size();i++)
                 ~^~~~~~~~~~~~
friend.cpp:23:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<ad[x].size();i++)
                 ~^~~~~~~~~~~~~
friend.cpp:32:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<inloc[x].size();i++)
                 ~^~~~~~~~~~~~~~~~
friend.cpp:40:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<v[x].size();i++)
                 ~^~~~~~~~~~~~

Subtask #1
0 / 11.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 7448 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 8 ms 7544 KB Output is correct
2 Correct 7 ms 7416 KB Output is correct
3 Correct 8 ms 7416 KB Output is correct
4 Correct 8 ms 7416 KB Output is correct
5 Correct 8 ms 7416 KB Output is correct
6 Correct 9 ms 7388 KB Output is correct
7 Correct 7 ms 7416 KB Output is correct
8 Correct 8 ms 7416 KB Output is correct
9 Correct 7 ms 7416 KB Output is correct
10 Correct 8 ms 7420 KB Output is correct
11 Correct 8 ms 7420 KB Output is correct
12 Correct 8 ms 7416 KB Output is correct
13 Correct 8 ms 7464 KB Output is correct
14 Correct 8 ms 7416 KB Output is correct
15 Correct 8 ms 7416 KB Output is correct

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 7536 KB Output is correct
2 Correct 8 ms 7416 KB Output is correct
3 Correct 7 ms 7416 KB Output is correct
4 Correct 7 ms 7416 KB Output is correct
5 Correct 7 ms 7416 KB Output is correct
6 Correct 8 ms 7412 KB Output is correct
7 Correct 7 ms 7416 KB Output is correct
8 Correct 8 ms 7416 KB Output is correct
9 Correct 8 ms 7416 KB Output is correct
10 Correct 8 ms 7416 KB Output is correct
11 Correct 8 ms 7416 KB Output is correct
12 Incorrect 55 ms 12536 KB Output isn't correct
13 Halted 0 ms 0 KB -