제출 #1177133

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1177133		madamadam3	나일강 (IOI24_nile)	C++20	6 / 100	17 ms	2632 KiB

nile

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

using namespace std;

typedef long long ll;
using vi = vector<int>;

// input
// W[i] = weight of artifact i
// A[i] = cost of transporting artifact i by itself
// B[i] = cost of transporting artifact i with another artifact
// E[j] = maximum weight different for artifacts going together for query j

// output
// R[i] = min cost of transporting all artifacts, when D = R[j]

vector<ll> calculate_costs(vi W, vi A, vi B, vi E) {
  int N = W.size(), Q = E.size();
  vector<ll> R(Q, 0);

  for (int j = 0; j < Q; j++) {
    ll SUM = 0; for (int i = 0; i < N; i++) SUM += B[i];
    ll MIN = numeric_limits<ll>::max();

    if (N % 2 == 0) {
      MIN = SUM;
      R[j] = MIN;
      continue;
    }

    for (int i = 0; i < N; i++) {
      MIN = min(MIN, SUM - B[i] + A[i]);
    }

    R[j] = MIN;
  }

  return R;
}

• Subtask 0: 0 / 0
• Subtask 1: 6 / 6
• Subtask 2: 0 / 13
• Subtask 3: 0 / 17
• Subtask 4: 0 / 11
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15
• Subtask 7: 0 / 18