#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include "bits/stdc++.h"
#include "molecules.h"
using namespace std;
using ll = long long;
vector<int> find_subset(int l, int u, vector<int> w) {
srand(time(0));
int n = (int)w.size();
ll sum = 0;
for (int i=0; i<n; i++) {
sum += (ll)w[i];
}
if (sum == u) {
vector<int> res;
for (int i=0; i<n; i++) {
res.push_back(i);
}
return res;
}
if (sum < l) {
vector<int> ans;
return ans;
}
for (int i=0; i<1000000; i++) {
set<int> s;
for (int j=0; j<n; j++) {
int r = rand()%n;
s.insert(r);
}
sum = 0;
for (auto &e:s) {
sum += (ll)w[e];
}
if (l <= sum && sum <= u) {
vector<int> res;
for (auto &e:s) {
res.push_back(e);
}
return res;
}
}
vector<int> emp;
return emp;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
26 ms |
336 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
336 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
504 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
336 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
504 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
504 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
504 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
82 ms |
416 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
86 ms |
336 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = NO) |
18 |
Execution timed out |
1100 ms |
336 KB |
Time limit exceeded |
19 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
OK (n = 12, answer = YES) |
2 |
Correct |
1 ms |
336 KB |
OK (n = 12, answer = YES) |
3 |
Correct |
531 ms |
420 KB |
OK (n = 12, answer = NO) |
4 |
Correct |
520 ms |
420 KB |
OK (n = 12, answer = NO) |
5 |
Correct |
8 ms |
336 KB |
OK (n = 12, answer = YES) |
6 |
Correct |
4 ms |
336 KB |
OK (n = 12, answer = YES) |
7 |
Correct |
1 ms |
336 KB |
OK (n = 12, answer = YES) |
8 |
Correct |
1 ms |
336 KB |
OK (n = 12, answer = YES) |
9 |
Correct |
1 ms |
336 KB |
OK (n = 6, answer = YES) |
10 |
Correct |
5 ms |
336 KB |
OK (n = 12, answer = YES) |
11 |
Correct |
1 ms |
336 KB |
OK (n = 100, answer = NO) |
12 |
Execution timed out |
1058 ms |
336 KB |
Time limit exceeded |
13 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
26 ms |
336 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
336 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
504 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
336 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
504 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
504 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
504 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
82 ms |
416 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
86 ms |
336 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = NO) |
18 |
Execution timed out |
1100 ms |
336 KB |
Time limit exceeded |
19 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
26 ms |
336 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
336 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
504 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
336 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
504 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
504 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
504 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
82 ms |
416 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
86 ms |
336 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = NO) |
18 |
Execution timed out |
1100 ms |
336 KB |
Time limit exceeded |
19 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
26 ms |
336 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
336 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
504 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
336 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
504 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
504 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
504 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
82 ms |
416 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
86 ms |
336 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = NO) |
18 |
Execution timed out |
1100 ms |
336 KB |
Time limit exceeded |
19 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
26 ms |
336 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
336 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
504 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
336 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
504 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
504 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
504 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
82 ms |
416 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
86 ms |
336 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
336 KB |
OK (n = 3, answer = NO) |
18 |
Execution timed out |
1100 ms |
336 KB |
Time limit exceeded |
19 |
Halted |
0 ms |
0 KB |
- |