Submission #434273

#	Time	Username	Problem	Language	Result	Execution time	Memory
434273		madlogic	Jelly Flavours (IOI20_jelly)	C++17	0 / 100	2085 ms	344 KiB

jelly

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

int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) {
  int n = (int) a.size();
  vector<pair<int, int>> jellies(n);
  for (int i = 0; i < n; i++) {
    jellies[i].first = a[i];
    jellies[i].second = b[i];
  }
  sort(jellies.begin(), jellies.end());
  int res = 0;
  for (int i = 0; i < n; i++) {
    int sum = 0;
    for (int j = i; j < n; j++) {
      if (sum + jellies[j].first > x)  {
        break;
      }
      sum += jellies[j].first;
      int cur = j - i + 1;
      vector<int> rem;
      for (int k = 0; k < n; k++) {
        if (k >= i && k <= j) {
          continue;
        }
        rem.push_back(jellies[k].second);
      }
      sort(rem.begin(), rem.end());
      int tmp = y;
      for (int& cost : rem) {
        if (tmp - cost >= 0) {
          tmp -= cost;
          ++cur;
        }
      }
      res = max(res, cur);
    }
  } 
  return res;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 24
• Subtask 3: 0 / 9
• Subtask 4: 0 / 10
• Subtask 5: 0 / 14
• Subtask 6: 0 / 32