제출 #288861

#제출 시각아이디문제언어결과실행 시간메모리
288861BeanZ선물상자 (IOI15_boxes)C++14
10 / 100
1 ms384 KiB
#include <bits/stdc++.h> #include "boxes.h" using namespace std; #define ll long long #define endl '\n' const int N = 2e5 + 5; ll dp[10000007]; ll delivery(int n, int k, int l, int position[]){ for (int i = 1; i <= n; i++){ ll cost = 1e18; cost = min(cost, 1ll * position[i - 1] * 2); cost = min(cost, (1ll * l - position[max(i - k, 0)]) * 2); cost = min(cost, 1ll * l); dp[i] = dp[max(0, i - k)] + cost; } return dp[n]; } /* int main(){ ios_base::sync_with_stdio(false); cin.tie(0); if (fopen("VietCT.INP", "r")){ freopen("VietCT.INP", "r", stdin); freopen("VietCT.OUT", "w", stdout); } } /* */

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

boxes.cpp:29:1: warning: "/*" within comment [-Wcomment]
   29 | /*
      |
#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...