제출 #151717

#제출 시각아이디문제언어결과실행 시간메모리
151717willi19친구 (IOI14_friend)C++14
27 / 100
38 ms3468 KiB
#include "friend.h"
#include<bits/stdc++.h>
using namespace std;
int c[100100],h[100100],p[100100];
int dp(int ind)
{
    if(ind==0)
        return max(0,c[0]);
    if(p[ind]==0)
    {
        c[h[ind]]-=c[ind];
        return dp(ind-1)+c[ind];
    }
    if(p[ind]==1)
    {
        if(c[ind]<=0)
            return dp(ind-1);
        if(c[h[ind]]>0) c[h[ind]]+=c[ind];
        else c[h[ind]]=c[ind];
        return dp(ind-1);
    }
    if(p[ind]==2)
    {
        c[h[ind]]=max(c[h[ind]],c[ind]);
        return dp(ind-1);
    }
}
int findSample(int n,int confidence[],int host[],int protocol[]){
    for(int i=0;i<n;i++)
    {
        c[i]=confidence[i];
        h[i]=host[i];
        p[i]=protocol[i];
    }
    return dp(n-1);
}

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

friend.cpp: In function 'int dp(int)':
friend.cpp:27:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...