Submission #529821

#TimeUsernameProblemLanguageResultExecution timeMemory
529821__VariattoDetecting Molecules (IOI16_molecules)C++17
0 / 100
1 ms304 KiB
#include "molecules.h" #include <bits/stdc++.h> using namespace std; #define pb push_back #define fi first #define se second #define ll long long const int MAX=2e5+10; pair<int,int>t[MAX]; int n, u, l; vector<int>v; vector<int> find_subset(int l, int u, vector<int>w){ n=w.size(); for(int i=1; i<=n; i++){ t[i].fi=w[i-1]; t[i].se=i; } sort(t+1, t+n+1); bool bylo=false; for(int i=n; i>=1; i--){ if(l<=t[i].fi && t[i].fi<=u){ v.pb(t[i].se); bylo=true; break; } if(u-t[i].fi>=t[1].fi) l-=t[i].fi, u-=t[i].fi, v.pb(t[i].se); } sort(v.begin(), v.end()); if(!bylo) v.clear(); return v; }
#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...