#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define double long double
#define pon ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); int T=1;
#define ponchik signed main
#define pb push_back
#define pf push_front
#define endl "\n"
#define F first
#define S second
const long long N=1e5+69,INF=1e18+1488;
vector<int> find_subset(int l, int u, vector<int> w)
//int main()
{
long long n=w.size(),a=l,b=u;
// vector <long long> w;
// for (int i=0; i<n; i++)
// {
// int x; cin>>x;
// w.pb(x);
// }
sort(w.begin(),w.end());
long long l1=0,r=0,sum=w[0];
vector <int> ans;
while (l1<=r&&l1<n)
{
if (sum>=a&&sum<=b)
{
for (int i=l1; i<=r; i++) ans.pb(i);
break;
}
if (sum<a) r++,sum+=w[r];
else if (sum>b) l1++,sum-=w[l1-1];
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
348 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
344 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
348 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
OK (n = 12, answer = YES) |
2 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
3 |
Correct |
1 ms |
348 KB |
OK (n = 12, answer = NO) |
4 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = NO) |
5 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
6 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
8 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
9 |
Correct |
0 ms |
348 KB |
OK (n = 6, answer = YES) |
10 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
11 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = NO) |
12 |
Incorrect |
0 ms |
348 KB |
sum of weights should be in [50..51] but it is 73 |
13 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
348 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
344 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
348 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
0 ms |
344 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
1 ms |
348 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
0 ms |
348 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 ms |
348 KB |
sum of weights should be in [50..51] but it is 73 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
348 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
344 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
348 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
0 ms |
344 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
1 ms |
348 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
0 ms |
348 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 ms |
348 KB |
sum of weights should be in [50..51] but it is 73 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
348 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
344 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
348 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
0 ms |
344 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
1 ms |
348 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
0 ms |
348 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 ms |
348 KB |
sum of weights should be in [50..51] but it is 73 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
348 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
344 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
348 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
0 ms |
344 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
1 ms |
348 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
0 ms |
348 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 ms |
348 KB |
sum of weights should be in [50..51] but it is 73 |
32 |
Halted |
0 ms |
0 KB |
- |