Submission #1037942

#	Time	Username	Problem	Language	Result	Execution time	Memory
1037942		Mr_Husanboy	모임들 (IOI18_meetings)	C++17	19 / 100	1807 ms	786432 KiB

meetings

#include "meetings.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ff first
#define ss second
#define all(a) (a).begin(), (a).end()

template<typename T>
int len(T &a){
  return a.size();
}
const ll infl = 1e18 + 110;

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());


vector<long long> minimum_costs(vector<int> h, vector<int> L,
                                     vector<int> R) {
  int n = len(h);
  int q = len(L);
  vector<vector<ll>> cost(n, vector<ll> (n, 0));
  for(int i = 0; i < n; i ++){
    int mx = 0;
    for(int j = i; j >= 0; j --){
      mx = max(mx, h[j]);
      cost[i][j] = mx;
    }
    mx = 0;
    for(int j = i; j < n; j ++){
      mx = max(mx, h[j]);
      cost[i][j] = mx;
    }
    for(int j = 1; j < n; j ++){
      cost[i][j] += cost[i][j - 1];
    }
  }

  vector<ll> res(q, infl);
  for(int i = 0; i < q; i ++){
    for(int j = L[i]; j <= R[i]; j ++){
      res[i] = min(res[i], cost[j][R[i]] - (L[i] ? cost[j][L[i] - 1] : 0));
    }
  }
  return res;
}

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