Submission #318433

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
318433	2020-11-01T19:33:02 Z	study	Detecting Molecules (IOI16_molecules)	C++17	19 / 100	1 ms	492 KB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> find_subset(int l, int u, vector<int> v) {
	vector<int> ans;
	int n = v.size();
	long long s=0,beg = 0, end = 0;
	while (end < n){
		if (s < l){
			s += v[end];
			end++;
		}
		else if (s > u){
			s -= v[beg];
			beg++;
		}
		if (s >= l and s <= u){
			for (int i=beg; i<=end-1; ++i){
				ans.emplace_back(i);
			}
			return ans;
		}
	}
	while (beg < n){
		s -= v[beg];
		beg++;
		if (s >= l and s <= u){
			for (int i=beg; i<=end-1; ++i){
				ans.emplace_back(i);
			}
			return ans;
		}
	}
  	return vector<int>(0);
}

Subtask #1
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	364 KB	OK (n = 1, answer = NO)
2	Correct	0 ms	364 KB	OK (n = 1, answer = NO)
3	Correct	1 ms	384 KB	OK (n = 1, answer = YES)
4	Correct	1 ms	364 KB	OK (n = 2, answer = YES)
5	Correct	1 ms	256 KB	OK (n = 2, answer = YES)
6	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
7	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
8	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
9	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
10	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
11	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
12	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
13	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
14	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
15	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
16	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
17	Correct	1 ms	364 KB	OK (n = 3, answer = NO)
18	Correct	0 ms	364 KB	OK (n = 100, answer = NO)
19	Correct	0 ms	364 KB	OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
2	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
3	Correct	1 ms	364 KB	OK (n = 12, answer = NO)
4	Correct	0 ms	364 KB	OK (n = 12, answer = NO)
5	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
6	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
7	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
8	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
9	Correct	1 ms	364 KB	OK (n = 6, answer = YES)
10	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
11	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
12	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
13	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
14	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
15	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
16	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
17	Correct	1 ms	364 KB	OK (n = 100, answer = YES)

Subtask #3
0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	364 KB	OK (n = 1, answer = NO)
2	Correct	0 ms	364 KB	OK (n = 1, answer = NO)
3	Correct	1 ms	384 KB	OK (n = 1, answer = YES)
4	Correct	1 ms	364 KB	OK (n = 2, answer = YES)
5	Correct	1 ms	256 KB	OK (n = 2, answer = YES)
6	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
7	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
8	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
9	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
10	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
11	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
12	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
13	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
14	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
15	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
16	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
17	Correct	1 ms	364 KB	OK (n = 3, answer = NO)
18	Correct	0 ms	364 KB	OK (n = 100, answer = NO)
19	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
20	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
21	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
22	Correct	1 ms	364 KB	OK (n = 12, answer = NO)
23	Correct	0 ms	364 KB	OK (n = 12, answer = NO)
24	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
25	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
26	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
27	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
28	Correct	1 ms	364 KB	OK (n = 6, answer = YES)
29	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
30	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
31	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
32	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
33	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
34	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
35	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
36	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
37	Correct	1 ms	364 KB	OK (n = 28, answer = YES)
38	Correct	1 ms	364 KB	OK (n = 27, answer = YES)
39	Correct	1 ms	364 KB	OK (n = 90, answer = YES)
40	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
41	Correct	1 ms	492 KB	OK (n = 100, answer = YES)
42	Correct	1 ms	364 KB	OK (n = 10, answer = YES)
43	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
45	Incorrect	1 ms	364 KB	Contestant can not find answer, jury can
46	Halted	0 ms	0 KB	-

