# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
73859 |
2018-08-29T07:00:54 Z |
funcsr |
Friend (IOI14_friend) |
C++17 |
|
137 ms |
17408 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];
bool both[200000];
P dfs(int x, int p) {
int dp0 = 0, dp1 = W[x];
for (int t : Gchildren[x]) if (t != p) {
int dp0t, dp1t;
tie(dp0t, dp1t) = dfs(t, x);
dp0 += dp1t;
dp1 += dp0t;
}
if (!Gclone[x].empty()) {
assert(Gclone[x].size() == 2);
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;
if (both[x]) 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);
both[root] = protocol[i] == 1;
}
}
return dfs(0, -1).second;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
9688 KB |
Output is correct |
2 |
Correct |
11 ms |
9704 KB |
Output is correct |
3 |
Correct |
12 ms |
9872 KB |
Output is correct |
4 |
Correct |
11 ms |
9872 KB |
Output is correct |
5 |
Correct |
11 ms |
9988 KB |
Output is correct |
6 |
Correct |
12 ms |
9988 KB |
Output is correct |
7 |
Correct |
12 ms |
9988 KB |
Output is correct |
8 |
Correct |
12 ms |
9988 KB |
Output is correct |
9 |
Correct |
11 ms |
9992 KB |
Output is correct |
10 |
Correct |
12 ms |
10024 KB |
Output is correct |
11 |
Correct |
12 ms |
10028 KB |
Output is correct |
12 |
Correct |
12 ms |
10032 KB |
Output is correct |
13 |
Correct |
11 ms |
10036 KB |
Output is correct |
14 |
Correct |
13 ms |
10040 KB |
Output is correct |
15 |
Correct |
13 ms |
10044 KB |
Output is correct |
16 |
Correct |
12 ms |
10048 KB |
Output is correct |
17 |
Correct |
11 ms |
10124 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
14 ms |
10124 KB |
Output is correct |
2 |
Correct |
13 ms |
10124 KB |
Output is correct |
3 |
Correct |
12 ms |
10124 KB |
Output is correct |
4 |
Correct |
13 ms |
10200 KB |
Output is correct |
5 |
Correct |
15 ms |
10200 KB |
Output is correct |
6 |
Correct |
16 ms |
10200 KB |
Output is correct |
7 |
Correct |
13 ms |
10200 KB |
Output is correct |
8 |
Correct |
13 ms |
10200 KB |
Output is correct |
9 |
Correct |
16 ms |
10200 KB |
Output is correct |
10 |
Correct |
17 ms |
10256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
10256 KB |
Output is correct |
2 |
Correct |
12 ms |
10256 KB |
Output is correct |
3 |
Correct |
13 ms |
10256 KB |
Output is correct |
4 |
Correct |
12 ms |
10256 KB |
Output is correct |
5 |
Correct |
15 ms |
10256 KB |
Output is correct |
6 |
Correct |
14 ms |
10256 KB |
Output is correct |
7 |
Correct |
11 ms |
10336 KB |
Output is correct |
8 |
Correct |
14 ms |
10336 KB |
Output is correct |
9 |
Correct |
11 ms |
10336 KB |
Output is correct |
10 |
Correct |
13 ms |
10352 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
10352 KB |
Output is correct |
2 |
Correct |
13 ms |
10352 KB |
Output is correct |
3 |
Correct |
14 ms |
10352 KB |
Output is correct |
4 |
Correct |
13 ms |
10352 KB |
Output is correct |
5 |
Correct |
15 ms |
10352 KB |
Output is correct |
6 |
Correct |
17 ms |
10352 KB |
Output is correct |
7 |
Correct |
14 ms |
10352 KB |
Output is correct |
8 |
Correct |
15 ms |
10352 KB |
Output is correct |
9 |
Correct |
12 ms |
10352 KB |
Output is correct |
10 |
Correct |
15 ms |
10352 KB |
Output is correct |
11 |
Correct |
17 ms |
10352 KB |
Output is correct |
12 |
Correct |
13 ms |
10352 KB |
Output is correct |
13 |
Correct |
11 ms |
10352 KB |
Output is correct |
14 |
Correct |
15 ms |
10352 KB |
Output is correct |
15 |
Correct |
13 ms |
10360 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
10360 KB |
Output is correct |
2 |
Correct |
14 ms |
10360 KB |
Output is correct |
3 |
Correct |
13 ms |
10360 KB |
Output is correct |
4 |
Correct |
13 ms |
10360 KB |
Output is correct |
5 |
Correct |
13 ms |
10360 KB |
Output is correct |
6 |
Correct |
13 ms |
10360 KB |
Output is correct |
7 |
Correct |
11 ms |
10360 KB |
Output is correct |
8 |
Correct |
11 ms |
10364 KB |
Output is correct |
9 |
Correct |
15 ms |
10488 KB |
Output is correct |
10 |
Correct |
11 ms |
10496 KB |
Output is correct |
11 |
Correct |
12 ms |
10496 KB |
Output is correct |
12 |
Correct |
13 ms |
10496 KB |
Output is correct |
13 |
Correct |
11 ms |
10496 KB |
Output is correct |
14 |
Correct |
11 ms |
10496 KB |
Output is correct |
15 |
Correct |
13 ms |
10496 KB |
Output is correct |
16 |
Correct |
13 ms |
10496 KB |
Output is correct |
17 |
Correct |
14 ms |
10496 KB |
Output is correct |
18 |
Correct |
13 ms |
10496 KB |
Output is correct |
19 |
Correct |
13 ms |
10496 KB |
Output is correct |
20 |
Correct |
13 ms |
10496 KB |
Output is correct |
21 |
Correct |
14 ms |
10496 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
11 ms |
10496 KB |
Output is correct |
2 |
Correct |
12 ms |
10496 KB |
Output is correct |
3 |
Correct |
13 ms |
10496 KB |
Output is correct |
4 |
Correct |
14 ms |
10496 KB |
Output is correct |
5 |
Correct |
11 ms |
10496 KB |
Output is correct |
6 |
Correct |
12 ms |
10496 KB |
Output is correct |
7 |
Correct |
14 ms |
10496 KB |
Output is correct |
8 |
Correct |
12 ms |
10496 KB |
Output is correct |
9 |
Correct |
12 ms |
10496 KB |
Output is correct |
10 |
Correct |
12 ms |
10496 KB |
Output is correct |
11 |
Correct |
10 ms |
10496 KB |
Output is correct |
12 |
Correct |
137 ms |
16356 KB |
Output is correct |
13 |
Correct |
48 ms |
16356 KB |
Output is correct |
14 |
Runtime error |
91 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. |
15 |
Halted |
0 ms |
0 KB |
- |