Submission #1028883

#	Time	Username	Problem	Language	Result	Execution time	Memory
1028883		c2zi6	Detecting Molecules (IOI16_molecules)	C++14	31 / 100	1075 ms	2588 KiB

molecules

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "molecules.h"

const int MAXN = 1e4;
const int MAXSUM = 1e4;
bitset<MAXSUM+1> dp[MAXN+1];

VI find_subset(int L, int R, VI w) {
    dp[0][0] = true;
    int n = w.size();
    rep(i, n) replr(s, 0, MAXSUM) {
        dp[i+1] = dp[i] | (dp[i]<<w[i]);
    }
    replr(s, L, R) if (dp[n][s]) {
        VI ret;
        ret.reserve(n);
        reprl(i, n-1, 0) {
            if (!dp[i][s]) {
                s -= w[i];
                ret.pb(i);
            }
        }
        return ret;
    }
    return VI{};
}

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