oj.uz

답안 #491981

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
491981 2021-12-05T09:28:59 Z nick_kcin Detecting Molecules (IOI16_molecules) C++14
31 / 100
 1000 ms 836 KB 
#include <cstdio>
#include <vector>
#include <map>
#include <utility>
using namespace std;

// mappa numero-indice
map<int, int> found;

int nn[(int)1e6 + 5];
int nni;

vector<int> find_subset(int l, int u, vector<int> w)
{
	found[0] = -1;
	for (size_t i = 0; i < w.size(); i++)
	{
		int tw = w[i];
		fprintf(stderr, "tw = %d\n", tw);
		nni = 0;
		for (auto it = found.begin(); it != found.end(); it++)
		{
			int nxt = it->first + tw;
			if (nxt > u)
				continue;
			auto nit = found.find(nxt);
			if (nit != found.end())
				continue;
			nn[nni++] = nxt;
		}

		for (int k = 0; k < nni; k++)
		{
			found[nn[k]] = i;
		}
	}
	// for(auto it = found.begin(); it != found.end(); it++) {
	// 	fprintf(stderr, "D: %d -> %d\n", it->first, it->second);
	// }

	auto it = found.lower_bound(l);
	// fprintf(stderr, "DIT: %d -> %d\n", it->first, it->second);
	if (it != found.end() && it->first <= u)
	{
		vector<int> inx;
		int ww = it->first;
		int val = it->second;
		while(val != -1)
		{
			inx.push_back(val);
			int nxt = ww - w[val];
			// fprintf(stderr, "Dowo: val = %d, nxt=%d\n", val, nxt);
			val = found[nxt];
			ww = nxt;
			// sleep(1);
		}
		return inx;
	}
	else
	{
		return vector<int>(0);
	}
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB OK (n = 1, answer = NO)
2 Correct 0 ms 204 KB OK (n = 1, answer = NO)
3 Correct 1 ms 204 KB OK (n = 1, answer = YES)
4 Correct 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 204 KB OK (n = 3, answer = YES)
8 Correct 0 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 0 ms 204 KB OK (n = 3, answer = YES)
11 Correct 0 ms 204 KB OK (n = 3, answer = YES)
12 Correct 0 ms 204 KB OK (n = 3, answer = YES)
13 Correct 0 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 KB OK (n = 3, answer = NO)
18 Correct 0 ms 204 KB OK (n = 100, answer = NO)
19 Correct 0 ms 204 KB OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB OK (n = 12, answer = YES)
2 Correct 0 ms 204 KB OK (n = 12, answer = YES)
3 Correct 0 ms 204 KB OK (n = 12, answer = NO)
4 Correct 0 ms 204 KB OK (n = 12, answer = NO)
5 Correct 0 ms 204 KB OK (n = 12, answer = YES)
6 Correct 0 ms 204 KB OK (n = 12, answer = YES)
7 Correct 1 ms 204 KB OK (n = 12, answer = YES)
8 Correct 1 ms 204 KB OK (n = 12, answer = YES)
9 Correct 0 ms 204 KB OK (n = 6, answer = YES)
10 Correct 0 ms 204 KB OK (n = 12, answer = YES)
11 Correct 1 ms 204 KB OK (n = 100, answer = NO)
12 Correct 0 ms 204 KB OK (n = 100, answer = YES)
13 Correct 1 ms 204 KB OK (n = 100, answer = NO)
14 Correct 0 ms 204 KB OK (n = 100, answer = YES)
15 Correct 1 ms 204 KB OK (n = 100, answer = YES)
16 Correct 1 ms 204 KB OK (n = 100, answer = YES)
17 Correct 1 ms 204 KB OK (n = 100, answer = YES)

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB OK (n = 1, answer = NO)
2 Correct 0 ms 204 KB OK (n = 1, answer = NO)
3 Correct 1 ms 204 KB OK (n = 1, answer = YES)
4 Correct 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 204 KB OK (n = 3, answer = YES)
8 Correct 0 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 0 ms 204 KB OK (n = 3, answer = YES)
11 Correct 0 ms 204 KB OK (n = 3, answer = YES)
12 Correct 0 ms 204 KB OK (n = 3, answer = YES)
13 Correct 0 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 KB OK (n = 3, answer = NO)
18 Correct 0 ms 204 KB OK (n = 100, answer = NO)
19 Correct 0 ms 204 KB OK (n = 100, answer = YES)
20 Correct 0 ms 204 KB OK (n = 12, answer = YES)
21 Correct 0 ms 204 KB OK (n = 12, answer = YES)
22 Correct 0 ms 204 KB OK (n = 12, answer = NO)
23 Correct 0 ms 204 KB OK (n = 12, answer = NO)
24 Correct 0 ms 204 KB OK (n = 12, answer = YES)
25 Correct 0 ms 204 KB OK (n = 12, answer = YES)
26 Correct 1 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 204 KB OK (n = 12, answer = YES)
28 Correct 0 ms 204 KB OK (n = 6, answer = YES)
29 Correct 0 ms 204 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Correct 0 ms 204 KB OK (n = 100, answer = YES)
32 Correct 1 ms 204 KB OK (n = 100, answer = NO)
33 Correct 0 ms 204 KB OK (n = 100, answer = YES)
34 Correct 1 ms 204 KB OK (n = 100, answer = YES)
35 Correct 1 ms 204 KB OK (n = 100, answer = YES)
36 Correct 1 ms 204 KB OK (n = 100, answer = YES)
37 Correct 0 ms 204 KB OK (n = 28, answer = YES)
38 Correct 1 ms 204 KB OK (n = 27, answer = YES)
39 Correct 2 ms 204 KB OK (n = 90, answer = YES)
40 Correct 0 ms 204 KB OK (n = 100, answer = YES)
41 Correct 0 ms 204 KB OK (n = 100, answer = YES)
42 Correct 0 ms 204 KB OK (n = 10, answer = YES)
43 Correct 4 ms 332 KB OK (n = 100, answer = YES)
44 Correct 2 ms 204 KB OK (n = 100, answer = YES)
45 Correct 1 ms 204 KB OK (n = 100, answer = YES)
46 Correct 1 ms 204 KB OK (n = 100, answer = YES)
47 Correct 3 ms 332 KB OK (n = 100, answer = NO)
48 Correct 1 ms 204 KB OK (n = 100, answer = NO)
49 Correct 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 4 ms 332 KB OK (n = 100, answer = YES)
51 Correct 4 ms 332 KB OK (n = 100, answer = YES)
52 Correct 2 ms 332 KB OK (n = 100, answer = YES)
53 Correct 0 ms 204 KB OK (n = 100, answer = YES)
54 Correct 0 ms 204 KB OK (n = 100, answer = YES)

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB OK (n = 1, answer = NO)
2 Correct 0 ms 204 KB OK (n = 1, answer = NO)
3 Correct 1 ms 204 KB OK (n = 1, answer = YES)
4 Correct 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 204 KB OK (n = 3, answer = YES)
8 Correct 0 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 0 ms 204 KB OK (n = 3, answer = YES)
11 Correct 0 ms 204 KB OK (n = 3, answer = YES)
12 Correct 0 ms 204 KB OK (n = 3, answer = YES)
13 Correct 0 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 KB OK (n = 3, answer = NO)
18 Correct 0 ms 204 KB OK (n = 100, answer = NO)
19 Correct 0 ms 204 KB OK (n = 100, answer = YES)
20 Correct 0 ms 204 KB OK (n = 12, answer = YES)
21 Correct 0 ms 204 KB OK (n = 12, answer = YES)
22 Correct 0 ms 204 KB OK (n = 12, answer = NO)
23 Correct 0 ms 204 KB OK (n = 12, answer = NO)
24 Correct 0 ms 204 KB OK (n = 12, answer = YES)
25 Correct 0 ms 204 KB OK (n = 12, answer = YES)
26 Correct 1 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 204 KB OK (n = 12, answer = YES)
28 Correct 0 ms 204 KB OK (n = 6, answer = YES)
29 Correct 0 ms 204 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Correct 0 ms 204 KB OK (n = 100, answer = YES)
32 Correct 1 ms 204 KB OK (n = 100, answer = NO)
33 Correct 0 ms 204 KB OK (n = 100, answer = YES)
34 Correct 1 ms 204 KB OK (n = 100, answer = YES)
35 Correct 1 ms 204 KB OK (n = 100, answer = YES)
36 Correct 1 ms 204 KB OK (n = 100, answer = YES)
37 Correct 0 ms 204 KB OK (n = 28, answer = YES)
38 Correct 1 ms 204 KB OK (n = 27, answer = YES)
39 Correct 2 ms 204 KB OK (n = 90, answer = YES)
40 Correct 0 ms 204 KB OK (n = 100, answer = YES)
41 Correct 0 ms 204 KB OK (n = 100, answer = YES)
42 Correct 0 ms 204 KB OK (n = 10, answer = YES)
43 Correct 4 ms 332 KB OK (n = 100, answer = YES)
44 Correct 2 ms 204 KB OK (n = 100, answer = YES)
45 Correct 1 ms 204 KB OK (n = 100, answer = YES)
46 Correct 1 ms 204 KB OK (n = 100, answer = YES)
47 Correct 3 ms 332 KB OK (n = 100, answer = NO)
48 Correct 1 ms 204 KB OK (n = 100, answer = NO)
49 Correct 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 4 ms 332 KB OK (n = 100, answer = YES)
51 Correct 4 ms 332 KB OK (n = 100, answer = YES)
52 Correct 2 ms 332 KB OK (n = 100, answer = YES)
53 Correct 0 ms 204 KB OK (n = 100, answer = YES)
54 Correct 0 ms 204 KB OK (n = 100, answer = YES)
55 Execution timed out 1077 ms 836 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB OK (n = 1, answer = NO)
2 Correct 0 ms 204 KB OK (n = 1, answer = NO)
3 Correct 1 ms 204 KB OK (n = 1, answer = YES)
4 Correct 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 204 KB OK (n = 3, answer = YES)
8 Correct 0 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 0 ms 204 KB OK (n = 3, answer = YES)
11 Correct 0 ms 204 KB OK (n = 3, answer = YES)
12 Correct 0 ms 204 KB OK (n = 3, answer = YES)
13 Correct 0 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 KB OK (n = 3, answer = NO)
18 Correct 0 ms 204 KB OK (n = 100, answer = NO)
19 Correct 0 ms 204 KB OK (n = 100, answer = YES)
20 Correct 0 ms 204 KB OK (n = 12, answer = YES)
21 Correct 0 ms 204 KB OK (n = 12, answer = YES)
22 Correct 0 ms 204 KB OK (n = 12, answer = NO)
23 Correct 0 ms 204 KB OK (n = 12, answer = NO)
24 Correct 0 ms 204 KB OK (n = 12, answer = YES)
25 Correct 0 ms 204 KB OK (n = 12, answer = YES)
26 Correct 1 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 204 KB OK (n = 12, answer = YES)
28 Correct 0 ms 204 KB OK (n = 6, answer = YES)
29 Correct 0 ms 204 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Correct 0 ms 204 KB OK (n = 100, answer = YES)
32 Correct 1 ms 204 KB OK (n = 100, answer = NO)
33 Correct 0 ms 204 KB OK (n = 100, answer = YES)
34 Correct 1 ms 204 KB OK (n = 100, answer = YES)
35 Correct 1 ms 204 KB OK (n = 100, answer = YES)
36 Correct 1 ms 204 KB OK (n = 100, answer = YES)
37 Correct 0 ms 204 KB OK (n = 28, answer = YES)
38 Correct 1 ms 204 KB OK (n = 27, answer = YES)
39 Correct 2 ms 204 KB OK (n = 90, answer = YES)
40 Correct 0 ms 204 KB OK (n = 100, answer = YES)
41 Correct 0 ms 204 KB OK (n = 100, answer = YES)
42 Correct 0 ms 204 KB OK (n = 10, answer = YES)
43 Correct 4 ms 332 KB OK (n = 100, answer = YES)
44 Correct 2 ms 204 KB OK (n = 100, answer = YES)
45 Correct 1 ms 204 KB OK (n = 100, answer = YES)
46 Correct 1 ms 204 KB OK (n = 100, answer = YES)
47 Correct 3 ms 332 KB OK (n = 100, answer = NO)
48 Correct 1 ms 204 KB OK (n = 100, answer = NO)
49 Correct 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 4 ms 332 KB OK (n = 100, answer = YES)
51 Correct 4 ms 332 KB OK (n = 100, answer = YES)
52 Correct 2 ms 332 KB OK (n = 100, answer = YES)
53 Correct 0 ms 204 KB OK (n = 100, answer = YES)
54 Correct 0 ms 204 KB OK (n = 100, answer = YES)
55 Execution timed out 1077 ms 836 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB OK (n = 1, answer = NO)
2 Correct 0 ms 204 KB OK (n = 1, answer = NO)
3 Correct 1 ms 204 KB OK (n = 1, answer = YES)
4 Correct 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 204 KB OK (n = 3, answer = YES)
8 Correct 0 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 0 ms 204 KB OK (n = 3, answer = YES)
11 Correct 0 ms 204 KB OK (n = 3, answer = YES)
12 Correct 0 ms 204 KB OK (n = 3, answer = YES)
13 Correct 0 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 KB OK (n = 3, answer = NO)
18 Correct 0 ms 204 KB OK (n = 100, answer = NO)
19 Correct 0 ms 204 KB OK (n = 100, answer = YES)
20 Correct 0 ms 204 KB OK (n = 12, answer = YES)
21 Correct 0 ms 204 KB OK (n = 12, answer = YES)
22 Correct 0 ms 204 KB OK (n = 12, answer = NO)
23 Correct 0 ms 204 KB OK (n = 12, answer = NO)
24 Correct 0 ms 204 KB OK (n = 12, answer = YES)
25 Correct 0 ms 204 KB OK (n = 12, answer = YES)
26 Correct 1 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 204 KB OK (n = 12, answer = YES)
28 Correct 0 ms 204 KB OK (n = 6, answer = YES)
29 Correct 0 ms 204 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Correct 0 ms 204 KB OK (n = 100, answer = YES)
32 Correct 1 ms 204 KB OK (n = 100, answer = NO)
33 Correct 0 ms 204 KB OK (n = 100, answer = YES)
34 Correct 1 ms 204 KB OK (n = 100, answer = YES)
35 Correct 1 ms 204 KB OK (n = 100, answer = YES)
36 Correct 1 ms 204 KB OK (n = 100, answer = YES)
37 Correct 0 ms 204 KB OK (n = 28, answer = YES)
38 Correct 1 ms 204 KB OK (n = 27, answer = YES)
39 Correct 2 ms 204 KB OK (n = 90, answer = YES)
40 Correct 0 ms 204 KB OK (n = 100, answer = YES)
41 Correct 0 ms 204 KB OK (n = 100, answer = YES)
42 Correct 0 ms 204 KB OK (n = 10, answer = YES)
43 Correct 4 ms 332 KB OK (n = 100, answer = YES)
44 Correct 2 ms 204 KB OK (n = 100, answer = YES)
45 Correct 1 ms 204 KB OK (n = 100, answer = YES)
46 Correct 1 ms 204 KB OK (n = 100, answer = YES)
47 Correct 3 ms 332 KB OK (n = 100, answer = NO)
48 Correct 1 ms 204 KB OK (n = 100, answer = NO)
49 Correct 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 4 ms 332 KB OK (n = 100, answer = YES)
51 Correct 4 ms 332 KB OK (n = 100, answer = YES)
52 Correct 2 ms 332 KB OK (n = 100, answer = YES)
53 Correct 0 ms 204 KB OK (n = 100, answer = YES)
54 Correct 0 ms 204 KB OK (n = 100, answer = YES)
55 Execution timed out 1077 ms 836 KB Time limit exceeded
56 Halted 0 ms 0 KB -