Submission #1232371

#TimeUsernameProblemLanguageResultExecution timeMemory
1232371VMaksimoski008모임들 (IOI18_meetings)C++20
19 / 100
5591 ms4936 KiB
#include "meetings.h" #include <bits/stdc++.h> using namespace std; using ll = long long; vector<ll> minimum_costs(vector<int> a, vector<int> L, vector<int> R) { int q = L.size(), n = a.size(); vector<ll> ans(q, 1e18), pref(n), suf(n); for(int i=0; i<n; i++) { pref[i] = suf[i] = a[i]; int mx = a[i]; for(int j=i-1; j>=0; j--) { mx = max(mx, a[j]); pref[j] = pref[j+1] + mx; } mx = a[i]; for(int j=i+1; j<n; j++) { mx = max(mx, a[j]); suf[j] = suf[j-1] + mx; } for(int j=0; j<q; j++) { ans[j] = min(ans[j], pref[L[j]] + suf[R[j]] - a[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...