제출 #720489

#제출 시각아이디문제언어결과실행 시간메모리
720489LittleCube모임들 (IOI18_meetings)C++14
19 / 100
673 ms216252 KiB
#include "meetings.h"
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

namespace
{
  int N, Q;
  pll mx[5005][5005];
  vector<int> H;
};

ll query(int L, int R)
{
  if (R < L)
    return 1e18;
  if (L == R)
    return H[L];
  else
  {
    auto [h, mid] = mx[L][R];
    return min(query(L, mid - 1) + (R - mid + 1) * h, query(mid + 1, R) + (mid - L + 1) * h);
  }
}

vector<ll> minimum_costs(vector<int> H, vector<int> L, vector<int> R)
{
  N = H.size(), Q = L.size();
  ::H = H;
  vector<ll> C(Q);
  for (int i = 0; i < N; i++)
    mx[i][i] = pii(H[i], i);
  for (int i = 0; i < N; i++)
    for (int j = i + 1; j < N; j++)
      mx[i][j] = max(mx[i][j - 1], mx[j][j]);
  for (int i = 0; i < Q; i++)
    C[i] = query(L[i], R[i]);
  return C;
}

컴파일 시 표준 에러 (stderr) 메시지

meetings.cpp: In function 'long long int query(int, int)':
meetings.cpp:25:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   25 |     auto [h, mid] = mx[L][R];
      |          ^
#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...