제출 #134538

#제출 시각아이디문제언어결과실행 시간메모리
13453820160161simone선물상자 (IOI15_boxes)C++14
0 / 100
2 ms376 KiB
#include "boxes.h" #include <bits/stdc++.h> #define M 100000010 using namespace std; int mi[M]; long long delivery(int N, int K, int L, int p[]) { for(int i=0;i<N;i++){ mi[i]=min(abs(L-p[i]),abs(p[i]))*2; } sort(mi+1,mi+1+N); int ans=0,val=0,k=0; for(int i=1;i<=N;i++) { k++; val=max(mi[i],val); if(k==K) { ans+=val; val=0; k=0; } } ans+=val; }

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:25:1: warning: no return statement in function returning non-void [-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...