답안 #305504

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
305504 2020-09-23T11:42:07 Z tengiz05 Detecting Molecules (IOI16_molecules) C++14
31 / 100
1000 ms 13184 KB
#include "molecules.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
	int n = w.size();
	vector<vector<bool>> dp(10001, vector<bool> (n));
	vector<bool> able(10001);
	vector<int> ans;
	
	int sum = 0;
	for(auto x : w)sum += x;
	if(sum < l)return ans;
	/*
	queue<pair<int, vector<bool>> q;
	queue.push({0, dp[0]});
	
	while(!q.empty()){
		auto tt = q.top();
		int t = q.first;
		if(t > u)continue;
		if(t >= l && t <= u){
		
		}
	}*/
	able[0] = true;
	for(int i=0;i<10000;i++){
		if(!able[i])continue;
		if(i >= l){
			if(i <= u){
				for(int j=0;j<n;j++){
					if(dp[i][j])ans.push_back(j);
				}
			}
			break;
		}
		for(int j=0;j<n;j++){
			if(i+w[j] <= 10000 && !dp[i][j]){
				able[i+w[j]] = true;
				dp[i+w[j]] = dp[i];
				dp[i+w[j]][j] = true;
			}
		}
	}
	
    return ans;
}

/*

4 15 17
6 8 8 7

4 14 15
5 5 6 6

4 10 20
15 17 16 18

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