Submission #252239

#	Time	Username	Problem	Language	Result	Execution time	Memory
252239		cjoa	Detecting Molecules (IOI16_molecules)	C++11	9 / 100	1 ms	384 KiB

molecules

#include "molecules.h"

#include <vector>
#include <algorithm>
#include <utility>
#include <numeric>
#include <cassert>

using namespace std;

typedef pair<int,int> II;

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
   if (accumulate(w.begin(), w.end(), 0LL) < l)
      return {};

   const int N = w.size();

   vector<II> V;
   for (int i = 0; i < N; ++i) {
      V.push_back({w[i], i});
   }
   sort(V.begin(), V.end());

   if (V.begin()->first > u)
      return {};

   vector<int> res;
   long long sum = 0;
   for (auto p : V) {
      res.push_back(p.second);
      sum += p.first;
      if (sum >= l) {
         if (sum <= u)
            return res;
         sum -= V.begin()->first;
         res.erase(res.begin());
         if (!(l <= sum && sum <= u))
            return {};
         return res;
      }
   }
   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