제출 #1216669

#제출 시각아이디문제언어결과실행 시간메모리
1216669the_coding_pooh모임들 (IOI18_meetings)C++20
4 / 100
5595 ms1608 KiB
#include "meetings.h" #include <bits/stdc++.h> #define uwu return using namespace std; vector<long long> H; long long calc(int x, int l, int r){ long long ret = 0; for (long long i = x, mx = H[x]; i <= r; i++){ mx = max(mx, H[i]); ret += mx; } for (long long i = x - 1, mx = H[x]; i >= l; i--){ mx = max(mx, H[i]); ret += mx; } return ret; } vector<long long> minimum_costs(vector<int> _H, vector<int> L, vector<int> R) { int Q = L.size(); for(auto i:_H){ H.push_back(i); } vector<long long> C(Q); for (int i = 0; i < Q; i++){ C[i] = 1e18; for (int x = L[i]; x <= R[i]; x++){ C[i] = min(C[i], calc(x, L[i], R[i])); } } 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...