제출 #305462

#제출 시각아이디문제언어결과실행 시간메모리
305462vipghn2003선물상자 (IOI15_boxes)C++14
0 / 100
1 ms384 KiB
#include<bits/stdc++.h> using namespace std; int delivery(int n,int k,int L,int pos[]) { vector<int>l(n+1),r(n+1); sort(pos,pos+n); int mid=L/2+1; int cntl=0; for(int i=0;i<n;i++) { cntl++; if(cntl>=k) l[cntl]=l[cntl-k]+pos[i]*2; else l[cntl]=pos[i]*2; } int cntr=0; for(int i=n-1;i>=0;i--) { cntr++; if(cntr>=k) r[cntr]=r[cntr-k]+(L-pos[i]+1)*2; else r[cntr]=(L-pos[i]+1)*2; } int res=1e9; for(int i=0;i<=n;i++) { res=min(res,l[i]+r[n-i]); if(n-i-k>=0) res=min(res,l[i]+r[n-i-k]+L); } return res; } /* int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n,k,L; cin>>n>>k>>L; int pos[n]; for(int i=0;i<n;i++) cin>>pos[i]; cout<<delivery(n,k,L,pos); }*/

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

boxes.cpp: In function 'int delivery(int, int, int, int*)':
boxes.cpp:9:9: warning: unused variable 'mid' [-Wunused-variable]
    9 |     int mid=L/2+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...