제출 #422531

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
422531		Andyvanh1	친구 (IOI14_friend)	C++14	0 / 100	7 ms	1868 KiB

friend

#include <bits/stdc++.h>
#include "friend.h"
 
using namespace std;
 
#define vt vector
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rep(i,x) for(int (i) = 0; (i) < (x); (i)++ )
 
typedef long long ll;
typedef long double ld;
typedef vt<int> vi;
typedef pair<int,int> pii;
 
set<int> adjlist[1002];
int ass[1002];
bool visited[1002];
 
void dfs(int node){
    visited[node] = true;
    for(auto& e: adjlist[node]){
      ass[e] = ass[node]^1;
        if(!visited[e]){
            
            dfs(e);
        }
    }
}
 
int findSample(int n, int confidence[], int host[], int protocol[]){
    for(int i = 1; i < n; i++){
        if(protocol[i]==0){
            adjlist[i].insert(host[i]);
            adjlist[host[i]].insert(i);
        }else if(protocol[i]==1){
            for(int j = 0; j < i; j++){
                if(adjlist[host[i]].find(j)!=adjlist[j].end()){
                    adjlist[i].insert(j);
                    adjlist[j].insert(i);
                }
            }
        }
    }
 
 
    int ans = 0;
   set<int> st;
    for(int i = 0; i < n; i++){
        if(!visited[i]){
            int ans1 = 0, ans2 = 0;
            ass[i] = 0;
            dfs(i);
            for(int j = 0; j < n; j++){
                if(visited[j]&&st.find(j)==st.end()){
                    st.insert(j);
                    if(ass[j]==1)ans1++;
                    else ans2++;
                }
            }
            ans+=max(ans1,ans2);
        }
    }
    return ans;
}

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