This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,e) for (int i = s; i <= e; ++i)
#define rrep(i,s,e) for (int i = s; i >= e; --i)
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<ll> vll;
vi find_subset(int l, int u, vi w) {
bool dpp[2][u+1];
vi dpc[2][u+1];
dpp[1][0] = 1;
rep (i,1,u) dpp[1][i] = 0;
rep (i,0,(int)w.size()-1) {
memcpy (dpp[0], dpp[1], u+1);
rep (j,0,u) dpc[0][j] = dpc[1][j];
rep (j,0,u) {
if (j-w[i]>=0 && dpp[0][j-w[i]] && !dpp[0][j]) {
dpc[1][j] = dpc[0][j-w[i]];
dpc[1][j].pb(i);
dpp[1][j] = 1;
}
}
}
rep (i,l,u) if (dpp[1][i]) return dpc[1][i];
return vector<int>();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |