제출 #1158554

#제출 시각아이디문제언어결과실행 시간메모리
1158554SulA모임들 (IOI18_meetings)C++20
0 / 100
5595 ms1604 KiB
#include <bits/stdc++.h> #define all(a) a.begin(), a.end() #define popcount __builtin_popcount using namespace std; vector<long long> minimum_costs(vector<int> H, vector<int> l, vector<int> r) { int n = H.size(), q = l.size(); vector<long long> ans(q); for (int i = 0; i < q; i++) { for (int x = l[i]; x <= r[i]; x++) { int mx = 0; for (int y = x; y >= l[i]; y--) { mx = max(mx, H[y]); ans[i] += mx; } mx = H[x]; for (int y = x+1; y <= r[i]; y++) { mx = max(mx, H[y]); ans[i] += mx; } } } 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...