Submission #872693

#	Time	Username	Problem	Language	Result	Execution time	Memory
872693		LucaLucaM	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	0 ms	348 KiB

molecules

#include "molecules.h"
#ifdef LOCAL
#include "grader.cpp"
#endif
#include <vector>
#include <cassert>
#include <algorithm>

typedef long long ll;

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
  int n = (int) w.size();
  std::vector<std::pair<int, int>> a(n);
  for (int i = 0; i < n; i++) {
    a[i] = {w[i], i};
  }
  std::sort(a.begin(), a.end());
  std::vector<int> ret;
  ll s = 0;

  for (const auto &[val, idx] : a) {
    if (l <= val && val <= u) {
      ret = {idx};
      return ret;
    }
  }

  for (const auto &[val, idx] : a) {
    if (val < l) {
      s += val;
      ret.push_back(idx);
    }
    if (l <= s && s <= u) {
      return ret;
    }
  }
  return ret;
}

/**

4 15 17
6 8 8 7


**/

• Subtask 1: 0 / 9
• Subtask 2: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31