제출 #425639

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
425639		MarcoMeijer	모임들 (IOI18_meetings)	C++14	19 / 100	814 ms	786436 KiB

meetings

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

typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef vector<ii> vii;

#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define RE(a,b) REP(a,0,b)
#define RE1(a,b) REP(a,1,b+1)
#define FOR(a,b) for(auto& a : b)
#define pb push_back
#define fi first
#define se second
#define all(a) a.begin(), a.end()

vll minimum_costs(vi H, vi L, vi R) {
  int n = H.size();
  int q = L.size();

  vector<vll> costL, costR;
  RE(i,2) (i?costL:costR).assign(n,vll(n,0));
  RE(i,n) {
    ll mx = 0;
    ll res = 0;
    REP(j,i,n) {
      mx = max<ll>(mx,H[j]);
      res += mx;
      costL[i][j] = res;
    }
    mx = res = 0;
    REV(j,0,i+1) {
      mx = max<ll>(mx,H[j]);
      res += mx;
      costR[i][j] = res;
    }
  }

  vll C(q,1e18);
  RE(cq,q) {
    int l=L[cq], r=R[cq];
    REP(i,l,r+1) {
      C[cq] = min(C[cq], costR[i][l] + costL[i][r] - H[i]);
    }
  }
  return C;
}

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