Submission #313877

# Submission time Handle Problem Language Result Execution time Memory
313877 2020-10-17T08:11:29 Z IWANTTOGETGOLDINIOI Detecting Molecules (IOI16_molecules) C++14
19 / 100
1 ms 512 KB
#include "molecules.h"
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	int n = w.size();
	std::vector <std::pair <int , int> > subset;
	for (int i = 0;i < n;i++) {
		for (int j = 0;j < n; j++ ) {
			subset.push_back(std::make_pair (i , j));
		}
	}
	//std::sort (subset.begin(),subset.end());
	std::vector <int> ans;
	for (int i = 0; i < subset.size(); i++) {
		int sum = 0;
		for (int j = subset[i].first; j <= subset[i].second; j++ ) {
			sum += w[j];
		}
		ans.clear();
		if (sum >= l && sum <= u) {
			for (int k = subset[i].first; k <= subset[i].second; k++) {
				ans.push_back(k);
			}
			return ans;
		}
	}
	return ans;
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:17:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |  for (int i = 0; i < subset.size(); i++) {
      |                  ~~^~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 256 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 1 ms 256 KB OK (n = 3, answer = YES)
9 Correct 1 ms 384 KB OK (n = 3, answer = YES)
10 Correct 1 ms 256 KB OK (n = 3, answer = YES)
11 Correct 0 ms 256 KB OK (n = 3, answer = YES)
12 Correct 1 ms 256 KB OK (n = 3, answer = YES)
13 Correct 1 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 1 ms 256 KB OK (n = 3, answer = YES)
16 Correct 1 ms 256 KB OK (n = 3, answer = NO)
17 Correct 1 ms 256 KB OK (n = 3, answer = NO)
18 Correct 1 ms 512 KB OK (n = 100, answer = NO)
19 Correct 1 ms 512 KB OK (n = 100, answer = YES)
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB OK (n = 12, answer = YES)
2 Correct 1 ms 288 KB OK (n = 12, answer = YES)
3 Correct 1 ms 256 KB OK (n = 12, answer = NO)
4 Correct 1 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 1 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 1 ms 256 KB OK (n = 12, answer = YES)
11 Correct 1 ms 512 KB OK (n = 100, answer = NO)
12 Correct 1 ms 512 KB OK (n = 100, answer = YES)
13 Correct 1 ms 512 KB OK (n = 100, answer = NO)
14 Correct 1 ms 512 KB OK (n = 100, answer = YES)
15 Correct 1 ms 512 KB OK (n = 100, answer = YES)
16 Correct 1 ms 512 KB OK (n = 100, answer = YES)
17 Correct 1 ms 512 KB OK (n = 100, answer = YES)
# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 256 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 1 ms 256 KB OK (n = 3, answer = YES)
9 Correct 1 ms 384 KB OK (n = 3, answer = YES)
10 Correct 1 ms 256 KB OK (n = 3, answer = YES)
11 Correct 0 ms 256 KB OK (n = 3, answer = YES)
12 Correct 1 ms 256 KB OK (n = 3, answer = YES)
13 Correct 1 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 1 ms 256 KB OK (n = 3, answer = YES)
16 Correct 1 ms 256 KB OK (n = 3, answer = NO)
17 Correct 1 ms 256 KB OK (n = 3, answer = NO)
18 Correct 1 ms 512 KB OK (n = 100, answer = NO)
19 Correct 1 ms 512 KB OK (n = 100, answer = YES)
20 Correct 0 ms 256 KB OK (n = 12, answer = YES)
21 Correct 1 ms 288 KB OK (n = 12, answer = YES)
22 Correct 1 ms 256 KB OK (n = 12, answer = NO)
23 Correct 1 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 1 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 1 ms 256 KB OK (n = 12, answer = YES)
30 Correct 1 ms 512 KB OK (n = 100, answer = NO)
31 Correct 1 ms 512 KB OK (n = 100, answer = YES)
32 Correct 1 ms 512 KB OK (n = 100, answer = NO)
33 Correct 1 ms 512 KB OK (n = 100, answer = YES)
34 Correct 1 ms 512 KB OK (n = 100, answer = YES)
35 Correct 1 ms 512 KB OK (n = 100, answer = YES)
36 Correct 1 ms 512 KB OK (n = 100, answer = YES)
37 Correct 1 ms 384 KB OK (n = 28, answer = YES)
38 Correct 1 ms 376 KB OK (n = 27, answer = YES)
39 Correct 1 ms 384 KB OK (n = 90, answer = YES)
40 Correct 1 ms 512 KB OK (n = 100, answer = YES)
41 Correct 1 ms 512 KB OK (n = 100, answer = YES)
42 Correct 0 ms 256 KB OK (n = 10, answer = YES)
43 Correct 1 ms 512 KB OK (n = 100, answer = YES)
44 Correct 1 ms 512 KB OK (n = 100, answer = YES)
45 Incorrect 1 ms 512 KB Contestant can not find answer, jury can
46 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 256 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 1 ms 256 KB OK (n = 3, answer = YES)
9 Correct 1 ms 384 KB OK (n = 3, answer = YES)
10 Correct 1 ms 256 KB OK (n = 3, answer = YES)
11 Correct 0 ms 256 KB OK (n = 3, answer = YES)
12 Correct 1 ms 256 KB OK (n = 3, answer = YES)
13 Correct 1 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 1 ms 256 KB OK (n = 3, answer = YES)
16 Correct 1 ms 256 KB OK (n = 3, answer = NO)
17 Correct 1 ms 256 KB OK (n = 3, answer = NO)
18 Correct 1 ms 512 KB OK (n = 100, answer = NO)
19 Correct 1 ms 512 KB OK (n = 100, answer = YES)
20 Correct 0 ms 256 KB OK (n = 12, answer = YES)
21 Correct 1 ms 288 KB OK (n = 12, answer = YES)
22 Correct 1 ms 256 KB OK (n = 12, answer = NO)
23 Correct 1 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 1 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 1 ms 256 KB OK (n = 12, answer = YES)
30 Correct 1 ms 512 KB OK (n = 100, answer = NO)
31 Correct 1 ms 512 KB OK (n = 100, answer = YES)
32 Correct 1 ms 512 KB OK (n = 100, answer = NO)
33 Correct 1 ms 512 KB OK (n = 100, answer = YES)
34 Correct 1 ms 512 KB OK (n = 100, answer = YES)
35 Correct 1 ms 512 KB OK (n = 100, answer = YES)
36 Correct 1 ms 512 KB OK (n = 100, answer = YES)
37 Correct 1 ms 384 KB OK (n = 28, answer = YES)
38 Correct 1 ms 376 KB OK (n = 27, answer = YES)
39 Correct 1 ms 384 KB OK (n = 90, answer = YES)
40 Correct 1 ms 512 KB OK (n = 100, answer = YES)
41 Correct 1 ms 512 KB OK (n = 100, answer = YES)
42 Correct 0 ms 256 KB OK (n = 10, answer = YES)
43 Correct 1 ms 512 KB OK (n = 100, answer = YES)
44 Correct 1 ms 512 KB OK (n = 100, answer = YES)
45 Incorrect 1 ms 512 KB Contestant can not find answer, jury can
46 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 256 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 1 ms 256 KB OK (n = 3, answer = YES)
9 Correct 1 ms 384 KB OK (n = 3, answer = YES)
10 Correct 1 ms 256 KB OK (n = 3, answer = YES)
11 Correct 0 ms 256 KB OK (n = 3, answer = YES)
12 Correct 1 ms 256 KB OK (n = 3, answer = YES)
13 Correct 1 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 1 ms 256 KB OK (n = 3, answer = YES)
16 Correct 1 ms 256 KB OK (n = 3, answer = NO)
17 Correct 1 ms 256 KB OK (n = 3, answer = NO)
18 Correct 1 ms 512 KB OK (n = 100, answer = NO)
19 Correct 1 ms 512 KB OK (n = 100, answer = YES)
20 Correct 0 ms 256 KB OK (n = 12, answer = YES)
21 Correct 1 ms 288 KB OK (n = 12, answer = YES)
22 Correct 1 ms 256 KB OK (n = 12, answer = NO)
23 Correct 1 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 1 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 1 ms 256 KB OK (n = 12, answer = YES)
30 Correct 1 ms 512 KB OK (n = 100, answer = NO)
31 Correct 1 ms 512 KB OK (n = 100, answer = YES)
32 Correct 1 ms 512 KB OK (n = 100, answer = NO)
33 Correct 1 ms 512 KB OK (n = 100, answer = YES)
34 Correct 1 ms 512 KB OK (n = 100, answer = YES)
35 Correct 1 ms 512 KB OK (n = 100, answer = YES)
36 Correct 1 ms 512 KB OK (n = 100, answer = YES)
37 Correct 1 ms 384 KB OK (n = 28, answer = YES)
38 Correct 1 ms 376 KB OK (n = 27, answer = YES)
39 Correct 1 ms 384 KB OK (n = 90, answer = YES)
40 Correct 1 ms 512 KB OK (n = 100, answer = YES)
41 Correct 1 ms 512 KB OK (n = 100, answer = YES)
42 Correct 0 ms 256 KB OK (n = 10, answer = YES)
43 Correct 1 ms 512 KB OK (n = 100, answer = YES)
44 Correct 1 ms 512 KB OK (n = 100, answer = YES)
45 Incorrect 1 ms 512 KB Contestant can not find answer, jury can
46 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 256 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 1 ms 256 KB OK (n = 3, answer = YES)
9 Correct 1 ms 384 KB OK (n = 3, answer = YES)
10 Correct 1 ms 256 KB OK (n = 3, answer = YES)
11 Correct 0 ms 256 KB OK (n = 3, answer = YES)
12 Correct 1 ms 256 KB OK (n = 3, answer = YES)
13 Correct 1 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 1 ms 256 KB OK (n = 3, answer = YES)
16 Correct 1 ms 256 KB OK (n = 3, answer = NO)
17 Correct 1 ms 256 KB OK (n = 3, answer = NO)
18 Correct 1 ms 512 KB OK (n = 100, answer = NO)
19 Correct 1 ms 512 KB OK (n = 100, answer = YES)
20 Correct 0 ms 256 KB OK (n = 12, answer = YES)
21 Correct 1 ms 288 KB OK (n = 12, answer = YES)
22 Correct 1 ms 256 KB OK (n = 12, answer = NO)
23 Correct 1 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 1 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 1 ms 256 KB OK (n = 12, answer = YES)
30 Correct 1 ms 512 KB OK (n = 100, answer = NO)
31 Correct 1 ms 512 KB OK (n = 100, answer = YES)
32 Correct 1 ms 512 KB OK (n = 100, answer = NO)
33 Correct 1 ms 512 KB OK (n = 100, answer = YES)
34 Correct 1 ms 512 KB OK (n = 100, answer = YES)
35 Correct 1 ms 512 KB OK (n = 100, answer = YES)
36 Correct 1 ms 512 KB OK (n = 100, answer = YES)
37 Correct 1 ms 384 KB OK (n = 28, answer = YES)
38 Correct 1 ms 376 KB OK (n = 27, answer = YES)
39 Correct 1 ms 384 KB OK (n = 90, answer = YES)
40 Correct 1 ms 512 KB OK (n = 100, answer = YES)
41 Correct 1 ms 512 KB OK (n = 100, answer = YES)
42 Correct 0 ms 256 KB OK (n = 10, answer = YES)
43 Correct 1 ms 512 KB OK (n = 100, answer = YES)
44 Correct 1 ms 512 KB OK (n = 100, answer = YES)
45 Incorrect 1 ms 512 KB Contestant can not find answer, jury can
46 Halted 0 ms 0 KB -