Subtask #4
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	364 KB	OK (n = 1, answer = NO)
2	Correct	0 ms	364 KB	OK (n = 1, answer = NO)
3	Correct	1 ms	384 KB	OK (n = 1, answer = YES)
4	Correct	1 ms	364 KB	OK (n = 2, answer = YES)
5	Correct	1 ms	256 KB	OK (n = 2, answer = YES)
6	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
7	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
8	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
9	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
10	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
11	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
12	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
13	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
14	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
15	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
16	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
17	Correct	1 ms	364 KB	OK (n = 3, answer = NO)
18	Correct	0 ms	364 KB	OK (n = 100, answer = NO)
19	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
20	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
21	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
22	Correct	1 ms	364 KB	OK (n = 12, answer = NO)
23	Correct	0 ms	364 KB	OK (n = 12, answer = NO)
24	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
25	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
26	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
27	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
28	Correct	1 ms	364 KB	OK (n = 6, answer = YES)
29	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
30	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
31	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
32	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
33	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
34	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
35	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
36	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
37	Correct	1 ms	364 KB	OK (n = 28, answer = YES)
38	Correct	1 ms	364 KB	OK (n = 27, answer = YES)
39	Correct	1 ms	364 KB	OK (n = 90, answer = YES)
40	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
41	Correct	1 ms	492 KB	OK (n = 100, answer = YES)
42	Correct	1 ms	364 KB	OK (n = 10, answer = YES)
43	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
45	Incorrect	1 ms	364 KB	Contestant can not find answer, jury can
46	Halted	0 ms	0 KB	-

Subtask #5
0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	364 KB	OK (n = 1, answer = NO)
2	Correct	0 ms	364 KB	OK (n = 1, answer = NO)
3	Correct	1 ms	384 KB	OK (n = 1, answer = YES)
4	Correct	1 ms	364 KB	OK (n = 2, answer = YES)
5	Correct	1 ms	256 KB	OK (n = 2, answer = YES)
6	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
7	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
8	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
9	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
10	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
11	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
12	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
13	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
14	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
15	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
16	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
17	Correct	1 ms	364 KB	OK (n = 3, answer = NO)
18	Correct	0 ms	364 KB	OK (n = 100, answer = NO)
19	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
20	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
21	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
22	Correct	1 ms	364 KB	OK (n = 12, answer = NO)
23	Correct	0 ms	364 KB	OK (n = 12, answer = NO)
24	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
25	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
26	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
27	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
28	Correct	1 ms	364 KB	OK (n = 6, answer = YES)
29	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
30	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
31	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
32	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
33	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
34	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
35	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
36	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
37	Correct	1 ms	364 KB	OK (n = 28, answer = YES)
38	Correct	1 ms	364 KB	OK (n = 27, answer = YES)
39	Correct	1 ms	364 KB	OK (n = 90, answer = YES)
40	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
41	Correct	1 ms	492 KB	OK (n = 100, answer = YES)
42	Correct	1 ms	364 KB	OK (n = 10, answer = YES)
43	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
45	Incorrect	1 ms	364 KB	Contestant can not find answer, jury can
46	Halted	0 ms	0 KB	-

Subtask #6
0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	364 KB	OK (n = 1, answer = NO)
2	Correct	0 ms	364 KB	OK (n = 1, answer = NO)
3	Correct	1 ms	384 KB	OK (n = 1, answer = YES)
4	Correct	1 ms	364 KB	OK (n = 2, answer = YES)
5	Correct	1 ms	256 KB	OK (n = 2, answer = YES)
6	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
7	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
8	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
9	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
10	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
11	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
12	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
13	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
14	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
15	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
16	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
17	Correct	1 ms	364 KB	OK (n = 3, answer = NO)
18	Correct	0 ms	364 KB	OK (n = 100, answer = NO)
19	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
20	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
21	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
22	Correct	1 ms	364 KB	OK (n = 12, answer = NO)
23	Correct	0 ms	364 KB	OK (n = 12, answer = NO)
24	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
25	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
26	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
27	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
28	Correct	1 ms	364 KB	OK (n = 6, answer = YES)
29	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
30	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
31	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
32	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
33	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
34	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
35	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
36	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
37	Correct	1 ms	364 KB	OK (n = 28, answer = YES)
38	Correct	1 ms	364 KB	OK (n = 27, answer = YES)
39	Correct	1 ms	364 KB	OK (n = 90, answer = YES)
40	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
41	Correct	1 ms	492 KB	OK (n = 100, answer = YES)
42	Correct	1 ms	364 KB	OK (n = 10, answer = YES)
43	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
45	Incorrect	1 ms	364 KB	Contestant can not find answer, jury can
46	Halted	0 ms	0 KB	-

Submission #318433

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 12.0

Subtask #4 0 / 15.0

Subtask #5 0 / 23.0

Subtask #6 0 / 31.0

Subtask #1
9.0 / 9.0

Subtask #2
10.0 / 10.0

Subtask #3
0 / 12.0

Subtask #4
0 / 15.0

Subtask #5
0 / 23.0

Subtask #6
0 / 31.0