제출 #237016

#제출 시각아이디문제언어결과실행 시간메모리
237016michaoDetecting Molecules (IOI16_molecules)C++14
0 / 100
5 ms384 KiB
#include <bits/stdc++.h> #define ll long long int #define mp make_pair #define pb push_back #define ld long double #define pii pair<int,int> #define sz(x) (int)x.size() #define piii pair<pii,pii> #define precise cout<<fixed<<setprecision(10) #define st first #define nd second #define ins insert #define vi vector<int> #define BOOST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0) using namespace std; vi find_subset(int l,int u,vi w) { vector<pii>tab; tab.clear(); int licznik=1; for (auto it:w)tab.pb(mp(it,licznik++)); sort(tab.begin(),tab.end()); int ile=0; vi ans; ans.clear(); bool t=false; for (int i=sz(tab)-1;i>=0;i--) { if (ile+tab[i].st<=u)ile+=tab[i].st,ans.pb(tab[i].nd); if (ile>=l){t=true;break;} } if (!t)return {}; return ans; } /* int32_t main() { BOOST; vi rak; rak=find_subset(15, 17, {6, 8, 8, 7}); cout<<sz(rak)<<"\n"; for (auto it:rak)cout<<it<<" "; return 0; } */
#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...