제출 #775310

#제출 시각아이디문제언어결과실행 시간메모리
775310danikoynov친구 (IOI14_friend)C++14
16 / 100
1 ms400 KiB
#include "friend.h" #include<bits/stdc++.h> using namespace std; // Find out best sample const int maxn = 1010; vector < int > adj[maxn]; int findSample(int n,int confidence[],int host[],int protocol[]) { bool only_my = true, only_we = true; for (int i = 1; i < n; i ++) { if (protocol[i] != 1) only_my = false; if (protocol[i] != 2) only_we = false; } if (only_my) { int ans = 0; for (int i = 0; i < n; i ++) ans += confidence[i]; return ans; } else if (only_we) { int ans = 0; for (int i = 0; i < n; i ++) ans = max(ans, confidence[i]); return ans; } }

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

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:36:1: warning: control reaches end of non-void function [-Wreturn-type]
   36 | }
      | ^
#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...