Submission #913895

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
913895	2024-01-20 12:28:48	Trisanu_Das	Meetings (IOI18_meetings)	C++17	19 / 100	3372 ms	786432 KiB

meetings

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
#include "meetings.h"
#include <bits/stdc++.h>
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> A(Q);
  vector<vector<long long>> cost(N, vector<long long>(N, 0));
  for(int i = 0; i < N; ++i){
    for(int j = i - 1, c = H[i]; j >= 0; --j){
      c = max(c, H[j]);
      cost[i][j] = cost[i][j + 1] + c;
    }
    for(int j = i + 1, c = H[i]; j < N; ++j){
      c = max(c, H[j]);
      cost[i][j] = cost[i][j - 1] + c;
    }
  }
  for(int i = 0; i < Q; ++i){
    long long ans = 1e18;
    for(int j = L[i]; j <= R[i]; ++j){
      long long C = cost[j][L[i]] + H[j] + cost[j][R[i]];
      ans = min(ans, C);
    }
    A[i] = ans;
  }
    return A;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 4 / 4
• Subtask 2: 15 / 15
• Subtask 3: 0 / 17
• Subtask 4: 0 / 24
• Subtask 5: 0 / 40