# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
404217 | definitelynotmee | Friend (IOI14_friend) | C++98 | 1 ms | 448 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "friend.h"
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INFL = (1LL<<62)-1;
const int INF = (1<<30)-1;
const int MAXN = 1001;
int dp[MAXN][2];
vector<int> grafo[MAXN];
int *c;
void dfs(int id){
for(int i = 0; i < grafo[id].size(); i++){
dfs(grafo[id][i]);
dp[id][0] += max(dp[grafo[id][i]][1], dp[grafo[id][i]][0]);
dp[id][1] += dp[grafo[id][i]][0];
}
dp[id][1] += c[id];
}
int findSample(int n, int confidence[], int host[], int protocol[]){
for(int i = 1; i < n; i++){
grafo[host[i]].emplace_back(i);
}
c = confidence;
int resp = 0;
dfs(0);
return max(dp[0][0],dp[0][1]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |