제출 #607482

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
607482		MohamedFaresNebili	친구 (IOI14_friend)	C++14	100 / 100	22 ms	3160 KiB

friend

#include <bits/stdc++.h>
/// #pragma GCC optimize ("Ofast")
/// #pragma GCC target ("avx2")
/// #pragma GCC optimize("unroll-loops")
 
            using namespace std;
 
            using ll = long long;
            using ld = long double;
 
            #define ff first
            #define ss second
            #define pb push_back
            #define all(x) (x).begin(), (x).end()
            #define lb lower_bound
 
            const int MOD = 998244353;
 
            int DP[100001][2];
 
            int findSample(int N, int* confidence,
                          int* host, int* protocol) {
                for(int l = 0; l < N; l++)
                    DP[l][1] = confidence[l];
                for(int l = N - 1; l > 0; l--) {
                    int t = protocol[l];
                    if(t == 0) {
                     	DP[host[l]][0] += DP[l][1];
                      	DP[host[l]][1] += DP[l][0];
                    }
                    if(t == 1) {
                      	DP[host[l]][1] += DP[l][1];
                      	DP[host[l]][0] += DP[l][0];
                    }
                    if(t == 2) {
                      	DP[host[l]][1] = max(DP[host[l]][0] + DP[l][1], DP[host[l]][1] + DP[l][0]);
                      	DP[host[l]][0] += DP[l][0];
                    }
                  	DP[host[l]][1] = max(DP[host[l]][1], DP[host[l]][0]);
                }
                return max(DP[0][0], DP[0][1]);
            }

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