제출 #519586

#제출 시각아이디문제언어결과실행 시간메모리
519586silverfish선물상자 (IOI15_boxes)C++17
0 / 100
2 ms216 KiB
#include <bits/stdc++.h> #include "boxes.h" using namespace std; using ll = long long; const int N = 1000007; ll dp[N], p[N]; long long delivery(int n, int k, int L, int p[]) { ll l = L; fill(dp, dp+n, 1LL*n*l); dp[0] = 0; for(int i = 1; i <= n; ++i){ ll mn = min(l, 2LL*p[i-1]); for(int j = i; j > max(i-k, 0); --j){ ll cmn = min(mn, 2LL*(l-p[j-1])); dp[i] = min(dp[i], dp[j-1] + cmn); } } return dp[n]; }

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:9:45: warning: declaration of 'p' shadows a global declaration [-Wshadow]
    9 | long long delivery(int n, int k, int L, int p[]) {
      |                                         ~~~~^~~
boxes.cpp:7:11: note: shadowed declaration is here
    7 | ll dp[N], p[N];
      |           ^
#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...