# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
52677 | 2018-06-26T11:01:24 Z | alenam0161 | Detecting Molecules (IOI16_molecules) | C++17 | 4 ms | 592 KB |
#include "molecules.h" #include <iostream> #include <algorithm> #include <vector> using namespace std; struct po{ int fi; int se; po(int _x=0,int _y=0){ fi=_x;se=_y; } bool operator<(const po&oth){ return fi<oth.fi; } }; std::vector<int> find_subset(int l, int u, std::vector<int> w) { long long sum=0; po e; vector<po> all; int n=w.size(); for(int i=0;i<n;++i)all.push_back(po(w[i],i)); // sort(all.begin(),all.end()); int le=0; int r=-1; while(true){ while(r<n&&sum<l){ sum+=all[++r].fi; } if(r==n&&sum<l){ break; } if(sum>=l&&sum<=u){ vector<int> ans; for(int j=le;j<=r;++j){ ans.push_back(all[j].se); } // cout<<sum<<" "<<le<<" "<<r<<endl; return ans; } sum-=all[le++].fi; } return std::vector<int>(); }
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 484 KB | OK (n = 1, answer = NO) |
3 | Correct | 2 ms | 484 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 492 KB | OK (n = 2, answer = YES) |
5 | Correct | 2 ms | 492 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 492 KB | OK (n = 3, answer = YES) |
7 | Correct | 2 ms | 492 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 492 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 492 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 516 KB | OK (n = 3, answer = YES) |
11 | Correct | 3 ms | 516 KB | OK (n = 3, answer = YES) |
12 | Correct | 4 ms | 572 KB | OK (n = 3, answer = YES) |
13 | Correct | 2 ms | 572 KB | OK (n = 3, answer = NO) |
14 | Correct | 3 ms | 572 KB | OK (n = 3, answer = YES) |
15 | Correct | 3 ms | 572 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 572 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 572 KB | OK (n = 3, answer = NO) |
18 | Correct | 2 ms | 592 KB | OK (n = 100, answer = NO) |
19 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
2 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
3 | Correct | 3 ms | 592 KB | OK (n = 12, answer = NO) |
4 | Correct | 2 ms | 592 KB | OK (n = 12, answer = NO) |
5 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
6 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
7 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
8 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
9 | Correct | 2 ms | 592 KB | OK (n = 6, answer = YES) |
10 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
11 | Correct | 2 ms | 592 KB | OK (n = 100, answer = NO) |
12 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
13 | Correct | 2 ms | 592 KB | OK (n = 100, answer = NO) |
14 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
15 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
16 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
17 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 484 KB | OK (n = 1, answer = NO) |
3 | Correct | 2 ms | 484 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 492 KB | OK (n = 2, answer = YES) |
5 | Correct | 2 ms | 492 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 492 KB | OK (n = 3, answer = YES) |
7 | Correct | 2 ms | 492 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 492 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 492 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 516 KB | OK (n = 3, answer = YES) |
11 | Correct | 3 ms | 516 KB | OK (n = 3, answer = YES) |
12 | Correct | 4 ms | 572 KB | OK (n = 3, answer = YES) |
13 | Correct | 2 ms | 572 KB | OK (n = 3, answer = NO) |
14 | Correct | 3 ms | 572 KB | OK (n = 3, answer = YES) |
15 | Correct | 3 ms | 572 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 572 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 572 KB | OK (n = 3, answer = NO) |
18 | Correct | 2 ms | 592 KB | OK (n = 100, answer = NO) |
19 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
20 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
21 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
22 | Correct | 3 ms | 592 KB | OK (n = 12, answer = NO) |
23 | Correct | 2 ms | 592 KB | OK (n = 12, answer = NO) |
24 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
25 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
26 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
27 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
28 | Correct | 2 ms | 592 KB | OK (n = 6, answer = YES) |
29 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
30 | Correct | 2 ms | 592 KB | OK (n = 100, answer = NO) |
31 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
32 | Correct | 2 ms | 592 KB | OK (n = 100, answer = NO) |
33 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
34 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
35 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
36 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
37 | Correct | 2 ms | 592 KB | OK (n = 28, answer = YES) |
38 | Correct | 2 ms | 592 KB | OK (n = 27, answer = YES) |
39 | Correct | 2 ms | 592 KB | OK (n = 90, answer = YES) |
40 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
41 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
42 | Correct | 2 ms | 592 KB | OK (n = 10, answer = YES) |
43 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
44 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
45 | Incorrect | 2 ms | 592 KB | Contestant can not find answer, jury can |
46 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 484 KB | OK (n = 1, answer = NO) |
3 | Correct | 2 ms | 484 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 492 KB | OK (n = 2, answer = YES) |
5 | Correct | 2 ms | 492 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 492 KB | OK (n = 3, answer = YES) |
7 | Correct | 2 ms | 492 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 492 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 492 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 516 KB | OK (n = 3, answer = YES) |
11 | Correct | 3 ms | 516 KB | OK (n = 3, answer = YES) |
12 | Correct | 4 ms | 572 KB | OK (n = 3, answer = YES) |
13 | Correct | 2 ms | 572 KB | OK (n = 3, answer = NO) |
14 | Correct | 3 ms | 572 KB | OK (n = 3, answer = YES) |
15 | Correct | 3 ms | 572 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 572 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 572 KB | OK (n = 3, answer = NO) |
18 | Correct | 2 ms | 592 KB | OK (n = 100, answer = NO) |
19 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
20 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
21 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
22 | Correct | 3 ms | 592 KB | OK (n = 12, answer = NO) |
23 | Correct | 2 ms | 592 KB | OK (n = 12, answer = NO) |
24 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
25 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
26 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
27 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
28 | Correct | 2 ms | 592 KB | OK (n = 6, answer = YES) |
29 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
30 | Correct | 2 ms | 592 KB | OK (n = 100, answer = NO) |
31 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
32 | Correct | 2 ms | 592 KB | OK (n = 100, answer = NO) |
33 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
34 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
35 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
36 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
37 | Correct | 2 ms | 592 KB | OK (n = 28, answer = YES) |
38 | Correct | 2 ms | 592 KB | OK (n = 27, answer = YES) |
39 | Correct | 2 ms | 592 KB | OK (n = 90, answer = YES) |
40 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
41 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
42 | Correct | 2 ms | 592 KB | OK (n = 10, answer = YES) |
43 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
44 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
45 | Incorrect | 2 ms | 592 KB | Contestant can not find answer, jury can |
46 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 484 KB | OK (n = 1, answer = NO) |
3 | Correct | 2 ms | 484 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 492 KB | OK (n = 2, answer = YES) |
5 | Correct | 2 ms | 492 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 492 KB | OK (n = 3, answer = YES) |
7 | Correct | 2 ms | 492 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 492 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 492 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 516 KB | OK (n = 3, answer = YES) |
11 | Correct | 3 ms | 516 KB | OK (n = 3, answer = YES) |
12 | Correct | 4 ms | 572 KB | OK (n = 3, answer = YES) |
13 | Correct | 2 ms | 572 KB | OK (n = 3, answer = NO) |
14 | Correct | 3 ms | 572 KB | OK (n = 3, answer = YES) |
15 | Correct | 3 ms | 572 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 572 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 572 KB | OK (n = 3, answer = NO) |
18 | Correct | 2 ms | 592 KB | OK (n = 100, answer = NO) |
19 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
20 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
21 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
22 | Correct | 3 ms | 592 KB | OK (n = 12, answer = NO) |
23 | Correct | 2 ms | 592 KB | OK (n = 12, answer = NO) |
24 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
25 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
26 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
27 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
28 | Correct | 2 ms | 592 KB | OK (n = 6, answer = YES) |
29 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
30 | Correct | 2 ms | 592 KB | OK (n = 100, answer = NO) |
31 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
32 | Correct | 2 ms | 592 KB | OK (n = 100, answer = NO) |
33 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
34 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
35 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
36 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
37 | Correct | 2 ms | 592 KB | OK (n = 28, answer = YES) |
38 | Correct | 2 ms | 592 KB | OK (n = 27, answer = YES) |
39 | Correct | 2 ms | 592 KB | OK (n = 90, answer = YES) |
40 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
41 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
42 | Correct | 2 ms | 592 KB | OK (n = 10, answer = YES) |
43 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
44 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
45 | Incorrect | 2 ms | 592 KB | Contestant can not find answer, jury can |
46 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 484 KB | OK (n = 1, answer = NO) |
3 | Correct | 2 ms | 484 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 492 KB | OK (n = 2, answer = YES) |
5 | Correct | 2 ms | 492 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 492 KB | OK (n = 3, answer = YES) |
7 | Correct | 2 ms | 492 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 492 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 492 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 516 KB | OK (n = 3, answer = YES) |
11 | Correct | 3 ms | 516 KB | OK (n = 3, answer = YES) |
12 | Correct | 4 ms | 572 KB | OK (n = 3, answer = YES) |
13 | Correct | 2 ms | 572 KB | OK (n = 3, answer = NO) |
14 | Correct | 3 ms | 572 KB | OK (n = 3, answer = YES) |
15 | Correct | 3 ms | 572 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 572 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 572 KB | OK (n = 3, answer = NO) |
18 | Correct | 2 ms | 592 KB | OK (n = 100, answer = NO) |
19 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
20 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
21 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
22 | Correct | 3 ms | 592 KB | OK (n = 12, answer = NO) |
23 | Correct | 2 ms | 592 KB | OK (n = 12, answer = NO) |
24 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
25 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
26 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
27 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
28 | Correct | 2 ms | 592 KB | OK (n = 6, answer = YES) |
29 | Correct | 2 ms | 592 KB | OK (n = 12, answer = YES) |
30 | Correct | 2 ms | 592 KB | OK (n = 100, answer = NO) |
31 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
32 | Correct | 2 ms | 592 KB | OK (n = 100, answer = NO) |
33 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
34 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
35 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
36 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
37 | Correct | 2 ms | 592 KB | OK (n = 28, answer = YES) |
38 | Correct | 2 ms | 592 KB | OK (n = 27, answer = YES) |
39 | Correct | 2 ms | 592 KB | OK (n = 90, answer = YES) |
40 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
41 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
42 | Correct | 2 ms | 592 KB | OK (n = 10, answer = YES) |
43 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
44 | Correct | 2 ms | 592 KB | OK (n = 100, answer = YES) |
45 | Incorrect | 2 ms | 592 KB | Contestant can not find answer, jury can |
46 | Halted | 0 ms | 0 KB | - |