제출 #1184300

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1184300		pensive	Friend (IOI14_friend)	C++20	0 / 100	1097 ms	1348 KiB

friend

#include "friend.h"
#include <iostream>
#include <algorithm>
#include <vector>
#include <algorithm>

using namespace std;
#define ll long long
#define REP(a,i,n) for (int i=a;i<n;i++)
#define f first
#define s second

void iayf(int n, int i, int host, vector<vector<int>> &adjList) {
    adjList[host].push_back(i);
    adjList[i].push_back(host);
}
void mfayf(int n, int i, int host, vector<vector<int>> &adjList) {
    for (auto j : adjList[host]) {
        adjList[j].push_back(i);
        adjList[i].push_back(j);
    }
}
void wayf(int n, int i, int host, vector<vector<int>> &adjList) {
    mfayf(n,i,host,adjList);
    iayf(n, i, host, adjList);
}
int maxSample(int n, int i, vector<vector<int>> &adjList, int includes[], int confidence[]) {
    if (i==n) {
        return 0;
    }
    int cleared=0;
    for (auto j : adjList[i]) {
        cleared += includes[j];
    }
    int ans= maxSample(n,i+1,adjList,includes,confidence);
    if (cleared==0) {
        includes[i]=1;
        ans = max(ans, confidence[i]+maxSample(n,i+1,adjList,includes,confidence));
        includes[i]=0;
    }
    return ans;
}

int findSample(int n, int confidence[], int host[], int protocol[]) {
    vector<vector<int> > adjList(n);
    REP(1,i,n) {
        if (protocol[i]==0) iayf(n,i,host[i],adjList);
        else if (protocol[i]==1) mfayf(n,i,host[i],adjList);
        else if (protocol[i]==2) wayf(n,i,host[i],adjList);
    }
    int includes[n];
    return maxSample(n,1,adjList,includes,confidence);
} 

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