oj.uz

답안 #199395

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
199395 2020-02-01T07:51:08 Z kshitij_sodani Detecting Molecules (IOI16_molecules) C++17
31 / 100
 1000 ms 508 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){
	bitset<500001> dp;
	dp.set(0);
	int n=w.size();
	for(int j=0;j<n;j++){
		for(int i=500001;i>=w[j];i--){
			dp[i] =dp[i] | dp[i-w[j]];
		}
	}
	int ind=-1;
	for(int i=l;i<u+1;i++){
		if(dp[i]){
			ind=i;
			break;
		}
	}
	//cout<<ind<<endl;
	//cout<<w[dp[15]]<<endl;
	vector<int> ans;
	if(ind==-1){
		return ans;
	}
	int vis[n];
	while(ind>0){
		for(int i=0;i<n;i++){
			if(vis[i]==1){
				continue;
			}
			if(w[i]<=ind){
				if(dp[ind-w[i]]){
					ans.pb(i);
					vis[i]=1;
					ind-=w[i];
					break;
				}
			}
		}
	}
	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;


}*/

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 376 KB OK (n = 12, answer = YES)
2 Correct 28 ms 376 KB OK (n = 12, answer = YES)
3 Correct 28 ms 376 KB OK (n = 12, answer = NO)
4 Correct 28 ms 376 KB OK (n = 12, answer = NO)
5 Correct 28 ms 376 KB OK (n = 12, answer = YES)
6 Correct 28 ms 376 KB OK (n = 12, answer = YES)
7 Correct 28 ms 380 KB OK (n = 12, answer = YES)
8 Correct 30 ms 376 KB OK (n = 12, answer = YES)
9 Correct 18 ms 376 KB OK (n = 6, answer = YES)
10 Correct 28 ms 376 KB OK (n = 12, answer = YES)
11 Correct 201 ms 376 KB OK (n = 100, answer = NO)
12 Correct 206 ms 376 KB OK (n = 100, answer = YES)
13 Correct 203 ms 376 KB OK (n = 100, answer = NO)
14 Correct 199 ms 376 KB OK (n = 100, answer = YES)
15 Correct 199 ms 376 KB OK (n = 100, answer = YES)
16 Correct 197 ms 376 KB OK (n = 100, answer = YES)
17 Correct 201 ms 376 KB OK (n = 100, answer = YES)

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 376 KB OK (n = 1, answer = NO)
2 Correct 7 ms 376 KB OK (n = 1, answer = NO)
3 Correct 7 ms 376 KB OK (n = 1, answer = YES)
4 Correct 9 ms 376 KB OK (n = 2, answer = YES)
5 Correct 9 ms 376 KB OK (n = 2, answer = YES)
6 Correct 11 ms 376 KB OK (n = 3, answer = YES)
7 Correct 11 ms 376 KB OK (n = 3, answer = YES)
8 Correct 11 ms 380 KB OK (n = 3, answer = YES)
9 Correct 11 ms 376 KB OK (n = 3, answer = YES)
10 Correct 11 ms 376 KB OK (n = 3, answer = YES)
11 Correct 11 ms 376 KB OK (n = 3, answer = YES)
12 Correct 11 ms 376 KB OK (n = 3, answer = YES)
13 Correct 12 ms 380 KB OK (n = 3, answer = NO)
14 Correct 11 ms 376 KB OK (n = 3, answer = YES)
15 Correct 13 ms 376 KB OK (n = 3, answer = YES)
16 Correct 11 ms 376 KB OK (n = 3, answer = NO)
17 Correct 11 ms 376 KB OK (n = 3, answer = NO)
18 Correct 196 ms 376 KB OK (n = 100, answer = NO)
19 Correct 202 ms 504 KB OK (n = 100, answer = YES)
20 Correct 29 ms 376 KB OK (n = 12, answer = YES)
21 Correct 28 ms 376 KB OK (n = 12, answer = YES)
22 Correct 28 ms 376 KB OK (n = 12, answer = NO)
23 Correct 28 ms 376 KB OK (n = 12, answer = NO)
24 Correct 28 ms 376 KB OK (n = 12, answer = YES)
25 Correct 28 ms 376 KB OK (n = 12, answer = YES)
26 Correct 28 ms 380 KB OK (n = 12, answer = YES)
27 Correct 30 ms 376 KB OK (n = 12, answer = YES)
28 Correct 18 ms 376 KB OK (n = 6, answer = YES)
29 Correct 28 ms 376 KB OK (n = 12, answer = YES)
30 Correct 201 ms 376 KB OK (n = 100, answer = NO)
31 Correct 206 ms 376 KB OK (n = 100, answer = YES)
32 Correct 203 ms 376 KB OK (n = 100, answer = NO)
33 Correct 199 ms 376 KB OK (n = 100, answer = YES)
34 Correct 199 ms 376 KB OK (n = 100, answer = YES)
35 Correct 197 ms 376 KB OK (n = 100, answer = YES)
36 Correct 201 ms 376 KB OK (n = 100, answer = YES)
37 Correct 59 ms 380 KB OK (n = 28, answer = YES)
38 Correct 57 ms 376 KB OK (n = 27, answer = YES)
39 Correct 175 ms 376 KB OK (n = 90, answer = YES)
40 Correct 201 ms 504 KB OK (n = 100, answer = YES)
41 Correct 201 ms 376 KB OK (n = 100, answer = YES)
42 Correct 25 ms 376 KB OK (n = 10, answer = YES)
43 Correct 203 ms 504 KB OK (n = 100, answer = YES)
44 Correct 197 ms 504 KB OK (n = 100, answer = YES)
45 Correct 198 ms 508 KB OK (n = 100, answer = YES)
46 Correct 197 ms 376 KB OK (n = 100, answer = YES)
47 Correct 202 ms 508 KB OK (n = 100, answer = NO)
48 Correct 197 ms 376 KB OK (n = 100, answer = NO)
49 Correct 194 ms 376 KB OK (n = 100, answer = NO)
50 Correct 207 ms 452 KB OK (n = 100, answer = YES)
51 Correct 209 ms 376 KB OK (n = 100, answer = YES)
52 Correct 197 ms 376 KB OK (n = 100, answer = YES)
53 Correct 198 ms 504 KB OK (n = 100, answer = YES)
54 Correct 204 ms 376 KB OK (n = 100, answer = YES)

Subtask #4
0 / 15.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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