Submission #551912

#	Time	Username	Problem	Language	Result	Execution time	Memory
551912		smunteanu	Jelly Flavours (IOI20_jelly)	C++14	0 / 100	1 ms	340 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);
  
  vector<ipair> s(n);
  
  for (int i = 0; i < n; i++)
    s[i] = {a[i], i};

  sort(s.begin(), s.end());

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

  for (int i = 0; i < n; i++) {
    x -= s[i].first;
    if (x >= 0) 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: 0 / 9
• Subtask 4: 0 / 10
• Subtask 5: 0 / 14
• Subtask 6: 0 / 32