Submission #915727

#TimeUsernameProblemLanguageResultExecution timeMemory
915727biankMeetings (IOI18_meetings)C++14
19 / 100
5572 ms504816 KiB
#include "meetings.h" #include <bits/stdc++.h> using namespace std; #define SIZE(x) int(x.size()) #define forn(i,n) for(int i=0;i<int(n);i++) #define forsn(i,s,n) for(int i=int(s);i<int(n);i++) #define dforn(i,n) for(int i=int(n)-1;i>=0;i--) typedef long long ll; typedef vector<ll> vll; typedef vector<int> vi; const ll INF = 1e18; vll minimum_costs(vi h, vi l, vi r) { int q=SIZE(l), n=SIZE(h); vector<vll> p(n,vll(n+1)); forn(i,n) { vi c(n); c[i]=h[i]; dforn(j,i) c[j]=max(c[j+1],h[j]); forsn(j,i+1,n) c[j]=max(c[j-1],h[j]); forn(j,n) p[i][j+1]=p[i][j]+c[j]; } vll ans(q,INF); forn(i,q) { r[i]++; forn(j,n) ans[i]=min(ans[i],p[j][r[i]]-p[j][l[i]]); } return ans; }
#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...