oj.uz

Submission #199391

# Submission time Handle Problem Language Result Execution time Memory
199391 2020-02-01T07:27:28 Z kshitij_sodani Detecting Molecules (IOI16_molecules) C++17
31 / 100
 23 ms 632 KB 
#include <iostream>
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
typedef  long long int llo ;

#define mp make_pair
#define pb push_back
#define a first
#define b second
vector<int> find_subset(int l,int u,vector<int> w){
	int dp[1001];
	memset(dp,0,sizeof(dp));
	dp[0]=1;
	for(int j=0;j<w.size();j++){
		for(int i=1001;i>=w[j];i--){
			if(dp[i-w[j]]!=0 and dp[i]==0){
				dp[i]=j+1;
			}
		}
	}
	int ind=-1;
	for(int i=l;i<u+1;i++){
		if(dp[i]>0){
			ind=i;
			break;
		}
	}
	//cout<<ind<<endl;
	//cout<<w[dp[15]]<<endl;
	vector<int> ans;
	if(ind==-1){
		return ans;
	}
	while(ind>0){
		ans.pb(dp[ind]-1);
		ind-=w[dp[ind]-1];
	}
	return ans;
}
/*
int main(){

	vector<int> ss=find_subset(15,17,{6,8,8,7});
	for(int i=0;i<ss.size();i++){
		cout<<ss[i]<<" ";
	}
	cout<<endl;


	return 0;

}*/

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:15:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j=0;j<w.size();j++){
              ~^~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB OK (n = 1, answer = NO)
2 Correct 5 ms 248 KB OK (n = 1, answer = NO)
3 Correct 5 ms 256 KB OK (n = 1, answer = YES)
4 Correct 5 ms 256 KB OK (n = 2, answer = YES)
5 Correct 5 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 256 KB OK (n = 3, answer = YES)
7 Correct 5 ms 376 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 5 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 376 KB OK (n = 3, answer = YES)
11 Correct 5 ms 256 KB OK (n = 3, answer = YES)
12 Correct 5 ms 376 KB OK (n = 3, answer = YES)
13 Correct 5 ms 376 KB OK (n = 3, answer = NO)
14 Correct 6 ms 504 KB OK (n = 3, answer = YES)
15 Correct 5 ms 256 KB OK (n = 3, answer = YES)
16 Correct 5 ms 376 KB OK (n = 3, answer = NO)
17 Correct 5 ms 256 KB OK (n = 3, answer = NO)
18 Correct 5 ms 256 KB OK (n = 100, answer = NO)
19 Correct 5 ms 256 KB OK (n = 100, answer = YES)
20 Correct 5 ms 376 KB OK (n = 12, answer = YES)
21 Correct 5 ms 376 KB OK (n = 12, answer = YES)
22 Correct 5 ms 256 KB OK (n = 12, answer = NO)
23 Correct 5 ms 376 KB OK (n = 12, answer = NO)
24 Correct 5 ms 256 KB OK (n = 12, answer = YES)
25 Correct 5 ms 256 KB OK (n = 12, answer = YES)
26 Correct 5 ms 256 KB OK (n = 12, answer = YES)
27 Correct 5 ms 376 KB OK (n = 12, answer = YES)
28 Correct 5 ms 256 KB OK (n = 6, answer = YES)
29 Correct 5 ms 256 KB OK (n = 12, answer = YES)
30 Correct 5 ms 376 KB OK (n = 100, answer = NO)
31 Correct 5 ms 256 KB OK (n = 100, answer = YES)
32 Correct 5 ms 376 KB OK (n = 100, answer = NO)
33 Correct 5 ms 376 KB OK (n = 100, answer = YES)
34 Correct 5 ms 376 KB OK (n = 100, answer = YES)
35 Correct 5 ms 256 KB OK (n = 100, answer = YES)
36 Correct 5 ms 256 KB OK (n = 100, answer = YES)
37 Correct 6 ms 376 KB OK (n = 28, answer = YES)
38 Correct 5 ms 256 KB OK (n = 27, answer = YES)
39 Correct 5 ms 376 KB OK (n = 90, answer = YES)
40 Correct 8 ms 256 KB OK (n = 100, answer = YES)
41 Correct 6 ms 376 KB OK (n = 100, answer = YES)
42 Correct 5 ms 256 KB OK (n = 10, answer = YES)
43 Correct 5 ms 256 KB OK (n = 100, answer = YES)
44 Correct 5 ms 256 KB OK (n = 100, answer = YES)
45 Correct 5 ms 256 KB OK (n = 100, answer = YES)
46 Correct 5 ms 256 KB OK (n = 100, answer = YES)
47 Correct 5 ms 256 KB OK (n = 100, answer = NO)
48 Correct 6 ms 256 KB OK (n = 100, answer = NO)
49 Correct 5 ms 256 KB OK (n = 100, answer = NO)
50 Correct 5 ms 256 KB OK (n = 100, answer = YES)
51 Correct 5 ms 256 KB OK (n = 100, answer = YES)
52 Correct 5 ms 256 KB OK (n = 100, answer = YES)
53 Correct 5 ms 256 KB OK (n = 100, answer = YES)
54 Correct 5 ms 256 KB OK (n = 100, answer = YES)

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB OK (n = 1, answer = NO)
2 Correct 5 ms 248 KB OK (n = 1, answer = NO)
3 Correct 5 ms 256 KB OK (n = 1, answer = YES)
4 Correct 5 ms 256 KB OK (n = 2, answer = YES)
5 Correct 5 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 256 KB OK (n = 3, answer = YES)
7 Correct 5 ms 376 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 5 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 376 KB OK (n = 3, answer = YES)
11 Correct 5 ms 256 KB OK (n = 3, answer = YES)
12 Correct 5 ms 376 KB OK (n = 3, answer = YES)
13 Correct 5 ms 376 KB OK (n = 3, answer = NO)
14 Correct 6 ms 504 KB OK (n = 3, answer = YES)
15 Correct 5 ms 256 KB OK (n = 3, answer = YES)
16 Correct 5 ms 376 KB OK (n = 3, answer = NO)
17 Correct 5 ms 256 KB OK (n = 3, answer = NO)
18 Correct 5 ms 256 KB OK (n = 100, answer = NO)
19 Correct 5 ms 256 KB OK (n = 100, answer = YES)
20 Correct 5 ms 376 KB OK (n = 12, answer = YES)
21 Correct 5 ms 376 KB OK (n = 12, answer = YES)
22 Correct 5 ms 256 KB OK (n = 12, answer = NO)
23 Correct 5 ms 376 KB OK (n = 12, answer = NO)
24 Correct 5 ms 256 KB OK (n = 12, answer = YES)
25 Correct 5 ms 256 KB OK (n = 12, answer = YES)
26 Correct 5 ms 256 KB OK (n = 12, answer = YES)
27 Correct 5 ms 376 KB OK (n = 12, answer = YES)
28 Correct 5 ms 256 KB OK (n = 6, answer = YES)
29 Correct 5 ms 256 KB OK (n = 12, answer = YES)
30 Correct 5 ms 376 KB OK (n = 100, answer = NO)
31 Correct 5 ms 256 KB OK (n = 100, answer = YES)
32 Correct 5 ms 376 KB OK (n = 100, answer = NO)
33 Correct 5 ms 376 KB OK (n = 100, answer = YES)
34 Correct 5 ms 376 KB OK (n = 100, answer = YES)
35 Correct 5 ms 256 KB OK (n = 100, answer = YES)
36 Correct 5 ms 256 KB OK (n = 100, answer = YES)
37 Correct 6 ms 376 KB OK (n = 28, answer = YES)
38 Correct 5 ms 256 KB OK (n = 27, answer = YES)
39 Correct 5 ms 376 KB OK (n = 90, answer = YES)
40 Correct 8 ms 256 KB OK (n = 100, answer = YES)
41 Correct 6 ms 376 KB OK (n = 100, answer = YES)
42 Correct 5 ms 256 KB OK (n = 10, answer = YES)
43 Correct 5 ms 256 KB OK (n = 100, answer = YES)
44 Correct 5 ms 256 KB OK (n = 100, answer = YES)
45 Correct 5 ms 256 KB OK (n = 100, answer = YES)
46 Correct 5 ms 256 KB OK (n = 100, answer = YES)
47 Correct 5 ms 256 KB OK (n = 100, answer = NO)
48 Correct 6 ms 256 KB OK (n = 100, answer = NO)
49 Correct 5 ms 256 KB OK (n = 100, answer = NO)
50 Correct 5 ms 256 KB OK (n = 100, answer = YES)
51 Correct 5 ms 256 KB OK (n = 100, answer = YES)
52 Correct 5 ms 256 KB OK (n = 100, answer = YES)
53 Correct 5 ms 256 KB OK (n = 100, answer = YES)
54 Correct 5 ms 256 KB OK (n = 100, answer = YES)
55 Runtime error 23 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
56 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB OK (n = 1, answer = NO)
2 Correct 5 ms 248 KB OK (n = 1, answer = NO)
3 Correct 5 ms 256 KB OK (n = 1, answer = YES)
4 Correct 5 ms 256 KB OK (n = 2, answer = YES)
5 Correct 5 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 256 KB OK (n = 3, answer = YES)
7 Correct 5 ms 376 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 5 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 376 KB OK (n = 3, answer = YES)
11 Correct 5 ms 256 KB OK (n = 3, answer = YES)
12 Correct 5 ms 376 KB OK (n = 3, answer = YES)
13 Correct 5 ms 376 KB OK (n = 3, answer = NO)
14 Correct 6 ms 504 KB OK (n = 3, answer = YES)
15 Correct 5 ms 256 KB OK (n = 3, answer = YES)
16 Correct 5 ms 376 KB OK (n = 3, answer = NO)
17 Correct 5 ms 256 KB OK (n = 3, answer = NO)
18 Correct 5 ms 256 KB OK (n = 100, answer = NO)
19 Correct 5 ms 256 KB OK (n = 100, answer = YES)
20 Correct 5 ms 376 KB OK (n = 12, answer = YES)
21 Correct 5 ms 376 KB OK (n = 12, answer = YES)
22 Correct 5 ms 256 KB OK (n = 12, answer = NO)
23 Correct 5 ms 376 KB OK (n = 12, answer = NO)
24 Correct 5 ms 256 KB OK (n = 12, answer = YES)
25 Correct 5 ms 256 KB OK (n = 12, answer = YES)
26 Correct 5 ms 256 KB OK (n = 12, answer = YES)
27 Correct 5 ms 376 KB OK (n = 12, answer = YES)
28 Correct 5 ms 256 KB OK (n = 6, answer = YES)
29 Correct 5 ms 256 KB OK (n = 12, answer = YES)
30 Correct 5 ms 376 KB OK (n = 100, answer = NO)
31 Correct 5 ms 256 KB OK (n = 100, answer = YES)
32 Correct 5 ms 376 KB OK (n = 100, answer = NO)
33 Correct 5 ms 376 KB OK (n = 100, answer = YES)
34 Correct 5 ms 376 KB OK (n = 100, answer = YES)
35 Correct 5 ms 256 KB OK (n = 100, answer = YES)
36 Correct 5 ms 256 KB OK (n = 100, answer = YES)
37 Correct 6 ms 376 KB OK (n = 28, answer = YES)
38 Correct 5 ms 256 KB OK (n = 27, answer = YES)
39 Correct 5 ms 376 KB OK (n = 90, answer = YES)
40 Correct 8 ms 256 KB OK (n = 100, answer = YES)
41 Correct 6 ms 376 KB OK (n = 100, answer = YES)
42 Correct 5 ms 256 KB OK (n = 10, answer = YES)
43 Correct 5 ms 256 KB OK (n = 100, answer = YES)
44 Correct 5 ms 256 KB OK (n = 100, answer = YES)
45 Correct 5 ms 256 KB OK (n = 100, answer = YES)
46 Correct 5 ms 256 KB OK (n = 100, answer = YES)
47 Correct 5 ms 256 KB OK (n = 100, answer = NO)
48 Correct 6 ms 256 KB OK (n = 100, answer = NO)
49 Correct 5 ms 256 KB OK (n = 100, answer = NO)
50 Correct 5 ms 256 KB OK (n = 100, answer = YES)
51 Correct 5 ms 256 KB OK (n = 100, answer = YES)
52 Correct 5 ms 256 KB OK (n = 100, answer = YES)
53 Correct 5 ms 256 KB OK (n = 100, answer = YES)
54 Correct 5 ms 256 KB OK (n = 100, answer = YES)
55 Runtime error 23 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
56 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB OK (n = 1, answer = NO)
2 Correct 5 ms 248 KB OK (n = 1, answer = NO)
3 Correct 5 ms 256 KB OK (n = 1, answer = YES)
4 Correct 5 ms 256 KB OK (n = 2, answer = YES)
5 Correct 5 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 256 KB OK (n = 3, answer = YES)
7 Correct 5 ms 376 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 5 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 376 KB OK (n = 3, answer = YES)
11 Correct 5 ms 256 KB OK (n = 3, answer = YES)
12 Correct 5 ms 376 KB OK (n = 3, answer = YES)
13 Correct 5 ms 376 KB OK (n = 3, answer = NO)
14 Correct 6 ms 504 KB OK (n = 3, answer = YES)
15 Correct 5 ms 256 KB OK (n = 3, answer = YES)
16 Correct 5 ms 376 KB OK (n = 3, answer = NO)
17 Correct 5 ms 256 KB OK (n = 3, answer = NO)
18 Correct 5 ms 256 KB OK (n = 100, answer = NO)
19 Correct 5 ms 256 KB OK (n = 100, answer = YES)
20 Correct 5 ms 376 KB OK (n = 12, answer = YES)
21 Correct 5 ms 376 KB OK (n = 12, answer = YES)
22 Correct 5 ms 256 KB OK (n = 12, answer = NO)
23 Correct 5 ms 376 KB OK (n = 12, answer = NO)
24 Correct 5 ms 256 KB OK (n = 12, answer = YES)
25 Correct 5 ms 256 KB OK (n = 12, answer = YES)
26 Correct 5 ms 256 KB OK (n = 12, answer = YES)
27 Correct 5 ms 376 KB OK (n = 12, answer = YES)
28 Correct 5 ms 256 KB OK (n = 6, answer = YES)
29 Correct 5 ms 256 KB OK (n = 12, answer = YES)
30 Correct 5 ms 376 KB OK (n = 100, answer = NO)
31 Correct 5 ms 256 KB OK (n = 100, answer = YES)
32 Correct 5 ms 376 KB OK (n = 100, answer = NO)
33 Correct 5 ms 376 KB OK (n = 100, answer = YES)
34 Correct 5 ms 376 KB OK (n = 100, answer = YES)
35 Correct 5 ms 256 KB OK (n = 100, answer = YES)
36 Correct 5 ms 256 KB OK (n = 100, answer = YES)
37 Correct 6 ms 376 KB OK (n = 28, answer = YES)
38 Correct 5 ms 256 KB OK (n = 27, answer = YES)
39 Correct 5 ms 376 KB OK (n = 90, answer = YES)
40 Correct 8 ms 256 KB OK (n = 100, answer = YES)
41 Correct 6 ms 376 KB OK (n = 100, answer = YES)
42 Correct 5 ms 256 KB OK (n = 10, answer = YES)
43 Correct 5 ms 256 KB OK (n = 100, answer = YES)
44 Correct 5 ms 256 KB OK (n = 100, answer = YES)
45 Correct 5 ms 256 KB OK (n = 100, answer = YES)
46 Correct 5 ms 256 KB OK (n = 100, answer = YES)
47 Correct 5 ms 256 KB OK (n = 100, answer = NO)
48 Correct 6 ms 256 KB OK (n = 100, answer = NO)
49 Correct 5 ms 256 KB OK (n = 100, answer = NO)
50 Correct 5 ms 256 KB OK (n = 100, answer = YES)
51 Correct 5 ms 256 KB OK (n = 100, answer = YES)
52 Correct 5 ms 256 KB OK (n = 100, answer = YES)
53 Correct 5 ms 256 KB OK (n = 100, answer = YES)
54 Correct 5 ms 256 KB OK (n = 100, answer = YES)
55 Runtime error 23 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
56 Halted 0 ms 0 KB -