제출 #220755

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
220755		infinite_iq	친구 (IOI14_friend)	C++14	19 / 100	5 ms	384 KiB

friend

    #define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
    #include <bits/stdc++.h>
    using namespace std;
    #define sqr 200
    #define mid (l+r)/2
    #define pb push_back
    #define ppb pop_back
    #define fi first
    #define se second
    #define lb lower_bound
    #define ub upper_bound
    #define ins insert
    #define era erase
    #define C continue
    #define mem(dp,i) memset(dp,i,sizeof(dp))
    #define mset multiset
    typedef long long ll;
    typedef short int si;
    typedef long double ld;
    typedef pair<int,int> pi;
    typedef pair<ll,ll> pll;
    typedef vector<int> vi;
    typedef vector<ll> vll;
    typedef vector<pi> vpi;
    typedef vector<pll> vpll;
    const ll mod=1e9+7;
    const ll inf= 4e18;
    const ld pai=acos(-1);
    #include "friend.h"
    vi v[1009];;
    int val[1009];
    int dp[1009][2];
    int done[1009];
    void dfs(int node){
            done[node]=1;
            dp[node][1]=val[node];
            for(auto u:v[node]){
                    dfs(u);
                    dp[node][1]+=dp[u][0];
                    dp[node][0]+=max(dp[u][1],dp[u][0]);
            }
    }
    int findSample(int n,int confidence[],int host[],int protocol[]){
            for(int i=0;i<n;i++)val[i]=confidence[i];
            for(int i=1;i<n;i++){
                    int a=i,b=host[i];
                    v[b].pb(a);
            }
            int ans=0;
            for(int i=0;i<n;i++){
                    if(!done[i]){
                            dfs(i);
                            ans+=max(dp[i][0],dp[i][1]);
                    }
            }
            return ans;
    }

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