제출 #1291223

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1291223		lucaskojima	Cloud Computing (CEOI18_clo)	C++17	0 / 100	3 ms	576 KiB

clo

#include "bits/stdc++.h"
#define sz(x) (int)size(x)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define int long long

using namespace std;
using ll = long long;
using pii = pair<int, int>;

const char nl = '\n';
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;

struct T {
  int c, f, v;
};

int32_t main() {
  ios::sync_with_stdio(0), cin.tie(0);

  int n; cin >> n;
  vector<T> a(n);
  for (int i = 0; i < n; i++)
    cin >> a[i].c >> a[i].f >> a[i].v;

  int m; cin >> m;
  vector<T> b(m);
  for (int i = 0; i < m; i++)
    cin >> b[i].c >> b[i].f >> b[i].v;

  int ans = 0;
  for (int mask = 0; mask < (1 << n); mask++) {
    int cost = 0;
    for (int i = 0; i < n; i++)
      if ((mask >> i) & 1)
        cost -= a[i].v;

    for (int j = 0; j < m; j++) {
      int qnt = 0;
      for (int i = 0; i < n; i++)
        if ((mask >> i) & 1)
          if (a[i].f >= b[j].f)
            qnt += a[i].c;

      if (qnt >= b[j].c)
        cost += b[j].v;
    }

    ans = max(ans, cost);
  }

  cout << ans << nl;
  return 0;
}

• Subtask 1: 0 / 18
• Subtask 2: 0 / 18
• Subtask 3: 0 / 18
• Subtask 4: 0 / 18
• Subtask 5: 0 / 18
• Subtask 6: 0 / 10