제출 #350912

#제출 시각아이디문제언어결과실행 시간메모리
350912spike1236Detecting Molecules (IOI16_molecules)C++14
0 / 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)); ll sum = 0; veci res; for(int i = 0; i < n; ++i) { if(l <= a[i].f && a[i].f <= r) return {a[i].s}; if(a[i].f < l) { sum += a[i].f; res.pb(a[i].s); } } if(sum < l) return {}; while(sum > r && !res.empty()) sum -= a[res.back()].f, res.pop_back(); return res; }
#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...