oj.uz

Submission #73860

# Submission time Handle Problem Language Result Execution time Memory
73860 2018-08-29T07:03:20 Z funcsr Friend (IOI14_friend) C++17
100 / 100
 114 ms 15988 KB 
#include "friend.h"
#include <vector>
#include <cassert>
#include <tuple>
#define rep(i, n) for (int i=0; i<(n); i++)
#define pb push_back
using namespace std;
typedef pair<int, int> P;

vector<int> Gchildren[200000];
vector<int> Gclone[200000];
int repr[100000];
int W[200000];

P dfs(int x, int p) {
  int dp0 = 0, dp1 = W[x]>=0?W[x]:0;
  for (int t : Gchildren[x]) {
    int dp0t, dp1t;
    tie(dp0t, dp1t) = dfs(t, x);
    dp0 += dp1t;
    dp1 += dp0t;
  }
  if (!Gclone[x].empty()) {
    int t1 = Gclone[x][0], t2 = Gclone[x][1];
    int dp0t1, dp1t1;
    tie(dp0t1, dp1t1) = dfs(t1, x);
    int dp0t2, dp1t2;
    tie(dp0t2, dp1t2) = dfs(t2, x);
    dp0 += dp0t1+dp0t2;
    // both[i]
    if (W[x]==-1) dp1 += dp1t1+dp1t2;
    else dp1 += max(dp1t1+dp0t2, dp0t1+dp1t2);
  }
  dp1 = max(dp1, dp0);
  return P(dp0, dp1);
}

int findSample(int N, int A[], int host[], int protocol[]) {
  W[0] = A[0];
  repr[0] = 0;
  int V = 1;
  for (int i=1; i<N; i++) {
    int p = host[i];
    if (protocol[i] == 0) {
      Gchildren[repr[p]].pb(V);
      W[V] = A[i];
      repr[i] = V;
      V++;
    }
    else {
      // copy
      int root = repr[p], p_new = V++, x = V++;
      repr[p] = p_new;
      repr[i] = x;

      W[p_new] = W[root];
      W[x] = A[i];
      W[root] = 0;

      Gclone[root].pb(p_new);
      Gclone[root].pb(x);

      if (protocol[i] == 1) W[root] = -1; // both[i]
    }
  }

  return dfs(0, -1).second;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 9720 KB Output is correct
2 Correct 11 ms 9828 KB Output is correct
3 Correct 12 ms 9928 KB Output is correct
4 Correct 13 ms 9928 KB Output is correct
5 Correct 13 ms 9928 KB Output is correct
6 Correct 11 ms 9928 KB Output is correct
7 Correct 15 ms 9928 KB Output is correct
8 Correct 13 ms 9928 KB Output is correct
9 Correct 14 ms 9928 KB Output is correct
10 Correct 14 ms 9928 KB Output is correct
11 Correct 12 ms 9928 KB Output is correct
12 Correct 13 ms 9928 KB Output is correct
13 Correct 12 ms 9932 KB Output is correct
14 Correct 14 ms 9940 KB Output is correct
15 Correct 13 ms 9940 KB Output is correct
16 Correct 12 ms 9944 KB Output is correct
17 Correct 12 ms 9948 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 10004 KB Output is correct
2 Correct 15 ms 10004 KB Output is correct
3 Correct 14 ms 10004 KB Output is correct
4 Correct 15 ms 10012 KB Output is correct
5 Correct 14 ms 10024 KB Output is correct
6 Correct 13 ms 10036 KB Output is correct
7 Correct 15 ms 10080 KB Output is correct
8 Correct 17 ms 10080 KB Output is correct
9 Correct 12 ms 10080 KB Output is correct
10 Correct 14 ms 10104 KB Output is correct

Subtask #3
8.0 / 8.0

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

Subtask #4
19.0 / 19.0

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

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 10260 KB Output is correct
2 Correct 10 ms 10260 KB Output is correct
3 Correct 11 ms 10260 KB Output is correct
4 Correct 10 ms 10260 KB Output is correct
5 Correct 11 ms 10260 KB Output is correct
6 Correct 10 ms 10260 KB Output is correct
7 Correct 12 ms 10260 KB Output is correct
8 Correct 10 ms 10260 KB Output is correct
9 Correct 13 ms 10284 KB Output is correct
10 Correct 14 ms 10284 KB Output is correct
11 Correct 11 ms 10284 KB Output is correct
12 Correct 12 ms 10284 KB Output is correct
13 Correct 10 ms 10284 KB Output is correct
14 Correct 11 ms 10284 KB Output is correct
15 Correct 11 ms 10284 KB Output is correct
16 Correct 13 ms 10284 KB Output is correct
17 Correct 11 ms 10284 KB Output is correct
18 Correct 12 ms 10284 KB Output is correct
19 Correct 10 ms 10284 KB Output is correct
20 Correct 12 ms 10284 KB Output is correct
21 Correct 14 ms 10284 KB Output is correct

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 10284 KB Output is correct
2 Correct 11 ms 10284 KB Output is correct
3 Correct 10 ms 10284 KB Output is correct
4 Correct 12 ms 10284 KB Output is correct
5 Correct 10 ms 10284 KB Output is correct
6 Correct 12 ms 10284 KB Output is correct
7 Correct 11 ms 10284 KB Output is correct
8 Correct 10 ms 10284 KB Output is correct
9 Correct 11 ms 10284 KB Output is correct
10 Correct 11 ms 10284 KB Output is correct
11 Correct 11 ms 10284 KB Output is correct
12 Correct 100 ms 15324 KB Output is correct
13 Correct 51 ms 15324 KB Output is correct
14 Correct 114 ms 15324 KB Output is correct
15 Correct 92 ms 15988 KB Output is correct