Submission #350945

#TimeUsernameProblemLanguageResultExecution timeMemory
350945spike1236Detecting Molecules (IOI16_molecules)C++14
9 / 100
1 ms512 KiB
#include <bits/stdc++.h> using namespace std; #define pb push_back #define mp make_pair #define f first #define s second #define ll long long #define ld long double #define all(_v) _v.begin(), _v.end() #define sz(_v) (int)_v.size() #define pii pair <int, int> #define pll pair <ll, ll> #define veci vector <int> #define vecll vector <ll> veci find_subset(int asd, int asdas, veci w) { ll l = asd, r = asdas; int n = sz(w); vector <pair <ll, int> > a; for(int i = 0; i < n; ++i) a.pb(mp(w[i], i)); sort(all(a)); for(int i = 0; i < n; ++i) { ll sum = a[i].f; if(l <= sum && sum <= r) return {a[i].s}; for(int j = i + 1; j < n; ++j) { sum += a[j].f; if(l <= sum && sum <= r) { if(!i || j == n - 1) { veci res; for(int k = i; k <= j; ++k) res.pb(a[k].s); sort(all(res)); return res; } } } } return {}; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...