oj.uz

Submission #50890

# Submission time Handle Problem Language Result Execution time Memory
50890 2018-06-14T05:06:29 Z Talant Friend (IOI14_friend) C++17
46 / 100
 63 ms 25464 KB 
#include "friend.h"

#include <bits/stdc++.h>

#define pb push_back
#define mk make_pair
#define sc second
#define fr first

using namespace std;

const int N = (1e6 + 5);

int u[1005][1005];
int dp[1005][3];

int ans;
int fg;

vector <int> g[N];

void dfs (int v,int p = -1) {
      for (auto to : g[v]) {
            if (to != p) {
                  dfs(to,v);
                  dp[v][1] += dp[to][0];
                  dp[v][0] += max(dp[to][0],dp[to][1]);
            }
      }
}
int findSample(int n,int confidence[],int host[],int protocol[]){
      if (n <= 10) {
            for (int i = 1; i < n; i ++) {
                  int v = host[i];

                  if (protocol[i] == 0) {
                        u[v][i] = 1,u[i][v] = 1;
                        g[v].pb(i),g[i].pb(v);
                  }
                  else if (protocol[i] == 1) {
                        for (auto to : g[v]) {
                              g[to].pb(i),g[i].pb(to);
                              u[to][i] = 1,u[i][to] = 1;
                        }
                  }
                  else {
                        for (auto to : g[v]) {
                              g[to].pb(i),g[i].pb(to);
                              u[to][i] = 1,u[i][to] = 1;
                        }
                        g[v].pb(i);
                        g[i].pb(v);
                        u[v][i] = 1;
                        u[i][v] = 1;
                  }
            }
            for (int i = 0; i < (1 << n); i ++) {
                  vector <int> v;
                  int fl = 0;
                  int as = 0;
                  for (int j = 0; j < n; j ++) {
                        if (i & (1 << j)) {
                              for (auto to : v)
                                    if (u[to][j]) fl = 1;
                              as += confidence[j];
                              v.pb(j);
                        }
                  }
                  if (!fl)
                        ans = max(ans,as);
             }
            return ans;
      }
      else {
            if (protocol[1] == 1) {
                  for (int i = 0; i < n; i ++)
                        ans += confidence[i];
                  return ans;
            }
            else if (protocol[1] == 2) {
                  for (int i = 0; i < n; i ++)
                        ans = max(ans,confidence[i]);
                  return ans;
            }
            else {
                  for (int i = 1; i < n; i ++) {
                        int v = host[i];
                        g[v].pb(i),g[i].pb(v);
                  }
                  for (int i = 0; i < n; i ++)
                        dp[i][1] = confidence[i];

                  dfs(1);

                  return (max(dp[1][0],dp[1][1]));
            }

      }
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23800 KB Output is correct
2 Correct 21 ms 23912 KB Output is correct
3 Correct 20 ms 23980 KB Output is correct
4 Correct 22 ms 23980 KB Output is correct
5 Correct 25 ms 23980 KB Output is correct
6 Correct 24 ms 23980 KB Output is correct
7 Correct 24 ms 24016 KB Output is correct
8 Correct 21 ms 24016 KB Output is correct
9 Correct 21 ms 24016 KB Output is correct
10 Correct 21 ms 24016 KB Output is correct
11 Correct 21 ms 24016 KB Output is correct
12 Correct 21 ms 24016 KB Output is correct
13 Correct 21 ms 24016 KB Output is correct
14 Correct 23 ms 24016 KB Output is correct
15 Correct 21 ms 24016 KB Output is correct
16 Correct 21 ms 24064 KB Output is correct
17 Correct 24 ms 24064 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 24064 KB Output is correct
2 Correct 20 ms 24064 KB Output is correct
3 Correct 27 ms 24148 KB Output is correct
4 Correct 21 ms 24148 KB Output is correct
5 Correct 21 ms 24148 KB Output is correct
6 Correct 21 ms 24148 KB Output is correct
7 Correct 20 ms 24148 KB Output is correct
8 Correct 21 ms 24148 KB Output is correct
9 Correct 20 ms 24148 KB Output is correct
10 Correct 23 ms 24148 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 24148 KB Output is correct
2 Correct 20 ms 24148 KB Output is correct
3 Correct 20 ms 24148 KB Output is correct
4 Correct 21 ms 24148 KB Output is correct
5 Correct 22 ms 24148 KB Output is correct
6 Correct 21 ms 24148 KB Output is correct
7 Correct 21 ms 24148 KB Output is correct
8 Correct 25 ms 24148 KB Output is correct
9 Correct 21 ms 24148 KB Output is correct
10 Correct 21 ms 24148 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 24148 KB Output is correct
2 Correct 20 ms 24148 KB Output is correct
3 Correct 26 ms 24148 KB Output is correct
4 Correct 25 ms 24148 KB Output is correct
5 Correct 21 ms 24188 KB Output is correct
6 Correct 22 ms 24188 KB Output is correct
7 Correct 22 ms 24188 KB Output is correct
8 Correct 23 ms 24256 KB Output is correct
9 Correct 24 ms 24256 KB Output is correct
10 Correct 21 ms 24256 KB Output is correct
11 Correct 24 ms 24256 KB Output is correct
12 Correct 22 ms 24256 KB Output is correct
13 Correct 22 ms 24256 KB Output is correct
14 Correct 26 ms 24256 KB Output is correct
15 Correct 25 ms 24256 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 24256 KB Output is correct
2 Correct 24 ms 24256 KB Output is correct
3 Correct 22 ms 24256 KB Output is correct
4 Correct 24 ms 24256 KB Output is correct
5 Correct 23 ms 24256 KB Output is correct
6 Correct 22 ms 24256 KB Output is correct
7 Correct 26 ms 24256 KB Output is correct
8 Correct 25 ms 24256 KB Output is correct
9 Correct 26 ms 24268 KB Output is correct
10 Correct 22 ms 24268 KB Output is correct
11 Incorrect 28 ms 24268 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 24268 KB Output is correct
2 Correct 21 ms 24268 KB Output is correct
3 Correct 22 ms 24312 KB Output is correct
4 Correct 20 ms 24312 KB Output is correct
5 Correct 21 ms 24312 KB Output is correct
6 Correct 21 ms 24312 KB Output is correct
7 Correct 21 ms 24312 KB Output is correct
8 Correct 21 ms 24312 KB Output is correct
9 Correct 22 ms 24312 KB Output is correct
10 Correct 20 ms 24312 KB Output is correct
11 Correct 20 ms 24312 KB Output is correct
12 Incorrect 63 ms 25464 KB Output isn't correct
13 Halted 0 ms 0 KB -