oj.uz

Submission #73854

# Submission time Handle Problem Language Result Execution time Memory
73854 2018-08-29T06:54:46 Z funcsr Friend (IOI14_friend) C++17
69 / 100
 142 ms 17408 KB 
#include "friend.h"
#include <vector>
#include <cassert>
#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];
bool both[200000];

int dp0[200000], dp1[200000];
void dfs(int x, int p) {
  dp0[x] = 0, dp1[x] = W[x];
  for (int t : Gchildren[x]) if (t != p) {
    dfs(t, x);
    dp0[x] += dp1[t];
    dp1[x] += dp0[t];
  }
  if (!Gclone[x].empty()) {
    assert(Gclone[x].size() == 2);
    int t1 = Gclone[x][0], t2 = Gclone[x][1];
    dfs(t1, x);
    dfs(t2, x);
    dp0[x] += dp0[t1]+dp0[t2];
    if (both[x]) dp1[x] += dp1[t1]+dp1[t2];
    else dp1[x] += max(dp1[t1]+dp0[t2], dp0[t1]+dp1[t2]);
  }
  dp1[x] = max(dp1[x], dp0[x]);
}

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);

      both[root] = protocol[i] == 1;
    }
  }

  dfs(0, -1);
  return dp1[0];
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 9724 KB Output is correct
2 Correct 12 ms 9832 KB Output is correct
3 Correct 15 ms 9832 KB Output is correct
4 Correct 15 ms 9952 KB Output is correct
5 Correct 15 ms 9952 KB Output is correct
6 Correct 17 ms 9952 KB Output is correct
7 Correct 15 ms 9952 KB Output is correct
8 Correct 14 ms 10092 KB Output is correct
9 Correct 13 ms 10092 KB Output is correct
10 Correct 14 ms 10092 KB Output is correct
11 Correct 11 ms 10092 KB Output is correct
12 Correct 16 ms 10104 KB Output is correct
13 Correct 12 ms 10108 KB Output is correct
14 Correct 13 ms 10112 KB Output is correct
15 Correct 13 ms 10244 KB Output is correct
16 Correct 15 ms 10244 KB Output is correct
17 Correct 12 ms 10244 KB Output is correct

Subtask #2
8.0 / 8.0

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

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 10384 KB Output is correct
2 Correct 13 ms 10408 KB Output is correct
3 Correct 17 ms 10420 KB Output is correct
4 Correct 17 ms 10424 KB Output is correct
5 Correct 14 ms 10436 KB Output is correct
6 Correct 14 ms 10436 KB Output is correct
7 Correct 11 ms 10436 KB Output is correct
8 Correct 14 ms 10436 KB Output is correct
9 Correct 16 ms 10436 KB Output is correct
10 Correct 15 ms 10436 KB Output is correct

Subtask #4
19.0 / 19.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 10692 KB Output is correct
2 Correct 12 ms 10692 KB Output is correct
3 Correct 12 ms 10692 KB Output is correct
4 Correct 13 ms 10692 KB Output is correct
5 Correct 14 ms 10692 KB Output is correct
6 Correct 14 ms 10692 KB Output is correct
7 Correct 13 ms 10692 KB Output is correct
8 Correct 15 ms 10692 KB Output is correct
9 Correct 13 ms 10692 KB Output is correct
10 Correct 17 ms 10692 KB Output is correct
11 Correct 14 ms 10692 KB Output is correct
12 Runtime error 142 ms 17408 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
13 Halted 0 ms 0 KB -