oj.uz

Submission #73885

# Submission time Handle Problem Language Result Execution time Memory
73885 2018-08-29T08:20:17 Z funcsr Friend (IOI14_friend) C++17
35 / 100
 5 ms 752 KB 
#include "friend.h"
#include <iostream>
#include <vector>
#include <cassert>
#include <tuple>
#include <queue>
#define rep(i, n) for (int i=0; i<(n); i++)
#define pb push_back
using namespace std;

int dp0[100000], dp1[100000];

int findSample(int N, int A[], int host[], int protocol[]) {
  rep(i, N) dp0[i] = 0, dp1[i] = A[i];
  for (int x=N-1; x>0; x--) {
    int p = host[x];
    if (protocol[x] == 0) {
      dp0[p] += max(dp0[x], dp1[x]);
      dp1[p] += dp0[x];
    }
    else if (protocol[x] == 1) {
      dp0[p] += dp0[x];
      dp1[p] += max(dp0[x], dp1[x]);
    }
    else {
      dp0[p] += dp0[x];
      dp1[p] = max(dp0[x]+dp1[p], dp1[x]+dp0[p]);
    }
  }
  return max(dp0[0], dp1[0]);
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 324 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 420 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 3 ms 544 KB Output is correct
6 Correct 2 ms 544 KB Output is correct
7 Correct 2 ms 544 KB Output is correct
8 Incorrect 2 ms 620 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 620 KB Output is correct
2 Correct 3 ms 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 2 ms 624 KB Output is correct
7 Correct 2 ms 624 KB Output is correct
8 Correct 3 ms 624 KB Output is correct
9 Correct 4 ms 624 KB Output is correct
10 Correct 4 ms 624 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 624 KB Output is correct
2 Correct 3 ms 624 KB Output is correct
3 Correct 2 ms 716 KB Output is correct
4 Correct 3 ms 716 KB Output is correct
5 Correct 3 ms 716 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 2 ms 736 KB Output is correct
8 Correct 3 ms 736 KB Output is correct
9 Correct 3 ms 736 KB Output is correct
10 Correct 3 ms 736 KB Output is correct

Subtask #4
19.0 / 19.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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