Submission #551914

#	Time	Username	Problem	Language	Result	Execution time	Memory
551914		smunteanu	Jelly Flavours (IOI20_jelly)	C++14	9 / 100	2 ms	352 KiB

jelly

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

int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {

  typedef pair<int,int> ipair;

  int n = (int)a.size();

  bool v[n]; memset(v, 0, n);

  for (int i = 0; i < n; i++) v[i] = !b[i];

  ipair s[n];
  for (int i = 0; i < n; i++) s[i] = {a[i], i};
  sort(s, s + n);

  for (int i = 0; i < n; i++) {
    if (v[s[i].second]) continue;
    if (x - s[i].first >= 0) x -= s[i].first, v[s[i].second] = true;
    else break;
  }

  int t = 0;
  for (int i = 0; i < n; i++) t += v[i];

  return t;

}

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