oj.uz

Submission #55996

# Submission time Handle Problem Language Result Execution time Memory
55996 2018-07-09T09:51:17 Z Just_Solve_The_Problem Friend (IOI14_friend) C++11
100 / 100
 46 ms 7324 KB 
#include <bits/stdc++.h>
#include "friend.h"

using namespace std;

const int N = (int)1e5 + 7;

int dp[N][2];

int findSample(int n, int confidence[], int host[], int protocol[]){
  for (int i = 0; i < n; i++) 
  	dp[i][0] = confidence[i];
  for (int i = n - 1; i > 0; i--) {
  	if (protocol[i] == 0) {
  		dp[host[i]][0] += dp[i][1];
  		dp[host[i]][1] += dp[i][0];
  	} else if (protocol[i] == 1) {
  		dp[host[i]][0] += dp[i][0];
  		dp[host[i]][1] += dp[i][1];
  	} else if (protocol[i] == 2) {
  		dp[host[i]][0] = max(dp[host[i]][0] + dp[i][1], dp[host[i]][1] + dp[i][0]);
  		dp[host[i]][1] += dp[i][1];
  	}
  	dp[host[i]][0] = max(dp[host[i]][0], dp[host[i]][1]);           
  }
  return max(dp[0][0], dp[1][1]);
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 360 KB Output is correct
3 Correct 2 ms 472 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 624 KB Output is correct
6 Correct 3 ms 736 KB Output is correct
7 Correct 3 ms 868 KB Output is correct
8 Correct 3 ms 868 KB Output is correct
9 Correct 2 ms 868 KB Output is correct
10 Correct 3 ms 876 KB Output is correct
11 Correct 3 ms 880 KB Output is correct
12 Correct 2 ms 880 KB Output is correct
13 Correct 2 ms 880 KB Output is correct
14 Correct 2 ms 880 KB Output is correct
15 Correct 2 ms 904 KB Output is correct
16 Correct 3 ms 904 KB Output is correct
17 Correct 2 ms 904 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 928 KB Output is correct
2 Correct 3 ms 936 KB Output is correct
3 Correct 3 ms 936 KB Output is correct
4 Correct 2 ms 960 KB Output is correct
5 Correct 3 ms 972 KB Output is correct
6 Correct 3 ms 972 KB Output is correct
7 Correct 3 ms 1000 KB Output is correct
8 Correct 2 ms 1016 KB Output is correct
9 Correct 3 ms 1044 KB Output is correct
10 Correct 3 ms 1056 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1072 KB Output is correct
2 Correct 5 ms 1076 KB Output is correct
3 Correct 3 ms 1084 KB Output is correct
4 Correct 3 ms 1096 KB Output is correct
5 Correct 2 ms 1108 KB Output is correct
6 Correct 3 ms 1108 KB Output is correct
7 Correct 3 ms 1204 KB Output is correct
8 Correct 3 ms 1208 KB Output is correct
9 Correct 14 ms 1208 KB Output is correct
10 Correct 2 ms 1208 KB Output is correct

Subtask #4
19.0 / 19.0

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

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1356 KB Output is correct
2 Correct 2 ms 1356 KB Output is correct
3 Correct 2 ms 1356 KB Output is correct
4 Correct 2 ms 1356 KB Output is correct
5 Correct 2 ms 1356 KB Output is correct
6 Correct 2 ms 1356 KB Output is correct
7 Correct 2 ms 1356 KB Output is correct
8 Correct 3 ms 1356 KB Output is correct
9 Correct 3 ms 1356 KB Output is correct
10 Correct 2 ms 1356 KB Output is correct
11 Correct 3 ms 1356 KB Output is correct
12 Correct 3 ms 1356 KB Output is correct
13 Correct 2 ms 1356 KB Output is correct
14 Correct 2 ms 1356 KB Output is correct
15 Correct 2 ms 1356 KB Output is correct
16 Correct 3 ms 1360 KB Output is correct
17 Correct 2 ms 1364 KB Output is correct
18 Correct 2 ms 1368 KB Output is correct
19 Correct 2 ms 1372 KB Output is correct
20 Correct 3 ms 1376 KB Output is correct
21 Correct 3 ms 1384 KB Output is correct

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1520 KB Output is correct
2 Correct 2 ms 1524 KB Output is correct
3 Correct 2 ms 1528 KB Output is correct
4 Correct 3 ms 1532 KB Output is correct
5 Correct 2 ms 1536 KB Output is correct
6 Correct 2 ms 1540 KB Output is correct
7 Correct 2 ms 1544 KB Output is correct
8 Correct 2 ms 1548 KB Output is correct
9 Correct 4 ms 1552 KB Output is correct
10 Correct 3 ms 1556 KB Output is correct
11 Correct 2 ms 1560 KB Output is correct
12 Correct 46 ms 4756 KB Output is correct
13 Correct 22 ms 4756 KB Output is correct
14 Correct 46 ms 6236 KB Output is correct
15 Correct 43 ms 7324 KB Output is correct