# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
123609 | Nodir_Bobiev | Detecting Molecules (IOI16_molecules) | C++14 | 2 ms | 396 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
# include <iostream>
# include <vector>
# include <algorithm>
using namespace std;
vector< int > find_subset( int l, int u, vector < int > w )
{
vector < pair < int, int > > vc;
int n = 0;
for( auto c: w )vc.push_back( make_pair( c, n++) );
sort( vc.begin(), vc.end() );
long long sm = 0;
vector < int > ans;
for( int i = n - 1; i >= 0; i -- ){
sm += vc[i].first;
ans.push_back( vc[i].second );
if( sm > u ) break;
if( sm >= l ) return ans;
}
for( int i = 0; i < n - ans.size(); i ++ ){
if( sm >= l && sm <= u ) break;
sm -= vc[ ans[i] ].first - vc[i].first;
ans[i] = vc[i].second;
}
if( sm < l || u < sm )
ans.clear();
return ans;
}
/*
int main()
{
vector < int > ret = find_subset( 10, 20, {15,17,16,18} );
for( auto c: ret) {
cout << c << ' ';
}
return 0;
}
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |