제출 #134701

#제출 시각아이디문제언어결과실행 시간메모리
134701Boxworld선물상자 (IOI15_boxes)C++14
0 / 100
2 ms348 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; long long delivery(int N, int K, int L, int p[]){ int m=-1; long long ans=1e16; for (int i=0;i<N;i++) if (p[i]*2<L)m=i; int r=m,l=m+1; for (int j=0;j*K<=N;j++){ long long ans1=j*L; for (int i=0;i<K;i++){ if (r!=0&&p[r]>L-p[l])r--; else if (l<N)l++;else r--; } for (int i=r;i>=0;i-=K)ans1+=p[i]*2; for (int i=l;i<N;i+=K)ans1+=(L-p[i])*2; ans=min(ans,ans1); } return ans; }

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:7:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for (int i=0;i<N;i++)
     ^~~
boxes.cpp:9:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  int r=m,l=m+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...