답안 #114542

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
114542	2019-06-01T16:51:12 Z	ly20	Detecting Molecules (IOI16_molecules)	C++17	31 / 100	1000 ms	896 KB

molecules

#include<bits/stdc++.h>
#define debug(args...) //fprintf(stderr,args)
#include "molecules.h"
using namespace std;
const int MAXN=112345;
int kn[MAXN];
vector<int> find_subset(int l,int u,vector<int> w)
{
	int n=w.size();
	for(int i=0;i<MAXN;i++)
	{
		kn[i]=-1;
	}
	kn[0]=-2;
	for(int i=0;i<n;i++)
	{
		for(int j=MAXN-1;j>=w[i];j--)
		{
			if(kn[j-w[i]]!=-1 && kn[j]==-1)kn[j]=i;
		}
	}
	int val=-1;
	for(int i=l;i<=u;i++)
	{
		if(kn[i]!=-1)val=i;
		debug("%d %d\n",i,kn[i]);
	}
	vector<int> result;
	int cont=0;
	while(val>0)
	{
		result.push_back(kn[val]);
		val-=w[kn[val]];
		cont++;
	}
	//for(int i=0;i<cont;i++)resp[i]=result[i];
	return result;
}
/*int w[MAXN];
int v[MAXN];
int main()
{
	int l,u,n;
	scanf("%d %d %d",&l,&u,&n);
	for(int i=0;i<n;i++)scanf("%d",&w[i]);
	find_subset(l,u,w,n,v);
	for(int i=0;i<n;i++)printf("%d\n",w[resp[i]]);
}*/

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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

답안 #114542

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 10.0 / 10.0

Subtask #3 12.0 / 12.0

Subtask #4 0 / 15.0

Subtask #5 0 / 23.0

Subtask #6 0 / 31.0

Subtask #1
9.0 / 9.0

Subtask #2
10.0 / 10.0

Subtask #3
12.0 / 12.0

Subtask #4
0 / 15.0

Subtask #5
0 / 23.0

Subtask #6
0 / 31.0