Submission #974797

#	Time	Username	Problem	Language	Result	Execution time	Memory
974797		d4xn	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	39 ms	7228 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std; 
 
#define int long long
 
vector<signed> sb;
 
std::vector<signed> find_subset(signed l, signed u, std::vector<signed> W) {
    int n = W.size();
  vector<pair<int, int>> w(n);	
  for (int i = 0; i < n; i++) {
    w[i] = make_pair(W[i], i);
  }
  sort(w.begin(), w.end());
  	
  	int sum = 0;
  	int R = -1;
  	while (R+1 < n && sum + w[R+1].first <= u) {
      sum += w[++R].first;
      sb.push_back(w[R].second);
    }
  
  	if (l <= sum) return sb;
  
  	int L = n;
  	while (min(R, L-1) >= 0 && sum - w[R].first + w[L-1].first <= u) {
      sum += w[--L].first - w[R--].first;
      sb.pop_back();
    }
  
  	for (int i = n-1; i >= L; i--) {
      sb.push_back(w[i].second);
    }
  
  	if (sum < l || u < sum) sb.clear();
    return sb;
}

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