//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(lmao) lmao.begin(), lmao.end()
using namespace std;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
const int N = 1e6 + 5;
int block = 555;
const int mod = 1e9 + 7;
//const ll oo = 5e18;
int n, a[N];
vector<int> find_subset(int L,int R,vector<int> _w){
vector<int> w;
for(int i = 0; i < _w.size(); i ++) w.pb(i);
sort(all(w), [&] (int x,int y){return _w[x] < _w[y];});
for(int i = 0; i < w.size(); i ++){
a[i] = w[i];
w[i] = _w[i];
}
int ptr = 0;
vector<int> ans;
if(w[0] >= L && w[0] <= R){ans.pb(0); return ans;}
deque<int> dq;
ll tmp = w[0];
dq.pb(0);
for(int i = 1; i < w.size(); i ++){
dq.push_front(i);
tmp += w[i];
while(!dq.empty() && tmp > R){
tmp -= w[dq.back()];
dq.pop_back();
}
if(tmp >= L){
while(!dq.empty()){
ans.pb(a[dq.back()]);
dq.pop_back();
}
sort(all(ans));
return ans;
}
while(!dq.empty() && tmp >= L){
tmp -= w[dq.back()];
dq.pop_back();
}
}
return ans;
}
//#define lpv
#ifdef lpv
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define task "v"
if(fopen(task ".inp","r")){
freopen(task ".inp","r",stdin);
freopen(task ".out","w",stdout);
}
int l, u; cin >> l >> u;
int x;
vector<int> input;
while (cin >> x) input.push_back(x);
for (auto i : find_subset(l, u, input))
cout << i << ' ';
}
#endif // lpv
Compilation message
molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:24:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
24 | for(int i = 0; i < _w.size(); i ++) w.pb(i);
| ~~^~~~~~~~~~~
molecules.cpp:26:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
26 | for(int i = 0; i < w.size(); i ++){
| ~~^~~~~~~~~~
molecules.cpp:36:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
36 | for(int i = 1; i < w.size(); i ++){
| ~~^~~~~~~~~~
molecules.cpp:30:9: warning: unused variable 'ptr' [-Wunused-variable]
30 | int ptr = 0;
| ^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 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 |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
600 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
344 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 |
344 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 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 |
0 ms |
344 KB |
OK (n = 12, answer = NO) |
4 |
Correct |
1 ms |
344 KB |
OK (n = 12, answer = NO) |
5 |
Correct |
0 ms |
344 KB |
OK (n = 12, answer = YES) |
6 |
Correct |
1 ms |
348 KB |
OK (n = 12, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
8 |
Correct |
1 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 |
1 ms |
344 KB |
OK (n = 100, answer = NO) |
12 |
Incorrect |
0 ms |
344 KB |
sum of weights should be in [50..51] but it is 32 |
13 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 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 |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
600 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
344 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 |
344 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 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 |
0 ms |
344 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
1 ms |
344 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
344 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
1 ms |
348 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
1 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 |
1 ms |
344 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 ms |
344 KB |
sum of weights should be in [50..51] but it is 32 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 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 |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
600 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
344 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 |
344 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 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 |
0 ms |
344 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
1 ms |
344 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
344 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
1 ms |
348 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
1 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 |
1 ms |
344 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 ms |
344 KB |
sum of weights should be in [50..51] but it is 32 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 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 |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
600 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
344 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 |
344 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 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 |
0 ms |
344 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
1 ms |
344 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
344 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
1 ms |
348 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
1 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 |
1 ms |
344 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 ms |
344 KB |
sum of weights should be in [50..51] but it is 32 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 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 |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
600 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
344 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 |
344 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 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 |
0 ms |
344 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
1 ms |
344 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
344 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
1 ms |
348 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
1 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 |
1 ms |
344 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 ms |
344 KB |
sum of weights should be in [50..51] but it is 32 |
32 |
Halted |
0 ms |
0 KB |
- |