#include "bits/stdc++.h"
using namespace std;
vector<int> find_subset(int l, int u, vector<int>w)
{
int f = w[0];
int sz = w.size();
int hi = u/f;
int lo = (l+f-1)/f;
vector<int> res;
if(lo > hi || sz < lo) return res;
for(int i=0;i<lo;i++) res.push_back(i);
return res ;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
204 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
204 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
204 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
204 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
204 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
204 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
204 KB |
OK (n = 100, answer = YES) |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Contestant can not find answer, jury can |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
204 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
204 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
204 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
204 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
204 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
204 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
204 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
1 ms |
204 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
204 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
204 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
204 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
204 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
204 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
204 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
204 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
1 ms |
204 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
204 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
204 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
204 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
204 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
204 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
204 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
204 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
1 ms |
204 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
204 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
204 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
204 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
204 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
204 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
204 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
204 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
204 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
1 ms |
204 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |