제출 #410043

#제출 시각아이디문제언어결과실행 시간메모리
410043robs선물상자 (IOI15_boxes)C++17
10 / 100
1 ms204 KiB
#include "boxes.h" #include <bits/stdc++.h> #define debug(args...) fprintf(stderr, args) #define clli (long long int) typedef long long int lli; using namespace std; const lli maxn = 2e7, INF = 1e18; lli n, k, m, dp1[maxn], dp2[maxn], ini[maxn], fim[maxn], resp; long long delivery(int N, int K, int L, int p[]) { n = clli N; m = clli L; k = clli K; resp = INF; for(int x = 0; x < n; x++) ini[x] = clli 2*p[x] + ((x >= k)?ini[x-k]:0); for(int x = n-1; x >= 0; x--) fim[x] = clli 2*(m-p[x]) + ((x+k < n)?ini[x+k]:0); resp = min(ini[n-1], fim[0]); for(int x = 0; x < n-1; x++) resp = min(resp, ini[x]+fim[x+1]); if(k >= m) resp = min(resp, m); else { for(int x = 1; x+k < n; x++) resp = min(resp, ini[x-1]+m+fim[x+k]); resp = min(resp, m+ini[n-k-1]); resp = min(resp, m+fim[k]); } // ll ans = min(2*suf[0], 2*pref[N-1]); // if(K >= N) ans = min(ans, (ll) L); // for(int i = 0; i < N-1; i++) ans = min(ans, 2*suf[i+1] + 2*pref[i]); // // achar volta // if(K < N){ // for(int i = 1; i+K < N; i++ ){ // ans = min(ans, L + 2*pref[i-1] + 2*suf[i+K]); // } // ans = min(ans, L + 2*pref[N-K-1]); // ans = min(ans, L + 2*suf[K]); // dou a volta, e pego o resto com uma ida do outro lado // } // debug("%d\n",resp); // for(int x = 0; x < n; x++) // debug("ini[%d] = %d, fim[%d] = %d// %d // %d\n",x,ini[x],x,fim[x],ini[x]+fim[x+1],ini[x-1]+m+fim[x+k]); return resp; }

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:16:15: warning: conversion from 'lli' {aka 'long long int'} to 'int' may change value [-Wconversion]
   16 |  for(int x = n-1; x >= 0; x--)
      |              ~^~
boxes.cpp:25:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   25 |  for(int x = 1; x+k < n; x++)
      |  ^~~
boxes.cpp:27:3: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   27 |   resp = min(resp, m+ini[n-k-1]);
      |   ^~~~
#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...