제출 #239007

#제출 시각아이디문제언어결과실행 시간메모리
239007Autoratch선물상자 (IOI15_boxes)C++14
0 / 100
5 ms384 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; const int N = 1e7 + 2; long long dp[N],dr[N],ans = LLONG_MAX; long long delivery(int n,int k,int l,int p[]) { for(int i = 1;i <= n;i++) { dp[i] = dp[max(i-l,0)]+p[i-1]*2; } for(int i = n;i >= 1;i--) { dr[i] = dr[min(i+l,n+1)]+(l-p[i-1])*2; } for(int i = 0;i <= n;i++) ans = min(ans,dp[i]+dr[i+1]); return ans; }

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:9:30: warning: unused parameter 'k' [-Wunused-parameter]
 long long delivery(int n,int k,int l,int p[]) 
                              ^
#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...