Submission #1078406

#	Time	Username	Problem	Language	Result	Execution time	Memory
1078406		sqrteipi	Detecting Molecules (IOI16_molecules)	C++14	9 / 100	1 ms	436 KiB

molecules

#include <bits/stdc++.h>
using namespace std;
#define int long long
 
vector<signed> find_subset(signed l, signed u, vector<signed> w) {
  int n = w.size(), r = u;
  vector<pair<int, int>> vec;
  for (int i=0; i<n; i++) {
    int k = w[i];
    vec.push_back({k, i});
  }
  sort(vec.begin(), vec.end());
  int mi = 0, ma = 0, li = 0, ri = n - 1;
  while (li < n) {
    mi += vec[li].first, ma += vec[ri].first;
    if (l <= mi && mi <= r) {
      vector<signed> ans;
      for (int i=0; i<=li; i++) ans.push_back(vec[i].second);
      return ans;
    }
    if (l <= ma && ma <= r) {
      vector<signed> ans;
      for (int i=ri; i<n; i++) ans.push_back(vec[i].second);
      return ans;
    }
    if (mi <= l && r <= ma) {
      int sum = mi - vec[li].first;
      for (int i=li; i<n; i++) {
        sum += vec[i].first;
        if (l <= sum && sum <= r) {
          vector<signed> ans;
          for (int j=i-li; j<=i; j++) ans.push_back(vec[i].second);
          return ans;
        }
        sum -= vec[i-li].first;
      }
    }
    li++, ri--;
  }
  return {};
}

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