Submission #141640

#	Time	Username	Problem	Language	Result	Execution time	Memory
141640		eggag32	Detecting Molecules (IOI16_molecules)	C++17	46 / 100	265 ms	65540 KiB

molecules

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include "molecules.h"
//#include "grader.cpp"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end() 
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define endl '\n'

template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }

vector<bool> vis(500005, 0);
vi dp[500005];

vi find_subset(int l, int r, vi w) {
	int n = w.size();
	vis[0] = 1;
	rep(i, n){
		for(int j = r - w[i]; j >= 0; j--){
			if(vis[j]){ //possible to get previous
				if(!vis[j + w[i]]){ //we don't yet have it
					dp[j + w[i]] = dp[j];
					dp[j + w[i]].pb(i);
					vis[j + w[i]] = 1;
					if((j + w[i]) <= r && (j + w[i]) >= l){
						return dp[j + w[i]];
					}
				}
			}
		}
	}
	return vi(0);
}

/*
Things to look out for:
	- Integer overflows
	- Array bounds
	- Special cases
Be careful!
*/

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