제출 #874069

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
874069		Sandarach151	친구 (IOI14_friend)	C++17	27 / 100	118 ms	65536 KiB

friend

#include<bits/stdc++.h>
using namespace std;

int findSample(int n, int confidence[], int host[], int protocol[]){
    if(n<=10){
        set<int> adg[n];
        for(int i=1; i<n; i++){
            if(protocol[i]==0){
                adg[host[i]].insert(i);
                adg[i].insert(host[i]);
            }
            else if(protocol[i]==1){
                for(auto u : adg[host[i]]){
                    adg[i].insert(u);
                    adg[u].insert(i);
                }
            }
            else{
                for(auto u : adg[host[i]]){
                    adg[i].insert(u);
                    adg[u].insert(i);
                }
                adg[host[i]].insert(i);
                adg[i].insert(host[i]);
            }
        }
        int maxx = 0;
        for(int mask=0; mask < (1<<n); mask++){
            bool test = true;
            int cur = 0;
            for(int i=0; i<n; i++){
                for(int j=0; j<n; j++){
                    if(((mask & (1<<i))!=0) && ((mask & (1<<j))!=0) && adg[i].count(j)){
                        test = false;
                        break;
                    }
                }
                if(!test){
                    break;
                }
            }
            if(test){
                for(int i=0; i<n; i++){
                    if((mask & (1<<i))!=0){
                        cur+=confidence[i];
                    }
                }
                maxx = max(maxx, cur);
            }
        }
        return maxx;
    }
    else{
        bool res0 = true;
        bool res1 = true;
        bool res2 = true;
        for(int i=1; i<n; i++){
            if(protocol[i]==0){
                res1 = false;
                res2 = false;
            }
            if(protocol[i]==1){
                res0 = false;
                res2 = false;
            }
            if(protocol[i]==2){
                res0 = false;
                res1 = false;
            }
        }
        if(res1){
            int ans = 0;
            for(int i=0; i<n; i++){
                ans += confidence[i];
            }
            return ans;
        }
        else if(res2){
            int ans = 0;
            for(int i=0; i<n; i++){
                ans = max(ans, confidence[i]);
            }
            return ans;
        }
        else if(res0){
            vector<int> adg[n];
            for(int i=1; i<n; i++){
                if(protocol[i]==0){
                    adg[host[i]].push_back(i);
                    adg[i].push_back(host[i]);
                }
                else if(protocol[i]==1){
                    for(auto u : adg[host[i]]){
                        adg[i].push_back(u);
                        adg[u].push_back(i);
                    }
                }
                else{
                    for(auto u : adg[host[i]]){
                        adg[i].push_back(u);
                        adg[u].push_back(i);
                    }
                    adg[host[i]].push_back(i);
                    adg[i].push_back(host[i]);
                }
            }
            vector<int> color(n, -1);
            queue<int> que;
            que.push(0);
            color[0]=0;
            while(!que.empty()){
                int cur = que.front();
                que.pop();
                for(auto u : adg[cur]){
                    if(color[u]==-1){
                        color[u]=1-color[cur];
                        que.push(u);
                    }
                }
            }
            int tot0 = 0;
            int tot1 = 0;
            for(int i=0; i<n; i++){
                if(color[i]==0) tot0+=confidence[i];
                else tot1+=confidence[i]; 
            }
            return max(tot0, tot1);
        }
    }
}

컴파일 시 표준 에러 (stderr) 메시지

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:130:1: warning: control reaches end of non-void function [-Wreturn-type]
  130 | }
      | ^

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