Submission #465204

#TimeUsernameProblemLanguageResultExecution timeMemory
465204dattranxxxDetecting Molecules (IOI16_molecules)C++11
0 / 100
1088 ms9692 KiB
/*
 * Author :  shora
 */
#include <bits/stdc++.h>
#define print(_v) for (auto &_ : _v) {cerr << _ << ' ';} cerr << endl;
#include "molecules.h"
using namespace std;
using ll = long long;
const int oo = 1e9;
const int N = 2e5;
map<int, int> dp[N];
int n;
int call(int i, int l, vector<int>& a) {
	if (i == -1) 
		return l <= 0 ? 0 : oo;
	return min(call(i-1, l-a[i], a) + a[i], call(i-1, l, a));
}
vector<int> find_subset(int l, int u, vector<int> a) {
	n = a.size();
	vector<int> res;
	if (call(n-1, l, a) > u) 
		return res;
	int i = n-1;
  while (~i) {
  	if (call(i-1, l-a[i], a) + a[i] < call(i-1, l, a)) {
  		res.push_back(i);
  		l -= a[i];
		}
		i--;
	}
  return res;
}
#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...