oj.uz

Submission #424220

# Submission time Handle Problem Language Result Execution time Memory
424220 2021-06-11T18:10:17 Z Charis02 Friend (IOI14_friend) C++14
19 / 100
 1 ms 460 KB 
#include "friend.h"
#include<iostream>
#include<vector>
#include<string.h>
#define rep(i,a,b) for(int i = a;i < b;i++)
#define N 1004

using namespace std;

vector < int > graph[N];
int conf[N];
int dp[N][2];

int calc(int cur,int par,int choose)
{
    int res = 0;

    if(dp[cur][choose]!=-1)
        return dp[cur][choose];

    if(choose)
    {
        res = conf[cur];

        rep(i,0,graph[cur].size())
        {
            int v = graph[cur][i];

            if(v == par)
                continue;
            res += calc(v,cur,0);
        }
    }
    else
    {
        rep(i,0,graph[cur].size())
        {
            int v = graph[cur][i];

            if(v == par)
                continue;
            res += max(calc(v,cur,0),calc(v,cur,1));
        }
    }

    return dp[cur][choose] = res;
}

int findSample(int n,int confidence[],int host[],int protocol[])
{
    rep(i,0,n)
    {
        conf[i] = confidence[i];
        if(i == 0)
            continue;

        graph[host[i]].push_back(i);
        graph[i].push_back(host[i]);
    }

    memset(dp,-1,sizeof dp);

	return max(calc(1,1,0),calc(1,1,1));
}

Compilation message

friend.cpp: In function 'int calc(int, int, int)':
friend.cpp:5:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define rep(i,a,b) for(int i = a;i < b;i++)
......
   25 |         rep(i,0,graph[cur].size())
      |             ~~~~~~~~~~~~~~~~~~~~~   
friend.cpp:25:9: note: in expansion of macro 'rep'
   25 |         rep(i,0,graph[cur].size())
      |         ^~~
friend.cpp:5:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define rep(i,a,b) for(int i = a;i < b;i++)
......
   36 |         rep(i,0,graph[cur].size())
      |             ~~~~~~~~~~~~~~~~~~~~~   
friend.cpp:36:9: note: in expansion of macro 'rep'
   36 |         rep(i,0,graph[cur].size())
      |         ^~~

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Incorrect 1 ms 332 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 332 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 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 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 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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