# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
587114 | hibiki | Friend (IOI14_friend) | C++11 | 1 ms | 348 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 "friend.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
// Find out best sample
int ans = 0;
int l[1005], best[1005];
vector<int> v[1005];
int dp[1005][2];
int fi(int idx)
{
if(l[idx] == idx) return idx;
return l[idx] = fi(l[idx]);
}
void uni(int la, int lb)
{
if(la != lb)
ans -= min(best[la], best[la]);
best[lb] = max(best[la], best[lb]);
l[la] = lb;
}
void dfs(int nw, int fa)
{
dp[nw][0] = dp[nw][1] = 0;
for(auto go: v[nw])
{
}
}
int findSample(int n,int c[],int h[],int p[]){
int ty;
for(int i = 1; i < n; i++)
ty = p[i];
// if(n < 20) ty = 3;
if(ty == 0)
{
for(int i = 1; i < n; i++)
v[h[i]].pb(i), v[i].pb(h[i]);
}
else if(ty == 1)
{
for(int i = 0; i < n; i++)
ans += c[i];
}
else if(ty == 2)
{
for(int i = 0; i < n; i++)
ans += c[i];
for(int i = 0; i < n; i++)
l[i] = i, best[i] = c[i];
for(int i = 1; i < n; i++)
uni(fi(h[i]), fi(i));
}
else
{
}
return ans;
}
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... |