제출 #446580

#제출 시각아이디문제언어결과실행 시간메모리
446580FEDIKUSBoxes with souvenirs (IOI15_boxes)C++17
10 / 100
1 ms332 KiB
#include "boxes.h" #include<bits/stdc++.h> using namespace std; typedef long long ll; const int maxn=1e7+10; ll bn[maxn]; ll bp[maxn]; ll delivery(int n, int k, int l, int p[]) { ll ret=LLONG_MAX; int koliko=0; for(int i=0;i<n;i++){ if(i-k<0) bn[i]=2*p[i]; else{ bn[i]=bn[i-k]+2*p[i]; } } for(int i=n-1;i>=0;i--){ if(i+k>=n) bp[i]=2*(l-p[i]); else{ bp[i]=bp[i+k]+2*(l-p[i]); } } for(int i=-1;i<n;i++){ ret=min(ret,(i>=0 ? bn[i]:0)+(i+1<n ? bp[i+1]:0)); } return ret; }

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

boxes.cpp: In function 'll delivery(int, int, int, int*)':
boxes.cpp:15:9: warning: unused variable 'koliko' [-Wunused-variable]
   15 |     int koliko=0;
      |         ^~~~~~
#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...