#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector <int> ans;
ans.reserve(w.size());
sort(w.begin(),w.end());
long long sum = 0;
int it;
for(it = 0;it < w.size() && sum + w[it] <= u;it++){
sum += w[it];
ans.emplace_back(it);
}
// cout<< l << ' ' << u << endl;
// cout<<sum<<endl;
// for(int i = 0;i < ans.size();i++) cout<<ans[i]<<' ';
// cout<<endl;
// if(sum > u) return vector<int> (0);
if(sum >= l && sum <= u) return ans;
for(int i = w.size()-1;i >= it;i--) {
for(int j = 0;j < ans.size();j++){
if(sum + (w[i] - w[ans[j]]) <= u && sum + (w[i] - w[ans[j]]) >= l){
sum+= (w[i] - w[ans[j]]);
ans[j] = i;
return ans;
}
}
}
return vector <int> (0);
}
// int main(){
// auto a = find_subset(15, 17, {6, 8, 8, 7});
// for(int i = 0;i < a.size();i++){
// cout<<a[i]<<' ';
// }
// cout<<endl;
// a = find_subset(14, 15, {5, 5, 6, 6});
// for(int i = 0;i < a.size();i++){
// cout<<a[i]<<' ';
// }
// cout<<endl;
// a = find_subset(10, 20, {15, 17, 16, 18});
// for(int i = 0;i < a.size();i++){
// cout<<a[i]<<' ';
// }
// cout<<endl;
// }
Compilation message
molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:11:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
11 | for(it = 0;it < w.size() && sum + w[it] <= u;it++){
| ~~~^~~~~~~~~~
molecules.cpp:23:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
23 | for(int j = 0;j < ans.size();j++){
| ~~^~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
256 KB |
OK (n = 100, answer = YES) |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
256 KB |
Contestant can not find answer, jury can |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
0 ms |
256 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
0 ms |
256 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
0 ms |
256 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
0 ms |
256 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |