Submission #256406

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
256406	2020-08-02T16:15:15 Z	SpeedOfMagic	Detecting Molecules (IOI16_molecules)	C++17	19 / 100	1 ms	372 KB

molecules

#include <bits/stdc++.h>

#include "molecules.h"

using namespace std;

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	vector<pair<int, int>> ww;
	for (size_t i = 0; i < w.size(); ++i)
		ww.push_back({w[i], i});
	sort(ww.begin(), ww.end());
	int cur = 0;
	vector<int> result;
	for (int i = 0; i < ww.size(); ++i) {
		if (cur + ww[i].first < l) {
			result.push_back(ww[i].second);
			cur += ww[i].first;
		} else if (cur + ww[i].first <= u) {
			result.push_back(ww[i].second);
			cur += ww[i].first;
			break;
		} else {
			break;
		}
	}
	if (cur >= l) {
		sort(result.begin(), result.end());
		return result;
	} else {
		int j = 0;
		for (int i = ww.size() - 1; i >= 0 && j < result.size(); --i) {
			cur -= w[result[j]];
			cur += ww[i].first;
			result[j] = ww[i].second;
			++j;
			if (cur >= l) {
				assert(cur <= u);
				sort(result.begin(), result.end());
				return result;
			}
		}
		return {};
	}
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:14:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < ww.size(); ++i) {
                  ~~^~~~~~~~~~~
molecules.cpp:31:43: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = ww.size() - 1; i >= 0 && j < result.size(); --i) {
                                         ~~^~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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

Submission #256406

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