Submission #1102161

#	Time	Username	Problem	Language	Result	Execution time	Memory
1102161		akzytr	Detecting Molecules (IOI16_molecules)	C++17	31 / 100	66 ms	65536 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
	vector<int> result;

	int n = w.size();
	bool dp[n + 1][u + 1];
	int back[u + 1];

	for(int i = 0; i <= n; i++) {
		for(int j = 0; j <= u; j++) {
			dp[i][j] = 0;
			back[j] = -1;
		}
	}

	dp[0][0] = 1;
	back[0] = 0;

	for(int i = 1; i <= n; i++) {
		for(int s = 0; s <= u; s++) {
			if(s < w[i - 1]) {
				dp[i][s] = dp[i - 1][s];
			}

			else if(dp[i - 1][s - w[i - 1]]) {
				dp[i][s] = 1;
				if(back[s] == -1) {
					back[s] = i;
				}
			} else {
				dp[i][s] = dp[i - 1][s];
			}
		}
	}

	for(int i = l; i <= u; i++) {
		if(back[i] != -1) {
			int idx = back[i];
			int s = i;
			while(idx != 0) {
				result.push_back(idx - 1);
				s -= w[idx - 1];
				idx = back[s];
			}
			break;
		}
	}

	return result;
}

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