제출 #93797

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
93797		Bodo171	친구 (IOI14_friend)	C++14	27 / 100	79 ms	12004 KiB

friend

#include "friend.h"
#include <vector>
#include <iostream>
// Find out best sample
using namespace std;
const int nmax=100005;
vector<int> v[nmax],ad[nmax],inloc[nmax];
int sum[nmax][2],best[nmax][2];
int a[nmax],val[nmax];
int nr,p,tip;
void dfs(int x)
{
    for(int i=0;i<v[x].size();i++)
       dfs(v[x][i]);
    for(int i=0;i<inloc[x].size();i++)
        dfs(inloc[x][i]);
    for(int i=0;i<ad[x].size();i++)
        dfs(ad[x][i]);
    nr=0;
    for(int i=0;i<v[x].size();i++)
    {
        a[++nr]=v[x][i];
        sum[nr][0]=sum[nr-1][0]+best[a[nr]][0];
        sum[nr][1]=sum[nr-1][1]+max(best[a[nr]][0],best[a[nr]][1]);
    }
    int totad=0,totinloc=0;
    for(int i=0;i<ad[x].size();i++)
        totad+=best[ad[x][i]][0];
    for(int i=0;i<inloc[x].size();i++)
        totinloc+=best[inloc[x][i]][0];
    best[x][1]=sum[nr][0]+val[x]+totad+totinloc;
    for(int i=0;i<ad[x].size();i++)
    {
        p=0;
        while(a[p]<=ad[x][i]&&p<=nr)
            p++;
        p--;
        best[x][1]=max(best[x][0],sum[p][0]+sum[nr][1]-sum[p][1]+best[ad[x][i]][1]+totad+totinloc-best[ad[x][i]][0]);
        best[x][1]=max(best[x][1],sum[nr][0]+val[x]+best[ad[x][i]][1]+totad+totinloc-best[ad[x][i]][0]);
    }
    for(int i=0;i<inloc[x].size();i++)
    {
        p=0;
        while(a[p]<=inloc[x][i]&&p<=nr)
            p++;
        p--;
        best[x][1]=max(best[x][1],best[inloc[x][i]][1]+sum[nr][1]-sum[p][1]+sum[p][0]+totad+totinloc-best[inloc[x][i]][0]);
    }
    for(int i=0;i<v[x].size();i++)
        best[x][0]+=max(best[v[x][i]][0],best[v[x][i]][1]);
    for(int i=0;i<ad[x].size();i++)
        best[x][0]+=best[ad[x][i]][0];
    for(int i=0;i<inloc[x].size();i++)
        best[x][0]+=best[inloc[x][i]][0];
}
int findSample(int n,int confidence[],int host[],int protocol[]){
    for(int i=0;i<n;i++)
        val[i]=confidence[i];
    for(int i=1;i<n;i++)
    {
        tip=protocol[i];
        if(tip==0)
        {
            v[host[i]].push_back(i);
        }
        if(tip==1)
        {
            ad[host[i]].push_back(i);
        }
        if(tip==2)
        {
            inloc[host[i]].push_back(i);
        }
    }
    dfs(0);
	return max(best[0][0],best[0][1]);
}

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

friend.cpp: In function 'void dfs(int)':
friend.cpp:13:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<v[x].size();i++)
                 ~^~~~~~~~~~~~
friend.cpp:15:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<inloc[x].size();i++)
                 ~^~~~~~~~~~~~~~~~
friend.cpp:17:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<ad[x].size();i++)
                 ~^~~~~~~~~~~~~
friend.cpp:20:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<v[x].size();i++)
                 ~^~~~~~~~~~~~
friend.cpp:27:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<ad[x].size();i++)
                 ~^~~~~~~~~~~~~
friend.cpp:29:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<inloc[x].size();i++)
                 ~^~~~~~~~~~~~~~~~
friend.cpp:32:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<ad[x].size();i++)
                 ~^~~~~~~~~~~~~
friend.cpp:41:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<inloc[x].size();i++)
                 ~^~~~~~~~~~~~~~~~
friend.cpp:49:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<v[x].size();i++)
                 ~^~~~~~~~~~~~
friend.cpp:51:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<ad[x].size();i++)
                 ~^~~~~~~~~~~~~
friend.cpp:53:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<inloc[x].size();i++)
                 ~^~~~~~~~~~~~~~~~

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