제출 #115300

#제출 시각아이디문제언어결과실행 시간메모리
115300faustaadp친구 (IOI14_friend)C++17
16 / 100
2 ms384 KiB
#include "friend.h" #include<bits/stdc++.h> typedef long long ll; #define pb push_back #define mp make_pair #define fi first #define se second using namespace std; // Find out best sample ll i,n,b[3],a[101010],jum,ma; int findSample(int n,int confidence[],int host[],int protocol[]) { //int ans=10; for(i=0;i<n;i++) { if(i>=1) b[protocol[i]]=1; a[i]=confidence[i]; jum+=a[i]; ma=max(ma,a[i]); } if(b[0]==0&&b[1]==1&&b[2]==0) return jum; if(b[0]==0&&b[1]==0&&b[2]==1) return ma; }

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

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:26: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...