oj.uz

Submission #415909

# Submission time Handle Problem Language Result Execution time Memory
415909 2021-06-01T17:09:31 Z LouayFarah Friend (IOI14_friend) C++14
0 / 100
 1000 ms 42244 KB 
#include "bits/stdc++.h"
#include "friend.h"
using namespace std;

vector<set<int>> adj;
set<int> em;
vector<bool> denied;

int dfs(int u, int n, int c[])
{
    int r = c[u];
    int temp = c[u];
    denied[u] = true;
    for(auto v: adj[u])
        denied[v] = true;
    for(int i = 0; i<n; i++)
    {
        if(!denied[i])
        {
            int val = dfs(i, n, c);
            r = max(r, temp + val);
        }
    }
    return r;
}

int findSample(int n, int confidence[], int host[], int protocol[])
{
    adj.assign(n, em);
    for(int i = 1; i<n; i++)
    {
        if(protocol[i]==0)
        {
            int x = host[i];
            adj[x].insert(i);
            adj[i].insert(x);
        }
        else if(protocol[i]==1)
        {
            int x = host[i];
            for(auto v: adj[x])
            {
                adj[v].insert(i);
                adj[i].insert(v);
            }
        }
        else
        {
            int x = host[i];
            adj[x].insert(i);
            adj[i].insert(x);
            for(auto v: adj[x])
            {
                adj[v].insert(i);
                adj[i].insert(v);
            }
        }
    }

    int res = 0;
    for(int i = 0; i<n; i++)
    {
        denied.assign(n, false);
        int maxi = dfs(i, n, confidence);
        res = max(res, maxi);
    }

    return res;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 204 KB Output is correct
2 Correct 52 ms 332 KB Output is correct
3 Correct 82 ms 336 KB Output is correct
4 Correct 588 ms 396 KB Output is correct
5 Execution timed out 1018 ms 452 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 8900 KB Output is correct
2 Runtime error 344 ms 42244 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 591 ms 472 KB Output is correct
10 Execution timed out 1056 ms 412 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

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