제출 #165327

#제출 시각아이디문제언어결과실행 시간메모리
165327losmi247선물상자 (IOI15_boxes)C++14
0 / 100
3 ms376 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1e7+67; ll n,k,l,a[N]; ll delivery(int d,int K,int L,int positions[]){ n = d,k = K,l = L; for(int i = 1; i <= n; i++){ a[i] = positions[i-1]; } if(k == 1){ ll sol = 0; for(int i = 1; i <= n; i++){ sol += min(2*a[i],l); } return sol; } if(k == n){ } } /*int main(){ }*/

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

boxes.cpp: In function 'll delivery(int, int, int, int*)':
boxes.cpp:23: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...