#include "molecules.h"
#include <bits/stdc++.h>
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
if(u == l) return std::vector<int>(1, 0); //if the range is 0, all weights are same, return any
int total_weight = 0, i = 0;
std::queue<int> indices;
std::sort(w.begin(), w.end());
while(total_weight < l) {
total_weight += w[i];
indices.push(i++);
}
i = 0;
while(total_weight > u) {
total_weight -= w[i++];
indices.pop();
}
if(total_weight < l || total_weight > u) return std::vector<int>(); //no subarray found
std::vector<int> ans(indices.size());
i = 0;
while(!indices.empty()) {
ans[i++] = indices.front();
indices.pop();
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
364 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
364 KB |
OK (n = 1, answer = YES) |
4 |
Incorrect |
1 ms |
364 KB |
sum of weights should be in [100..100] but it is 50 |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Contestant can not find answer, jury can |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
364 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
364 KB |
OK (n = 1, answer = YES) |
4 |
Incorrect |
1 ms |
364 KB |
sum of weights should be in [100..100] but it is 50 |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
364 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
364 KB |
OK (n = 1, answer = YES) |
4 |
Incorrect |
1 ms |
364 KB |
sum of weights should be in [100..100] but it is 50 |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
364 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
364 KB |
OK (n = 1, answer = YES) |
4 |
Incorrect |
1 ms |
364 KB |
sum of weights should be in [100..100] but it is 50 |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
364 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
364 KB |
OK (n = 1, answer = YES) |
4 |
Incorrect |
1 ms |
364 KB |
sum of weights should be in [100..100] but it is 50 |
5 |
Halted |
0 ms |
0 KB |
- |