제출 #1210295

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1210295		loiiii12358	모임들 (IOI18_meetings)	C++20	19 / 100	572 ms	851968 KiB

meetings

#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long

std::vector<long long> minimum_costs(std::vector<int32_t> H, std::vector<int32_t> L,
                                     std::vector<int32_t> R) {
  int N=H.size(),Q = L.size(),tmp;
  vector<long long> C(Q);
  vector<vector<int>> dist(N,vector<int>(N)),sum(N,vector<int>(N,0));
  for(int i=0;i<N;i++){
    tmp=0;
    for(int j=i;j<N;j++){
      tmp=max(tmp,(int)H[j]);
      dist[i][j]=dist[j][i]=tmp;
    }
  }
  for(int i=0;i<N;i++){
    for(int j=i-1;j>=0;j--){
      sum[i][j]=sum[i][j+1]+dist[i][j];
    }
    for(int j=i+1;j<N;j++){
      sum[i][j]=sum[i][j-1]+dist[i][j];
    }
  }
  for(int i=0;i<Q;i++){
    tmp=1e18;
    for(int j=L[i];j<=R[i];j++){
      if(sum[j][L[i]]+sum[j][R[i]]+H[j]<tmp){
        tmp=sum[j][L[i]]+sum[j][R[i]]+H[j];
      }
    }
    C[i]=tmp;
  }
  return C;
}

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