답안 #156527

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
156527	2019-10-06T10:49:13 Z	a_player	Detecting Molecules (IOI16_molecules)	C++14	19 / 100	1000 ms	380 KB

molecules

#include <bits/stdc++.h>

#define f first
#define s second
#define mp make_pair
#define pb push_back

using namespace std;

typedef long long ll;

int dp[10001];
bitset<10001> vis;

vector<int> find_subset(int l,int u,vector<int> w){
	
	dp[0]=1;
	for(int i=0;i<w.size();i++)
	for(int j=u;j>=w[i];j--)if(dp[j-w[i]])dp[j]=1;
	int pos=-1;
		for(int i=l;i<=u;i++)if(dp[i])pos=i;
  vector<int> sol;
		if(pos==-1){
			return sol;
			}
		while(pos>0)	
		for(int i=0;i<w.size();i++)if(!vis[i])if(pos-w[i]>=0)if(dp[pos-w[i]]){
			pos-=w[i];
			sol.push_back(i);
			vis[i]=1;
		}
		
		
	return sol;
}

Compilation message

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

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
2	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	376 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	256 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	376 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
16	Correct	2 ms	252 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	256 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
21	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	376 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	376 KB	OK (n = 12, answer = NO)
24	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
25	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
26	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	256 KB	OK (n = 6, answer = YES)
29	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
30	Correct	2 ms	256 KB	OK (n = 100, answer = NO)
31	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
32	Correct	2 ms	256 KB	OK (n = 100, answer = NO)
33	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
34	Correct	2 ms	256 KB	OK (n = 100, answer = YES)
35	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
36	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
37	Correct	2 ms	376 KB	OK (n = 28, answer = YES)
38	Correct	2 ms	256 KB	OK (n = 27, answer = YES)
39	Correct	2 ms	376 KB	OK (n = 90, answer = YES)
40	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
41	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
42	Execution timed out	1057 ms	380 KB	Time limit exceeded
43	Halted	0 ms	0 KB	-

Subtask #4
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
2	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	376 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	256 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	376 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
16	Correct	2 ms	252 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	256 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
21	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	376 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	376 KB	OK (n = 12, answer = NO)
24	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
25	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
26	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	256 KB	OK (n = 6, answer = YES)
29	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
30	Correct	2 ms	256 KB	OK (n = 100, answer = NO)
31	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
32	Correct	2 ms	256 KB	OK (n = 100, answer = NO)
33	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
34	Correct	2 ms	256 KB	OK (n = 100, answer = YES)
35	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
36	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
37	Correct	2 ms	376 KB	OK (n = 28, answer = YES)
38	Correct	2 ms	256 KB	OK (n = 27, answer = YES)
39	Correct	2 ms	376 KB	OK (n = 90, answer = YES)
40	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
41	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
42	Execution timed out	1057 ms	380 KB	Time limit exceeded
43	Halted	0 ms	0 KB	-

Subtask #5
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
2	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	376 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	256 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	376 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
16	Correct	2 ms	252 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	256 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
21	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	376 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	376 KB	OK (n = 12, answer = NO)
24	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
25	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
26	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	256 KB	OK (n = 6, answer = YES)
29	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
30	Correct	2 ms	256 KB	OK (n = 100, answer = NO)
31	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
32	Correct	2 ms	256 KB	OK (n = 100, answer = NO)
33	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
34	Correct	2 ms	256 KB	OK (n = 100, answer = YES)
35	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
36	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
37	Correct	2 ms	376 KB	OK (n = 28, answer = YES)
38	Correct	2 ms	256 KB	OK (n = 27, answer = YES)
39	Correct	2 ms	376 KB	OK (n = 90, answer = YES)
40	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
41	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
42	Execution timed out	1057 ms	380 KB	Time limit exceeded
43	Halted	0 ms	0 KB	-

Subtask #6
0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
2	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	376 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	256 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	376 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	376 KB	OK (n = 3, answer = YES)
16	Correct	2 ms	252 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	256 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
21	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	376 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	376 KB	OK (n = 12, answer = NO)
24	Correct	2 ms	376 KB	OK (n = 12, answer = YES)
25	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
26	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	256 KB	OK (n = 6, answer = YES)
29	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
30	Correct	2 ms	256 KB	OK (n = 100, answer = NO)
31	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
32	Correct	2 ms	256 KB	OK (n = 100, answer = NO)
33	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
34	Correct	2 ms	256 KB	OK (n = 100, answer = YES)
35	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
36	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
37	Correct	2 ms	376 KB	OK (n = 28, answer = YES)
38	Correct	2 ms	256 KB	OK (n = 27, answer = YES)
39	Correct	2 ms	376 KB	OK (n = 90, answer = YES)
40	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
41	Correct	2 ms	376 KB	OK (n = 100, answer = YES)
42	Execution timed out	1057 ms	380 KB	Time limit exceeded
43	Halted	0 ms	0 KB	-

답안 #156527

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 10.0 / 10.0

Subtask #3 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
0 / 12.0

Subtask #4
0 / 15.0

Subtask #5
0 / 23.0

Subtask #6
0 / 31.0