oj.uz

답안 #307587

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
307587 2020-09-28T17:56:08 Z AmineTrabelsi Detecting Molecules (IOI16_molecules) C++14
31 / 100
 29 ms 26752 KB 
#include "molecules.h"
#include "bits/stdc++.h"
using namespace std;
#define sz(x) (int)x.size()
vector<int> a;
int low,high;
vector<int> res;
bitset<10004> dp[10004],vis[10004];

bool solve(int index,int sum){
	if((sum <= high) && (sum >= low))return 1;
	if(index >= sz(a))return 0;
	if(vis[index][sum]){
		if(dp[index][sum])
			res.push_back(index);
		return dp[index][sum];
	}
	vis[index][sum] = 1;
	bool ans = solve(index+1,sum+a[index]);
	if(ans){
		res.push_back(index);
		return 1;
	}
	return solve(index+1,sum);
}
vector<int> find_subset(int l, int u, vector<int> w) {
	a = w;
	low = l,high = u;
	bool x = solve(0,0);
    return res;
}

// comment out pls
/*
int main(){
	vector<int> vv = {6,8,8,7};
	vector<int> v = find_subset(15,17,vv);
	for(auto i:v)cout<<i<<" ";
		cout<<endl;
	return 0;
}
*/

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:29:7: warning: unused variable 'x' [-Wunused-variable]
   29 |  bool x = solve(0,0);
      |       ^

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 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 0 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 384 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 384 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 384 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 0 ms 384 KB OK (n = 3, answer = YES)
16 Correct 0 ms 384 KB OK (n = 3, answer = NO)
17 Correct 0 ms 384 KB OK (n = 3, answer = NO)
18 Correct 1 ms 384 KB OK (n = 100, answer = NO)
19 Correct 0 ms 384 KB OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 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 0 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 384 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 384 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 384 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 0 ms 384 KB OK (n = 3, answer = YES)
16 Correct 0 ms 384 KB OK (n = 3, answer = NO)
17 Correct 0 ms 384 KB OK (n = 3, answer = NO)
18 Correct 1 ms 384 KB OK (n = 100, answer = NO)
19 Correct 0 ms 384 KB OK (n = 100, answer = YES)
20 Correct 0 ms 384 KB OK (n = 12, answer = YES)
21 Correct 1 ms 416 KB OK (n = 12, answer = YES)
22 Correct 0 ms 384 KB OK (n = 12, answer = NO)
23 Correct 1 ms 384 KB OK (n = 12, answer = NO)
24 Correct 0 ms 384 KB OK (n = 12, answer = YES)
25 Correct 1 ms 384 KB OK (n = 12, answer = YES)
26 Correct 0 ms 384 KB OK (n = 12, answer = YES)
27 Correct 0 ms 384 KB OK (n = 12, answer = YES)
28 Correct 0 ms 256 KB OK (n = 6, answer = YES)
29 Correct 0 ms 384 KB OK (n = 12, answer = YES)
30 Correct 1 ms 384 KB OK (n = 100, answer = NO)
31 Correct 0 ms 384 KB OK (n = 100, answer = YES)
32 Correct 1 ms 384 KB OK (n = 100, answer = NO)
33 Correct 1 ms 384 KB OK (n = 100, answer = YES)
34 Correct 1 ms 384 KB OK (n = 100, answer = YES)
35 Correct 1 ms 384 KB OK (n = 100, answer = YES)
36 Correct 1 ms 384 KB OK (n = 100, answer = YES)
37 Correct 1 ms 384 KB OK (n = 28, answer = YES)
38 Correct 1 ms 384 KB OK (n = 27, answer = YES)
39 Correct 5 ms 384 KB OK (n = 90, answer = YES)
40 Correct 0 ms 384 KB OK (n = 100, answer = YES)
41 Correct 1 ms 384 KB OK (n = 100, answer = YES)
42 Correct 0 ms 384 KB OK (n = 10, answer = YES)
43 Correct 0 ms 384 KB OK (n = 100, answer = YES)
44 Correct 4 ms 384 KB OK (n = 100, answer = YES)
45 Correct 3 ms 384 KB OK (n = 100, answer = YES)
46 Correct 2 ms 384 KB OK (n = 100, answer = YES)
47 Correct 1 ms 384 KB OK (n = 100, answer = NO)
48 Correct 7 ms 512 KB OK (n = 100, answer = NO)
49 Correct 16 ms 512 KB OK (n = 100, answer = NO)
50 Correct 0 ms 384 KB OK (n = 100, answer = YES)
51 Correct 0 ms 384 KB OK (n = 100, answer = YES)
52 Correct 4 ms 384 KB OK (n = 100, answer = YES)
53 Correct 0 ms 256 KB OK (n = 100, answer = YES)
54 Correct 1 ms 384 KB OK (n = 100, answer = YES)

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 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 0 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 384 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 384 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 384 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 0 ms 384 KB OK (n = 3, answer = YES)
16 Correct 0 ms 384 KB OK (n = 3, answer = NO)
17 Correct 0 ms 384 KB OK (n = 3, answer = NO)
18 Correct 1 ms 384 KB OK (n = 100, answer = NO)
19 Correct 0 ms 384 KB OK (n = 100, answer = YES)
20 Correct 0 ms 384 KB OK (n = 12, answer = YES)
21 Correct 1 ms 416 KB OK (n = 12, answer = YES)
22 Correct 0 ms 384 KB OK (n = 12, answer = NO)
23 Correct 1 ms 384 KB OK (n = 12, answer = NO)
24 Correct 0 ms 384 KB OK (n = 12, answer = YES)
25 Correct 1 ms 384 KB OK (n = 12, answer = YES)
26 Correct 0 ms 384 KB OK (n = 12, answer = YES)
27 Correct 0 ms 384 KB OK (n = 12, answer = YES)
28 Correct 0 ms 256 KB OK (n = 6, answer = YES)
29 Correct 0 ms 384 KB OK (n = 12, answer = YES)
30 Correct 1 ms 384 KB OK (n = 100, answer = NO)
31 Correct 0 ms 384 KB OK (n = 100, answer = YES)
32 Correct 1 ms 384 KB OK (n = 100, answer = NO)
33 Correct 1 ms 384 KB OK (n = 100, answer = YES)
34 Correct 1 ms 384 KB OK (n = 100, answer = YES)
35 Correct 1 ms 384 KB OK (n = 100, answer = YES)
36 Correct 1 ms 384 KB OK (n = 100, answer = YES)
37 Correct 1 ms 384 KB OK (n = 28, answer = YES)
38 Correct 1 ms 384 KB OK (n = 27, answer = YES)
39 Correct 5 ms 384 KB OK (n = 90, answer = YES)
40 Correct 0 ms 384 KB OK (n = 100, answer = YES)
41 Correct 1 ms 384 KB OK (n = 100, answer = YES)
42 Correct 0 ms 384 KB OK (n = 10, answer = YES)
43 Correct 0 ms 384 KB OK (n = 100, answer = YES)
44 Correct 4 ms 384 KB OK (n = 100, answer = YES)
45 Correct 3 ms 384 KB OK (n = 100, answer = YES)
46 Correct 2 ms 384 KB OK (n = 100, answer = YES)
47 Correct 1 ms 384 KB OK (n = 100, answer = NO)
48 Correct 7 ms 512 KB OK (n = 100, answer = NO)
49 Correct 16 ms 512 KB OK (n = 100, answer = NO)
50 Correct 0 ms 384 KB OK (n = 100, answer = YES)
51 Correct 0 ms 384 KB OK (n = 100, answer = YES)
52 Correct 4 ms 384 KB OK (n = 100, answer = YES)
53 Correct 0 ms 256 KB OK (n = 100, answer = YES)
54 Correct 1 ms 384 KB OK (n = 100, answer = YES)
55 Correct 2 ms 1280 KB OK (n = 10000, answer = YES)
56 Runtime error 29 ms 26752 KB Execution killed with signal 11 (could be triggered by violating memory limits)
57 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 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 0 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 384 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 384 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 384 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 0 ms 384 KB OK (n = 3, answer = YES)
16 Correct 0 ms 384 KB OK (n = 3, answer = NO)
17 Correct 0 ms 384 KB OK (n = 3, answer = NO)
18 Correct 1 ms 384 KB OK (n = 100, answer = NO)
19 Correct 0 ms 384 KB OK (n = 100, answer = YES)
20 Correct 0 ms 384 KB OK (n = 12, answer = YES)
21 Correct 1 ms 416 KB OK (n = 12, answer = YES)
22 Correct 0 ms 384 KB OK (n = 12, answer = NO)
23 Correct 1 ms 384 KB OK (n = 12, answer = NO)
24 Correct 0 ms 384 KB OK (n = 12, answer = YES)
25 Correct 1 ms 384 KB OK (n = 12, answer = YES)
26 Correct 0 ms 384 KB OK (n = 12, answer = YES)
27 Correct 0 ms 384 KB OK (n = 12, answer = YES)
28 Correct 0 ms 256 KB OK (n = 6, answer = YES)
29 Correct 0 ms 384 KB OK (n = 12, answer = YES)
30 Correct 1 ms 384 KB OK (n = 100, answer = NO)
31 Correct 0 ms 384 KB OK (n = 100, answer = YES)
32 Correct 1 ms 384 KB OK (n = 100, answer = NO)
33 Correct 1 ms 384 KB OK (n = 100, answer = YES)
34 Correct 1 ms 384 KB OK (n = 100, answer = YES)
35 Correct 1 ms 384 KB OK (n = 100, answer = YES)
36 Correct 1 ms 384 KB OK (n = 100, answer = YES)
37 Correct 1 ms 384 KB OK (n = 28, answer = YES)
38 Correct 1 ms 384 KB OK (n = 27, answer = YES)
39 Correct 5 ms 384 KB OK (n = 90, answer = YES)
40 Correct 0 ms 384 KB OK (n = 100, answer = YES)
41 Correct 1 ms 384 KB OK (n = 100, answer = YES)
42 Correct 0 ms 384 KB OK (n = 10, answer = YES)
43 Correct 0 ms 384 KB OK (n = 100, answer = YES)
44 Correct 4 ms 384 KB OK (n = 100, answer = YES)
45 Correct 3 ms 384 KB OK (n = 100, answer = YES)
46 Correct 2 ms 384 KB OK (n = 100, answer = YES)
47 Correct 1 ms 384 KB OK (n = 100, answer = NO)
48 Correct 7 ms 512 KB OK (n = 100, answer = NO)
49 Correct 16 ms 512 KB OK (n = 100, answer = NO)
50 Correct 0 ms 384 KB OK (n = 100, answer = YES)
51 Correct 0 ms 384 KB OK (n = 100, answer = YES)
52 Correct 4 ms 384 KB OK (n = 100, answer = YES)
53 Correct 0 ms 256 KB OK (n = 100, answer = YES)
54 Correct 1 ms 384 KB OK (n = 100, answer = YES)
55 Correct 2 ms 1280 KB OK (n = 10000, answer = YES)
56 Runtime error 29 ms 26752 KB Execution killed with signal 11 (could be triggered by violating memory limits)
57 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 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 0 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 384 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 384 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 384 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 0 ms 384 KB OK (n = 3, answer = YES)
16 Correct 0 ms 384 KB OK (n = 3, answer = NO)
17 Correct 0 ms 384 KB OK (n = 3, answer = NO)
18 Correct 1 ms 384 KB OK (n = 100, answer = NO)
19 Correct 0 ms 384 KB OK (n = 100, answer = YES)
20 Correct 0 ms 384 KB OK (n = 12, answer = YES)
21 Correct 1 ms 416 KB OK (n = 12, answer = YES)
22 Correct 0 ms 384 KB OK (n = 12, answer = NO)
23 Correct 1 ms 384 KB OK (n = 12, answer = NO)
24 Correct 0 ms 384 KB OK (n = 12, answer = YES)
25 Correct 1 ms 384 KB OK (n = 12, answer = YES)
26 Correct 0 ms 384 KB OK (n = 12, answer = YES)
27 Correct 0 ms 384 KB OK (n = 12, answer = YES)
28 Correct 0 ms 256 KB OK (n = 6, answer = YES)
29 Correct 0 ms 384 KB OK (n = 12, answer = YES)
30 Correct 1 ms 384 KB OK (n = 100, answer = NO)
31 Correct 0 ms 384 KB OK (n = 100, answer = YES)
32 Correct 1 ms 384 KB OK (n = 100, answer = NO)
33 Correct 1 ms 384 KB OK (n = 100, answer = YES)
34 Correct 1 ms 384 KB OK (n = 100, answer = YES)
35 Correct 1 ms 384 KB OK (n = 100, answer = YES)
36 Correct 1 ms 384 KB OK (n = 100, answer = YES)
37 Correct 1 ms 384 KB OK (n = 28, answer = YES)
38 Correct 1 ms 384 KB OK (n = 27, answer = YES)
39 Correct 5 ms 384 KB OK (n = 90, answer = YES)
40 Correct 0 ms 384 KB OK (n = 100, answer = YES)
41 Correct 1 ms 384 KB OK (n = 100, answer = YES)
42 Correct 0 ms 384 KB OK (n = 10, answer = YES)
43 Correct 0 ms 384 KB OK (n = 100, answer = YES)
44 Correct 4 ms 384 KB OK (n = 100, answer = YES)
45 Correct 3 ms 384 KB OK (n = 100, answer = YES)
46 Correct 2 ms 384 KB OK (n = 100, answer = YES)
47 Correct 1 ms 384 KB OK (n = 100, answer = NO)
48 Correct 7 ms 512 KB OK (n = 100, answer = NO)
49 Correct 16 ms 512 KB OK (n = 100, answer = NO)
50 Correct 0 ms 384 KB OK (n = 100, answer = YES)
51 Correct 0 ms 384 KB OK (n = 100, answer = YES)
52 Correct 4 ms 384 KB OK (n = 100, answer = YES)
53 Correct 0 ms 256 KB OK (n = 100, answer = YES)
54 Correct 1 ms 384 KB OK (n = 100, answer = YES)
55 Correct 2 ms 1280 KB OK (n = 10000, answer = YES)
56 Runtime error 29 ms 26752 KB Execution killed with signal 11 (could be triggered by violating memory limits)
57 Halted 0 ms 0 KB -