Submission #21815

#	Time	Username	Problem	Language	Result	Execution time	Memory
21815		sampriti	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	69 ms	5340 KiB

molecules

#include "molecules.h"
#include <algorithm>
#include <vector>

using namespace std;

vector<int> find_subset(int L, int R, vector<int> A) {
  int N = A.size();
  vector<pair<int, int> > B(N);
  for(int i = 0; i < N; i++) {
    B[i] = {A[i], i};
  }
  sort(B.begin(), B.end());
  int i = 0, j = -1;
  long long sum = 0;
  while(j < N && sum < L) {
    sum += B[++j].first;
    if(sum >= L) {
      if(sum <= R) break;
      while(sum > R && i <= j) {
        sum -= B[i++].first;
      }
    }
  }
  vector<int> ans;
  if(sum >= L && sum <= R) {
    while(i <= j) {
      ans.push_back(B[i].second);
      i++;
    }
  }
  return ans;
}

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