# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
492048 |
2021-12-05T10:49:16 Z |
davi_bart |
Friend (IOI14_friend) |
C++14 |
|
11 ms |
7508 KB |
#include "friend.h"
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
// #define int ll
#define fi first
#define se second
#define ld long double
#define pb push_back
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
set<int> v[100010];
vector<bool> vis(100010, 0);
vector<int> figli[100010];
void dfs(int pos, int par) {
if (vis[pos]) return;
vis[pos] = 1;
if (par != -1) figli[par].pb(pos);
for (int x : v[pos]) dfs(x, pos);
}
int memo[100010][2];
vector<int> conf;
int sol(int pos, bool posso) {
if (memo[pos][posso] && pos != 100005) return memo[pos][posso];
int ans = conf[pos];
for (int x : figli[pos]) {
for (int y : figli[x]) {
int k = sol(y, 0);
int o = 0;
for (int z : figli[y]) {
int u = 0;
if (v[pos].count(z) == 0) {
u = sol(z, 1);
}
int l = 0;
for (int w : figli[z]) {
l += sol(w, 1);
}
o += max(u, l);
}
ans += max(k, o);
}
}
if (posso) {
int k = 0;
for (int x : figli[pos]) {
k += sol(x, 1);
}
ans = max(ans, k);
}
return memo[pos][posso] = ans;
}
int findSample(int N, int confidence[], int host[], int protocol[]) {
for (int i = 0; i < N; i++) conf.pb(confidence[i]);
int a[3] = {0, 0, 0};
for (int i = 1; i < N; i++) {
a[protocol[i]]++;
}
if (a[1] == N - 1) {
int tot = 0;
for (int i = 0; i < N; i++) tot += confidence[i];
return tot;
}
if (a[2] == N - 1) {
int tot = 0;
for (int i = 0; i < N; i++) tot = max(confidence[i], tot);
return tot;
}
for (int i = 1; i < N; i++) {
if (protocol[i] == 1 || protocol[i] == 2) {
for (int x : v[host[i]]) {
v[x].insert(i);
v[i].insert(x);
}
}
if (protocol[i] == 0 || protocol[i] == 2) {
v[host[i]].insert(i);
v[i].insert(host[i]);
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (!vis[i]) {
dfs(i, -1);
int ma = sol(i, 1);
// figli[100005].clear();
// figli[100005].pb(i);
// ma = max(ma, sol(100005) - 1);
ans += ma;
}
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
7372 KB |
Output is correct |
2 |
Correct |
5 ms |
7372 KB |
Output is correct |
3 |
Correct |
4 ms |
7376 KB |
Output is correct |
4 |
Correct |
4 ms |
7376 KB |
Output is correct |
5 |
Correct |
4 ms |
7376 KB |
Output is correct |
6 |
Correct |
4 ms |
7376 KB |
Output is correct |
7 |
Incorrect |
4 ms |
7380 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
7372 KB |
Output is correct |
2 |
Correct |
6 ms |
7372 KB |
Output is correct |
3 |
Correct |
4 ms |
7372 KB |
Output is correct |
4 |
Correct |
5 ms |
7380 KB |
Output is correct |
5 |
Correct |
5 ms |
7372 KB |
Output is correct |
6 |
Correct |
5 ms |
7324 KB |
Output is correct |
7 |
Correct |
6 ms |
7324 KB |
Output is correct |
8 |
Correct |
4 ms |
7372 KB |
Output is correct |
9 |
Correct |
5 ms |
7372 KB |
Output is correct |
10 |
Correct |
4 ms |
7372 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
7372 KB |
Output is correct |
2 |
Correct |
5 ms |
7380 KB |
Output is correct |
3 |
Correct |
4 ms |
7372 KB |
Output is correct |
4 |
Correct |
5 ms |
7372 KB |
Output is correct |
5 |
Correct |
5 ms |
7316 KB |
Output is correct |
6 |
Correct |
5 ms |
7372 KB |
Output is correct |
7 |
Correct |
4 ms |
7372 KB |
Output is correct |
8 |
Correct |
4 ms |
7372 KB |
Output is correct |
9 |
Correct |
4 ms |
7372 KB |
Output is correct |
10 |
Correct |
5 ms |
7372 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
7312 KB |
Output is correct |
2 |
Correct |
4 ms |
7372 KB |
Output is correct |
3 |
Correct |
4 ms |
7372 KB |
Output is correct |
4 |
Correct |
4 ms |
7376 KB |
Output is correct |
5 |
Correct |
5 ms |
7504 KB |
Output is correct |
6 |
Correct |
5 ms |
7504 KB |
Output is correct |
7 |
Correct |
4 ms |
7376 KB |
Output is correct |
8 |
Correct |
5 ms |
7508 KB |
Output is correct |
9 |
Correct |
4 ms |
7376 KB |
Output is correct |
10 |
Correct |
5 ms |
7376 KB |
Output is correct |
11 |
Correct |
5 ms |
7376 KB |
Output is correct |
12 |
Correct |
7 ms |
7504 KB |
Output is correct |
13 |
Correct |
5 ms |
7432 KB |
Output is correct |
14 |
Correct |
4 ms |
7376 KB |
Output is correct |
15 |
Correct |
5 ms |
7416 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
7372 KB |
Output is correct |
2 |
Correct |
4 ms |
7372 KB |
Output is correct |
3 |
Correct |
4 ms |
7372 KB |
Output is correct |
4 |
Correct |
4 ms |
7372 KB |
Output is correct |
5 |
Correct |
4 ms |
7372 KB |
Output is correct |
6 |
Correct |
4 ms |
7372 KB |
Output is correct |
7 |
Correct |
4 ms |
7372 KB |
Output is correct |
8 |
Correct |
4 ms |
7372 KB |
Output is correct |
9 |
Correct |
5 ms |
7500 KB |
Output is correct |
10 |
Correct |
4 ms |
7300 KB |
Output is correct |
11 |
Incorrect |
4 ms |
7368 KB |
Output isn't correct |
12 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
7292 KB |
Output is correct |
2 |
Correct |
4 ms |
7372 KB |
Output is correct |
3 |
Correct |
4 ms |
7372 KB |
Output is correct |
4 |
Correct |
5 ms |
7376 KB |
Output is correct |
5 |
Correct |
5 ms |
7372 KB |
Output is correct |
6 |
Correct |
4 ms |
7376 KB |
Output is correct |
7 |
Correct |
11 ms |
7372 KB |
Output is correct |
8 |
Correct |
4 ms |
7376 KB |
Output is correct |
9 |
Correct |
4 ms |
7376 KB |
Output is correct |
10 |
Correct |
4 ms |
7380 KB |
Output is correct |
11 |
Incorrect |
6 ms |
7376 KB |
Output isn't correct |
12 |
Halted |
0 ms |
0 KB |
- |