제출 #1018298

#제출 시각아이디문제언어결과실행 시간메모리
1018298vjudge1모임들 (IOI18_meetings)C++17
19 / 100
1669 ms786432 KiB
#include "meetings.h" #include <bits/stdc++.h> #define ll long long #define rep(a,b,c) for(int a=b; a<c; a++) #define repr(a,b,c) for(int a=b-1; a>c-1; a--) using namespace std; vector<long long> minimum_costs(vector<int> H, vector<int> L, vector<int> R) { int Q = L.size(), N=H.size(); vector<long long> C(Q,1e18); ll ans[N][N], mx, sum; rep(i,0,N){ mx=0; sum=-H[i]; rep(j,i,N){ mx=max(mx,(ll)H[j]); ans[i][j]=mx+sum; sum=ans[i][j]; } mx=H[i]; sum=0; repr(j,i,0){ mx=max(mx,(ll)H[j]); ans[i][j]=mx+sum; sum=ans[i][j]; } } rep(i,0,Q) rep(j,L[i],R[i]+1) C[i]=min(C[i],ans[j][L[i]]+ans[j][R[i]]+H[j]); return C; }
#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...