#pragma GCC diagnostic warning "-std=c++11"
#include <bits/stdc++.h>
#include "molecules.h"
#define pb push_back
#define f first
#define s second
#define MOD 1000000007
#define flush fflush(stdout)
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(), (x).rend()
#define pii pair<int,int>
using namespace std;
int n,T,k;
int last[1005];
pii dp[1005];
vector<int> find_subset(int l, int u, vector<int> W) {
n=W.size();
vector<int> w; w.pb(0);
for (auto x:W) w.pb(x);
for (int i=1; i<=n; i++) {
for (int j=1000; j>=w[i]+1; j--) {
if (last[j-w[i]]) {
dp[j]={1,last[j-w[i]]};
last[j]=w[i];
}
}
dp[w[i]]={1,w[i]};
last[w[i]]=w[i];
}
vector<int> freq[10005];
for (int i=1; i<=n; i++) freq[w[i]].pb(i-1);
vector<int> v;
for (int sum=l; sum<=u; sum++) {
if (dp[sum].f) {
map<int,int> ind;
int val=sum;
while (val) {
v.pb(freq[dp[val].s][ind[dp[val].s]]);
ind[dp[val].s]++;
val-=dp[val].s;
}
return v;
}
}
return v;
}
Compilation message
molecules.cpp:1:32: warning: '-std=c++11' is not an option that controls warnings [-Wpragmas]
1 | #pragma GCC diagnostic warning "-std=c++11"
| ^~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
600 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
600 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
600 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
604 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
600 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
604 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
604 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
604 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
604 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
600 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
604 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
604 KB |
OK (n = 100, answer = YES) |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = YES) |
2 |
Correct |
0 ms |
604 KB |
OK (n = 12, answer = YES) |
3 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = NO) |
4 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = NO) |
5 |
Correct |
0 ms |
604 KB |
OK (n = 12, answer = YES) |
6 |
Correct |
0 ms |
600 KB |
OK (n = 12, answer = YES) |
7 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = YES) |
8 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = YES) |
9 |
Correct |
1 ms |
604 KB |
OK (n = 6, answer = YES) |
10 |
Incorrect |
1 ms |
604 KB |
item #0 is taken twice |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
600 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
600 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
600 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
604 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
600 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
604 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
604 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
604 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
604 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
600 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
604 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
604 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
604 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
604 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
0 ms |
600 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
1 ms |
604 KB |
OK (n = 6, answer = YES) |
29 |
Incorrect |
1 ms |
604 KB |
item #0 is taken twice |
30 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
600 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
600 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
600 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
604 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
600 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
604 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
604 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
604 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
604 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
600 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
604 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
604 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
604 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
604 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
0 ms |
600 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
1 ms |
604 KB |
OK (n = 6, answer = YES) |
29 |
Incorrect |
1 ms |
604 KB |
item #0 is taken twice |
30 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
600 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
600 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
600 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
604 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
600 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
604 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
604 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
604 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
604 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
600 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
604 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
604 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
604 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
604 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
0 ms |
600 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
1 ms |
604 KB |
OK (n = 6, answer = YES) |
29 |
Incorrect |
1 ms |
604 KB |
item #0 is taken twice |
30 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
600 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
600 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
600 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
604 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
600 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
604 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
604 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
604 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
604 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
604 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
600 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
604 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
604 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
604 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
604 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
0 ms |
600 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
1 ms |
604 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
1 ms |
604 KB |
OK (n = 6, answer = YES) |
29 |
Incorrect |
1 ms |
604 KB |
item #0 is taken twice |
30 |
Halted |
0 ms |
0 KB |
- |