제출 #116524

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
116524		mirbek01	모임들 (IOI18_meetings)	C++11	19 / 100	757 ms	196344 KiB

meetings

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

using namespace std;

const int N = 8e5 + 2;
const int M = 5e3 + 2;

long long a[M][M];

vector<long long> minimum_costs(vector<int> H, vector<int> L, vector<int> R) {
      int Q = L.size();
      int n = H.size();
      vector<long long> C(Q);
      if(n <= 5000){
            for(int i = 0; i < n; i ++){
                  a[i][i] = H[i];
                  for(int j = i - 1; j >= 0; j --)
                        a[i][j] = max(int(a[i][j + 1]), H[j]);
                  for(int j = i + 1; j < n; j ++)
                        a[i][j] = max(int(a[i][j - 1]), H[j]);
                  for(int j = 1; j < n; j ++)
                        a[i][j] += a[i][j - 1];
            }
            for(int i = 0; i < Q; i ++){
                  long long ret = 5e18;
                  for(int j = L[i]; j <= R[i]; j ++){
                        long long now = a[j][R[i]];
                        if(L[i])
                              now -= a[j][L[i] - 1];
                        ret = min(ret, now);
                  }
                  C[i] = ret;
            }
      } else {

      }
      return C;
}

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