Submission #94569

#	Time	Username	Problem	Language	Result	Execution time	Memory
94569		wxh010910	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	2 ms	380 KiB

molecules

#include <bits/stdc++.h>
#include "molecules.h"

using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
  int n = w.size();
  vector<int> p(n);
  for (int i = 0; i < n; ++i) {
    p[i] = i;
  }
  sort(p.begin(), p.end(), [&](const int &x, const int &y) {
    return w[x] < w[y];
  });
  long long sum = 0;
  for (int i = 0; i < n; ++i) {
    sum += w[p[i]];
  }
  for (int i = 0, j = 0; i < n; ++i) {
    if (sum > u) {
      break;
    }
    while (sum > u || j < i) {
      sum -= w[p[j++]];
    }
    if (sum >= l) {
      vector<int> ans;
      for (int k = 0; k < i; ++k) {
        ans.push_back(p[k]);
      }
      for (int k = j; k < n; ++k) {
        ans.push_back(p[k]);
      }
      return ans;
    }
    sum += w[p[i]];
  }
  return vector<int>();
}

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