제출 #1239305

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

nile

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

using namespace std;

typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;

#define sz(x) int((x).size())
#define bg(x) (x).begin()
#define en(x) (x).end()
#define all(x) bg(x), en(x)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define srt(x) sort(all(x))
#define rev(x) reverse(all(x))
#define pb push_back
#define lb lower_bound
#define ub upper_bound

vl calculate_costs(vi W, vi A, vi B, vi E) {
  int n = sz(W), q = sz(E);
  vl w(all(W)), a(all(A)), b(all(B)), e(all(E));

  vl R(q, 0);
  FOR(i, 0, q) {
    R[i] = accumulate(all(b), 0LL);
    if (n % 2 == 1) {
      int best = 0;

      FOR(j, 0, n) {
        if (a[j] - b[j] < a[best] - b[best]) best = j;
      }

      R[i] -= B[best];
      R[i] += A[best];
    }
  }
  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