제출 #134588

#제출 시각아이디문제언어결과실행 시간메모리
134588StevenH선물상자 (IOI15_boxes)C++14
0 / 100
2 ms376 KiB
#include "boxes.h" long long delivery(int N, int K, int L, int p[]) { if(K==1) { int ans=0; for(int i=0;i<N;i++) { if(p[i]>N/2) ans+=(N-p[i])*2; else ans+=p[i]*2; } return ans; } else if(K==N) { int mx=-1; int mn=999999999; for(int i=0;i<N;i++) { if(p[i]>mx)mx=p[i]; if(p[i]<mn)mn=p[i]; } if(mx>N/2 && mn<N/2)return N; else if(mx<N/2 && mn<N/2)return mx*2; else if(mx>N/2 && mn>N/2)return (N-mn)*2; else return N; } //return 0; }

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:3:38: warning: unused parameter 'L' [-Wunused-parameter]
 long long delivery(int N, int K, int L, int p[]) {
                                      ^
boxes.cpp:33: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...