제출 #1073647

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1073647		steveonalex	친구 (IOI14_friend)	C++17	35 / 100	2 ms	4696 KiB

friend

#include "friend.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 1e5 + 69;
int n;
int a[N];
int p[N], q[N];

namespace Sub2{
    bool check(){
        for(int i = 1; i<n; ++i) if (q[i] != 1) return false;
        return true;
    }

    int solve(){
        int ans = 0;
        for(int i = 0; i<n; ++i) ans += a[i];
        return ans;
    }
}


namespace Sub3{
    bool check(){
        for(int i = 1; i<n; ++i) if (q[i] != 2) return false;
        return true;
    }

    int solve(){
        int ans = 0;
        for(int i = 0; i<n; ++i) maximize(ans, a[i]);
        return ans;
    }
}

namespace Sub4{
    bool check(){
        for(int i = 1; i<n; ++i) if (q[i] != 0) return false;
        return true;
    }

    vector<int> graph[N];
    int dp[N][2];

    void dfs(int u){
        dp[u][1] = a[u];
        for(int v: graph[u]){
            dfs(v);
            dp[u][0] += max(dp[v][0], dp[v][1]);
            dp[u][1] += dp[v][0];
        }
    }

    int solve(){
        for(int i= 1; i<n; ++i) graph[p[i]].push_back(i);

        dfs(0);
        return max(dp[0][0], dp[0][1]);
    }
}

int findSample(int _n, int confidence[], int host[], int protocol[]){
    n = _n;
    for(int i = 0; i < n; ++i) a[i] = confidence[i];
    for(int i = 1; i<n; ++i){
        p[i] = host[i];
        q[i] = protocol[i];
    }

    if (Sub2::check()) return Sub2::solve();
    if (Sub3::check()) return Sub3::solve();
    if (Sub4::check()) return Sub4::solve();
    return -1;
}

// int main(void){
//     ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
//     clock_t start = clock();

    
 
//     cerr << "Time elapsed: " << clock() - start << " ms\n";
//     return 0;
// }

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