#include "molecules.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
#define ll long long
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define vi vector < int >
#define pi pair < int, int >
int n, lf;
ll s;
std::vector<int> find_subset(int l, int u, std::vector <int> w) {
vi ans;
n = w.size();
sort(w.begin(), w.end());
for (int i = 0; i < n; i++){
s += w[i];
if (s > u){
s -= w[lf];
lf++;
}
if (i - lf >= 0 && s >= l && s <= u){
int s = 0;
for (int j = lf; j <= i; j++){
s += w[j];
ans.pb(j);
}
break;
}
}
if (s > u)
while(true);
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
3 ms |
384 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
3 ms |
384 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
3 ms |
384 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
3 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
384 KB |
OK (n = 100, answer = YES) |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = YES) |
2 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = YES) |
3 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = NO) |
4 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = NO) |
5 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
6 |
Correct |
3 ms |
384 KB |
OK (n = 12, answer = YES) |
7 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = YES) |
8 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
9 |
Correct |
2 ms |
256 KB |
OK (n = 6, answer = YES) |
10 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
11 |
Correct |
2 ms |
384 KB |
OK (n = 100, answer = NO) |
12 |
Incorrect |
2 ms |
384 KB |
sum of weights should be in [50..51] but it is 73 |
13 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
3 ms |
384 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
3 ms |
384 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
3 ms |
384 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
3 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
384 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
3 ms |
384 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
2 ms |
256 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
2 ms |
384 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
2 ms |
384 KB |
sum of weights should be in [50..51] but it is 73 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
3 ms |
384 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
3 ms |
384 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
3 ms |
384 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
3 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
384 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
3 ms |
384 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
2 ms |
256 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
2 ms |
384 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
2 ms |
384 KB |
sum of weights should be in [50..51] but it is 73 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
3 ms |
384 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
3 ms |
384 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
3 ms |
384 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
3 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
384 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
3 ms |
384 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
2 ms |
256 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
2 ms |
384 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
2 ms |
384 KB |
sum of weights should be in [50..51] but it is 73 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
3 ms |
384 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
3 ms |
384 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
3 ms |
384 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
3 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
384 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
3 ms |
384 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
2 ms |
256 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
2 ms |
384 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
2 ms |
384 KB |
sum of weights should be in [50..51] but it is 73 |
32 |
Halted |
0 ms |
0 KB |
- |