Submission #23679

#TimeUsernameProblemLanguageResultExecution timeMemory
23679NirjhorDetecting Molecules (IOI16_molecules)C++14
0 / 100
0 ms2024 KiB
#include <bits/stdc++.h>
#include <bits/stdc++.h>
#include "molecules.h"

using namespace std;

typedef long long ll;

vector <int> find_subset (int l, int u, vector <int> w) {
  int n = w.size();
  sort(w.begin(), w.end());
  ll sum = 0;
  vector <int> r;
  for (int i = 0, j = 0; j < n; ++j) {
		sum += (ll) w[j];
  	while (sum > u) {
  		sum -= w[i++];
  	}
  	if (sum >= l) {
			for (int k = i; k <= j; ++k) {
				r.push_back(w[k]);
			}
			break;
		}
  }
  return r;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...