Submission #233705

#	Time	Username	Problem	Language	Result	Execution time	Memory
233705		quocnguyen1012	Friend (IOI14_friend)	C++14	100 / 100	39 ms	4216 KiB

friend

#ifndef LOCAL
#include "friend.h"
#endif // LOCAL
#include <bits/stdc++.h>

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ar array

using namespace std;
typedef long long ll;
typedef pair<int, int> ii;

const int maxn = 1e5 + 5;

ll f[maxn][2];

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


#ifdef LOCAL
signed main(void)
{
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  #ifdef LOCAL
    freopen("A.INP", "r", stdin);
    freopen("A.OUT", "w", stdout);
  #endif // LOCAL
  int n; cin >> n;
  int val[n], host[n], type[n + 5];
  for(int i = 0; i < n; ++i){
    cin >> val[i];
  }
  for(int i = 1; i < n; ++i){
    cin >> host[i] >> type[i];
  //  cerr << host[i] << ' ' << type[i] << '\n';
  }
  cout << findSample(n, val, host, type);
}
#endif // LOCAL

• Subtask 1: 11 / 11
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 19 / 19
• Subtask 5: 23 / 23
• Subtask 6: 31 / 31