#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include "molecules.h"
//#include "grader.cpp"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end()
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define endl '\n'
template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }
vi find_subset(int l, int u, vi w) {
int sum = 0;
int n = w.size();
vi ans;
vi emp(0);
vector<pi> w1(n);
rep(i, n) w1[i] = {w[i], i};
sort(all(w1));
rep(i, n){
ans.pb(w1[i].se);
sum += w1[i].fi;
if(sum > u) return emp;
if(sum >= l) return ans;
}
if(sum < l) return emp;
return ans;
}
/*
Things to look out for:
- Integer overflows
- Array bounds
- Special cases
Be careful!
*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
380 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
376 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
376 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
380 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
252 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
380 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
376 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 |
376 KB |
OK (n = 100, answer = YES) |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
256 KB |
Contestant can not find answer, jury can |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
380 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
376 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
376 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
380 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
252 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
380 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
376 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 |
376 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
2 ms |
256 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
380 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
376 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
376 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
380 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
252 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
380 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
376 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 |
376 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
2 ms |
256 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
380 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
376 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
376 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
380 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
252 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
380 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
376 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 |
376 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
2 ms |
256 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
380 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
376 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
376 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
380 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
252 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
380 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
376 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 |
376 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
2 ms |
256 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |