제출 #204182

#제출 시각아이디문제언어결과실행 시간메모리
204182awlintqaa선물상자 (IOI15_boxes)C++14
0 / 100
5 ms376 KiB
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0) #include <bits/stdc++.h> using namespace std; #define sqr 200 #define mid (l+r)/2 #define pb push_back #define ppb pop_back #define fi first #define se second #define lb lower_bound #define ub upper_bound #define ins insert #define era erase #define C continue #define mem(dp,i) memset(dp,i,sizeof(dp)) #define mset multiset typedef long long ll; typedef short int si; typedef long double ld; typedef pair<int,int> pi; typedef pair<ll,ll> pll; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll; const ll mod=1e9+7; const ll inf= 4e18; const ld pai=acos(-1); #include "boxes.h" ll sz; ll a[1009]; ll calc1(ll x){ return x; } ll calc2(ll x){ return sz -x ; } long long delivery(int N, int K, int L, int p[]) { sz = L; for(int i=0;i<N;i++){ a[i+1]=p[i]; } ll ans=inf; for(int i=1;i<=N+1;i++){ ll sum1 = calc1(a[i-1]) + min(calc1(a[i-1]) ,calc2(a[i-1]) ); ll sum2 = calc2(a[i]) + min(calc1(a[i]) ,calc2(a[i]) ); ans =min(ans,sum1+sum2); } cout << ans << endl; return ans; }

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:38:31: warning: unused parameter 'K' [-Wunused-parameter]
 long long delivery(int N, int K, int L, int p[]) {
                               ^
#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...