# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
141607 | 2019-08-08T14:19:36 Z | eggag32 | Detecting Molecules (IOI16_molecules) | C++17 | 0 ms | 0 KB |
#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)); } vi find_subset(int l, int u, vi w) { int sum = 0; vi ans; vi emp(0); vector<pi> w1; rep(i, n) w1[i] = {w[i], i}; sort(all(w1)); rep(i, w.size()){ ans.pb(w1[i].se); sum += w1[i].fi; if(sum > u) return emp; if(sum >= l) return ans; } if(sum < l) return emp; return ans; } /* Things to look out for: - Integer overflows - Array bounds - Special cases Be careful! */